105 research outputs found
Advanced DSP Algorithms For Modern Wireless Communication Transceivers
A higher network throughput, a minimized delay and reliable communications
are some of many goals that wireless communication standards, such as the fifthgeneration
(5G) standard and beyond, intend to guarantee for its customers. Hence,
many key innovations are currently being proposed and investigated by researchers in
the academic and industry circles to fulfill these goals. This dissertation investigates
some of the proposed techniques that aim at increasing the spectral efficiency, enhancing
the energy efficiency, and enabling low latency wireless communications systems.
The contributions lay in the evaluation of the performance of several proposed receiver
architectures as well as proposing novel digital signal processing (DSP) algorithms to
enhance the performance of radio transceivers. Particularly, the effects of several radio
frequency (RF) impairments on the functionality of a new class of wireless transceivers,
the full-duplex transceivers, are thoroughly investigated. These transceivers are then
designed to operate in a relaying scenario, where relay selection and beamforming
are applied in a relaying network to increase its spectral efficiency. The dissertation
then investigates the use of greedy algorithms in recovering orthogonal frequency
division multiplexing (OFDM) signals by using sparse equalizers, which carry out the
equalization in a more efficient manner when the low-complexity single tap OFDM
equalizer can no longer recover the received signal due to severe interferences. The
proposed sparse equalizers are shown to perform close to conventional optimal and
dense equalizers when the OFDM signals are impaired by interferences caused by the
insertion of an insufficient cyclic prefix and RF impairments
Optics for AI and AI for Optics
Artificial intelligence is deeply involved in our daily lives via reinforcing the digital transformation of modern economies and infrastructure. It relies on powerful computing clusters, which face bottlenecks of power consumption for both data transmission and intensive computing. Meanwhile, optics (especially optical communications, which underpin today’s telecommunications) is penetrating short-reach connections down to the chip level, thus meeting with AI technology and creating numerous opportunities. This book is about the marriage of optics and AI and how each part can benefit from the other. Optics facilitates on-chip neural networks based on fast optical computing and energy-efficient interconnects and communications. On the other hand, AI enables efficient tools to address the challenges of today’s optical communication networks, which behave in an increasingly complex manner. The book collects contributions from pioneering researchers from both academy and industry to discuss the challenges and solutions in each of the respective fields
Revisiting Efficient Multi-Step Nonlinearity Compensation with Machine Learning: An Experimental Demonstration
Efficient nonlinearity compensation in fiber-optic communication systems is
considered a key element to go beyond the "capacity crunch''. One guiding
principle for previous work on the design of practical nonlinearity
compensation schemes is that fewer steps lead to better systems. In this paper,
we challenge this assumption and show how to carefully design multi-step
approaches that provide better performance--complexity trade-offs than their
few-step counterparts. We consider the recently proposed learned digital
backpropagation (LDBP) approach, where the linear steps in the split-step
method are re-interpreted as general linear functions, similar to the weight
matrices in a deep neural network. Our main contribution lies in an
experimental demonstration of this approach for a 25 Gbaud single-channel
optical transmission system. It is shown how LDBP can be integrated into a
coherent receiver DSP chain and successfully trained in the presence of various
hardware impairments. Our results show that LDBP with limited complexity can
achieve better performance than standard DBP by using very short, but jointly
optimized, finite-impulse response filters in each step. This paper also
provides an overview of recently proposed extensions of LDBP and we comment on
potentially interesting avenues for future work.Comment: 10 pages, 5 figures. Author version of a paper published in the
Journal of Lightwave Technology. OSA/IEEE copyright may appl
Compressive Sensing for Multi-channel and Large-scale MIMO Networks
Compressive sensing (CS) is a revolutionary theory that has important applications in many engineering areas. Using CS, sparse or compressible signals can be recovered from incoherent measurements with far fewer samples than the conventional Nyquist rate. In wireless communication problems where the sparsity structure of the signals and the channels can be explored and utilized, CS helps to significantly reduce the number of transmissions required to have an efficient and reliable data communication. The objective of this thesis is to study new methods of CS, both from theoretical and application perspectives, in various complex, multi-channel and large-scale wireless networks. Specifically, we explore new sparse signal and channel structures, and develop low-complexity CS-based algorithms to transmit and recover data over these networks more efficiently.
Starting from the theory of sparse vector approximation based on CS, a compressive multiple-channel estimation (CMCE) method is developed to estimate multiple sparse channels simultaneously. CMCE provides a reduction in the required overhead for the estimation of multiple channels, and can be applied to estimate the composite channels of two-way relay channels (TWRCs) with sparse intersymbol interference (ISI). To improve end-to-end error performance of the networks, various iterative estimation and decoding schemes based on CS for ISI-TWRC are proposed, for both modes of cooperative relaying: Amplify-and-Forward (AF) and Decode-and-Forward (DF). Theoretical results including the Restricted Isometry Property (RIP) and low-coherent condition of the discrete pilot signaling matrix, the performance guarantees, and the convergence of the schemes are presented in this thesis. Numerical results suggest that the error performances of the system is significantly improved by the proposed CS-based methods, thanks to the awareness of the sparsity feature of the channels.
Low-rank matrix approximation, an extension of CS-based sparse vector recovery theory, is then studied in this research to address the channel estimation problem of large-scale (or massive) multiuser (MU) multiple-input multiple-output (MIMO) systems. A low-rank channel matrix estimation method based on nuclear-norm regularization is formulated and solved via a dual quadratic semi-definite programming (SDP) problem. An explicit choice of the regularization parameter and useful upper bounds of the error are presented to show the efficacy of the CS method in this case. After that, both the uplink channel estimation and a downlink data recoding of massive MIMO in the interference-limited multicell scenarios are considered, where a CS-based rank-q channel approximation and multicell precoding method are proposed. The results in this work suggest that the proposed method can mitigate the effects of the pilot contamination and intercell interference, hence improves the achievable rates of the users in multicell massive MIMO systems. Finally, various low-complexity greedy techniques are then presented to confirm the efficacy and feasibility of the proposed approaches in practical applications
Compressive Sensing for Multi-channel and Large-scale MIMO Networks
Compressive sensing (CS) is a revolutionary theory that has important applications in many engineering areas. Using CS, sparse or compressible signals can be recovered from incoherent measurements with far fewer samples than the conventional Nyquist rate. In wireless communication problems where the sparsity structure of the signals and the
channels can be explored and utilized, CS helps to significantly reduce the number of transmissions required to have an efficient and reliable data communication. The objective of this thesis is to study new methods of CS, both from theoretical and application perspectives, in various complex, multi-channel and large-scale wireless networks. Specifically, we explore new sparse signal and channel structures, and develop low-complexity CS-based algorithms to transmit and recover data over these networks more efficiently.
Starting from the theory of sparse vector approximation based on CS, a compressive multiple-channel estimation (CMCE) method is developed to estimate multiple sparse channels simultaneously. CMCE provides a reduction in the required overhead for the estimation of multiple channels, and can be applied to estimate the composite channels of
two-way relay channels (TWRCs) with sparse intersymbol interference (ISI). To improve end-to-end error performance of the networks, various iterative estimation and decoding
schemes based on CS for ISI-TWRC are proposed, for both modes of cooperative relaying: Amplify-and-Forward (AF) and Decode-and-Forward (DF). Theoretical results including
the Restricted Isometry Property (RIP) and low-coherent condition of the discrete pilot signaling matrix, the performance guarantees, and the convergence of the schemes are presented in this thesis. Numerical results suggest that the error performances of the system is significantly improved by the proposed CS-based methods, thanks to the awareness of the sparsity feature of the channels.
Low-rank matrix approximation, an extension of CS-based sparse vector recovery theory, is then studied in this research to address the channel estimation problem of large-scale (or massive) multiuser (MU) multiple-input multiple-output (MIMO) systems. A low-rank channel matrix estimation method based on nuclear-norm regularization is formulated and solved via a dual quadratic semi-definite programming (SDP) problem. An explicit choice of the regularization parameter and useful upper bounds of the error are presented to show the efficacy of the CS method in this case. After that, both the uplink channel estimation and a downlink data precoding of massive MIMO in the interference-limited multicell scenarios are considered, where a CS-based rank-q channel approximation
and multicell precoding method are proposed. The results in this work suggest that the proposed method can mitigate the effects of the pilot contamination and intercell interference, hence improves the achievable rates of the users in multicell massive MIMO systems. Finally, various low-complexity greedy techniques are then presented to confirm the efficacy and feasibility of the proposed approaches in practical applications
- …