An efficient pseudo-codeword search algorithm for Belief Propagation decoding of LDPC codes

@article{Kakakhail2009AnEP,
  title={An efficient pseudo-codeword search algorithm for Belief Propagation decoding of LDPC codes},
  author={Shahkar Kakakhail and Sylvain Reynal and David Declercq and Vincent Heinrich},
  journal={2009 International Conference on Ultra Modern Telecommunications & Workshops},
  year={2009},
  pages={1-5}
}
We introduce the use of Fast Flat Histogram (FFH) method employing Wang Landau Algorithm in an adaptive noise sampling framework using Random Walk to find out the pseudo-codewords and consequently the pseudo-weights for the Belief Propagation (BP) decoding of LDPC codes over an Additive White Gaussian Noise (AWGN) channel. The FFH method enables us to tease out pseudo-codewords at very high Signal-to-Noise Ratios (SNRs) exploring the error floor region of a wide range of codes varying in length… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 33 REFERENCES

Codes and Decoding on General Graphs

VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

Fast flat-histogram method for generalized spin models.

  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2005
VIEW 11 EXCERPTS

Pseudo-codeword Landscape

  • 2007 IEEE International Symposium on Information Theory
  • 2007
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Introduction to Monte Carlo algorithms.

VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Efficient performance evaluation of Forward Error Correcting codes

  • 2008 11th IEEE Singapore International Conference on Communication Systems
  • 2008
VIEW 3 EXCERPTS