Abstract
Immediate generalization of Gallager's binary lowdensity parity-check (LDPC) codes gave birth to the LDPC codes over GF(q), which demonstrated error performance exceeding that of binary codes with compromised complexity. Various methods had been proposed for the decoder with an aim to simplifying the belief propagation algorithm. One of the algorithms was the "extended min-sum (EMS)" decoder which concerned only a limited number of incoming messages at the checks. In this paper, we propose a modification to further simplify the EMS decoder without sacrificing performance.
Original language | English |
---|---|
Title of host publication | Proceedings - 5th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2009 |
DOIs | |
Publication status | Published - 1 Dec 2009 |
Event | 5th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2009 - Beijing, China Duration: 24 Sept 2009 → 26 Sept 2009 |
Conference
Conference | 5th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2009 |
---|---|
Country/Territory | China |
City | Beijing |
Period | 24/09/09 → 26/09/09 |
ASJC Scopus subject areas
- Computer Networks and Communications
- Signal Processing
- Software
- Communication