Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation
From MaRDI portal
Publication:4544512
DOI10.1109/18.910580zbMath0998.94503OpenAlexW2109489513MaRDI QIDQ4544512
Sae-Young Chung, Ruediger Urbanke, Thomas J. Richardson
Publication date: 4 August 2002
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/08c23fd7c0e96cb50b0fabe3c2203be4b188d465
fixed pointscapacitythresholdlow-density parity-check codesGaussian approximationdensity evolutionsum-product decoding algorithm
Related Items (9)
LDPC code design for nonuniform power-line channels ⋮ STUDY OF BIFURCATION BEHAVIOR OF LDPC DECODERS ⋮ A fast BER evaluation method for LDGM codes ⋮ Construction of LDPC convolutional codes via difference triangle sets ⋮ An improved multidimensional reconciliation algorithm for continuous-variable quantum key distribution ⋮ A new method for performance evaluation of bit decoding algorithms using statistics of the log likelihood ratio ⋮ Codes on graphs: Recent progress ⋮ An Improved Rao–Nam Cryptosystem Based on Fractional Order Hyperchaotic System and EDF–QC–LDPC ⋮ Successive cancellation decoding of Reed-Solomon codes
Uses Software
This page was built for publication: Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation
