A low-complexity algorithm for decoding of M-ary LDPC codes

Autor:	Haoshan Shi, Guanghua He, Baomao Pang
Rok vydání:	2012
Předmět:	Average-case complexity Computational complexity theory Berlekamp–Welch algorithm Worst-case complexity List decoding Data_CODINGANDINFORMATIONTHEORY Sequential decoding Low-density parity-check code Algorithm Decoding methods Computer Science::Information Theory Mathematics
Zdroj:	2012 IEEE Symposium on Electrical & Electronics Engineering (EEESYM).
DOI:	10.1109/eeesym.2012.6258660
Popis:	M-ary LDPC codes provide higher performances than their binary counterpart but suffer from highest decoding complexity. The use of stochastic decoding algorithm can reduce the decoding complexity, but the computational complexity of probability generation is very high. A simple method to fast generate the probability especially in high-order modulation schemes is proposed in this paper. Simulation results show the proposed algorithm causes negligible performance degradation with reduction in computational complexity, which gives some advantages in hardware implementation of the decoders.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::1d3d9110451f065d6b7b82286766a7ad https://doi.org/10.1109/eeesym.2012.6258660 Zobrazit plný text záznamu