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

Analysis of decoding error probability for finite length LDPC codes

隆之 野崎

Published Jan 1, 2012• 0 citations
OpenAlex

Related papers

Analysis of decoding error probability for finite length LDPC codes ; 有限長の低密度パリティ検査符号の復号誤り率の解析

T. Nozaki, Takayuki Nozaki

•Jan 1, 2016•0 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

On the block error probability of iteratively decoded LDPC codes

Michael Lentmaier, Dmitri V. Truhachev, Daniel J. Costello +1 more

•Jan 1, 2004•6 citations

Finite-Length Analysis for Spatially Coupled LDPC Codes Based on Base Matrix

Yang Liu, Sha Sun, Yuzhi Zhang +1 more

Spatially coupled low density parity check (SC-LDPC) are prominent candidates for future communication standards due to their "threshold saturation" properties. To evaluate the finite-length performance of SC-LDPC codes, a general and efficient finite-length analysis from the perspective of the base matrix is proposed. We analyze the evolution of the residual graphs resulting at each iteration during the decoding process based on the base matrix and then derive the expression for the error probability. To verify the effectiveness of the proposed finite-length analysis, we consider the SC-LDPC code ensembles constructed by parallelly connecting multiple chains (PC-MSC-LDPC). The analysis results show that the predicted error probabilities obtained by using the derived expression for the error probability match the simulated error probabilities. The proposed finite-length analysis provides a useful engineering tool for practical SC-LDPC code design and for analyzing the effects of the code parameters on the performances.

Entropy•Jul 11, 2023•0 citations

Iterative decoding of LDPC codes: some bounds and properties

David Burshtein, Gadi Miller

Physica A Statistical Mechanics and its Applications•Dec 1, 2001•0 citations

Low-complexity Finite-Precision Decoders for LDPC Codes

Shiva Kumar Planjery, Bane V. Vasic, David Declercq +1 more

•Oct 1, 2010•0 citations
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.
Spatially coupled low density parity check (SC-LDPC) are prominent candidates for future communication standards due to their "threshold saturation" properties. To evaluate the finite-length performance of SC-LDPC codes, a general and efficient finite-length analysis from the perspective of the base matrix is proposed. We analyze the evolution of the residual graphs resulting at each iteration during the decoding process based on the base matrix and then derive the expression for the error probability. To verify the effectiveness of the proposed finite-length analysis, we consider the SC-LDPC code ensembles constructed by parallelly connecting multiple chains (PC-MSC-LDPC). The analysis results show that the predicted error probabilities obtained by using the derived expression for the error probability match the simulated error probabilities. The proposed finite-length analysis provides a useful engineering tool for practical SC-LDPC code design and for analyzing the effects of the code parameters on the performances.