.png){kind=icon}
.png){kind=icon}
Return
A Recursive Soft-Input Soft-Output Decoding Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2023.3334812.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Complexity theory
Maximum likelihood decoding
Codes
Iterative decoding
Approximation algorithms
Symbols
Generators
SISO decoding
recursive trellises
optimal sectionalization
Log-Max approximation
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W