DocumentCode
2002479
Title
Importance sampling for loop-free decoding trees with application to low-density parity-check codes
Author
Xia, Bo ; Ryan, William E.
Author_Institution
Dept. of Electr. & Comput. Eng., Arizona Univ., Tucson, AZ, USA
fYear
2003
fDate
29 June-4 July 2003
Firstpage
120
Abstract
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.
Keywords
decoding; importance sampling; noise; parity check codes; trees (mathematics); arbitrary tree; channel noise; importance sampling scheme; loop-free decoding tree; low-density parity-check code; Application software; Approximation algorithms; Decoding; Digital communication; Monte Carlo methods; Parity check codes; Signal to noise ratio;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2003. Proceedings. IEEE International Symposium on
Print_ISBN
0-7803-7728-1
Type
conf
DOI
10.1109/ISIT.2003.1228134
Filename
1228134
Link To Document