A Recursive Soft-Input Soft-Output Decoding Algorithm

A reduced complexity symbolwise maximum a posteriori probability (MAP) decoding algorithm for linear block codes is presented. This algorithm is based on the recursive trellises and performs two passes over the recursion tree. Probability-domain and Log-Max implementations are considered. Numeric re...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on communications Ročník 72; číslo 3; s. 1
Hlavní autoři: Karakchieva, Liudmila, Trifonov, Peter
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.03.2024
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Approximation algorithms
Block codes
Codes
Complexity
Complexity theory
Decoding
Generators
Iterative decoding
Log-Max approximation
Maximum likelihood decoding
optimal sectionalization
recursive trellises
SISO decoding
Symbols
ISSN:0090-6778, 1558-0857
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:A reduced complexity symbolwise maximum a posteriori probability (MAP) decoding algorithm for linear block codes is presented. This algorithm is based on the recursive trellises and performs two passes over the recursion tree. Probability-domain and Log-Max implementations are considered. Numeric results show that the proposed method has lower complexity compared to other known recursive algorithms and the classical BCJR algorithm. The complexity analysis for random codes is provided.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2023.3334812