Performance Bound for Finite-Length LDPC Coded Modulation

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

doi:10.1093/ietfec/e90-a.12.2975

Performance Bound for Finite-Length LDPC Coded Modulation

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

Full Text Views

0

Share
Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E90-A No.12 pp.2975-2978

Publication Date: 2007/12/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1093/ietfec/e90-a.12.2975

Type of Manuscript: LETTER

Category: Communication Theory and Signals

Cite this

Copy

Huy G. VU, Ha H. NGUYEN, David E. DODDS, "Performance Bound for Finite-Length LDPC Coded Modulation" in IEICE TRANSACTIONS on Fundamentals, vol. E90-A, no. 12, pp. 2975-2978, December 2007, doi: 10.1093/ietfec/e90-a.12.2975.
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.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e90-a.12.2975/_p

Copy

@ARTICLE{e90-a_12_2975,
author={Huy G. VU, Ha H. NGUYEN, David E. DODDS, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Performance Bound for Finite-Length LDPC Coded Modulation},
year={2007},
volume={E90-A},
number={12},
pages={2975-2978},
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.},
keywords={},
doi={10.1093/ietfec/e90-a.12.2975},
ISSN={1745-1337},
month={December},}

Copy

TY - JOUR
TI - Performance Bound for Finite-Length LDPC Coded Modulation
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2975
EP - 2978
AU - Huy G. VU
AU - Ha H. NGUYEN
AU - David E. DODDS
PY - 2007
DO - 10.1093/ietfec/e90-a.12.2975
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E90-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2007
AB - 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.
ER -