Dual-hop relaying communications over generalized-K (KG) fading channels

In this paper, a study on the end-to-end performance of dual-hop non-regenerative relaying over independent generalized-K (KG) fading channels is presented. Using a suitable upper bound for the end-to-end signal-to-noise ratio (SNR), novel closed-form expressions for the cumulative distribution function (CDF), probability density function (PDF) and the moments of this bounded SNR are derived. These results can be afterwards used to obtain important performance metrics of the considered system such as the outage probability and the error performance of digital modulation schemes. In the case of independent but non-necessarily identical fading channels, lower bounds for the average bit error probability (ABEP) for different modulation schemes are determined by using the Padé approximants method. For the case of identical fading channels, closed-form lower bounds for the ABEP are derived. Various numerical and computer simulation results illustrate the proposed analysis.     

Probability of error in CPSK systems with intersymbol interference and additive noise

A simple lower bound, an upper bound and a simple approximation to the upper bound on the probability of error for coherent phase-shift-keyed (CPSK) systems operating in the presence of intersymbol interference and additive noise are obtained. The additive noises in the in-phase channel and the quadrature channel are assumed to be independent, and are independent of the signal, but not restricted to be Gaussian. The approximation to the upper bound is four times the lower bound, hence the tightness of these bounds is uniform for all cases. This fact and the simplicity of the bounds make these bounds a useful system design tool. Numerical examples for quaternary and octonary systems are presented and compared to known results.     

Quadratic-exponential moment error bounds for digital communication systems

By utilizing the theory of moment spaces, upper and lower bounds are obtained for error probability of digital communication systems, based on the use ofquadratic- exponential moments of the inter-symbol interference random variables. Some bound can be evaluated numerically with minimal computational effort, while other bounds require more effort. Even the computationally simple bounds can be extremely tight.     

Truncation error for the generalized Bessel type sampling series

Numerous upper bounds for the truncation error of the Shannon sampling expansion associated with the Fourier transforms are available in the literature. In this paper we derive an upper bound for the truncation error of the generalized sampling expansion associated with the Hankel (Bessel) transform. A clear example of the application of such series is in the analysis of optical systems with circular symmetry. A lower bound for the Bessel function J_m(j_?,N+iy), which agrees with the known asymptotic one and is necessary to this analysis, is derived. The method, which employs complex contour integration, can be applied to other generalized sampling expansions.     

Robust adaptive control for prescribed performance tracking of constrained uncertain nonlinear systems

This paper proposes a robust adaptive control strategy for a class of state-constrained uncertain nonlinear systems with prescribed transient and steady-state behavior. The prescribed tracking performance can be characterized by constraints on an output tracking error. Both state and output constraints are achieved by bounding integral barrier Lyapunov functions in the backstepping procedure. A robust adaptive term is designed to compress auxiliary system uncertainties without the knowledge of their bounds. The satisfaction of control constraints and tracking error convergence are verified by theoretical analysis and are illustrated by simulation results.     

Truncation error analysis in computing of SEP and SEP floor for partially coherent receiver of MPSK signals over composite fading channels

In this paper, we analyze detection of multilevel phase-shift keying (MPSK) signals transmitted over a Gamma shadowed Nakagami-m fading channel. We derive novel analytical expression, in terms of Meijer’s G function, for Fourier coefficients of the probability density function of the received signal composite phase. Under the assumption of the imperfect reference signal extraction in the receiver, which is performed from the pilot signal, the analytical expression is derived for the symbol error probability (SEP) in the form of convergent series. The existence of the error floor is identified, and expression for its computation is provided. Mathematical proofs for convergence of Fourier series are provided for both SEP and SEP floor, and novel expressions of upper bounds for truncation errors are derived in terms of elementary mathematical functions. The convergence rate of the derived expressions is examined. Numerical results are confirmed independently by Monte-Carlo simulations.     

Robust distributed tracking control for linear multi-agent systems based on distributed intermediate estimator

This paper considers the distributed tracking control problem for linear multi-agent systems with disturbances and a leader whose control input is nonzero and not available to any follower. Based on the relative output measurements of neighboring agents, a novel distributed observer-based tracking protocol is proposed, where the distributed intermediate estimators are constructed to estimate the leader’s unknown control input and the states of the tracking error system simultaneously, then a distributed tracking protocol is designed based on the derived estimates. It is proved that the states of the tracking error system are uniformly ultimately bounded and an explicit tracking error bound is obtained. A simulation example of aircrafts verifies the effectiveness of the proposed method.     

An Upper Bound for the Singular Parameter in a Stable,Singularly Perturbed System

