A Recursive Soft-Input Soft-Output Decoding Algorithm

被引:0
|
作者
Karakchieva, Liudmila [1 ]
Trifonov, Peter [1 ]
机构
[1] ITMO Univ, Dept Informat Technol & Programming, St Petersburg 197101, Russia
基金
俄罗斯科学基金会;
关键词
Complexity theory; Maximum likelihood decoding; Codes; Iterative decoding; Approximation algorithms; Symbols; Generators; SISO decoding; recursive trellises; optimal sectionalization; Log-Max approximation; CODES; MAP;
D O I
10.1109/TCOMM.2023.3334812
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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.
引用
收藏
页码:1290 / 1302
页数:13
相关论文
共 50 条