We have been witnessed a growing research activity to advance new strategies to detect and exploit underlying sparsity in the parameters of physical models. In many cases, the sparsity is not explicit in the relations among the parameter coefficients requiring some suitable tools to reveal the potential sparsity. This work proposes a family of adaptive filtering algorithms, aimed at exposing some hidden features of the unknown parameters. Although the basic idea applies to any algorithm, we will concentrate the work in the LMS-type algorithms, giving rise to a family collectively named as Feature LMS (F-LMS) algorithms. These algorithms increase the convergence speed and reduce the steady-state mean-squared error, in comparison with the classical LMS solution. The main idea is to apply linear transformations, through the so-called feature matrices, to reveal the sparsity hidden in the coefficient vector, followed by a sparsity-promoting penalty function to exploit the exposed sparsity. For illustration, a few F-LMS algorithms for lowpass, bandpass, and highpass systems are introduced by using simple feature matrices that require either only simple operations or can learn the features. Simulations and real-life experiments demonstrate that the F-LMS algorithms bring about several performance improvements whenever the unknown sparsity of parameters is exposed.

This paper provides a review of user selection algorithms for massive multiple-input multiple-output (MIMO) systems under the line-of-sight (LoS) propagation model. Although the LoS propagation is extremely important to some promising technologies, like in millimeter-wave communications, massive MIMO systems are rarely studied under this propagation model. This paper fills this gap by providing a comprehensive study encompassing several user selection algorithms, different linear precoders and simulation setups, and also considers the effect of partial channel state information (CSI). One important result is the existence of practical cases in which the LoS propagation model may lead to significant levels of interference among users within a cell; these cases are not satisfactorily addressed by the existing user selection algorithms. Motivated by this issue, a new user selection algorithm based on inter-channel interference (ICI) called ICI-based selection (ICIBS) is proposed. Unlike other techniques, the ICIBS accounts for the ICI in a global manner, thus yielding better results, especially in cases where there are many users interfering with each other. In such scenarios, simulation results show that when compared to the competing algorithms, the proposed approach provided an improvement of at least 10.9% in the maximum throughput and 7.7% in the 95%-probability throughput when half of the users were selected.

The wide availability of mobile devices with embedded microphones opens up opportunities for new applications based on acoustic sensor localization (ASL). Among them, this paper highlights mobile device self-localization relying exclusively on acoustic signals, but with previous knowledge of reference signals and source positions. The problem of finding the sensor position is stated as a function of estimated times-of-flight (TOFs) or time-differences-of-flight (TDOFs) from the sound sources to the target microphone, and the main practical issues involved in TOF estimation are discussed. Least-squares ASL solutions are introduced, followed by other strategies inspired by sound source localization solutions: steered-response power, which improves localization accuracy, and a new region-based search, which alleviates complexity. A set of complementary techniques for further improvement of TOF/TDOF estimates are reviewed: sliding windows, matching pursuit, and TOF selection. The paper proceeds with proposing a novel ASL method that combines most of the previous material, whose performance is assessed in a real-world example: in a typical lecture room, the method achieves accuracy better than 20 cm.

Power allocation techniques, among which the max-min fairness power allocation (MMFPA) is one of the most widely used, are essential to guarantee good data throughput for all users in a cell. Recently, an efficient MMFPA algorithm for massive multiple-input multiple-output (MIMO) systems has been proposed. However, this algorithm is susceptible to the initial search interval employed by the underlying bisection search. Even if the optimal point belongs to the initial search interval, this algorithm may fail to converge to such a point. In this paper, we use the Perron-Frobenius theory to explain this issue and provide search intervals that guarantee convergence to the optimal point. Furthermore, we propose the bound test procedure as an efficient way of initializing the search interval. Simulation results corroborate our findings.

In this work, we propose a new frequency-domain adaptive filtering algorithm within the set-membership filtering (SMF) paradigm. Algorithms employing the previously proposed frequency-domain SMF (FD-SMF) concept are not capable of performing linear convolutions (i.e., linear filtering operations), but only circular convolutions. Here, we overcome such limitation by generalizing the FD-SMF concept to allow for linear convolutions, and we propose a new algorithm following this extended FD-SMF concept. Synthetic and real-life simulation results confirm that the proposed algorithm can perform quite better than its non-SMF counterpart, achieving faster convergence and requiring much fewer computations.

The demand for data traffic over mobile communication networks has substantially increased during the last decade. As a result, these mobile broadband devices spend the available spectrum fiercely, requiring the search for new technologies. In transmissions where the channel presents a frequency-selective behavior, multicarrier modulation (MCM) schemes have proven to be more efficient, in terms of spectral usage, than conventional modulations and spread spectrum techniques. The orthogonal frequency-division multiplexing (OFDM) is the most popular MCM method, since it not only increases spectral efficiency but also yields simple transceivers. All OFDM-based systems, including the single-carrier with frequency-division equalization (SC-FD), transmit redundancy in order to cope with the problem of interference among symbols. This book presents OFDM-inspired systems that are able to, at most, halve the amount of redundancy used by OFDM systems while keeping the computational complexity comparable. Su...