Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Access

Finite Length Analysis of Low-Density Parity-Check Codes on Impulsive Noise Channels

Zhen Mei, Martin Johnston, Stephane Le Goff, Li Chen

Published Jan 1, 2016• 9 citations
Publisher

Abstract

Low-density parity-check (LDPC) codes with very long block lengths are well known for their powerful error correction, but it is not always desirable to employ long codes in communication systems, where latency is a serious issue, such as voice and video communication between multiple users. Finite length analyses of LDPC codes have already been presented in the literature for the additive white Gaussian noise channel, but in this paper, we consider the finite length analysis of LDPC codes for channels that exhibit impulsive noise. First, an exact uncoded bit error probability (BEP) of an impulsive noise channel, modeled as a symmetric α-stable (SαS) distribution, is derived. Then, to obtain the LDPC-coded performance, density evolution is applied to evaluate the asymptotic performance of LDPC codes on SαS channels and determine the threshold signal-to-noise ratio. Finally, we derive closed-form expressions for the BEP and block error probability of short LDPC codes on these channels, which are shown to match closely with simulated results on channels with different levels of impulsiveness, even for block lengths as low as 1000 b.

DOI
10.1109/access.2017.2649571

Related papers

Study of short-length low-density-parity-check codes

Xia Zheng

Low-density parity-check (LDPC) codes can be applied to many different types of communication systems such as video broadcasting and satellite communications. However, the performance of the codes in practice may deviate a lot from the theoretical limits, achievable only by codes with infinite length. In this thesis, we will conduct a detailed investigation on the performance of short-length LDPC codes over additive white Gaussian noise (AWGN) channels. First, we look into the rich dynamical behavior occurring at the LDPC decoders when the LDPC code has a finite length. We will report the various types of bifurcation phenomena as the signal-to-noise ratio (SNR) increases. By linearizing the iterative equations used for decoding the signals, we are able to evaluate the eigenvalues corresponding to the fixed points. Based on the eigenvalues, we can further characterize the properties of the fixed points. In addition, we make use of a simple feedback technique in an attempt to improving the convergence rate of the decoder at the waterfall (medium-SNR) region. Then, we attempt to "optimize" the distributions of the variable-node degrees and check-node degrees such that lower error rates can be produced. Although some "optimized" variable-node and check-node degree distributions have already been reported in the literature, they are found based on the assumption that the LDPC codes having an infinite length. Therefore, the error performance of a finite-length LDPC code obeying such degree distributions may not be "optimized" and there are possibilities that codes following other degree distributions may produce better performance in terms of block/bit error rates (BLERs/BERs). Since the LDPC decoders rely on passing messages iteratively between the set of variable nodes and the set of check nodes, decreasing the short average path length (APL) will no doubt accelerate the exchange of messages among the variable nodes, thereby reducing the number of iterations the decoder algorithm takes to converge. Inspired by the short average path length (APL) between nodes in complex networks with scale-free (SF) degree distributions, we make the first attempt in applying complex-network theories to communications engineering and build short-length LDPC codes with variable-node degrees following SF degree distributions. Not only have we evaluated the theoretical performance of our SF-LDPC codes, but also the simulated error rates. Furthermore, we compare our results with those of other well-known LDPC codes.

•Jan 1, 2009•0 citations

A non-linear LLR approximation for LDPC decoding over impulsive noise channels

Yi Hou, Rongke Liu, Ling Zhao

The performance of Low-Density Parity-Check codes over symmetric alpha-stable impulsive noise channels is considered in this paper. Due to the lack of closed-form expressions for the probability density functions of almost all the alpha-stable distributions, an efficient non-linear approximation method for channel log-likelihood ratio is presented to achieve high decoding performance covering the range of characteristic exponent from 1 to 2 and avoid the use of complicated numerical integrations. The simulations for both long and short codes show that the parameter selection of the proposed method is not sensitive to the noise level. Even fixed parameter setting for the proposed non-linear approximation can obtain a satisfying decoding performance.

IEEE/CIC International Conference on Communications in China (ICCC)•Oct 1, 2014•10 citations

An Efficient Analysis of Finite-Length LDPC Codes

R. Yazdani, Masoud Ardakani

An efficient method for finite-length low-density parity-check (LDPC) code analysis is proposed. This method is based on studying the channel variations when observed during a finite-length codeword. To this end, channel parameters are interpreted as random variables and their distributions are found. Assuming that a decoding failure is the result of an observed channel worse than the code's decoding threshold, the block error probability of finite-length LDPC codes is estimated. Using an extrinsic information transfer chart analysis, bit error probability is obtained from the block error probability. Our results suggest that by considering only the channel variations around its expected behavior and even ignoring the effects of cycles, one can closely predict the performance of LDPC codes of a few thousand bits or longer in the waterfall region.

International Conference on Communications•Jun 1, 2007•8 citations

