摘要
通过改进传统线性分组码的伴随式译码算法 ,提出了一种低复杂度的列表译码算法 .该算法通过组合线性分组码校验矩阵中权重较小的列向量进行译码并正确计算出各码字元素的软输出信息 ,应用该算法可以构造乘积码迭代译码器 .比较其他同类算法 ,该算法不仅性能较好、适用码型范围较广 ,而且可以根据具体情况在译码复杂度和译码性能两者之间做出折衷选择 .分析和仿真结果表明 ,该译码算法在误码性能和译码复杂度方面都优于传统的乘积码迭代译码算法 ,能够有效应用于通信系统中实现纠错 。
By modifying the traditional syndrome decoding algorithm of linear block codes, a low complexity list decoding algorithm was proposed. It proceeds decoding by combining the least weight columns of check matrix of linear block codes. And it can also compute the soft output of decoded symbols, so an iterative decoder for product codes can constructed from it. Compared to the conventional weighting iterative algorithm, the proposed algorithm not only has better performance and can apply to a wide scope of linear block codes, but also can make a compromise decision between the complexity and decoding performance. The analyses and simulations show the advantages of the proposed algorithm. It can be applied to the practical communication system for error correcting.
出处
《上海交通大学学报》
EI
CAS
CSCD
北大核心
2002年第6期753-756,共4页
Journal of Shanghai Jiaotong University
基金
国家自然科学基金资助项目 (60 0 72 0 2 8)
