By Topic

Importance sampling for loop-free decoding trees with application to low-density parity-check codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
B. Xia ; Dept. of Electr. & Comput. Eng., Arizona Univ., Tucson, AZ, USA ; W. E. Ryan

An importance sampling scheme for the decoding of loop-free decoding trees is proposed. It is shown that this scheme is asymptotically efficient and that, for an arbitrary tree and a given estimation precision, the number of simulation runs needed is inversely proportional to the standard deviation of the channel noise. This work has its application to the decoding of low-density parity-check codes.

Published in:

Information Theory, 2003. Proceedings. IEEE International Symposium on

Date of Conference:

29 June-4 July 2003