Waterfall Performance Analysis of Finite-Length LDPC Codes on Symmetric Channels

Raman Yazdani, Masoud Ardakani

An efficient method for analyzing the performance of finite-length low-density parity-check (LDPC) codes in the waterfall region, when transmission takes place on a memoryless binary-input output-symmetric channel is proposed. This method is based on studying the variations of the channel quality around its expected value when observed during the transmission of a finite-length codeword. We model these variations with a single parameter. This parameter is then viewed as a random variable and its probability distribution function is obtained. Assuming that a decoding failure is the result of an observed channel worse than the codeiquests decoding threshold, the block error probability of finite-length LDPC codes under different decoding algorithms is estimated. Using an extrinsic information transfer chart analysis, the bit error probability is obtained from the block error probability. Different parameters can be used for modeling the channel variations. In this work, two of such parameters are studied. Through examples, it is shown that this method can closely predict the performance of LDPC codes of a few thousand bits or longer in the waterfall region.

IEEE Transactions on Communications•Nov 1, 2009•24 citations

Robust Low Density Parity Check Decoding over Markov Gaussian Channels

Der‐Feng Tseng, Shi-Shun Lin

Communications systems suffer from impulsive in- terference, generally modeled as a memory channel to account for the inherent bursts of impulse even though conventional receivers take into account the additive white Gaussian noise only. In this paper, finite- field based constructions of Low Density Parity Check (LDPC) coding over the Markov Gaussian channel are investigated. In contrast with existing approaches assuming the impulse noise statistics, this paper proposes a modified maximum- a-priori method, which forfeits using the statistical knowledge of impulse, to estimate whether or not each transmitted symbol is corrupted by impulse noise. Subsequently, the sum-product algorithm LDPC decoder invokes a clipper to diminish impulsive interference when the channel state is identified to be impulse- corrupted. The bit error rate (BER) performance versus the signal-to-noise ratio for the proposed decoder is conducted using computer simulation. The experimental results in terms of the BER performance justified the robustness of our proposed receiver and also revealed its competitiveness with the optimal benchmark decoder in the hostile environment. Moreover, using the proposed receiver, our calibrated quasi-cyclic LDPC code is shown to slightly outperform its 5G New Radio counterpart under certain circumstances.

IEEE Vehicular Technology Conference•Apr 1, 2019•2 citations

The Asymptotic Bit Error Probability of LDPC Codes for the Binary Erasure Channel with Finite Iteration Number

Ryuhei Mori, Kenta Kasai, Tomoharu Shibuya +1 more

We consider communication over the binary erasure channel (BEC) using low-density parity-check (LDPC) code and belief propagation (BP) decoding. The bit error probability for infinite block length is known by density evolution and it is well known that a difference between the bit error probability at finite iteration number for finite block length $n$ and for infinite block length is asymptotically $α/n$, where $α$ is a specific constant depending on the degree distribution, the iteration number and the erasure probability. Our main result is to derive an efficient algorithm for calculating $α$ for regular ensembles. The approximation using $α$ is accurate for $(2,r)$-regular ensembles even in small block length.

