Simplified Log-MAP Algorithm for Very Low-Complexity Turbo Decoder Hardware Architectures

Motivated by the importance of hardware implementation in practical turbo decoders, a simplified, yet effective, n-input max* approximation algorithm is proposed with the aim being its efficient implementation for very low-complexity turbo decoder hardware architectures. The simplification is obtain...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on instrumentation and measurement Ročník 63; číslo 3; s. 531 - 537
Hlavní autori: Martina, Maurizio, Papaharalabos, Stylianos, Mathiopoulos, P. Takis, Masera, Guido
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York IEEE 01.03.2014
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
Algorithms
Approximation methods
Architecture
Bit error rate
Codes
Complexity theory
Computer architecture
Decoders
Decoding
Delays
Digital circuit
Digital circuits
Expenses
Hardware
Instrumentation
logarithmic maximum a posteriori (Log-MAP)
Max-Log-MAP
Turbo codes
ISSN:0018-9456, 1557-9662
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Motivated by the importance of hardware implementation in practical turbo decoders, a simplified, yet effective, n-input max* approximation algorithm is proposed with the aim being its efficient implementation for very low-complexity turbo decoder hardware architectures. The simplification is obtained using an appropriate digital circuit for finding the first two maximum values in a set of n data that embeds the computation of a correction term. Various implementation results show that the proposed architecture is simpler by 30%, on average, than the constant logarithmic-maximum a posteriori (Log-MAP) one, in terms of chip area with the same delay. This comes at the expense of very small performance degradation, in the order of 0.1 dB for up to moderate bit error rates, e.g., 10 -5 , assuming binary turbo codes. However, when applying scaling to the extrinsic information, the proposed algorithm achieves almost identical Log-MAP turbo code performance for both binary and double-binary turbo codes, without increasing noticeably the implementation complexity.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:0018-9456
1557-9662
DOI:10.1109/TIM.2013.2281554