Advanced receivers for distributed cooperation in mobile ad hoc networks

Mobile ad hoc networks (MANETs) are rapidly deployable wireless communications systems, operating with minimal coordination in order to avoid spectral efficiency losses caused by overhead. Cooperative transmission schemes are attractive for MANETs, but the distributed nature of such protocols comes with an increased level of interference, whose impact is further amplified by the need to push the limits of energy and spectral efficiency. Hence, the impact of interference has to be mitigated through with the use PHY layer signal processing algorithms with reasonable computational complexity. Recent advances in iterative digital receiver design techniques exploit approximate Bayesian inference and derivative message passing techniques to improve the capabilities of well-established turbo detectors. In particular, expectation propagation (EP) is a flexible technique which offers attractive complexity-performance trade-offs in situations where conventional belief propagation is limited by computational complexity. Moreover, thanks to emerging techniques in deep learning, such iterative structures are cast into deep detection networks, where learning the algorithmic hyper-parameters further improves receiver performance. In this thesis, EP-based finite-impulse response decision feedback equalizers are designed, and they achieve significant improvements, especially in high spectral efficiency applications, over more conventional turbo-equalization techniques, while having the advantage of being asymptotically predictable. A framework for designing frequency-domain EP-based receivers is proposed, in order to obtain detection architectures with low computational complexity. This framework is theoretically and numerically analysed with a focus on channel equalization, and then it is also extended to handle detection for time-varying channels and multiple-antenna systems. The design of multiple-user detectors and the impact of channel estimation are also explored to understand the capabilities and limits of this framework. Finally, a finite-length performance prediction method is presented for carrying out link abstraction for the EP-based frequency domain equalizer. The impact of accurate physical layer modelling is evaluated in the context of cooperative broadcasting in tactical MANETs, thanks to a flexible MAC-level simulato

Extending expectation propagation for graphical models

Thesis (Ph. D.)--Massachusetts Institute of Technology, School of Architecture and Planning, Program in Media Arts and Sciences, 2005.Includes bibliographical references (p. 101-106).Graphical models have been widely used in many applications, ranging from human behavior recognition to wireless signal detection. However, efficient inference and learning techniques for graphical models are needed to handle complex models, such as hybrid Bayesian networks. This thesis proposes extensions of expectation propagation, a powerful generalization of loopy belief propagation, to develop efficient Bayesian inference and learning algorithms for graphical models. The first two chapters of the thesis present inference algorithms for generative graphical models, and the next two propose learning algorithms for conditional graphical models. First, the thesis proposes a window-based EP smoothing algorithm for online estimation on hybrid dynamic Bayesian networks. For an application in wireless communications, window-based EP smoothing achieves estimation accuracy comparable to sequential Monte Carlo methods, but with less than one-tenth computational cost. Second, it develops a new method that combines tree-structured EP approximations with the junction tree for inference on loopy graphs. This new method saves computation and memory by propagating messages only locally to a subgraph when processing each edge in the entire graph. Using this local propagation scheme, this method is not only more accurate, but also faster than loopy belief propagation and structured variational methods. Third, it proposes predictive automatic relevance determination (ARD) to enhance classification accuracy in the presence of irrelevant features. ARD is a Bayesian technique for feature selection.(cont.) The thesis discusses the overfitting problem associated with ARD, and proposes a method that optimizes the estimated predictive performance, instead of maximizing the model evidence. For a gene expression classification problem, predictive ARD outperforms previous methods, including traditional ARD as well as support vector machines combined with feature selection techniques. Finally, it presents Bayesian conditional random fields (BCRFs) for classifying interdependent and structured data, such as sequences, images or webs. BCRFs estimate the posterior distribution of model parameters and average prediction over this posterior to avoid overfitting. For the problems of frequently-asked-question labeling and of ink recognition, BCRFs achieve superior prediction accuracy over conditional random fields trained with maximum likelihood and maximum a posteriori criteria.by Yuan Qi.Ph.D

On Investigations of Machine Learning and Deep Learning Techniques for MIMO Detection

