An improved distributed dynamic channel assignment scheme for dense WLANs

The popularity of wireless local area networks (WLANs) has resulted in their dense deployment in many cities around the world. The increased interference among different WLANs severely degrades the throughput achievable. This problem has been further exacerbated by the limited number of frequency channels available. An improved distributed and dynamic channel assignment scheme that is simple to implement and does not depend on the knowledge of the throughput function is proposed in this work. It also allows each access point (AP) to asynchronously switch to the new best channel. Simulation results show that our proposed scheme converges much faster than similar previously reported work, with a reduction in convergence time and channel switches as much as 77.3% and 52.3% respectively. When it is employed in dynamic environments, the throughput improves by up to 12.7%.

Space-time block coding for four transmit antennas over time-selective fading channels: orthogonal or non-orthogonal design?

The paper deals with an issue in space time block coding (STBC) design. It considers whether, over a time-selective channel, orthogonal STBC (O-STBC) or non-orthogonal STBC (NO-STBC) performs better. It is shown that, under time-selectiveness, once vehicle speed has risen above a certain value, NO-STBC always outperforms O-STBC across the whole SNR range. Also, considering that all existing NO-STBC schemes have been investigated under quasi-static channels only, a new simple receiver is derived for the NO-STBC system under time-selective channels.

Online bayesian inference in some time-frequency representations of non-stationary processes

The use of Bayesian inference in the inference of time-frequency representations has, thus far, been limited to offline analysis of signals, using a smoothing spline based model of the time-frequency plane. In this paper we introduce a new framework that allows the routine use of Bayesian inference for online estimation of the time-varying spectral density of a locally stationary Gaussian process. The core of our approach is the use of a likelihood inspired by a local Whittle approximation. This choice, along with the use of a recursive algorithm for non-parametric estimation of the local spectral density, permits the use of a particle filter for estimating the time-varying spectral density online. We provide demonstrations of the algorithm through tracking chirps and the analysis of musical data.

Adaptive B-spline neural network based nonlinear equalization for high-order QAM systems with nonlinear transmit high power amplifier

High bandwidth-efficiency quadrature amplitude modulation (QAM) signaling widely adopted in high-rate communication systems suffers from a drawback of high peak-toaverage power ratio, which may cause the nonlinear saturation of the high power amplifier (HPA) at transmitter. Thus, practical high-throughput QAM communication systems exhibit nonlinear and dispersive channel characteristics that must be modeled as a Hammerstein channel. Standard linear equalization becomes inadequate for such Hammerstein communication systems. In this paper, we advocate an adaptive B-Spline neural network based nonlinear equalizer. Specifically, during the training phase, an efficient alternating least squares (LS) scheme is employed to estimate the parameters of the Hammerstein channel, including both the channel impulse response (CIR) coefficients and the parameters of the B-spline neural network that models the HPA’s nonlinearity. In addition, another B-spline neural network is used to model the inversion of the nonlinear HPA, and the parameters of this inverting B-spline model can easily be estimated using the standard LS algorithm based on the pseudo training data obtained as a natural byproduct of the Hammerstein channel identification. Nonlinear equalisation of the Hammerstein channel is then accomplished by the linear equalization based on the estimated CIR as well as the inverse B-spline neural network model. Furthermore, during the data communication phase, the decision-directed LS channel estimation is adopted to track the time-varying CIR. Extensive simulation results demonstrate the effectiveness of our proposed B-Spline neural network based nonlinear equalization scheme.

Monitoring scan asymmetry of microwave humidity sounding channels using simultaneous all angle collocations (SAACs)

Simultaneous all angle collocations (SAACs) of microwave humidity sounders (AMSU-B and MHS) on-board polar orbiting satellites are used to estimate scan-dependent biases. This method has distinct advantages over previous methods, such as that the estimated scan-dependent biases are not influenced by diurnal differences between the edges of the scan and the biases can be estimated for both sides of the scan. We find the results are robust in the sense that biases estimated for one satellite pair can be reproduced by double differencing biases of these satellites with a third satellite. Channel 1 of these instruments shows the least bias for all satellites. Channel 2 has biases greater than 5 K, thus needs to be corrected. Channel 3 has biases of about 2 K and more and they are time varying for some of the satellites. Channel 4 has the largest bias which is about 15 K when the data are averaged for 5 years, but biases of individual months can be as large as 30 K. Channel 5 also has large and time varying biases for two of the AMSU-Bs. NOAA-15 (N15) channels are found to be affected the most, mainly due to radio frequency interference (RFI) from onboard data transmitters. Channel 4 of N15 shows the largest and time varying biases, so data of this channel should only be used with caution for climate applications. The two MHS instruments show the best agreement for all channels. Our estimates may be used to correct for scan-dependent biases of these instruments, or at least used as a guideline for excluding channels with large scan asymmetries from scientific analyses.

Precoder design for multi-antenna systems with temporally and spatially correlated fading channels

