.png){kind=icon}
Return
Improved Random Redundant Iterative HDPC Decoding
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2009.07.070621.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
An iterative algorithm for soft-input soft-output (SISO) decoding of classical algebraic cyclic block codes is presented below. Inspired by other approaches for high performance belief propagation (BP) decoding, this algorithm requires up to 10 times less computational complexity than other methods that achieve similar performance. By utilizing multiple BP decoders, and using random permutation taken from the permutation group of the code, this algorithm reaches near maximum likelihood performance. A computational complexity comparison of the proposed algorithm versus other methods is presented as well. This includes complexity versus performance analysis, allowing one to trade between the former and the latter, according to ones needs.
Keywords:
Iterative decoding
soft-decision decoding
permutation group
message-passing algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W
Organization
Cited Papers
Redox Titration of All Electron Carriers of Cytochrome c Oxidase by Fourier Transform Infrared Spectroscopy.png)
Biochemistry
BiochemistryIF0
PREAI
ShareSaveShareSaveReduced complexity iterative decoding of low-density parity check codes based on belief propagation
PREAI
ShareSave no more
no more