TSP Featured Articles

We consider the problem of decentralized consensus optimization, where the sum of n smooth and strongly convex functions are minimized over n distributed agents that form a connected network. In particular, we consider the case that the communicated local decision variables among nodes are quantized in order to alleviate the communication bottleneck in distributed optimization.

This paper studies resilient distributed estimation under measurement attacks. A set of agents each makes successive local, linear, noisy measurements of an unknown vector field collected in a vector parameter. The local measurement models are heterogeneous across agents and may be locally unobservable for the unknown parameter.

The problem of detecting a high-dimensional signal based on compressive measurements in the presence of an eavesdropper (Eve) is studied in this paper. We assume that a large number of sensors collaborate to detect the presence of sparse signals while the Eve has access to all the information transmitted by the sensors to the fusion center (FC). 

The topic of sequence design has received considerable attention due to its wide applications in active sensing. One important desired property for the design sequence is the spectral shape. In this paper, the sequence design problem is formulated by minimizing the regularized spectral level ratio subject to a peak-to-average power ratio constraint.

This paper considers and analyzes the performance of semiblind, training, and data-aided channel estimation schemes for multiple-input multiple-output (MIMO) filter bank multicarrier (FBMC) systems with offset quadrature amplitude modulation.

In this paper, we study blind channel-and-signal estimation by exploiting the burst-sparse structure of angular-domain propagation channels in massive MIMO systems. The state-of-the-art approach utilizes the structured channel sparsity by sampling the angular-domain channel representation with a uniform angle-sampling grid, a.k.a. virtual channel representation.

Linear data-detection algorithms that build on zero forcing (ZF) or linear minimum mean-square error (L-MMSE) equalization achieve near-optimal spectral efficiency in massive multi-user multiple-input multiple-output (MU-MIMO) systems. 

In this paper, we study the problem of beam alignment for millimeter wave (mmWave) communications, where a hybrid analog and digital beamforming structure is employed at the transmitter (i.e., base station), and an omni-directional antenna or an antenna array is used at the receiver (i.e., user).

Sequential Monte Carlo (SMC) methods comprise one of the most successful approaches to approximate Bayesian filtering. However, SMC without a good proposal distribution can perform poorly, in particular in high dimensions. We propose nested sequential Monte Carlo, a methodology that generalizes the SMC framework by requiring only approximate, properly weighted, samples from the SMC proposal distribution, while still resulting in a correct SMC algorithm. 

The paper derives the stability bound of the initial mean-square deviation of an adaptive filtering algorithm based on minimizing the 2 L th moment of the estimation error, with L being an integer greater than 1. The analysis is done for a time-invariant plant with even input probability density function. Dependence of the stability bound on the algorithm step-size, type of the noise distribution, signal-to-noise ratio (SNR), and L is studied.