Successive Integer-Forcing and its Sum-Rate Optimality

Integer-forcing receivers generalize traditional linear receivers for the multiple-input multiple-output channel by decoding integer-linear combinations of the transmitted streams, rather then the streams themselves. Previous works have shown that the additional degree of freedom in choosing the integer coefficients enables this receiver to approach the performance of maximum-likelihood decoding in various scenarios. Nonetheless, even for the optimal choice of integer coefficients, the additive noise at the equalizer's output is still correlated. In this work we study a variant of integer-forcing, termed successive integer-forcing, that exploits these noise correlations to improve performance. This scheme is the integer-forcing counterpart of successive interference cancellation for traditional linear receivers. Similarly to the latter, we show that successive integer-forcing is capacity achieving when it is possible to optimize the rate allocation to the different streams. In comparison to standard successive interference cancellation receivers, the successive integer-forcing receiver offers more possibilities for capacity achieving rate tuples, and in particular, ones that are more balanced.Comment: A shorter version was submitted to the 51st Allerton Conferenc

Fast Decoder for Overloaded Uniquely Decodable Synchronous Optical CDMA

In this paper, we propose a fast decoder algorithm for uniquely decodable (errorless) code sets for overloaded synchronous optical code-division multiple-access (O-CDMA) systems. The proposed decoder is designed in a such a way that the users can uniquely recover the information bits with a very simple decoder, which uses only a few comparisons. Compared to maximum-likelihood (ML) decoder, which has a high computational complexity for even moderate code lengths, the proposed decoder has much lower computational complexity. Simulation results in terms of bit error rate (BER) demonstrate that the performance of the proposed decoder for a given BER requires only 1-2 dB higher signal-to-noise ratio (SNR) than the ML decoder.Comment: arXiv admin note: substantial text overlap with arXiv:1806.0395

Interference Alignment for Cognitive Radio Communications and Networks: A Survey

© 2019 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).Interference alignment (IA) is an innovative wireless transmission strategy that has shown to be a promising technique for achieving optimal capacity scaling of a multiuser interference channel at asymptotically high-signal-to-noise ratio (SNR). Transmitters exploit the availability of multiple signaling dimensions in order to align their mutual interference at the receivers. Most of the research has focused on developing algorithms for determining alignment solutions as well as proving interference alignment’s theoretical ability to achieve the maximum degrees of freedom in a wireless network. Cognitive radio, on the other hand, is a technique used to improve the utilization of the radio spectrum by opportunistically sensing and accessing unused licensed frequency spectrum, without causing harmful interference to the licensed users. With the increased deployment of wireless services, the possibility of detecting unused frequency spectrum becomes diminished. Thus, the concept of introducing interference alignment in cognitive radio has become a very attractive proposition. This paper provides a survey of the implementation of IA in cognitive radio under the main research paradigms, along with a summary and analysis of results under each system model.Peer reviewe

A Non-Orthogonal Multiple-Access Scheme Using Reliable Physical-Layer Network Coding and Cascade-Computation Decoding

© 2017 IEEE. This paper studies non-orthogonal transmission over a K -user fading multiple access channel. We propose a new reliable physical-layer network coding and cascade-computation decoding scheme. In the proposed scheme, K single-antenna users encode their messages by the same practical channel code and QAM modulation, and transmit simultaneously. The receiver chooses K linear coefficient vectors and computes the associated K layers of finite-field linear message combinations in a cascade manner. Finally, the K users' messages are recovered by solving the K linear equations. The proposed can be regarded as a generalized onion peeling. We study the optimal network coding coefficient vectors used in the cascade computation. Numerical results show the performance of the proposed approaches that of the iterative maximum a posteriori probability detection and decoding scheme, but without using receiver iteration. This results in considerable complexity reduction, processing delay, and easier implementation. Our proposed scheme significantly outperforms the iterative detection and decoding scheme with a single iteration, for example, by 1.7 dB for the two user case. The proposed scheme provides a competitive solution for non-orthogonal multiple access

Nulling-cancelling algorithm with selective maximum-likelihood detection for MIMO communication

Multiple transmit and receive antennas can increase the system capacity, as well as increase reliability in wireless communication. Vertical Bell Laboratories layered spaces-time (V-BLAST) scheme is widely used to achieve high spectral efficiencies in scattering environments. In V-BLAST systems, receiver design is usually based on the nulling-canceling algorithm which offers a good tradeoff between the computational complexity and system performance.;In this thesis, we propose a nulling-canceling based detection algorithm that performs selective maximum-likelihood decoding. We first compare the symbol estimates from two nulling-canceling implementations with different orders. If the symbol estimates do not agree, then maximum-likelihood detection is performed on the discrepant symbols and the rest of the symbols are detected via nulling and canceling. If there is no discrepancy in the comparison, then only nulling and canceling are performed. In our numerical results, 4-QAM (Quadrature Amplitude Modulation) and 16-QAM constellations are considered, and both Minimum Mean Squared Error (MMSE) and Zero-Forcing (ZF) based detections are implemented. We show that our proposed algorithm can achieve a better performance than the nulling-canceling algorithm and requires a relatively small increase in computational complexity, especially at high SNR.;Based on the Bit Error Rate (BER) performance result, we show that our proposed algorithm can achieve a better performance than the nulling-canceling algorithm and requires a relatively small computational complexity increase, especially at high Signal-to-Noise Ratio (SNR) scenario. The BER performances of an unordered system with BPSK (Binary Phase Shift Keying) or 4-QAM modulation and hybrid detection algorithms are given, under the joint consideration of nulling-canceling of several subchannels and block maximum-likelihood detection of several subchannels

