On optimal and near-optimal turbo decoding using generalized max operator

Motivated by a recently published robust geometric programming approximation, a generalized approach for approximating efficiently the max* operator is presented. Using this approach, the max* operator is approximated by means of a generic and yet very simple max operator, instead of using additiona...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE communications letters Jg. 13; H. 7; S. 522 - 524
Hauptverfasser: Papaharalabos, S., Mathiopoulos, P., Masera, G., Martina, M.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York, NY IEEE 01.07.2009
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Algorithms
Applied sciences
Approximation
Approximation algorithms
Bit error rate
Coding, codes
Decoding
Degradation
Exact sciences and technology
Hardware
Information, signal and communications theory
Iterative algorithms
Iterative decoding
Mathematical analysis
Operators
Optimization
Piecewise linear approximation
Piecewise linear techniques
Programming
Robustness
Signal and communications theory
Telecommunications and information theory
Turbo codes
Performance evaluation
Approximate method
Bit error rate
Programming
Turbo code
Algorithm
Iterative decoding
Implementation
Geometrical model
Algorithm complexity
A posteriori estimation
Turbo codes
Circuit synthesis
Piecewise linearization
ISSN:1089-7798, 1558-2558
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Motivated by a recently published robust geometric programming approximation, a generalized approach for approximating efficiently the max* operator is presented. Using this approach, the max* operator is approximated by means of a generic and yet very simple max operator, instead of using additional correction term as previous approximation methods require. Following that, several turbo decoding algorithms are obtained with optimal and near-optimal bit error rate (BER) performance depending on a single parameter, namely the number of piecewise linear (PWL) approximation terms. It turns out that the known max-log-MAP algorithm can be viewed as special case of this new generalized approach. Furthermore, the decoding complexity of the most popular previously published methods is estimated, for the first time, in a unified way by hardware synthesis results, showing the practical implementation advantages of the proposed approximations against these methods.
Bibliographie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2009.090537