The MAP algorithm is a trellis-based maximum a posteriori probability decoding algorithm. It is the heart of the turbo (or iterative) decoding which achieves an error performance near the Shannon limit. Unfortunately, the implementation of this algorithm requires large computation and storage. Furthermore, its forward and backward recursions result in long decoding delay. For practical applications, this decoding algorithm must be simplified and its decoding complexity and delay must be reduced. In this paper, the MAP algorithm and its variations, such as Log-MAP and Max-Log-MAP algorithms, are first applied to sectionalized trellises for linear block codes and carried out as two-stage decodings. Using the structural properties of properly sectionalized trellises, the decoding complexity and delay of the MAP algorithms can be reduced. Computation-wise optimum sectionalizations of a trellis for MAP algorithms are investigated. Also presented in this paper are bi-directional and parallel MAP decodings.Lin, ShuGoddard Space Flight CenterALGORITHMS; DECODING; LINEAR SYSTEMS; PROBABILITY THEORY; ERRORS; COMPUTATION

6. 5 137 7 Performance of BTCs and 139 their Applications 7. 1 Introduction 139 7. 2 Some Results from the Literatures 139 7. 3 Applications of Block Turbo Codes. 142 7. 3. 1 Broadband Wireless Access Standard 144 7. 3. 2 Advanced Hardware Architectures (AHA) 145 7. 3. 3 COMTECH EF DATA 147 7. 3. 4 Turbo Concept 149 7. 3. 5 Paradise Data Com 150 Summary 7. 4 151 8 Implementation Issues 153 8. 1 Fixed-point Implementation of Turbo Decoder 153 8. 1. 1 Input Data Quantization for DVB-RCS Turbo Codes 155 8. 1. 2 Input Data Quantization for BTC 157 8. 2 The Effect of Correction Term in Max-Log-MAP Algorithm 159 8. 3 Effect of Channel Impairment on Turbo Codes 163 8. 3. 1 System Model for the Investigation of Channel Impairments 163 8. 3. 2 Channel SNR Mismatch 164 8. 3. 2. 1 Simulation Results 165 8. 3. 3 Carrier Phase Recovery 170 8. 3. 3. 1 The Effect of Phase Offset on the Performance of RM Turbo Codes 170 8. 3. 3. 2 The Effect of Preamble Size on the Performance of RM Turbo Codes 170 8. 3. 3. 3 Simulation Results 170 8. 4 Hardware Implementation of Turbo Codes 171 8. 5 Summary 175 9 177 Low Density Parity Check Codes 9. 1 Gallager Codes: Regular Binary LDPC Codes 177 9. 2 Random Block Codes 178 9. 2. 1 Generator Matrix 179 9. 2.

Covering the full range of channel codes from the most conventional through to the most advanced, the second edition of Turbo Coding, Turbo Equalisation and Space-Time Coding is a self-contained reference on channel coding for wireless channels. The book commences with a historical perspective on the topic, which leads to two basic component codes, convolutional and block codes. It then moves on to turbo codes which exploit iterative decoding by using algorithms, such as the Maximum-A-Posteriori (MAP), Log-MAP and Soft Output Viterbi Algorithm (SOVA), comparing their performance. It also compares Trellis Coded Modulation (TCM), Turbo Trellis Coded Modulation (TTCM), Bit-Interleaved Coded Modulation (BICM) and Iterative BICM (BICM-ID) under various channel conditions. The horizon of the content is then extended to incorporate topics which have found their way into diverse standard systems. These include space-time block and trellis codes, as well as other Multiple-Input Multiple-Output (MIMO) schemes and near-instantaneously Adaptive Quadrature Amplitude Modulation (AQAM). The book also elaborates on turbo equalisation by providing a detailed portrayal of recent advances in partial response modulation schemes using diverse channel codes. A radically new aspect for this second edition is the discussion of multi-level coding and sphere-packing schemes, Extrinsic Information Transfer (EXIT) charts, as well as an introduction to the family of Generalized Low Density Parity Check codes. This new edition includes recent advances in near-capacity turbo-transceivers as well as new sections on multi-level coding schemes and of Generalized Low Density Parity Check codes Comparatively studies diverse channel coded and turbo detected systems to give all-inclusive information for researchers, engineers and students Details EXIT-chart based irregular transceiver designs Uses rich performance comparisons as well as diverse near-capacity design examples

As the demand for data reliability increases, coding for error control becomes increasingly important in data transmission systems and has become an integral part of almost all data communication system designs. In recent years, various trellis-based soft-decoding algorithms for linear block codes have been devised. New ideas developed in the study of trellis structure of block codes can be used for improving decoding and analyzing the trellis complexity of convolutional codes. These recent developments provide practicing communication engineers with more choices when designing error control systems. Trellises and Trellis-based Decoding Algorithms for Linear Block Codes combines trellises and trellis-based decoding algorithms for linear codes together in a simple and unified form. The approach is to explain the material in an easily understood manner with minimal mathematical rigor. Trellises and Trellis-based Decoding Algorithms for Linear Block Codes is intended for practicing communication engineers who want to have a fast grasp and understanding of the subject. Only material considered essential and useful for practical applications is included. This book can also be used as a text for advanced courses on the subject.