arXiv:0801.0931•Jan 7, 2008•0 citations
Low-density parity-check (LDPC) codes with very long block lengths are well known for their powerful error correction, but it is not always desirable to employ long codes in communication systems, where latency is a serious issue, such as voice and video communication between multiple users. Finite length analyses of LDPC codes have already been presented in the literature for the additive white Gaussian noise channel, but in this paper, we consider the finite length analysis of LDPC codes for channels that exhibit impulsive noise. First, an exact uncoded bit error probability (BEP) of an impulsive noise channel, modeled as a symmetric α-stable (SαS) distribution, is derived. Then, to obtain the LDPC-coded performance, density evolution is applied to evaluate the asymptotic performance of LDPC codes on SαS channels and determine the threshold signal-to-noise ratio. Finally, we derive closed-form expressions for the BEP and block error probability of short LDPC codes on these channels, which are shown to match closely with simulated results on channels with different levels of impulsiveness, even for block lengths as low as 1000 b.
Low-density parity-check (LDPC) codes can be applied to many different types of communication systems such as video broadcasting and satellite communications. However, the performance of the codes in practice may deviate a lot from the theoretical limits, achievable only by codes with infinite length. In this thesis, we will conduct a detailed investigation on the performance of short-length LDPC codes over additive white Gaussian noise (AWGN) channels. First, we look into the rich dynamical behavior occurring at the LDPC decoders when the LDPC code has a finite length. We will report the various types of bifurcation phenomena as the signal-to-noise ratio (SNR) increases. By linearizing the iterative equations used for decoding the signals, we are able to evaluate the eigenvalues corresponding to the fixed points. Based on the eigenvalues, we can further characterize the properties of the fixed points. In addition, we make use of a simple feedback technique in an attempt to improving the convergence rate of the decoder at the waterfall (medium-SNR) region. Then, we attempt to "optimize" the distributions of the variable-node degrees and check-node degrees such that lower error rates can be produced. Although some "optimized" variable-node and check-node degree distributions have already been reported in the literature, they are found based on the assumption that the LDPC codes having an infinite length. Therefore, the error performance of a finite-length LDPC code obeying such degree distributions may not be "optimized" and there are possibilities that codes following other degree distributions may produce better performance in terms of block/bit error rates (BLERs/BERs). Since the LDPC decoders rely on passing messages iteratively between the set of variable nodes and the set of check nodes, decreasing the short average path length (APL) will no doubt accelerate the exchange of messages among the variable nodes, thereby reducing the number of iterations the decoder algorithm takes to converge. Inspired by the short average path length (APL) between nodes in complex networks with scale-free (SF) degree distributions, we make the first attempt in applying complex-network theories to communications engineering and build short-length LDPC codes with variable-node degrees following SF degree distributions. Not only have we evaluated the theoretical performance of our SF-LDPC codes, but also the simulated error rates. Furthermore, we compare our results with those of other well-known LDPC codes.
The performance of Low-Density Parity-Check codes over symmetric alpha-stable impulsive noise channels is considered in this paper. Due to the lack of closed-form expressions for the probability density functions of almost all the alpha-stable distributions, an efficient non-linear approximation method for channel log-likelihood ratio is presented to achieve high decoding performance covering the range of characteristic exponent from 1 to 2 and avoid the use of complicated numerical integrations. The simulations for both long and short codes show that the parameter selection of the proposed method is not sensitive to the noise level. Even fixed parameter setting for the proposed non-linear approximation can obtain a satisfying decoding performance.
An efficient method for finite-length low-density parity-check (LDPC) code analysis is proposed. This method is based on studying the channel variations when observed during a finite-length codeword. To this end, channel parameters are interpreted as random variables and their distributions are found. Assuming that a decoding failure is the result of an observed channel worse than the code's decoding threshold, the block error probability of finite-length LDPC codes is estimated. Using an extrinsic information transfer chart analysis, bit error probability is obtained from the block error probability. Our results suggest that by considering only the channel variations around its expected behavior and even ignoring the effects of cycles, one can closely predict the performance of LDPC codes of a few thousand bits or longer in the waterfall region.
An efficient method for analyzing the performance of finite-length low-density parity-check (LDPC) codes in the waterfall region, when transmission takes place on a memoryless binary-input output-symmetric channel is proposed. This method is based on studying the variations of the channel quality around its expected value when observed during the transmission of a finite-length codeword. We model these variations with a single parameter. This parameter is then viewed as a random variable and its probability distribution function is obtained. Assuming that a decoding failure is the result of an observed channel worse than the codeiquests decoding threshold, the block error probability of finite-length LDPC codes under different decoding algorithms is estimated. Using an extrinsic information transfer chart analysis, the bit error probability is obtained from the block error probability. Different parameters can be used for modeling the channel variations. In this work, two of such parameters are studied. Through examples, it is shown that this method can closely predict the performance of LDPC codes of a few thousand bits or longer in the waterfall region.
Communications systems suffer from impulsive in- terference, generally modeled as a memory channel to account for the inherent bursts of impulse even though conventional receivers take into account the additive white Gaussian noise only. In this paper, finite- field based constructions of Low Density Parity Check (LDPC) coding over the Markov Gaussian channel are investigated. In contrast with existing approaches assuming the impulse noise statistics, this paper proposes a modified maximum- a-priori method, which forfeits using the statistical knowledge of impulse, to estimate whether or not each transmitted symbol is corrupted by impulse noise. Subsequently, the sum-product algorithm LDPC decoder invokes a clipper to diminish impulsive interference when the channel state is identified to be impulse- corrupted. The bit error rate (BER) performance versus the signal-to-noise ratio for the proposed decoder is conducted using computer simulation. The experimental results in terms of the BER performance justified the robustness of our proposed receiver and also revealed its competitiveness with the optimal benchmark decoder in the hostile environment. Moreover, using the proposed receiver, our calibrated quasi-cyclic LDPC code is shown to slightly outperform its 5G New Radio counterpart under certain circumstances.
We consider communication over the binary erasure channel (BEC) using low-density parity-check (LDPC) code and belief propagation (BP) decoding. The bit error probability for infinite block length is known by density evolution and it is well known that a difference between the bit error probability at finite iteration number for finite block length nnn and for infinite block length is asymptotically α/nα/nα/n, where ααα is a specific constant depending on the degree distribution, the iteration number and the erasure probability. Our main result is to derive an efficient algorithm for calculating ααα for regular ensembles. The approximation using ααα is accurate for (2,r)(2,r)(2,r)-regular ensembles even in small block length.