| LDPC码的树图法构造 |
| |
| 引用本文： | 张焕明,叶梧,冯穗力.LDPC码的树图法构造[J].国际商务研究,2007,47(4):166-168. |
| |
| 作者姓名： | 张焕明 叶梧 冯穗力 |
| |
| 作者单位： | 华南理工大学电子与信息学院,广州510640 |
| |
| 摘 要： | LDPC码译码采用的是BP算法,但由于回路的存在,使译码重复迭代,特别是短长度的回路使LDPC码的性能下降.为此,用树图法分析了LDPC码的回路及其特性,给出了求解回路长度和所经过节点的方法,非常适合于计算机进行求解.同时也用树图的方法来构造LDPC码,可以在树生成的过程中了解其中的回路数目及长度.
|
| 关 键 词： | LDPC码 Tanner图 树图法 回路 度 |
| 收稿时间： | 2006/12/26 0:00:00 |
| 修稿时间： | 2007/4/16 0:00:00 |
Construction of LDPC Codes With Tree Graph |
| |
| ZHANG Huan-ming,YE Wu,FENG Hui-li.Construction of LDPC Codes With Tree Graph[J].International Business Research,2007,47(4):166-168. |
| |
| Authors: | ZHANG Huan-ming YE Wu FENG Hui-li |
| |
| Institution: | School of Electronic Information, South China Universiry of Technology, Guangzhou 510640, China |
| |
| Abstract: | Belief-Propagation(BP)algorithm is used in LDPC code''s decoding,but small loops degrade the code''s performance.This paper analyzes the LDPC code''s Loops by tree graph and also presents a method to obtain the loop lenghth and the nodes passing by.This nethod is easy to be realized by computer.At the same time,LDPC code can also be constructed with tree graph and the number of loop and the lenghth can be known during the generation of tree. |
| |
| Keywords: | LDPC code Tanner graph tree graph method loop degree |
|
| 点击此处可从《国际商务研究》浏览原始摘要信息 |
| 点击此处可从《国际商务研究》下载免费的PDF全文 |
|
