Turbo Decoding and Detection for Wireless Applications

A historical perspective of turbo coding and turbo transceivers inspired by the generic turbo principles is provided, as it evolved from Shannon’s visionary predictions. More specifically, we commence by discussing the turbo principles, which have been shown to be capable of performing close to Shannon’s capacity limit. We continue by reviewing the classic maximum a posteriori probability decoder. These discussions are followed by studying the effect of a range of system parameters in a systematic fashion, in order to gauge their performance ramifications. In the second part of this treatise, we focus our attention on the family of iterative receivers designed for wireless communication systems, which were partly inspired by the invention of turbo codes. More specifically, the family of iteratively detected joint coding and modulation schemes, turbo equalization, concatenated spacetime and channel coding arrangements, as well as multi-user detection and three-stage multimedia systems are highlighted

Doctor of Philosophy

dissertationMultiple-input and multiple-output (MIMO) technique has emerged as a key feature for future generations of wireless communication systems. It increases the channel capacity proportionate to the minimum number of transmit and receive antennas. This dissertation addresses the receiver design for high-rate MIMO communications in at fading environments. The emphasis of the thesis is on the cases where channel state information (CSI) is not available and thus, clever channel estimation algorithms have to be developed to bene t from the maximum available channel capacity. The thesis makes four distinct novel contributions. First, we note that the conventional MCMC-MIMO detector presented in the prior work may deteriorate as SNR increases. We suggest and show through computer simulations that this problem to a great extent can be solved by initializing the MCMC detector with regulated states which are found through linear detectors. We also introduce the novel concept of staged-MCMC in a turbo receiver, where we start the detection process at a lower complexity and increase complexity only if the data could not be correctly detected in the present stage of data detection. Second, we note that in high-rate MIMO communications, joint data detection and channel estimation poses new challenges when a turbo loop is used to improve the quality of the estimated channel and the detected data. Erroneous detected data may propagate in the turbo loop and, thus, degrade the performance of the receiver signi cantly. This is referred to as error propagation. We propose a novel receiver that decorrelates channel estimation and the detected data to avoid the detrimental e ect of error propagation. Third, the dissertation studies joint channel estimation and MIMO detection over a continuously time-varying channel and proposes a new dual-layer channel estimator to overcome the complexity of optimal channel estimators. The proposed dual-layer channel estimator reduces the complexity of the MIMO detector with optimal channel estimator by an order of magnitude at a cost of a negligible performance degradation, on the order of 0.1 to 0.2 dB. The fourth contribution of this dissertation is to note that the Wiener ltering techniques that are discussed in this dissertation and elsewhere in the literature assume that channel (time-varying) statistics are available. We propose a new method that estimates such statistics using the coarse channel estimates obtained through pilot symbols. The dissertation also makes an additional contribution revealing di erences between the MCMC-MIMO and LMMSE-MIMO detectors. We nd that under the realistic condition where CSI has to be estimated, hence the available channel estimate will be noisy, the MCMC-MIMO detector outperforms the LMMSE-MIMO detector with a signi cant margin

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

Transmission of vector quantization over a frequency-selective Rayleigh fading CDMA channel

Recently, the transmission of vector quantization (VQ) over a code-division multiple access (CDMA) channel has received a considerable attention in research community. The complexity of the optimal decoding for VQ in CDMA communications is prohibitive for implementation, especially for systems with a medium or large number of users. A suboptimal approach to VQ decoding over a CDMA channel, disturbed by additive white Gaussian noise (AWGN), was recently developed. Such a suboptimal decoder is built from a soft-output multiuser detector (MUD), a soft bit estimator and the optimal soft VQ decoders of individual users. Due to its lower complexity and good performance, such a decoding scheme is an attractive alternative to the complicated optimal decoder. It is necessary to extend this decoding scheme for a frequency-selective Rayleigh fading CDMA channel, a channel model typically seen in mobile wireless communications. This is precisely the objective of this thesis. Furthermore, the suboptimal decoders are obtained not only for binary phase shift keying (BPSK), but also for M-ary pulse amplitude modulation (M-PAM). This extension offers a flexible trade-off between spectrum efficiency and performance of the systems. In addition, two algorithms based on distance measure and reliability processing are introduced as other alternatives to the suboptimal decoder. Simulation results indicate that the suboptimal decoders studied in this thesis also performs very well over a frequency-selective Rayleigh fading CDMA channel

