Paper Info
Title
Low-Complexity Computational Units For The Local-Sova Decoding Algorithm
Abstract
Recently the Local-SOVA algorithm was suggested as an alternative to the max-Log MAP algorithm commonly used for decoding Turbo codes. In this work, we introduce new complexity reductions to the Local-SOVA algorithm, which allow an efficient implementation at a marginal BER penalty of 0.05 dB. Furthermore, we present the first hardware architectures for the computational units of the Local-SOVA algorithm, namely for the add-compare select unit and the soft output unit, targeting radix orders 2, 4 and 8. We provide place & route implementation results for 22nm technology and demonstrate an area reduction of 46 - 75% for the soft output unit for radix orders >= 4 in comparison with the respective max-Log MAP soft output unit. These area reductions compensate for the overhead in the add compare select unit, resulting in overall area saving of around 27 - 46% compared to the max-Log-MAP. These savings simplify the design and implementation of high throughput Turbo decoders.
Year
DOI
Venue
2020
10.1109/PIMRC48278.2020.9217318
2020 IEEE 31ST ANNUAL INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS (IEEE PIMRC)
Keywords
DocType
ISSN
Local-SOVA, Turbo codes, Soft-input soft-ouput decoding, Soft-ouput Viterbi algorithm, High-radix decoding
Conference
2166-9570
Citations 
PageRank 
References 
0
0.34
0
Authors
5
Name
Order
Citations
PageRank
Stefan Weithoffer112.72
Rami Klaimi200.34
Charbel Abdel Nour315223.78
Norbert Wehn41165137.17
Catherine Douillard594593.72