This paper reviews in detail the various types of multiple input multiple output (MIMO) detector algorithms. The current MIMO detectors are not suitable for massive MIMO (mMIMO) scenarios where there are a large number of antennas. Their performance degrades with the increase in number of antennas in the MIMO system. For combatting the issues, machine learning (ML) and deep learning (DL) based detection algorithms are being researched and developed. An extensive survey of these detectors is provided in this paper, alongwith their advantages and challenges. The issues discussed have to be resolved before using them for final deployment

Iterative graphical algorithms for phase noise channels.

Doctoral Degree. University of KwaZulu-Natal, Durban.This thesis proposes algorithms based on graphical models to detect signals and charac- terise the performance of communication systems in the presence of Wiener phase noise. The algorithms exploit properties of phase noise and consequently use graphical models to develop low complexity approaches of signal detection. The contributions are presented in the form of papers. The first paper investigates the effect of message scheduling on the performance of graphical algorithms. A serial message scheduling is proposed for Orthogonal Frequency Division Multiplexing (OFDM) systems in the presence of carrier frequency offset and phase noise. The algorithm is shown to have better convergence compared to non-serial scheduling algorithms. The second paper introduces a concept referred to as circular random variables which is based on exploiting the properties of phase noise. An iterative algorithm is proposed to detect Low Density Parity Check (LDPC) codes in the presence of Wiener phase noise. The proposed algorithm is shown to have similar performance as existing algorithms with very low complexity. The third paper extends the concept of circular variables to detect coherent optical OFDM signals in the presence of residual carrier frequency offset and Wiener phase noise. The proposed iterative algorithm shows a significant improvement in complexity compared to existing algorithms. The fourth paper proposes two methods based on minimising the free energy function of graphical models. The first method combines the Belief Propagation (BP) and the Uniformly Re-weighted BP (URWBP) algorithms. The second method combines the Mean Field (MF) and the URWBP algorithms. The proposed methods are used to detect LDPC codes in Wiener phase noise channels. The proposed methods show good balance between complexity and performance compared to existing methods. The last paper proposes parameter based computation of the information bounds of the Wiener phase noise channel. The proposed methods compute the information lower and upper bounds using parameters of the Gaussian probability density function. The results show that these methods achieve similar performance as existing methods with low complexity

Low-resolution ADC receiver design, MIMO interference cancellation prototyping, and PHY secrecy analysis.

This dissertation studies three independent research topics in the general field of wireless communications. The first topic focuses on new receiver design with low-resolution analog-to-digital converters (ADC). In future massive multiple-input-multiple-output (MIMO) systems, multiple high-speed high-resolution ADCs will become a bottleneck for practical applications because of the hardware complexity and power consumption. One solution to this problem is to adopt low-cost low-precision ADCs instead. In Chapter II, MU-MIMO-OFDM systems only equipped with low-precision ADCs are considered. A new turbo receiver structure is proposed to improve the overall system performance. Meanwhile, ultra-low-cost communication devices can enable massive deployment of disposable wireless relays. In Chapter III, the feasibility of using a one-bit relay cluster to help a power-constrained transmitter for distant communication is investigated. Nonlinear estimators are applied to enable effective decoding. The second topic focuses prototyping and verification of a LTE and WiFi co-existence system, where the operation of LTE in unlicensed spectrum (LTE-U) is discussed. LTE-U extends the benefits of LTE and LTE Advanced to unlicensed spectrum, enabling mobile operators to offload data traffic onto unlicensed frequencies more efficiently and effectively. With LTE-U, operators can offer consumers a more robust and seamless mobile broadband experience with better coverage and higher download speeds. As the coexistence leads to considerable performance instability of both LTE and WiFi transmissions, the LTE and WiFi receivers with MIMO interference canceller are designed and prototyped to support the coexistence in Chapter IV. The third topic focuses on theoretical analysis of physical-layer secrecy with finite blocklength. Unlike upper layer security approaches, the physical-layer communication security can guarantee information-theoretic secrecy. Current studies on the physical-layer secrecy are all based on infinite blocklength. Nevertheless, these asymptotic studies are unrealistic and the finite blocklength effect is crucial for practical secrecy communication. In Chapter V, a practical analysis of secure lattice codes is provided

Variational channel estimation with tempering: An artificial intelligence algorithm for wireless intelligent networks

This article belongs to the Special Issue Trends on Edge Computing and Artificial Intelligence for Next Generation Sensor Network