Novel LDPC coding and decoding strategies: design, analysis, and algorithms

In this digital era, modern communication systems play an essential part in nearly every aspect of life, with examples ranging from mobile networks and satellite communications to Internet and data transfer. Unfortunately, all communication systems in a practical setting are noisy, which indicates that we can either improve the physical characteristics of the channel or find a possible systematical solution, i.e. error control coding. The history of error control coding dates back to 1948 when Claude Shannon published his celebrated work “A Mathematical Theory of Communication”, which built a framework for channel coding, source coding and information theory. For the first time, we saw evidence for the existence of channel codes, which enable reliable communication as long as the information rate of the code does not surpass the so-called channel capacity. Nevertheless, in the following 60 years none of the codes have been proven closely to approach the theoretical bound until the arrival of turbo codes and the renaissance of LDPC codes. As a strong contender of turbo codes, the advantages of LDPC codes include parallel implementation of decoding algorithms and, more crucially, graphical construction of codes. However, there are also some drawbacks to LDPC codes, e.g. significant performance degradation due to the presence of short cycles or very high decoding latency. In this thesis, we will focus on the practical realisation of finite-length LDPC codes and devise algorithms to tackle those issues. Firstly, rate-compatible (RC) LDPC codes with short/moderate block lengths are investigated on the basis of optimising the graphical structure of the tanner graph (TG), in order to achieve a variety of code rates (0.1 < R < 0.9) by only using a single encoder-decoder pair. As is widely recognised in the literature, the presence of short cycles considerably reduces the overall performance of LDPC codes which significantly limits their application in communication systems. To reduce the impact of short cycles effectively for different code rates, algorithms for counting short cycles and a graph-related metric called Extrinsic Message Degree (EMD) are applied with the development of the proposed puncturing and extension techniques. A complete set of simulations are carried out to demonstrate that the proposed RC designs can largely minimise the performance loss caused by puncturing or extension. Secondly, at the decoding end, we study novel decoding strategies which compensate for the negative effect of short cycles by reweighting part of the extrinsic messages exchanged between the nodes of a TG. The proposed reweighted belief propagation (BP) algorithms aim to implement efficient decoding, i.e. accurate signal reconstruction and low decoding latency, for LDPC codes via various design methods. A variable factor appearance probability belief propagation (VFAP-BP) algorithm is proposed along with an improved version called a locally-optimized reweighted (LOW)-BP algorithm, both of which can be employed to enhance decoding performance significantly for regular and irregular LDPC codes. More importantly, the optimisation of reweighting parameters only takes place in an offline stage so that no additional computational complexity is required during the real-time decoding process. Lastly, two iterative detection and decoding (IDD) receivers are presented for multiple-input multiple-output (MIMO) systems operating in a spatial multiplexing configuration. QR decomposition (QRD)-type IDD receivers utilise the proposed multiple-feedback (MF)-QRD or variable-M (VM)-QRD detection algorithm with a standard BP decoding algorithm, while knowledge-aided (KA)-type receivers are equipped with a simple soft parallel interference cancellation (PIC) detector and the proposed reweighted BP decoders. In the uncoded scenario, the proposed MF-QRD and VM-QRD algorithms are shown to approach optimal performance, yet require a reduced computational complexity. In the LDPC-coded scenario, simulation results have illustrated that the proposed QRD-type IDD receivers can offer near-optimal performance after a small number of detection/decoding iterations and the proposed KA-type IDD receivers significantly outperform receivers using alternative decoding algorithms, while requiring similar decoding complexity

Interference mitigation and awareness for improved reliability

Wireless systems are commonly affected by interference from various sources. For example, a number of users that operate in the same wireless network can result in multiple-access interference (MAI). In addition, for ultrawideband (UWB) systems, which operate at very low power spectral densities, strong narrowband interference (NBI) can have significant effects on the communications reliability. Therefore, interference mitigation and awareness are crucial in order to realize reliable communications systems. In this chapter, pulse-based UWB systems are considered, and the mitigation of MAI is investigated first. Then, NBI avoidance and cancelation are studied for UWB systems. Finally, interference awareness is discussed for short-rate communications, next-generation wireless networks, and cognitive radios.Mitigation of multiple-access interference (MAI)In an impulse radio ultrawideband (IR-UWB) communications system, pulses with very short durations, commonly less than one nanosecond, are transmitted with a low-duty cycle, and information is carried by the positions or the polarities of pulses [1-5]. Each pulse resides in an interval called frame, and the positions of pulses within frames are determined according to time-hopping (TH) sequences specific to each user. The low-duty cycle structure together with TH sequences provide a multiple-access capability for IR-UWB systems [6].Although IR-UWB systems can theoretically accommodate a large number of users in a multiple-access environment [2, 4], advanced signal processing techniques are necessary in practice in order to mitigate the effects of interfering users on the detection of information symbols efficiently [6]. © Cambridge University Press 2011