UPDATE: Zenodo migration postponed to Oct 13 from 06:00-08:00 UTC. Read the announcement.

Conference paper Open Access

Low-complexity Computational Units for the Local-SOVA Decoding Algorithm

Weithoffer, S.; Klaimi, R.; Nour, C.; Wehn, N.; Douillard, C.

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 28nm 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.

Files (359.8 kB)
Name Size
359.8 kB Download
All versions This version
Views 8080
Downloads 7474
Data volume 26.6 MB26.6 MB
Unique views 7272
Unique downloads 7373


Cite as