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

Implementable Wireless Access for B3G Networks - III: Complexity Reducing Transceiver Structures

This article presents a comprehensive overview of some of the research conducted within Mobile VCE’s Core Wireless Access Research Programme,1 a key focus of which has naturally been on MIMO transceivers. The series of articles offers a coherent view of how the work was structured and comprises a compilation of material that has been presented in detail elsewhere (see references within the article). In this article MIMO channel measurements, analysis, and modeling, which were presented previously in the first article in this series of four, are utilized to develop compact and distributed antenna arrays. Parallel activities led to research into low-complexity MIMO single-user spacetime coding techniques, as well as SISO and MIMO multi-user CDMA-based transceivers for B3G systems. As well as feeding into the industry’s in-house research program, significant extensions of this work are now in hand, within Mobile VCE’s own core activity, aiming toward securing major improvements in delivery efficiency in future wireless systems through crosslayer operation

Self-concatenated code design and its application in power-efficient cooperative communications

In this tutorial, we have focused on the design of binary self-concatenated coding schemes with the help of EXtrinsic Information Transfer (EXIT) charts and Union bound analysis. The design methodology of future iteratively decoded self-concatenated aided cooperative communication schemes is presented. In doing so, we will identify the most important milestones in the area of channel coding, concatenated coding schemes and cooperative communication systems till date and suggest future research directions

Low Complexity Iterative Multiuser Detection and Decoding for Real-Time Applications

This paper presents a low-complexity multiuser decoding technique that can be implemented in real time for a convolutionally coded direct sequence code division multiple access (DS-CDMA) system. The main contribution, denoted here as the iterative prior update (IPU), consists of iterative interference cancellation and prior updates on sequences of coded bits combined with M-algorithm and list decoding. We illustrate performance gains over other low-complexity sequence detection and decoding strategies and argue that the algorithm converges within a few iterations and requires only a small size buffer for keeping track of the priors along iterations. The fact that the we can use existing available architectures for Viterbi decoding with slight modifications and can meet the real-time processing constraints makes the IPU algorithm an attractive alternative for cellular systems

Iterative multiuser detection with integrated channel estimation for turbo coded DS-CDMA.

In present days the demand of high bandwidth and data rate in wireless communications is increasing rapidly to accommodate multimedia applications, including services such as wireless video and high-speed Internet access. In this thesis, we propose a receiver algorithm for mobile communications systems which apply CDMA (Code division multiple access) as multiple access technique. Multiuser Detection and turbo coding are the two most powerful techniques for enhancing the performance of future wireless services. The standardization of direct sequence CDMA (DS-CDMA) systems in the third generation of mobile communication system has raised the interest in exploiting the capabilities and capacity of this type of Technology. However the conventional DS-CDMA system has the major drawback of multiple Access Interference (MAI). The MAI is unavoidable because receivers deal with the information which is transmitted not by a single information source but by several uncoordinated and geographically separated sources. To overcome this problem MUD is a promising approach to increase capacity. (Abstract shortened by UMI.)Dept. of Electrical and Computer Engineering. Paper copy at Leddy Library: Theses & Major Papers - Basement, West Bldg. / Call Number: Thesis2005 .C465. Source: Masters Abstracts International, Volume: 45-01, page: 0404. Thesis (M.Sc.)--University of Windsor (Canada), 2005

Quantum search algorithms, quantum wireless, and a low-complexity maximum likelihood iterative quantum multi-user detector design

The high complexity of numerous optimal classic communication schemes, such as the maximum likelihood (ML) multiuser detector (MUD), often prevents their practical implementation. In this paper, we present an extensive review and tutorial on quantum search algorithms (QSA) and their potential applications, and we employ a QSA that finds the minimum of a function in order to perform optimal hard MUD with a quadratic reduction in the computational complexity when compared to that of the ML MUD. Furthermore, we follow a quantum approach to achieve the same performance as the optimal soft-input soft-output classic detectors by replacing them with a quantum algorithm, which estimates the weighted sum of a function’s evaluations. We propose a soft-input soft-output quantum-assisted MUD (QMUD) scheme, which is the quantum-domain equivalent of the ML MUD. We then demonstrate its application using the design example of a direct-sequence code division multiple access system employing bit-interleaved coded modulation relying on iterative decoding, and compare it with the optimal ML MUD in terms of its performance and complexity. Both our extrinsic information transfer charts and bit error ratio curves show that the performance of the proposed QMUD and that of the optimal classic MUD are equivalent, but the QMUD’s computational complexity is significantly lower

