Efficient Decoding of Turbo Codes with Nonbinary Belief Propagation - Archive ouverte HAL Access content directly
Journal Articles EURASIP Journal on Wireless Communications and Networking Year : 2008

Efficient Decoding of Turbo Codes with Nonbinary Belief Propagation

Abstract

This paper presents a new approach to decode turbo codes using a nonbinary belief propagation decoder. The proposed approach can be decomposed into two main steps. First, a nonbinary Tanner graph representation of the turbo code is derived by clustering the binary parity-check matrix of the turbo code. Then, a group belief propagation decoder runs several iterations on the obtained nonbinary Tanner graph. We show in particular that it is necessary to add a preprocessing step on the parity-check matrix of the turbo code in order to ensure good topological properties of the Tanner graph and then good iterative decoding performance. Finally, by capitalizing on the diversity which comes from the existence of distinct efficient preprocessings, we propose a new decoding strategy, called decoder diversity, that intends to take benefits from the diversity through collaborative decoding schemes.
Fichier principal
Vignette du fichier
Poulliat_2008_EURASIPJWCN.pdf (1.18 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00521063 , version 1 (26-09-2010)

Identifiers

  • HAL Id : hal-00521063 , version 1

Cite

Charly Poulliat, David Declercq, Thierry Lestable. Efficient Decoding of Turbo Codes with Nonbinary Belief Propagation. EURASIP Journal on Wireless Communications and Networking, 2008, 2008, Article ID 473613, 10 p. ⟨hal-00521063⟩
67 View
191 Download

Share

Gmail Facebook X LinkedIn More