A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Performance Bound for Finite-Length LDPC Coded Modulation
2007
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences
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 mediumlength codes, performance of the sum-product decoding can asymptotically approach the bounds.
doi:10.1093/ietfec/e90-a.12.2975
fatcat:i2noafrpgrcc7by2bzuqdek2ue