Communication at millimeter wave (mmWave) frequencies is defining a new era of wireless communication. The mmWave band offers higher bandwidth communication channels versus those presently used in commercial wireless systems. The applications of mmWave are immense: wireless local and personal area networks in the unlicensed band, 5G cellular systems, not to mention vehicular area networks, ad hoc networks, and wearables. Signal processing is critical for enabling the next generation of mmWave communication. Due to the use of large antenna arrays at the transmitter and receiver, combined with radio frequency and mixed signal power constraints, new multiple-input multiple-output (MIMO) communication signal processing techniques are needed. Because of the wide bandwidths, low complexity transceiver algorithms become important. There are opportunities to exploit techniques like compressed sensing for channel estimation and beamforming. This article provides an overview of signal processing challenges in mmWave wireless systems, with an emphasis on those faced by using MIMO communication at higher carrier frequencies.

An Overview of Signal Processing Techniques for Millimeter Wave MIMO Systems

Massive multiple-input multiple-output MIMO is one of themost promising technologies for the next generation of wirelesscommunication networks because it has the potential to providegame-changing improvements in spectral efficiency SE and energyefficiency EE. This monograph summarizes many years ofresearch insights in a clear and self-contained way and providesthe reader with the necessary knowledge and mathematical toolsto carry out independent research in this area. Starting froma rigorous definition of Massive MIMO, the monograph coversthe important aspects of channel estimation, SE, EE, hardwareefficiency HE, and various practical deployment considerations.From the beginning, a very general, yet tractable, canonical systemmodel with spatial channel correlation is introduced. This modelis used to realistically assess the SE and EE, and is later extendedto also include the impact of hardware impairments. Owing tothis rigorous modeling approach, a lot of classic "wisdom" aboutMassive MIMO, based on too simplistic system models, is shownto be questionable.

https://www.nowpublishers.com/article/DownloadSummary/SIG-093

Massive MIMO Networks: Spectral, Energy, and Hardware Efficiency

It is now over a decade since the pioneering contribution of Gordon (1993), which is commonly regarded as the first instance of modern sequential Monte Carlo (SMC) approaches. Initially focussed on applications to tracking and vision, these techniques are now very widespread and have had a significant impact in virtually all areas of signal and image processing concerned with Bayesian dynamical models. This paper is intended to serve both as an introduction to SMC algorithms for nonspecialists and as a reference to recent contributions in domains where the techniques are still under significant development, including smoothing, estimation of fixed parameters and use of SMC methods beyond the standard filtering contexts.

/pdf/an-overview-of-existing-methods-and-recent-advances-in-3xs5szusg4.pdf

An Overview of Existing Methods and Recent Advances in Sequential Monte Carlo

Graphical models such as factor graphs allow a unified approach to a number of key topics in coding and signal processing such as the iterative decoding of turbo codes, LDPC codes and similar codes, joint decoding, equalization, parameter estimation, hidden-Markov models, Kalman filtering, and recursive least squares. Graphical models can represent complex real-world systems, and such representations help to derive practical detection/estimation algorithms in a wide area of applications. Most known signal processing techniques -including gradient methods, Kalman filtering, and particle methods -can be used as components of such algorithms. Other than most of the previous literature, we have used Forney-style factor graphs, which support hierarchical modeling and are compatible with standard block diagrams.

/pdf/an-introduction-to-factor-graphs-3hrc9a4eeo.pdf

An introduction to factor graphs

Millimeter wave (mmWave) communications have recently attracted large research interest, since the huge available bandwidth can potentially lead to the rates of multiple gigabit per second per user Though mmWave can be readily used in stationary scenarios, such as indoor hotspots or backhaul, it is challenging to use mmWave in mobile networks, where the transmitting/receiving nodes may be moving, channels may have a complicated structure, and the coordination among multiple nodes is difficult To fully exploit the high potential rates of mmWave in mobile networks, lots of technical problems must be addressed This paper presents a comprehensive survey of mmWave communications for future mobile networks (5G and beyond) We first summarize the recent channel measurement campaigns and modeling results Then, we discuss in detail recent progresses in multiple input multiple output transceiver design for mmWave communications After that, we provide an overview of the solution for multiple access and backhauling, followed by the analysis of coverage and connectivity Finally, the progresses in the standardization and deployment of mmWave for mobile networks are discussed

Millimeter Wave Communications for Future Mobile Networks

Recent developments have demonstrated that particle filtering is an emerging and powerful methodology, using Monte Carlo methods, for sequential signal processing with a wide range of applications in science and engineering. It has captured the attention of many researchers in various communities, including those of signal processing, statistics and econometrics. Based on the concept of sequential importance sampling and the use of Bayesian theory, particle filtering is particularly useful in dealing with difficult nonlinear and non-Gaussian problems. The underlying principle of the methodology is the approximation of relevant distributions with random measures composed of particles (samples from the space of the unknowns) and their associated weights. First, we present a brief review of particle filtering theory; and then we show how it can be used for resolving many problems in wireless communications. We demonstrate its application to blind equalization, blind detection over flat fading channels, multiuser detection, and estimation and detection of space-time codes in fading channels.

Particle filtering

We use the Gaussian particle filter to build several types of Gaussian sum particle filters. These filters approximate the filtering and predictive distributions by weighted Gaussian mixtures and are basically banks of Gaussian particle filters. Then, we extend the use of Gaussian particle filters and Gaussian sum particle filters to dynamic state space (DSS) models with non-Gaussian noise. With non-Gaussian noise approximated by Gaussian mixtures, the non-Gaussian noise models are approximated by banks of Gaussian noise models, and Gaussian mixture filters are developed using algorithms developed for Gaussian noise DSS models. As a result, problems involving heavy-tailed densities can be conveniently addressed. Simulations are presented to exhibit the application of the framework developed herein, and the performance of the algorithms is examined.

/pdf/gaussian-sum-particle-filtering-371b79ugvl.pdf

Gaussian sum particle filtering

We address optimal estimation of correlated multiple-input multiple-output (MIMO) channels using pilot signals, assuming knowledge of the second-order channel statistics at the transmitter. Assuming a block fading channel model and minimum mean square error (MMSE) estimation at the receiver, we design the transmitted signal to optimize two criteria: MMSE and the conditional mutual information between the MIMO channel and the received signal. Our analysis is based on the recently proposed virtual channel representation, which corresponds to beamforming in fixed virtual directions and exposes the structure and the true degrees of freedom in the correlated channel. However, our design framework is applicable to more general channel models, which include known channel models, such as the transmit and receive correlated model, as special cases. We show that optimal signaling is in a block form, where the block length depends on the signal-to-noise ratio (SNR) as well as the channel correlation matrix. The block signal corresponds to transmitting beams in successive symbol intervals along fixed virtual transmit angles, whose powers are determined by (nonidentical) water filling solutions based on the optimization criteria. Our analysis shows that these water filling solutions identify exactly which virtual transmit angles are important for channel estimation. In particular, at low SNR, the block length reduces to one, and all the power is transmitted on the beam corresponding to the strongest transmit angle, whereas at high SNR, the block length has a maximum length equal to the number of active virtual transmit angles, and the power is assigned equally to all active transmit angles. Consequently, from a channel estimation viewpoint, a faster fading rate can be tolerated at low SNRs relative to higher SNRs.

/pdf/transmit-signal-design-for-optimal-estimation-of-correlated-3sdjbbhjpg.pdf

Transmit signal design for optimal estimation of correlated MIMO channels

We study distributed strategies for classification of multiple targets in a wireless sensor network The maximum number of targets is known a priori but the actual number of distinct targets present in any given event is assumed unknown The target signals are modeled as zero-mean Gaussian processes with distinct temporal power spectral densities, and it is assumed that the noise-corrupted node measurements are spatially independent The proposed classifiers have a simple distributed architecture: local hard decisions from each node are communicated over noisy links to a manager node which optimally fuses them to make the final decision A natural strategy for local hard decisions is to use the optimal local classifier A key problem with the optimal local classifier is that the number of hypotheses increases exponentially with the maximum number of targets We propose two suboptimal (mixture density and Gaussian) local classifiers that are based on a natural but coarser repartitioning of the hypothesis space, resulting in linear complexity with the number of targets We show that exponentially decreasing probability of error with the number of nodes can be guaranteed with an arbitrarily small but nonvanishing communication power per node Numerical results based on real data demonstrate the remarkable practical advantage of decision fusion: an acceptably small probability of error can be attained by fusing a moderate number of unreliable local decisions Furthermore, the performance of the suboptimal mixture density classifier is comparable to that of the optimal local classifier, making it an attractive choice in practice

Distributed multitarget classification in wireless sensor networks

Existing results on MIMO channel capacity assume a rich scattering environment in which the channel power scales quadratically with the number of antennas, resulting in linear capacity scaling with the number of antennas. However, such scaling in channel power is physically impossible indefinitely. We thus address the following fundamental question: for a given channel power scaling law, what is the best achievable capacity scaling law? For a channel power scaling, /spl rho//sub c/(N) = O(N/sup /spl gamma//), /spl gamma/ /spl isin/ (0,2], we argue that the channel capacity cannot scale faster than C(N) = O(/spl radic/(/spl rho//sub c/(N))) = O(N/sup /spl gamma//2/). Our approach is based on a family of space-time channels corresponding to different distributions of channel power in the spatial signal space dimensions. We develop the concept of an ideal MIMO channel that achieves the optimal scaling law for a given /spl rho//sub c/(N). For a given number of antennas, unlike existing results that either emphasize the low or high SNR regimes, we propose a methodology for capacity-optimal signaling at any SNR. The methodology is based on creating the ideal channel from any given physical scattering environment via adaptive-resolution array configurations.

J.H. Kotecha

Papers

Particle filtering

Gaussian sum particle filtering

Transmit signal design for optimal estimation of correlated MIMO channels

Distributed multitarget classification in wireless sensor networks

Capacity of space-time wireless channels: a physical perspective