检索结果-内蒙古大学图书馆

bootstrap decoding of low-density parity-check codes

IEEE COMMUNICATIONS LETTERS 2002年第9期6卷 391-393页

作者： Nouh, A Banihashemi, AH Carleton Univ Dept Syst & Comp Engn BCWS Ctr Ottawa ON K1S 5B6 Canada

An initial bootstrap step for the decoding of low-density parity-check (LDPC) codes is proposed. decoding is initiated by first erasing a number of less reliable bits. New values and reliabilities are then assigned to erasure bits by passing messages from nonerasure bits through the reliable check equations. The bootstrap step is applied to the weighted bit-flipping algorithm to decode a number of LDPC codes. Large improvements in both performance and complexity are observed.

关键词： bootstrap decoding iterative decoding low-density parity-check (LDPC) codes message-passing algorithms message-passing schedule weighted bit-flipping algorithm

来源：评论

学校读者我要写书评

暂无评论

High-performance iterative Viterbi algorithm for conventional serial concatenated codes

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2002年第7期48卷 1759-1771页

作者： Wei, L Univ Cent Florida Sch Elect Engn & Comp Sci Orlando FL 32816 USA

The Viterbi algorithm (VA) and conventional serial concatenated codes (CSCC) have been widely applied in digital communication systems over the last 30 years. In this paper, we show that the Shannon capacity of additive white Gaussian noise (AWGN) channels can be approached by CSCCs and the iterative VA (IVA). We firstly study the algebraic properties of CSCCs. We then present the IVA to decode these codes. We also analyze the performance of the IVA and conclude that a better performance can be achieved if we replace the powerful block codes by some simple parity codes. One of the key results in this paper shows that by using a proper design for the decoding method, codes with small loops can be very efficiently decoded using a min-sum type algorithm. The numerical results show that the IVA can closely approach the Shannon sphere-packing lower bound and the Shannon limit. For block sizes ranging from 56 information bits to 11970 information bits, the IVA can perform to within about 1 dB of the Shannon sphere-packing lower bound at a block error rate of 10(-4). We show that the IVA has very low complexity and can be applied to many current standard systems, for example, the Qualcomm code-division multiple-access (CDMA) system and the NASA concatenated system, with very little modification or, for some cases, without any modification.

关键词： bootstrap decoding iterative decoding serial concatenated systems (SCC) turbo decoding Viterbi algorithm (VA)

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：