Iterative Receiver for MIMO-OFDM System with ICI Cancellation and Channel Estimation

As a multi-carrier modulation scheme, Orthogonal Frequency Division Multiplexing (OFDM) technique can achieve high data rate in frequency-selective fading channels by splitting a broadband signal into a number of narrowband signals over a number of subcarriers, where each subcarrier is more robust to multipath. The wireless communication system with multiple antennas at both the transmitter and receiver, known as multiple-input multiple-output (MIMO) system, achieves high capacity by transmitting independent information over different antennas simultaneously. The combination of OFDM with multiple antennas has been considered as one of most promising techniques for future wireless communication systems. The challenge in the detection of a space-time signal is to design a low-complexity detector, which can efficiently remove interference resulted from channel variations and approach the interference-free bound. The application of iterative parallel interference canceller (PIC) with joint detection and decoding has been a promising approach. However, the decision statistics of a linear PIC is biased toward the decision boundary after the first cancellation stage. In this thesis, we employ an iterative receiver with a decoder metric, which considerably reduces the bias effect in the second iteration, which is critical for the performance of the iterative algorithm. Channel state information is required in a MIMO-OFDM system signal detection at the receiver. Its accuracy directly affects the overall performance of MIMO-OFDM systems. In order to estimate the channel in high-delay-spread environments, pilot symbols should be inserted among subcarriers before transmission. To estimate the channel over all the subcarriers, various types of interpolators can be used. In this thesis, a linear interpolator and a trigonometric interpolator are compared. Then we propose a new interpolator called the multi-tap method, which has a much better system performance. In MIMO-OFDM systems, the time-varying fading channels can destroy the orthogonality of subcarriers. This causes serious intercarrier interference (ICI), thus leading to significant system performance degradation, which becomes more severe as the normalized Doppler frequency increases. In this thesis, we propose a low-complexity iterative receiver with joint frequency- domain ICI cancellation and pilot-assisted channel estimation to minimize the effect of time-varying fading channels. At the first stage of receiver, the interference between adjacent subcarriers is subtracted from received OFDM symbols. The parallel interference cancellation detection with decision statistics combining (DSC) is then performed to suppress the interference from other antennas. By restricting the interference to a limited number of neighboring subcarriers, the computational complexity of the proposed receiver can be significantly reduced. In order to construct the time variant channel matrix in the frequency domain, channel estimation is required. However, an accurate estimation requiring complete knowledge of channel time variations for each block, cannot be obtained. For time- varying frequency-selective fading channels, the placement of pilot tones also has a significant impact on the quality of the channel estimates. Under the assumption that channel variations can be approximated by a linear model, we can derive channel state information (CSI) in the frequency domain and estimate time-domain channel parameters. In this thesis, an iterative low-complexity channel estimation method is proposed to improve the system performance. Pilot symbols are inserted in the transmitted OFDM symbols to mitigate the effect of ICI and the channel estimates are used to update the results of both the frequency domain equalizer and the PICDSC detector in each iteration. The complexity of this algorithm can be reduced because the matrices are precalculated and stored in the receiver when the placement of pilots symbols is fixed in OFDM symbols before transmission. Finally, simulation results show that the proposed MIMO-OFDM iterative receiver can effectively mitigate the effect of ICI and approach the ICI-free performance over time-varying frequency-selective fading channels

Turbo space-time coded modulation : principle and performance analysis

