.png){kind=icon}
Return
A Parallel Belief Propagation Decoding Algorithm for Rate Compatible Modulation
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2017.2692762.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This letter proposes a parallel belief propagation algorithm for fast iterative decoding of rate compatible modulation. In this proposed algorithm, the processing at symbol node is partitioned into several low complexity sub-processors. All sub-processors have similar structures and work in parallel without cross connections among them. Numerical and simulation results show that proper partition results in significant reduction of the computational complexity without decoding performance degradation.
Keywords:
Rate compatible modulation
belief propagation
parallel decoding
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave no more
no more