| 基于加权图的准循环低密度奇偶校验码构造算法 |
| |
| 引用本文： | 胡家义,王文博.基于加权图的准循环低密度奇偶校验码构造算法[J].西安电子科技大学学报,2008,35(5):938-941. |
| |
| 作者姓名： | 胡家义 王文博 |
| |
| 作者单位： | (北京邮电大学 泛网无线通信教育部重点实验室，北京 100876) |
| |
| 摘 要： | 提出了大围长准循环低密度奇偶校验码低复杂度构造方法，主要基于加权图来确定满足大围长基矩阵待定位置容许值集合．这些集合无须通过逐一试用所有可能数值来确定，因而大大降低了准循环低密度奇偶校验码的构造复杂度．仿真表明该算法构造出的准循环低密度奇偶校验码具有大围长，且具有好的性能．
|
| 关 键 词： | 低密度奇偶校验码 环 围长 加权图 |
| 收稿时间： | 2007-10-19 |
Algorithm for constructing QC_LDPC codes based on the weighted map |
| |
| HU Jia-yi,WANG Wen-bo.Algorithm for constructing QC_LDPC codes based on the weighted map[J].Journal of Xidian University,2008,35(5):938-941. |
| |
| Authors: | HU Jia-yi WANG Wen-bo |
| |
| Affiliation: | (Key Lab. of Universal Wireless Communications, Ministry of Education, Beijing Univ. of Posts and Telecommunications, Beijing 100876， China) ; |
| |
| Abstract: | A low complexity algorithm for constructing Quasicyclic low-density parity-check(QCLDPC) codes with a large girth is presented.Based on the weighted graph,the algorithm leads to sets of values of all undetermined positions of the base matrix ensuring QCLDPC with a large girth.The sets of values are determined without trying every possible value so that the complexity for constructing QCLDPC codes is greatly reduced.Simulations show the algorithm can construct codes with a large girth which have good perform... |
| |
| Keywords: | low-density parity-check codes cycle girth weighted map |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《西安电子科技大学学报》浏览原始摘要信息 |
|
点击此处可从《西安电子科技大学学报》下载全文 |