Iterative receivers and multichannel equalisation for time division multiple access systems

The thesis introduces receiver algorithms improving the performance of TDMA mobile radio systems. Particularly, we consider receivers utilising side information, which can be obtained from the error control coding or by having a priori knowledge of interference sources. Iterative methods can be applied in the former case and interference suppression techniques in the latter. Convolutional coding adds redundant information into the signal and thereby protects messages transmitted over a radio channel. In the coded systems the receiver is usually comprised of separate channel estimation, detection and channel decoding tasks due to complexity restrictions. This suboptimal solution suffers from performance degradation compared to the optimal solution achieved by optimising the joint probability of information bits, transmitted symbols and channel impulse response. Conventional receiver utilises estimated channel state information in the detection and detected symbols in the channel decoding to finally obtain information bits. However, the channel decoder provides also extrinsic information on the bit probabilities, which is independent of the received information at the equaliser input. Therefore it is beneficial to re-perform channel estimation and detection using this new extrinsic information together with the original input signal. We apply iterative receiver techniques mainly to Enhanced General Packet Radio System (EGPRS) using GMSK modulation for iterative channel estimation and 8-PSK modulation for iterative detection scheme. Typical gain for iterative detection is around 2 dB and for iterative channel estimation around 1 dB. Furthermore, we suggest two iteration rounds as a reasonable complexity/performance trade-off. To obtain further complexity reduction we introduce the soft trellis decoding technique that reduces the decoder complexity significantly in the iterative schemes. Cochannel interference (CCI) originates from the nearby cells that are reusing the same transmission frequency. In this thesis we consider CCI suppression by joint detection (JD) technique, which detects simultaneously desired and interfering signals. Because of the complexity limitations we only consider JD for two binary modulated signals. Therefore it is important to find the dominant interfering signal (DI) to achieve the best performance. In the presence of one strong DI, the JD provides major improvement in the receiver performance. The JD requires joint channel estimation (JCE) for the two signals. However, the JCE makes the implementation of the JD more difficult, since it requires synchronised network and unique training sequences with low cross-correlation for the two signals.reviewe

Soft information based protocols in network coded relay networks

Future wireless networks aim at providing higher quality of service (QoS) to mobile users. The emergence of relay technologies has shed light on new methodologies through which the system capacity can be dramatically increased with low deployment cost. In this thesis, novel relay technologies have been proposed in two practical scenarios: wireless sensor networks (WSN) and cellular networks. In practical WSN designs, energy conservation is the single most important requirement. This thesis draws attention to a multiple access relay channels model in the WSN. The network coded symbol for the received signals from correlated sources has been derived; the network coded symbol vector is then converted into a sparse vector, after which a compressive sensing (CS) technique is applied over the sparse signals. A theoretical proof analysis is derived regarding the reliability of the network coded symbol formed in the proposed protocol. The proposed protocol results in a better bit error rate (BER) performance in comparison to the direct implementation of CS on the EF protocol. Simulation results validate our analyses. Another hot topic is the application of relay technologies to the cellular networks. In this thesis, a practical two-way transmission scheme is proposed based on the EF protocol and the network coding technique. A trellis coded quantization/modulation (TCQ/M) scheme is used in the network coding process. The soft network coded symbols are quantized into only one bit thus requiring the same transmission bandwidth as the simplest decode-and-forward protocol. The probability density function of the network coded symbol is derived to help to form the quantization codebook for the TCQ. Simulations show that the proposed soft forwarding protocol can achieve full diversity with only a transmission rate of 1, and its BER performance is equivalent to that of an unquantized EF protocol