Performance Analysis of Finite-Length LDPC Codes Over Asymmetric Memoryless Channels

In this paper, we analyze the waterfall performance of finite-length low-density parity-check (LDPC) codes for asymmetric memoryless channels by considering variations of channel parameters: the observed bit error rate P obs and mutual information I obs during the real-time transmission. Moreover, w...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on vehicular technology Vol. 68; no. 11; pp. 11338 - 11342
Main Authors Mei, Zhen, Cai, Kui, Song, Guanghui
Format Journal Article
LanguageEnglish
Published New York IEEE 01.11.2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
asymmetric channels
Asymmetry
Binary system
Bit error rate
Channel estimation
Channels
Codes
Curve fitting
density evolution
Error correcting codes
Estimation
finite-length analysis
LDPC codes
Low density parity check codes
Memoryless systems
Mutual information
Parameters
Parity check codes
Real-time systems
Waterfalls
Zinc
Online AccessGet full text

Cover

More Information
Summary:In this paper, we analyze the waterfall performance of finite-length low-density parity-check (LDPC) codes for asymmetric memoryless channels by considering variations of channel parameters: the observed bit error rate P obs and mutual information I obs during the real-time transmission. Moreover, we propose to use the variation of a new channel parameter: the maximal achievable channel coding rate Robs at finite blocklengths to estimate the waterfall performance. Simulation results demonstrate that our estimations can well predict the waterfall performance of LDPC codes. In particular, the estimation based on R obs can fit the waterfall performance for various code lengths. For estimations based on P obs and I obs , their accuracy increases as the codeword length increases and no curve fitting is required.
ISSN:0018-9545
1939-9359
DOI:10.1109/TVT.2019.2944139