Performance Bound for Finite-Length LDPC Coded Modulation

Huy G. VU  Ha H. NGUYEN  David E. DODDS  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E90-A   No.12   pp.2975-2978
Publication Date: 2007/12/01
Online ISSN: 1745-1337
DOI: 10.1093/ietfec/e90-a.12.2975
Print ISSN: 0916-8508
Type of Manuscript: LETTER
Category: Communication Theory and Signals
LDPC codes,  performance bound,  coded modulation,  

Full Text: PDF>>
Buy this Article

Coded modulation systems based on low density parity check (LDPC) codes of finite lengths are considered. The union bounds on the bit error probabilities of the maximum likelihood (ML) decoding are presented for both additive white Gaussian noise (AWGN) and flat Rayleigh fading channels. The tightness of the derived bound is verified by simulating the ML decoding of a very short LDPC code. For medium-length codes, performance of the sum-product decoding can asymptotically approach the bounds.