Turbo-codes and high spectral efficiency modulation

Goff, Stan; Glavieux, Alain; Berrou, Claude

doi:10.1109/icc.1994.368804

Cited by 307 publications

(183 citation statements)

References 4 publications

Supporting

Mentioning

177

Contrasting

Unclassified

Order By: Relevance

“…From the definition of in (6) we can write (10) where in the last line we split the probability into the sum of joint probabilities over all possible previous states . Using Bayes' rule and the assumption that the channel is memoryless again, we can proceed as follows:…”

Section: B the Forward Recursive Calculation Of The Valuesmentioning

confidence: 99%

“…Since then, a large body of work has been carried out in the area, aiming, for example, to reduce the decoder complexity, as suggested by Robertson et al [7], Berrou et al [9], as well as by Battail [8]. Le Goff et al [10], Wachsmann and Huber [11], as well as Robertson and Worz [12] suggested to use the codes in conjunction with bandwidth efficient modulation schemes. Further advances in understanding the excellent preformance of the codes are due, for example, to Benedetto and Montorsi [13], [15], Perez et al [14].…”

Section: Introductionmentioning

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

Section: B the Forward Recursive Calculation Of The Valuesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Comparative study of turbo decoding techniques: an overview

Woodard

Hanzo

2000

IEEE Trans. Veh. Technol.

258

140

View full text Add to dashboard Cite

show abstract

“…또한 복호기와 복조기 간 정보를 주고받으며 반복 복호를 수행하는 BICM-ID (bit interleaved coded modulation with iterative decoding)를 이용하여 BICM의 성능을 개선할 수 있는 것으로 알려져 있다. 논문 [4] 에서는 BICM에 기존의 격자 부호를 대신하여 터보 부호를 사 (1949) 용하는 Turbo-BICM을 제안하였으며 터보 부호 복호 기와 복조기 간에 정보를 교환하며 반복 복호 (iterative decoding)를 수행하는 Turbo-BICM-ID를 이용하여 성 능을 개선할 수 있다 [5] . Turbo-BICM-ID에서 복조기는 터보 부호 복호기의 매 반복 복호에서 생성된 정보 및 패리티 비트에 대한 LLR (log-likelihood ratio)을 바탕으로 수신 심볼 (symbol)에 대한 사전 정보 (a priori information)를 구 하고 이를 바탕으로 수신 심볼을 구성하고 있는 각 비 트들에 대한 터보 복호기 입력 신호를 갱신한다.…”

unclassified

A Low-Complexity Turbo coded BICM-ID System

Kang¹,

Lee²,

Oh³

2013

Journal of the Institute of Electronics and Information Enginee

View full text Add to dashboard Cite

In this paper, we propose a low-complexity Turbo coded BICM-ID (bit-interleaved coded modulation with iterative decoding) system. A Turbo code is a powerful error correcting code with a BER (bit error rate) performance very close to the Shannon limit. In order to increase spectral efficiency of the Turbo code, a coded modulation combining Turbo code with high order modulation is used. The BER performance of Turbo-BICM can be improved by Turbo-BICM-ID using iterative demodulation and decoding algorithm. However, compared with Turbo-BICM, the decoding complexity of Turbo-BICM-ID is increased by exchanging information between decoder and demodulator. To reduce the decoding complexity of Turbo-BICM-ID, we propose a low-complexity Turbo-BICM-ID system. When compared with conventional Turbo-BICM-ID, the proposed scheme not only show similar BER performance but also reduce the decoding complexity.

show abstract

“…with Variable Length Codes (VLC) [6] or a many-to-one strategy [7]. In [7] Raphaeli proposed a simple method for achieving a dyadic PMF, using the notion of pragmatic turbo codes [8]. However, the PMF is fixed and is designed for a certain SNR region, making it sub-optimal if a change in the spectral efficiency is required.…”

Section: Introductionmentioning

confidence: 99%

Rate-adaptive constellation shaping for near-capacity achieving turbo coded BICM

Yankov

Forchhammer

Larsen

et al. 2014

2014 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

Abstract-In this paper the problem of constellation shaping is considered. Mapping functions are designed for a manyto-one signal shaping strategy, combined with a turbo coded Bit-interleaved Coded Modulation (BICM), based on symmetric Huffman codes with binary reflected Gray-like properties. An algorithm is derived for finding the Huffman code with such properties for a variety of alphabet sizes, and near-capacity performance is achieved for a wide SNR region by dynamically choosing the optimal code rate, constellation size and mapping function based on the operating SNR point and assuming perfect channel quality estimation. Gains of more than 1dB are observed for high SNR compared to conventional turbo coded BICM, and it is shown that the mapping functions designed here significantly outperform current state of the art TurboTrellis Coded Modulation and other existing constellation shaping methods.

show abstract

Turbo-codes and high spectral efficiency modulation

Cited by 307 publications

References 4 publications

Comparative study of turbo decoding techniques: an overview

Comparative study of turbo decoding techniques: an overview

A Low-Complexity Turbo coded BICM-ID System

Rate-adaptive constellation shaping for near-capacity achieving turbo coded BICM

Contact Info

Product

Resources

About