Importance sampling for Tanner trees

IEEE Transactions on Information Theory

Volumn 51, Issue 6, 2005, Pages 2183-2189

  Xia, Bo ^a,b   Ryan, William E ^a  

^a University of Arizona   (United States)

^b INTEL CORPORATION   (United States)

Author keywords

Importance sampling; Low density parity check (LDPC) code; Message passing decoding; Tanner graph; Tanner tree

Indexed keywords

COMPUTER SIMULATION; DECODING; ERROR ANALYSIS; ESTIMATION; GRAPH THEORY; ITERATIVE METHODS; PROBABILITY; TREES (MATHEMATICS); WHITE NOISE;

IMPORTANCE SAMPLING; LOW DENSITY PARITY CHECK (LDPC) CODE; MESSAGE PASSING DECODING; TANNER GRAPH; TANNER TREE;

CODES (SYMBOLS);

EID: 20544442266     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2005.847748     Document Type: Article

References (13)

1. IEEE J. Select. Areas Commun. (Special Issue on Importance Sampling), vol. 11, no. 3, pp. 289-476, Apr. 1993.
2. J. Sadowsky, "A new method for Viterbi decoder simulation using importance sampling," IEEE Trans. Commun., vol. 38, no. 9, pp. 1341-1351, Sep. 1990.
3. M. Ferrari and S. Bellini, "Importance sampling simulation of concatenated block codes," Proc. IEE-Commun., vol. 147, pp. 245-251, Oct. 2000.
4. B. Xia and W. Ryan, "On importance sampling for linear block codes," in Proc. IEEE Int. Conf. Commun., Anchorage, AK, May 2003, pp. 2904-2908.
5. B. Xia and W. Ryan, "On importance sampling for low-density parity-check codes," IEEE Trans. Commun., submitted for publication.
6. R. Holzlohner et al., "Evaluation of the very low BER of FEC codes using dual adaptive importance sampling," IEEE Commun. Lett., vol. 9, no. 2, pp. 163-165, Feb. 2005.
7. J. Sadowsky and J. Bucklew, "On large deviation theory and asymptotically efficient Monte Carlo estimation," IEEE Trans. Inf. Theory, vol. 36, no. 3, pp. 579-588, May 1990.
8. R. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
9. T. Richardson and R. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001.
10. D. Lu and K. Yao, "Improved importance sampling technique for efficient simulation of digital communication systems," IEEE J. Select. Areas Commun., vol. 6, no. 1, pp. 67-75, Jan. 1988.
11. Y. Kou, S. Lin, and M. Fossorier, "Low-density parity-check codes based on finite geometries: A rediscovery and new results," IEEE Trans. Inf. Theory, vol. 47, no. 7, pp. 2711-2736, Nov. 2001.
12. T. Richardson, "Error floors of LDPC codes," in Proc. 41st Allerton Conf. on Communication, control and Computing, Monticello, IL, Oct. 2003, pp. 1426-1435.
13. D. MacKay and M. Postol, "Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check codes," in Proc. MFCSIT2002, Galway, ser. Electronic Notes in Theoretical Computer Science. Amsterdam, The Netherlands: Elsevier, 2003, vol. 74. [Online] Available at http://www.inference.phy.cam.ac.uk/mackay/abstracts/ margulis.html