This paper considers the problem of stability of a singularly perturbed system and of finding an upper bound for the parameter when the order of the system changes as a result of parameter perturbation. By means of the contraction mapping technique, conditions have been derived for determining explicitly the range of parameter perturbation such that both bounded-input-bounded-output and asymptotic stabilities are insured. In addition, bounds of the state and output of the singularly perturbed system can be found. Two examples are given to illustrate the application and significance of the results.     

Probability of error in digital fiber optic systems with inter-symbol interference and signal dependent additive noise

Data transmission via optical fiber is a new discipline of communication theory. The principal difference from conventional baseband data transmission, which is characterized by a signal independent additive Gaussian noise, is the existence of a signal dependent shot noise.This paper presents a technique for estimating the error probability performance of digital systems with inter-symbol interference and signal dependent additive noise. For binary antipodal (±1) systems, the approximate upper bound to the error probability is twice the lower bound. Hence either can be taken as a good approximation to the actual error probability. The technique is then applied to a model of some promising optical data communication systems and a good approximation to the error probability is obtained. Some observations about the effect of various system parameters on the error probability and some numerical examples are presented.     

Finite horizon tracking control of probabilistic Boolean control networks

In this paper, the finite horizon tracking control problem of probabilistic Boolean control networks (PBCNs) is studied. For a given reference output trajectory, two trackability definitions are introduced according to whether the tracking probability is 1. Under the framework of the semi-tensor product, some necessary and sufficient conditions are obtained to determine whether the reference output trajectory is trackable with probability (probability one) by a PBCN starting from a given initial state. Based on this, two algorithms are proposed to determine the maximum tracking probability and the corresponding optimal control policy sequence. By determining the tracking error of the reference output trajectory, two related optimal control problems are considered: one is to minimize the expected value of the total tracking error, and the other is to minimize the maximum tracking error. Inspired by dynamic programming, corresponding algorithms are given to solve these two problems. Finally, two examples are given to verify the validity and correctness of the results.     

一种新的土地覆盖类别面积估计方法及其在最大似然分类法中的应用

首先根据生产者精度和使用者精度的概念，提出生产者精度和使用者精度的条件概率表达式，然后根据概率乘积公式，推导出生产者精度和使用者精度之间的关系式。该关系式表明：①使用者精度和生产者精度的比值可作为类别真实面积与分类结果中类别面积的比值的估计;②利用使用者精度和生产者精度的比值可对遥感分类结果进行修正，产生更接近于真实值的土地覆盖类别面积值，且该方法的计算结果仅取决于使用者精度和生产者精度数据的可靠性，与分类算法的优劣无关。该方法可用于最大似然分类方法中先验概率的估计。对Erdas Imagine软件所附带lanierimg文件的实验结果表明，各种分类结果包括一种对常规最大似然分类结果进行任意修改后的分类结果，利用文中提出方法修正后均产生了接近于真实值的类别面积比例。由于作为标准的精度检验方法，几乎所有的分类影像都会产生误差矩阵用于精度报告，这保证了该方法具有很好的应用价值，可以帮助土地利用/土地覆盖研究中获取更准确的土地利用/土地覆盖的面积数据。     

Event-based H∞ filtering for discrete-time Markov jump systems with network-induced delay

The problem of event-based H_∞ filtering for discrete-time Markov jump system with network-induced delay is investigated in this paper. For different jumping modes, different event-triggered communication schemes are constructed to choose which output signals should be transmitted. Through the analysis of network-induced delay’s intervals, the discrete-time system, the event-triggered scheme and network-induced delay are unified into a discrete-time Markov jump filter error system with time-delay. Based on time-delay system analysis method, criteria are derived to guarantee the discrete-time Markov jump error system stochastically stable with an H_∞ norm bound. The correspondent filter and the event-based parameters are also given. A numerical example is given to show that the proposed filter design techniques are effective and event-triggered communication scheme can save limited network resources greatly.     

Application of a transversal laguerre network in adaptive equalization

Synchronous data transmission systems that transmit information over dispersive channels often employ adaptive equalization techniques in the processing of the received signals. Most equalizers presently used in communication systems are of the tapped delay line (TDL) type. In this paper, we propose a class of adaptive equalizers of which the TDL equalizer is a member. Another interesting member of this class is the Laguerre adaptive equalizer which is to be introduced in this paper. The configuration of the Laguerre equalizer is developed. It is found, as shown by the examples, that the Laguerre equalizer is more accurate, and is less sensitive to timing error than the conventional TDL equalizer.     

Varying-order iterative learning control against perturbed initial conditions

A homing mechanism is required for repositioning as a system performs tasks repeatedly. By examining the effect of poor repositioning on the tracking performance of iterative learning control, this paper develops a varying-order learning approach for the performance improvement. Through varying-order learning, the resultant system output trajectory is ensured to follow a given trajectory with a lowered error bound, in comparison with the conventional fixed-order method. A discrete-time initial rectifying action is introduced in the formed varying-order learning algorithm, and a sufficient condition for convergence is derived. An implementable scheme is presented based on the proposed approach, and illustrated by numerical results of two examples of robotic manipulators.     