A breakthrough in coding was achieved with the invention of turbo codes. Turbo codes approach Shannon capacity by displaying the properties of long random codes, yet allowing efficient decoding. Coding alone, however, cannot fully address the problem of multipath fading channel. Recent advances in information theory have revolutionized the traditional view of multipath channel as an impairment. New results show that high gains in capacity can be achieved through the use of multiple antennas at the transmitter and the receiver. To take advantage of these new results in information theory, it is necessary to devise methods that allow communication systems to operate close to the predicted capacity. One such method recently invented is space-time coding, which provides both coding gain and diversity advantage. In this dissertation, a new class of codes is proposed that extends the concept of turbo coding to include space-time encoders as constituent building blocks of turbo codes. The codes are referred to as turbo spacetime coded modulation (turbo-STCM). The motivation behind the turbo-STCM concept is to fuse the important properties of turbo and space-time codes into a unified design framework. A turbo-STCM encoder is proposed, which consists of two space-time codes in recursive systematic form concatenated in parallel. An iterative symbol-by-symbol maximum a posteriori algorithm operating in the log domain is developed for decoding turbo-STCM. The decoder employs two a posteriori probability (APP) computing modules concatenated in parallel; one module for each constituent code. The analysis of turbo-STCM is demonstrated through simulations and theoretical closed-form expressions. Simulation results are provided for 4-PSK and 8-PSK schemes over the Rayleigh block-fading channel. It is shown that the turbo-STCM scheme features full diversity and full coding rate. The significant gain can be obtained in performance over conventional space-time codes of similar complexity. The analytical union bound to the bit error probability is derived for turbo-STCM over the additive white Gaussian noise (AWGN) and the Rayleigh block-fading channels. The bound makes it possible to express the performance analysis of turbo-STCM in terms of the properties of the constituent space-time codes. The union bound is demonstrated for 4-PSK and 8-PSK turbo-STCM with two transmit antennas and one/two receive antennas. Information theoretic bounds such as Shannon capacity, cutoff rate, outage capacity and the Fano bound, are computed for multiantenna systems over the AWGN and fading channels. These bounds are subsequently used as benchmarks for demonstrating the performance of turbo-STCM

Self-concatenated coding for wireless communication systems

In this thesis, we have explored self-concatenated coding schemes that are designed for transmission over Additive White Gaussian Noise (AWGN) and uncorrelated Rayleigh fading channels. We designed both the symbol-based Self-ConcatenatedCodes considered using Trellis Coded Modulation (SECTCM) and bit-based Self- Concatenated Convolutional Codes (SECCC) using a Recursive Systematic Convolutional (RSC) encoder as constituent codes, respectively. The design of these codes was carried out with the aid of Extrinsic Information Transfer (EXIT) charts. The EXIT chart based design has been found an efficient tool in finding the decoding convergence threshold of the constituent codes. Additionally, in order to recover the information loss imposed by employing binary rather than non-binary schemes, a soft decision demapper was introduced in order to exchange extrinsic information withthe SECCC decoder. To analyse this information exchange 3D-EXIT chart analysis was invoked for visualizing the extrinsic information exchange between the proposed Iteratively Decoding aided SECCC and soft-decision demapper (SECCC-ID). Some of the proposed SECTCM, SECCC and SECCC-ID schemes perform within about 1 dB from the AWGN and Rayleigh fading channels’ capacity. A union bound analysis of SECCC codes was carried out to find the corresponding Bit Error Ratio (BER) floors. The union bound of SECCCs was derived for communications over both AWGN and uncorrelated Rayleigh fading channels, based on a novel interleaver concept.Application of SECCCs in both UltraWideBand (UWB) and state-of-the-art video-telephone schemes demonstrated its practical benefits.In order to further exploit the benefits of the low complexity design offered by SECCCs we explored their application in a distributed coding scheme designed for cooperative communications, where iterative detection is employed by exchanging extrinsic information between the decoders of SECCC and RSC at the destination. In the first transmission period of cooperation, the relay receives the potentially erroneous data and attempts to recover the information. The recovered information is then re-encoded at the relay using an RSC encoder. In the second transmission period this information is then retransmitted to the destination. The resultant symbols transmitted from the source and relay nodes can be viewed as the coded symbols of a three-component parallel-concatenated encoder. At the destination a Distributed Binary Self-Concatenated Coding scheme using Iterative Decoding (DSECCC-ID) was employed, where the two decoders (SECCC and RSC) exchange their extrinsic information. It was shown that the DSECCC-ID is a low-complexity scheme, yet capable of approaching the Discrete-input Continuous-output Memoryless Channels’s (DCMC) capacity.Finally, we considered coding schemes designed for two nodes communicating with each other with the aid of a relay node, where the relay receives information from the two nodes in the first transmission period. At the relay node we combine a powerful Superposition Coding (SPC) scheme with SECCC. It is assumed that decoding errors may be encountered at the relay node. The relay node then broadcasts this information in the second transmission period after re-encoding it, again, using a SECCC encoder. At the destination, the amalgamated block of Successive Interference Cancellation (SIC) scheme combined with SECCC then detects and decodes the signal either with or without the aid of a priori information. Our simulation results demonstrate that the proposed scheme is capable of reliably operating at a low BER for transmission over both AWGN and uncorrelated Rayleigh fading channels. We compare the proposed scheme’s performance to a direct transmission link between the two sources having the same throughput