logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Gallager's Decoding Algorithm A over High Order Modulations

delete2009-05-01
delete0
PRE
AI
H
Hyun-Koo Yang *
M
Myung-Kyu Lee
Y
Yang, Kyeongeheol
DOI：10.1109/LCOMM.2009.090070delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
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

Journal

IEEE Communications Letters cover
IEEE Communications Letters
IF:
4.4
Papers:
1.3W
Citations:
2.2W

Organization

No organization information available