Simplified recursion units for Max-Log-MAP: New trade-offs through variants of Local-SOVA - Archive ouverte HAL Access content directly
Conference Papers Year :

Simplified recursion units for Max-Log-MAP: New trade-offs through variants of Local-SOVA

(1, 2) , (1, 3) , (1, 2) , (1, 2)
1
2
3

Abstract

The Log-domain BCJR algorithm is broadly used in iterative decoding processes. However, the serial nature of the recursive state metric calculations is a limiting factor for throughput increase. A possible solution resorts to high-radix decoding, which involves decoding several successive symbols at once. Despite several studies aiming at reducing its complexity, high-radix processing remains the most computationally intensive part of the decoder when targeting very high throughput. In this work, we propose a reformulation specifically targeting the complexity reduction of the recursive calculation units by either limiting the required number of operations or by selectively removing unnecessary ones. We report a complexity reduction of the add-compare-select units in the order of 50% compared to the recently proposed local-SOVA algorithm. In addition, our results show that several performance/complexity trade-offs can be achieved thanks to the proposed simplified variants. This represents a promising step forward in order to implement efficient very high throughput convolutional decoders.
Fichier principal
Vignette du fichier
Low_complexity_ACS_and_DS_LSOVA_Final.pdf (758.42 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03279583 , version 1 (06-07-2021)

Identifiers

Cite

Rami Klaimi, Stefan Weithoffer, Charbel Abdel Nour, Catherine Douillard. Simplified recursion units for Max-Log-MAP: New trade-offs through variants of Local-SOVA. ISTC 2021: 11th International Symposium on Topics in Coding, Aug 2021, Montreal, Canada. ⟨10.1109/ISTC49272.2021.9594265⟩. ⟨hal-03279583⟩
83 View
65 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More