Non-sequential decoding algorithm for hard iterative turbo product codes - [transactions letters]

In this letter, we propose a new decoding algorithm to improve the bit error rate performance of the hard-input hard-output (HIHO) turbo product codes (TPC) with hard iterative decoding. The proposed algorithm iteratively, but not sequentially, decodes the received TPC blocks based on the reliabilit...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on communications Jg. 57; H. 6; S. 1545 - 1549
Hauptverfasser: Al-dweik, A.J., Sharif, B.S.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York, NY IEEE 01.06.2009
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Applied sciences
Arithmetic
AWGN
Bit error rate
Bit rate
Coding, codes
Exact sciences and technology
Gain
hard decision decoding
Information, signal and communications theory
Iterative algorithms
Iterative decoding
Product codes
Quantization
Signal and communications theory
Telecommunications and information theory
TPC
Turbo block codes
Turbo codes
Block code
Bit error rate
TPC
Iterative method
Turbo code
Algorithm
Sequential decoding
Iterative decoding
Implementation
Simulation
Coding
Sequential method
hard decision decoding
Turbo block codes
ISSN:0090-6778, 1558-0857
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this letter, we propose a new decoding algorithm to improve the bit error rate performance of the hard-input hard-output (HIHO) turbo product codes (TPC) with hard iterative decoding. The proposed algorithm iteratively, but not sequentially, decodes the received TPC blocks based on the reliability of the constituent codes. Simulation results confirm a noticeable coding gain improvement using the proposed decoding process with respect to standard HIHO TPC decoding. An efficient implementation of the new technique offers a negligible additional complexity when the channel-bit error probability is less than 10 -2 .
Bibliographie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2009.06.070010