Performance Bound for Finite-Length LDPC Coded Modulation

  • Authors:

  • Huy G. Vu;Ha H. Nguyen;David E. Dodds

  • Affiliations:

  • -;-;-

  • Venue:
  • IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.