Turbo code at 0.03 dB from capacity limit

Boutros, Joseph J.; Caire, Giuseppe; Viterbo, Emanuele; Sawaya, Hadi; Vialle, Stéphane

doi:10.1109/isit.2002.1023328

Cited by 53 publications

(20 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In 1993 a new error correcting technique, known as turbo coding [2], was introduced and claimed to achieve near Shannon-limit error correction performance; a required E b /N o of 0.7 dB was reported for bit error rates (BER) of 10 -5 using a code rate of 1/2 in an Additive White Gaussian Noise (AWGN) channel. Many researchers have contributed to this latest technique of channel coding [3]- [12].…”

Section: Introductionmentioning

confidence: 99%

Turbo Codes: Analysis and Design

AL-Rawi

2015

KMUTNB: IJAST

View full text Add to dashboard Cite

This paper studies briefly the design and performance of turbo codes. It focuses on studying the effects of three parameters beside the termination process on the performance of turbo codes. These parameters include, number of iterations, frame size and code rate. Simulation results show that the performance proportional to these three parameters, in addition, the termination process improves the performance.

show abstract

Section: Introductionmentioning

confidence: 99%

Turbo Codes: Analysis and Design

AL-Rawi

2015

KMUTNB: IJAST

View full text Add to dashboard Cite

show abstract

“…Afterwards, their interests go towards irregular TCs [4]. In our work, we focused on the improvement of the 3GPP2 code used in the third-generation (3G) cdma2000 mobile phone communication systems [5].…”

Section: Introductionmentioning

confidence: 99%

A survey of three-dimensional turbo codes and recent performance enhancements

Ismail

Douillard

Kerouedan

2013

J Wireless Com Network

View full text Add to dashboard Cite

This paper presents a survey of two techniques intended for improving the performance of conventional turbo codes (TCs). The first part of this work is dedicated to explore a hybrid concatenation structure combining both parallel and serial concatenation based on a three-dimensional (3D) code. The 3D structure, recently introduced by Berrou et al., is able to ensure large asymptotic gains at very low error rates at the expense of an increase in complexity and a loss in the convergence threshold. In order to reduce the loss in the convergence threshold, the authors consider first a time-varying construction of the post-encoded parity. Then, they investigate the association of the 3D TC with high-order modulations according to the bit-interleaved coded modulation approach. The second part of this study deals with irregular TCs. In contrast to 3D TCs, although irregular TCs can achieve performance closer to capacity, their asymptotic performance is very poor. Therefore, the authors propose irregular turbo coding schemes with suitable interleavers in order to improve their distance properties. Finally, a modified encoding procedure, inspired from the 3D TC, makes it possible to obtain irregular TCs which perform better than the corresponding regular codes in both the waterfall and the error floor regions.

show abstract

“…1) Design block-wise maximum distance separable (MDS) codes, that achieve the largest possible diversity given by the Singleton bound in the block-erasure channel [ 2) Reducing the decoding threshold in the AWGN channel. In this paper, we design irregular binary turbo codes [11] for block-fading channels. Based on the h-π-diagonal multiplexer [7] we design irregular turbo codes with full diversity.…”

Section: Introductionmentioning

confidence: 99%

Irregular turbo codes in block-fading channels

Kraidy

Boutros

Fàbregas

2010

2010 IEEE International Symposium on Information Theory

View full text Add to dashboard Cite

Abstract-We study irregular binary turbo codes over nonergodic block-fading channels. We first propose an extension of channel multiplexers initially designed for regular turbo codes. We then show that, using these multiplexers, irregular turbo codes that exhibit a small decoding threshold over the ergodic Gaussian-noise channel perform very close to the outage probability on block-fading channels, from both density evolution and finite-length perspectives.

show abstract

Turbo code at 0.03 dB from capacity limit

Cited by 53 publications

References 2 publications

Turbo Codes: Analysis and Design

Turbo Codes: Analysis and Design

A survey of three-dimensional turbo codes and recent performance enhancements

Irregular turbo codes in block-fading channels

Contact Info

Product

Resources

About