Joint interleaver design for multiple turbo codes

Ehtiati, N.; Soleymani, M.R.; Sadjadpour, Hamid R.

doi:10.1109/vetecf.2004.1400463

Cited by 3 publications

(6 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For this, we propose a new design with very small storage space to achieve the similar performance. This design with the original performance remained takes up 2 2 N as large as the storage space of the original design only, while the computing complexity is also 2 1 N that of the original algorithm.…”

Section: Pg 2260mentioning

confidence: 99%

“…The storage space of the new one is 2 2 N as large as that of the original one and the computing complexity decreases to 2 1 N of the original one. It can be illustrated that the modified algorithm improves in running time and storage space so largely to ignore the limitation of the permutor size for the original algorithm.…”

Section: Performance Comparisonsmentioning

confidence: 99%

“…This means that design parameters must be found that allow an evaluation or design of two or more permutors jointly in terms of good distance property of the overall code. At present the joint permutor designs are mainly two methods: (1) Every permutor is designed separately to satisfy not overlap but complementary permutor conditions [2], but it highly depends on the choice of permutor conditions, which are usually complicated to choose; (2) All permutor outputs are combined to an interleaving matrix which satisfies special conditions, but it employs too much storage space for turbo codes with long sizes [3].…”

mentioning

confidence: 99%

See 2 more Smart Citations

A new joint permutor design for multiple turbo codes

et al. 2008

2008 3rd IEEE Conference on Industrial Electronics and Applications

View full text Add to dashboard Cite

A permutor is a critical component for the channel coding performance of turbo codes. Since the original joint permutor design for multiple turbo codes has disadvantages of large storage space and high computing complexity, it is not applicable at present. For this, this paper presents a new point-to-point joint permutor design algorithm, which only needs 2 2 N as large as storage space of the original design with the computing complexity greatly reduced.Index Terms-Multiple turbo codes (MTC), summary distance, joint permutor design.

show abstract

Section: Pg 2260mentioning

confidence: 99%

Section: Performance Comparisonsmentioning

confidence: 99%

mentioning

confidence: 99%

See 1 more Smart Citation

A new joint permutor design for multiple turbo codes

et al. 2008

2008 3rd IEEE Conference on Industrial Electronics and Applications

View full text Add to dashboard Cite

show abstract

“…Interleaver design in the context of multidimensional parallel concatenated convolutional codes is addressed in [12] and [13]. Here, the fact that data sequences which are divisible by the feedback polynom of the recursive convolutional constituent codes produce low weight code words is taken into account.…”

Section: Introductionmentioning

confidence: 99%

“…The interleaver should permute those divisible patterns to non divisible patterns. In order not to put too many restrictions on one interleaver, the idea in [12], [13] is that each interleaver takes care of a subset of critical patterns which have to be broken. This ensures that at least one constituent code contributes weight to the codeword.…”

Section: Introductionmentioning

confidence: 99%

Simple construction of multiple interleavers for concatenated zigzag codes

Bauch

Kusume

2007

Proceedings of the 2007 International Conference on Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

Concatenated zigzag codes with iterative decoding show excellent performance close to the performance of turbo codes while having significantly lower decoding complexity. A strong code is built by concatenation of several weak high rate codes which encode differently interleaved versions of the data sequence. The need for multiple interleavers implies a new problem in interleaver design: Multiple interleavers have to be constructed which allow good performance in iterative decoding and are mutually random. Furthermore, for practical reasons, they should be constructed either from a simple equation or by simple permutations of a common mother interleaver in order to minimize the required memory for storage of the permutation pattern. We propose two simple methods for interleaver construction which meet those requirements. Our first proposal is to obtain multiple interleavers by cyclic shifts and selfinterleaving from a common mother interleaver. The second proposal uses modified read out processes in intermediate steps during construction of the UMTS turbo code internal interleaver. Particularly the proposed cyclic shifted interleavers are shown to provide superior performance with zigzag codes compared to other interleaving schemes such as congruential interleavers.

show abstract

Recent Advances in Turbo Code Design and Theory

Vucetic

Pérez

et al. 2007

Proc. IEEE

View full text Add to dashboard Cite

The interleaver, which combines the outputs of turbo decoders, is essential in determining the performance of turbo codes and is the main source of decoder computation and implementation complexity. ABSTRACT | The discovery of turbo codes and the subsequent rediscovery of low-density parity-check (LDPC) codes represent major milestones in the field of channel coding. Recent advances in the design and theory of turbo codes and their relationship to LDPC codes are discussed. Several new interleaver designs for turbo codes are presented which illustrate the important role that the interleaver plays in these codes. The relationship between turbo codes and LDPC codes is explored via an explicit formulation of the parity-check matrix of a turbo code, and simulation results are given for sum product decoding of a turbo code.

show abstract

Joint interleaver design for multiple turbo codes

Cited by 3 publications

References 6 publications

A new joint permutor design for multiple turbo codes

A new joint permutor design for multiple turbo codes

Simple construction of multiple interleavers for concatenated zigzag codes

Recent Advances in Turbo Code Design and Theory

Contact Info

Product

Resources

About