This paper addresses the problem of the design of a precoder for multiple transmit antenna communication systems with spatially and temporally correlated fading channels. Using the theories of matrix differential calculus, the paper derives a precoder for unitary space-time codes that can exploit the spatio-temporal correlation in the time-varying fading channels. The design criterion is based on minimizing the mean square error of the channel estimates. Computer simulation results show that a significant performance gain can be achieved by using the designed precoder.

State and input simultaneous estimation for a class of time-delay systems with uncertainties

This brief addresses the problem of estimation of both the states and the unknown inputs of a class of systems that are subject to a time-varying delay in their state variables, to an unknown input, and also to an additive uncertain, nonlinear disturbance. Conditions are derived for the solvability of the design matrices of a reduced-order observer for state and input estimation, and for the stability of its dynamics. To improve computational efficiency, a delay-dependent asymptotic stability condition is then developed using the linear matrix inequality formulation. A design procedure is proposed and illustrated by a numerical example.

Observer-based robust finite-time cooperative consensus control for multi-agent networks

This paper studies the finite-time consensus tracking control for multi-agent networks. The time-varying control input and the velocity of the leader is unknown to any follower. Only the position of the leader is known to its neighbors. We first propose a new finite-time multiple-surface sliding mode observer to estimate the leader's velocity. It is seen that the estimation error of the observer can converge to zero in a finite time. Then, we prove that finite-time consensus tracking of multi-agent networks can be achieved on a new terminal sliding mode surface. Simulation results are presented to validate the analysis.

Finite-time consensus algorithm of multi-agent networks

This paper is concerned with leader-follower finite-time consensus control of multi-agent networks with input disturbances. Terminal sliding mode control scheme is used to design the distributed control law. A new terminal sliding mode surface is proposed to guarantee finite-time consensus under fixed topology, with the common assumption that the position and the velocity of the active leader is known to its neighbors only. By using the finite-time Lyapunov stability theorem, it is shown that if the directed graph of the network has a directed spanning tree, then the terminal sliding mode control law can guarantee finite-time consensus even under the assumption that the time-varying control input of the active leader is unknown to any follower.

Time-delay systems : design of delay-free and low-order observers

This note provides a comprehensive treatment on the design of functional observers for linear systems having a time-varying delay in the state variables. The designed observers possess attractive features of being low-order and delay-free and hence they are cost effective and easy to implement. Existence conditions are derived and a design procedure for finding low-order observers is given.

Partial state and unknown input estimation for time-delay systems

This article considers the problem of estimating a partial set of the state vector and/or unknown input vector of linear systems driven by unknown inputs and time-varying delay in the state variables. Three types of reduced-order observers, namely, observers with delays, observers without internal delays and delay-free observers are proposed in this article. Existence conditions and design procedures are presented for the determination of parameters for each case of observers. Numerical examples are presented to illustrate the design procedures.

Survival analysis of time-to-event data in respiratory health research studies

This article provides a review of techniques for the analysis of survival data arising from respiratory health studies. Popular techniques such as the Kaplan–Meier survival plot and the Cox proportional hazards model are presented and illustrated using data from a lung cancer study. Advanced issues are also discussed, including parametric proportional hazards models, accelerated failure time models, time-varying explanatory variables, simultaneous analysis of multiple types of outcome events and the restricted mean survival time, a novel measure of the effect of treatment.

New generalized Halanay inequalities with applications to stability of nonlinear non-autonomous time-delay systems

In this paper, a general class of Halanay-type non-autonomous functional differential inequalities is considered. A new concept of stability, namely global generalized exponential stability, is proposed. We first prove some new generalizations of the Halanay inequality. We then derive explicit criteria for global generalized exponential stability of nonlinear non-autonomous time-delay systems based on our new generalized Halanay inequalities. Numerical examples and simulations are provided to illustrate the effectiveness of the obtained results.

On backwards and forwards reachable sets bounding for perturbed time-delay systems

Linear systems with interval time-varying delay and unknown-but-bounded disturbances are considered in this paper. We study the problem of finding outer bound of forwards reachable sets and inter bound of backwards reachable sets of the system. Firstly, two definitions on forwards and backwards reachable sets, where initial state vectors are not necessary to be equal to zero, are introduced. Then, by using the Lyapunov-Krasovskii method, two sufficient conditions for the existence of: (i) the smallest possible outer bound of forwards reachable sets; and (ii) the largest possible inter bound of backwards reachable sets, are derived. These conditions are presented in terms of linear matrix inequalities with two parameters need to tuned, which therefore can be efficiently solved by combining existing convex optimization algorithms with a two-dimensional search method to obtain optimal bounds. Lastly, the obtained results are illustrated by four numerical examples.

An enhanced stability criterion for time-delay systems via a new bounding technique

In the past few years, a great deal of effort has been devoted to improve delay-dependent conditions for stability of linear systems with an interval time-varying delay. To reduce conservatism of stability conditions, in the framework of the Lyapunov-Krasovskii functional (LKF) method, the bounding technique plays a key role. In this paper, a new bounding technique based on a new integral inequality is proposed. By employing the newly bounding technique proposed in this paper, an enhanced stability criterion for a class of linear systems with an interval time-varying delay is derived. The effectiveness and a significant improvement of the obtained results are shown by numerical examples.