Gallager's Decoding Algorithm A over High Order Modulations
SCIE
SCOPUS
- Title
- Gallager's Decoding Algorithm A over High Order Modulations
- Authors
- Yang, HK; Lee, MK; Yang, K
- Date Issued
- 2009-05
- Publisher
- IEEE-INST ELECTRICAL ELECTRONICS ENGI
- Abstract
- Gallager's decoding algorithm A (GDA) for low-density parity-check (LDPC) codes is of interest mainly due to its good performance with extremely low complexity. In this paper, we analyze GDA over 2(m)-ary pulse-amplitude modulation (2(m)-PAM). Firstly, we represent its average error probability by means of a recursion formula. We then define its threshold for additive white Gaussian noise (AWGN) channels and derive its stability condition. The bit-to-symbol mapping strategies have a strong influence on the performance of LDPC-coded modulation systems. Finally, we show that the bit-reliability mapping strategy proposed by Li and Ryan maximizes the threshold of the LDPC-coded modulation system with GDA over Gray-mapped 2(m)-PAM in the AWGN channel.
- Keywords
- Density evolution; Gallager' s decoding algorithm A; low-density parity-check (LDPC) codes; LDPC-coded modulation; optimal bit-to-symbol mapping; PARITY-CHECK CODES; DESIGN
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/28589
- DOI
- 10.1109/LCOMM.2009.090070
- ISSN
- 1089-7798
- Article Type
- Article
- Citation
- IEEE COMMUNICATIONS LETTERS, vol. 13, no. 5, page. 336 - 338, 2009-05
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.