Near optimum error correcting coding and decoding: turbo-codes

Berrou, Claude; Glavieux, Alain

doi:10.1109/26.539767

Cited by 2,356 publications

(1,289 citation statements)

References 10 publications

Supporting

Mentioning

1,219

Contrasting

Unclassified

Order By: Relevance

“…For channel decoding, the log-likelihood ratios (LLRs) are computed before decoding [18]. We note here that OFDM/TDM using MMSE-FDE for K = 1 (i.e., N m = N c ) reduces to the conventional OFDM system with N c = 256 subcarriers.…”

Section: B Ofdm/tdm Using Mmse-fdementioning

confidence: 99%

On transmission performance of OFDM-based schemes using MMSE-FDE in a frequency-selective fading channel

Gacanin¹,

Adachi

2011

J Wireless Com Network

View full text Add to dashboard Cite

There has been greatly increasing interest in orthogonal frequency division multiplexing (OFDM) for broadband wireless transmission due to its robustness against multipath fading. However, OFDM signals have high peak-toaverage power ratio (PAPR), and thus, a power amplifier must be operated with a large input power backoff (IBO). Recently, OFDM combined with time division multiplexing (OFDM/TDM) using minimum mean square errorfrequency domain equalization (MMSE-FDE) has been presented to reduce the PAPR, while improving the bit error rate (BER) performance of conventional OFDM. In this article, by extensive computer simulation, we present a comprehensive performance comparison of OFDM-based schemes in a nonlinear and frequency-selective fading channel. We discuss about the transmission performance of OFDM-based schemes with respect to the transmit peak-power, the achievable capacity, the BER performance, and the signal bandwidth. Our results show that OFDM/TDM using MMSE-FDE achieves a lower peak-power and capacity than conventional OFDM, which means significant reduction of amplifier transmit-power backoff, but with a slight decrease in signal bandwidth occupancy.

show abstract

Section: B Ofdm/tdm Using Mmse-fdementioning

confidence: 99%

On transmission performance of OFDM-based schemes using MMSE-FDE in a frequency-selective fading channel

Gacanin¹,

Adachi

2011

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

“…T URBO coding was introduced in 1993 by Berrou, Glavieux, and Thitimajashima [1], [2], who reported extremely impressive results for a code with a long frame length. Since its recent invention, turbo coding has evolved at an unprecedented rate and has reached a state of maturity within just a few years due to the intensive research efforts of the turbo coding community.…”

Section: Introductionmentioning

confidence: 99%

“…This, along with Bayes' rule and the fact that the transitions between the previous the present state in a trellis are mutually exclusive (i.e., only one of them could have occured at the encoder), allow us to rewrite (2) as (3) where is the set of transitions from the previous state to the present state that can occur if the input bit , and similarly for . For brevity we shall write as .…”

Section: A Introduction and Mathematical Preliminariesmentioning

confidence: 99%

See 1 more Smart Citation

Comparative study of turbo decoding techniques: an overview

Woodard

Hanzo

2000

IEEE Trans. Veh. Technol.

258

140

View full text Add to dashboard Cite

Abstract-In this contribution, we provide an overview of the novel class of channel codes referred to as turbo codes, which have been shown to be capable of performing close to the Shannon Limit. We commence with a brief discussion on turbo encoding, and then move on to describing the form of the iterative decoder most commonly used to decode turbo codes. We then elaborate on various decoding algorithms that can be used in an iterative decoder, and give an example of the operation of such a decoder using the so-called Soft Output Viterbi Algorithm (SOVA). Lastly, the effect of a range of system parameters is investigated in a systematic fashion, in order to gauge their performance ramifications.

show abstract

“…Turbo code, first presented to the coding community in 1993 [2], represents the most important breakthrough in channel coding. The origin turbo code offers near capacity performance for deep space and satellite channels.…”

Section: Introductionmentioning

confidence: 99%

An approximate formula for bit error rate of turbo code

Yang

2015

IEICE ComEX

View full text Add to dashboard Cite

Bit Error Rate (BER) is a significant metric extensively used in the performance evaluation of digital communication systems. Although BER can always be estimated through computer simulation, closed form expressions are often desirable in many scenarios. In this paper we propose an approximate formula for the BER of Turbo codes. With the proposed approximation, BER of Turbo codes under additive white Gaussian noise (AWGN) channel can be expressed as a product of two Gaussian Q functions with a scaling factor only depends on the signal-to-noise ratio (SNR). Simulation results show that the approximation error of the proposed formula is less than 0.3 dB both in AWGN and block Rayleigh fading channel.

show abstract

Near optimum error correcting coding and decoding: turbo-codes

Cited by 2,356 publications

References 10 publications

On transmission performance of OFDM-based schemes using MMSE-FDE in a frequency-selective fading channel

On transmission performance of OFDM-based schemes using MMSE-FDE in a frequency-selective fading channel

Comparative study of turbo decoding techniques: an overview

An approximate formula for bit error rate of turbo code

Contact Info

Product

Resources

About