Iterative Decoding With a Hamming Threshold for Block Turbo Codes

2004 ◽  
Vol 8 (9) ◽  
pp. 567-569 ◽  
Author(s):  
A. Mahran ◽  
M. Benaissa
Keyword(s):  
Turbo Codes ◽  
Iterative Decoding ◽  
Block Turbo Codes

scholarly journals Irregular Vector Turbo Codes with Low Complexity

2021 ◽  
Author(s):  
Abiodun Sholiyi ◽  
Timothy O Farrell
Keyword(s):  
Turbo Codes ◽  
Iterative Decoding ◽  
Turbo Code ◽  
Block Code ◽  
Low Complexity ◽  
Modulation Scheme ◽  
Awgn Channel ◽  
Block Turbo Code ◽  
Serially Concatenated ◽  
Block Turbo Codes

Abstract The term Block Turbo Code typically refers to the iterative decoding of a serially concatenated two-dimensional systematic block code. This paper introduces a Vector Turbo Code that is irregular but with code rates comparable to those of a Block Turbo Code (BTC) when the Bahl Cocke Jelinek Raviv (BCJR) algorithm is used. In Block Turbo Codes, the horizontal (or vertical) blocks are encoded first and the vertical (or horizontal) blocks second. The irregular Vector Turbo Code (iVTC) uses information bits that participate in varying numbers of trellis sections, which are organized into blocks that are encoded horizontally (or vertical) without vertical (or horizontal) encoding. The decoding requires only one soft-input soft-output (SISO) decoder. In general, a reduction in complexity, in comparison to a Block Turbo Code was achieved for the same very low probability of bit error (10−5 ). Performance in the AWGN channel shows that iVTC is capable of achieving a significant coding gain of 1.28 dB for a 64QAM modulation scheme, at a bit error rate (BER) of 10−5over its corresponding Block Turbo Code. Simulation results also show that some of these codes perform within 0.49 dB of capacity for binary transmission over an AWGN channel.

Efficient stopping criterion for iterative decoding of turbo codes

2003 ◽  
Vol 39 (1) ◽  
pp. 73 ◽  
Author(s):  
Nam Yul Yu ◽  
Min Goo Kim ◽  
Yong Serk Kim ◽  
Sang Uoon Chung
Keyword(s):  
Turbo Codes ◽  
Iterative Decoding ◽  
Stopping Criterion

Application of Extrinsic Information Transfer Charts to Anticipate Turbo Code Behavior

2013 ◽  
pp. 97-104
Author(s):  
Izabella Lokshina
Keyword(s):  
Turbo Codes ◽  
Iterative Decoding ◽  
Information Transfer ◽  
Turbo Code ◽  
A Priori ◽  
Substantial Reduction ◽  
International Standards ◽  
Extrinsic Information ◽  
Exit Chart ◽  
Analysis Technique

This paper examines turbo codes that are currently introduced in many international standards, including the UMTS standard for third generation personal communications and the ETSI DVB-T standard for Terrestrial Digital Video Broadcasting. The convergence properties of the iterative decoding process associated with a given turbo-coding scheme are estimated using the analysis technique based on so-called extrinsic information transfer (EXIT) chart. This approach provides a possibility to anticipate the bit error rate (BER) of a turbo code system using only the EXIT chart. It is shown that EXIT charts are powerful tools to analyze and optimize the convergence behavior of iterative systems utilizing the turbo principle. The idea is to consider the associated SISO stages as information processors that map input a priori LLR’s onto output extrinsic LLR’s, the information content being obviously assumed to increase from input to output, and introduce them to the design of turbo systems without the reliance on extensive simulation. Compared with the other methods for generating EXIT functions, the suggested approach provides insight into the iterative behavior of linear turbo systems with substantial reduction in numerical complexity.

Sign in / Sign up

Export Citation Format

Share Document