Designing good permutations for turbo codes: towards a single model

Berrou, Claude; Saouter, Yannick; Douillard, Catherine; Kerouedan, Sylvie; Jézéquel, Michel

doi:10.1109/icc.2004.1312507

Cited by 122 publications

(103 citation statements)

References 2 publications

Supporting

Mentioning

100

Contrasting

Unclassified

Order By: Relevance

“…One should note that the almost regular permutation [48] defined for the DVB-RCS standard (Digital Video Broadcast Return Channel Satellite), the dithered relatively prime interleaver [49] and the slice turbo code [50] belong to the family of "design stage interleaver".…”

Section: ) Solution At the Design Stagementioning

confidence: 99%

Iterative Decoding of Concatenated Convolutional Codes: Implementation Issues

2007

View full text Add to dashboard Cite

This tutorial paper gives an overview of the implementation aspects related to turbo decoders, where the term turbo generally refers to iterative decoders intended for Parallel Concatenated Convolutional Codes as well as for Serial Concatenated Convolutional Codes. We start by considering the general structure of iterative decoders, and the main features of the SISO algorithm that forms the heart of iterative decoders. Then, we show that very efficient parallel architectures are available for all types of turbo decoders allowing high speed implementations. Other implementation aspects like quantization issues and stopping rules used in conjunction with buffering for increasing throughput are considered. Finally, we perform an evaluation of the complexities of the turbo decoders as a function of the main parameters of the code.

show abstract

Section: ) Solution At the Design Stagementioning

confidence: 99%

Iterative Decoding of Concatenated Convolutional Codes: Implementation Issues

2007

View full text Add to dashboard Cite

show abstract

“…However, the effect of odd-even separation is much less significant for the random interleavers than it is for the block interleavers, but in general the employment of random interleavers is not conducive to maximizing the Hamming distance (HD). Hence, Berrou et al in [48] proposed a generic model for maximizing the HD.…”

Section: Hanzo Et Al: Turbo Decoding and Detection For Wireless Applmentioning

confidence: 99%

Turbo Decoding and Detection for Wireless Applications

Hanzo

Woodard²,

Robertson

2007

Proc. IEEE

View full text Add to dashboard Cite

Future iterative receivers will be designed using EXIT charts for near-capacity operation over dispersive wireless channels at the lowest possible complexity and delay. 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.

show abstract

“…Inter-symbol interleaving permutes the input words u n in the information data sequence and may be done using already known interleaving techniques [27][28][29]. An advantage brought by MNBTCs is the essential reduction of the interleaver length N. The MNBTC data block structure is three-dimensional: R × Q × N. For SBTC, we have a linear data block structure (R = Q = 1) and for MBTC and NBTC planar structures (R > Q = 1 for MBTC and Q > R = 1 for NBTC) as well.…”

Section: Interleaving For Mnbtcsmentioning

confidence: 99%

Multi-non-binary turbo codes

Balta

Douillard

Lucaciu

2013

J Wireless Com Network

View full text Add to dashboard Cite

This paper presents a new family of turbo codes called multi-non-binary turbo codes (MNBTCs) that generalizes the concept of turbo codes to multi-non-binary (MNB) parallel concatenated convolutional codes (PCCC). An MNBTC incorporates, as component encoders, recursive and systematic multi-non-binary convolutional encoders. The more compact data structure for these encoders confers some advantages on MNBTCs over other types of turbo codes, such as better asymptotic behavior, better convergence, and reduced latency. This paper presents in detail the structure and operation of an MNBTC: MNB encoding, trellis termination, Max-Log-MAP decoding adapted to the MNB case. It also shows an example of MNBTC whose performance is compared with the state-of-the-art turbo code adopted in the DVB-RCS2 standard.

show abstract

Designing good permutations for turbo codes: towards a single model

Cited by 122 publications

References 2 publications

Iterative Decoding of Concatenated Convolutional Codes: Implementation Issues

Iterative Decoding of Concatenated Convolutional Codes: Implementation Issues

Turbo Decoding and Detection for Wireless Applications

Multi-non-binary turbo codes

Contact Info

Product

Resources

About