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

被引：0

作者：

Bo, X ^{[1
]}

Ryan, WE ^{[1
]}

机构：

[1] Univ Arizona, Dept Elect & Comp Engn, Tucson, AZ 85721 USA

来源：

2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS | 2003年

关键词：

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We propose an importance sampling scheme for the decoding of loop-free decoding trees. 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.

引用

页码：120 / 120

页数：1