New upper bounds on the solution matrix to the continuous algebraic Riccati matrix equation

In this paper, new upper bounds for the solution matrix of the continuous algebraic Riccati matrix equation (CARE) are derived by means of some matrix inequalities and linear algebraic techniques. Furthermore, for the derived each bound, iterative algorithms are developed to obtain sharper solution estimates. Comparing with some appearing results in the literature, the presented bounds are less restrictive and more efficient. Finally, numerical examples are given to illustrate the effectiveness of the proposed results.     

Finite-time lag synchronization of master-slave complex dynamical networks with unknown signal propagation delays

This paper studies the finite-time lag synchronization issue of master-slave complex networks with unknown signal propagation delays by the linear and adaptive error state feedback approaches. The unknown signal propagation delays are fully considered and estimated by adaptive laws. By designing new Lyapunov functional and discontinuous feedback controllers, which involves the estimated error rather than the general synchronization error, sufficient conditions are derived to ensure lag synchronization of the networks within a setting time. It is interesting to discover that the setting time is related to initial values of both the estimated error and the estimated unknown signal propagation delays. Finally, two numerical examples are given to illustrate the effectiveness and correctness of the proposed finite-time lag synchronization criteria.     

On the recovery of discrete probability densities from imperfect measurements

The problem of the estimation of a discrete probability density from independent observations is considered. For a wide class of noises, a method is given for estimating a probability density when the measurements are corrupted by additive noise. This method is shown to be consistent, and several bounds on the error are given. An application to the detection of a (nonparametric) random signal is discussed. Finally, the estimation of a probability density is considered where the measurements are noisy and some of the measurements are incorrect. This situation may arise when a machine collecting the data fails part of the time.     

Centralized security-guaranteed filtering in multirate-sensor fusion under deception attacks

In this paper, the centralized security-guaranteed filtering problem is studied for linear time-invariant stochastic systems with multirate-sensor fusion under deception attacks. The underlying system includes a number of sensor nodes with a centralized filter, where each sensor is allowed to be sampled at different rate. A new measurement output model is proposed to characterize both the multiple rates and the deception attacks. By exploiting the lifting technique, the multi-rate sensor system is cast into a single-rate discrete-time system. With a new concept of security level, the aim of this paper is to design a filter such that the filtering error dynamics achieves the prescribed level of the security under deception attacks. By using the stochastic analysis techniques, sufficient conditions are first derived such that the filtering error system is guaranteed to have the desired security level, and then the filter gain is parameterized by using the semi-definite programme method with certain nonlinear constraints. Finally, a numerical simulation example is provided to demonstrate the feasibility of the proposed filtering scheme.     

Stabilization of discrete-time switched singular systems with state,output and switching delays

This paper is concerned with state feedback stabilization of discrete-time switched singular systems with time-varying delays existing simultaneously in the state, the output and the switching signal of the switched controller. On the basis of equivalent dynamics decomposition and Lyapunov–Krasovskii method, exponential estimates for the response of slow states of the closed-loop subsystems running in asynchronous and synchronous periods are first given. Exponential estimates for the response of fast states are also provided by establishing an analytic equation to solve the fast states and using some algebraic techniques. Then, by employing the obtained exponential estimates and the piecewise Lyapunov function approach with average dwell time (ADT) switching, sufficient conditions for the existence of a class of stabilizing switching signals and state feedback gains are derived, which explicitly depend on upper bounds on the delays and a lower bound on the ADT. Finally, two numerical examples are provided to illustrate the effectiveness of the obtained theoretical results.     

Multi-channel transmission scheduling with hopping scheme under uncertain channel states

This paper investigates the multi-channel transmission scheduling problem for remote state estimation based on a hopping scheme in cyber-physical systems. The smart sensor sends multiple subpackets over different orthogonal channels to the remote end simultaneously. Owing to the randomness and vulnerability of transmission environments, the uncertain multi-channel states are considered in this paper, which relaxes the assumption of existing deterministic models. The objective is to find an appropriate hopping scheme that minimizes the remote estimation error covariance. First, the multi-channel selection problem is modeled as a multi-arm bandits (MAB) matrix via taking the packet receiving probability as the gain. From the perspective of strategy and channel, two exponential-weight online learning algorithms are designed with the assistance of transmission energy switching policy. Then, based on Bernstein’s inequality for martingales and mini-batching loop, the upper bounds of algorithms’ regret values are analyzed under stochastic and adversarial channel states, respectively. Further, the estimator expression in iterative form and a sufficient condition for the error covariance to be bounded are derived. Finally, an example of unmanned vehicle moving demonstrates all the theoretical results.