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

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on communications Vol. 72; no. 3; p. 1
Main Authors Karakchieva, Liudmila, Trifonov, Peter
Format Journal Article
LanguageEnglish
Published New York IEEE 01.03.2024
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
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
Online AccessGet full text
ISSN0090-6778
1558-0857
DOI10.1109/TCOMM.2023.3334812

Cover

More Information
Summary: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.
Bibliography: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