| 一种低复杂度的LDPC码迭代译码算法 |
| |
| 引用本文： | 朱嘉,张海滨,潘宇.一种低复杂度的LDPC码迭代译码算法[J].电讯技术,2006,46(5):94-97. |
| |
| 作者姓名： | 朱嘉 张海滨 潘宇 |
| |
| 作者单位： | 上海交通大学,电子工程系,上海,200030 |
| |
| 基金项目： | 国家自然科学基金;国家高技术研究发展计划(863计划) |
| |
| 摘 要： | 在LDPC码的译码算法中，和积算法性能最优但复杂性较高，最小和算法实现简单但性能与和积算法相差较多。针对这一性能与复杂度的矛盾，带有修正项的最小和算法成为研究的热点问题。文中基于一种性能与和积算法接近的修正最小和算法进行研究，对修正项的修正方式进行了简化，简化后的算法在性能上与和积算法仍非常接近，实现复杂度却比原修正最小和算法有明显的降低。
|
| 关 键 词： | LDPC码 译码算法 和积算法 最小和算法 简化算法 修正项 |
| 文章编号： | 1001-893X（2006）05-0094-04 |
| 收稿时间： | 2005-09-02 |
| 修稿时间： | 2005-09-022006-05-12 |
A Low-complexity Iterative Decoding Algorithm for LDPC Codes |
| |
| ZHU Ji,ZHANG Hai-bin,PAN Yu.A Low-complexity Iterative Decoding Algorithm for LDPC Codes[J].Telecommunication Engineering,2006,46(5):94-97. |
| |
| Authors: | ZHU Ji ZHANG Hai-bin PAN Yu |
| |
| Affiliation: | Department of Electronic Engineering, Shanghai Jiaotong University, Shanghai 200030, China |
| |
| Abstract: | Among the decoding algorithms for low-density parity-check(LDPC) code,sum-product algorithm(SPA) has the optimal performance but high complexity,while min-sum algorithm has simple implementation complexity but worse performance.Considering this performance-complexity contradiction,some modified min-sum algorithms are proposed.In this paper,researches are done based on one of the modified min-sum algorithms that is close to SPA in performance but the way modifying fraction works is simplified.Simplified algorithm remains similar in performance to sum-product algorithm but has a remarkably reduced implementation complexity. |
| |
| Keywords: | LDPC code decoding algorithm sum - product algorithm rain - sum algorithm simplified algorithm correction term |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《电讯技术》浏览原始摘要信息 |
|
点击此处可从《电讯技术》下载全文 |
