.png){kind=icon}
.png){kind=icon}
Return
A Simplified Min-Sum Decoding Algorithm for Non-Binary LDPC Codes
.png){kind=icon}
OA
AI
DOI：10.1109/TCOMM.2012.101712.110709.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Non-binary low-density parity-check codes are robust to various channel impairments. However, based on the existing decoding algorithms, the decoder implementations are expensive because of their excessive computational complexity and memory usage. Based on the combinatorial optimization, we present an approximation method for the check node processing. The simulation results demonstrate that our scheme has small performance loss over the additive white Gaussian noise channel and independent Rayleigh fading channel. Furthermore, the proposed reduced-complexity realization provides significant savings on hardware, so it yields a good performance-complexity tradeoff and can be efficiently implemented.
Keywords:
Low-density parity-check (LDPC) codes
non-binary codes
iterative decoding
extended min-sum algorithm
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W