By Topic

Gallager's decoding algorithm Α over high order modulations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
H. -K. Yang ; Dept. of Electron. & Electr. Eng., Pohang Univ. of Sci. & Technol. (POSTECH), Pohang ; M. -K. Lee ; K. Yang

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 2m-ary pulse-amplitude modulation (2m-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 2m-PAM in the AWGN channel.

Published in:

IEEE Communications Letters  (Volume:13 ,  Issue: 5 )