Importance sampling for tanner trees

Authors:
B. Xia;W. E. Ryan
Affiliations:
Dept. of Electr. & Comput. Eng., Univ. of Arizona, Tucson, AZ, USA;-
Venue:
IEEE Transactions on Information Theory
Year:
2005

Citing 0
Cited 1

Predicting error floors of structured LDPC codes: deterministic bounds and estimates

IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes

Quantified Score

Hi-index	754.84

Visualization

Abstract

This correspondence presents an importance sampling (IS) simulation scheme for the soft iterative decoding on loop-free multiple-layer trees. It is shown that this scheme is asymptotically efficient in that, for an arbitrary tree and a given estimation precision, the required number of samples is inversely proportional to the noise standard deviation. This work has its application in the simulation of low-density parity-check (LDPC) codes.