Construction of Check Matrix of LDPC Codes Based on PEG-QC Algorithm

张建斌; 卢丹; 陆剑

您当前的位置：

首页 >

文章列表页 >

Construction of Check Matrix of LDPC Codes Based on PEG-QC Algorithm

更新时间：2026-09-14

- Construction of Check Matrix of LDPC Codes Based on PEG-QC Algorithm
- 基于PEG-QC算法的LDPC码校验矩阵的构造
- Vol. 33, Issue 6, Pages: 730-736(2012)
- 作者机构：
  
  1. 江苏技术师范学院电气信息工程学院
  2. 江苏技术师范学院教务处
- 作者简介：
- 基金信息：
- DOI：
  CLC：
- Published：2012
- 稿件说明：
移动端阅览
张建斌, 卢丹, 陆剑. Construction of Check Matrix of LDPC Codes Based on PEG-QC Algorithm[J]. 2012, 33(6): 730-736.
DOI：

张建斌, 卢丹, 陆剑. Construction of Check Matrix of LDPC Codes Based on PEG-QC Algorithm[J]. 2012, 33(6): 730-736. DOI：

摘要

通过分析LDPC(Low Density Parity Check)码树图、PEG(Progressive Edge-Growth)算法和准循环LDPC码的特点

提出了一种将PEG算法和准循环矩阵相结合来构造LDPC码校验矩阵的新算法.在该算法中

首先利用PEG算法构造基矩阵

再用文中提出的移位参数公式和准循环LDPC码结构特点来构造循环置换矩阵;然后利用循环置换矩阵和全零矩阵对基矩阵进行扩展

从而得到围长至少为8的准循环LDPC码校验矩阵.该算法综合了PEG算法和准循环码的优点

纠错性能总体上好于PEG算法

在相同的码参数条件下的硬件实现比PEG算法简单

且参数选择具有较大灵活性.

Abstract

By analyzing the characteristics of the LDPC tree

PEG algorithm and of quasi-cyclic LDPC codes

a new algorithm for construction of check matrix of LDPC codes which combines PEG algorithm with quasi-cyclic matrix was presented.In this algorithm

a basic matrix was firstly constructed with PEG algorithm

the cyclic permutation matrix was secondly constructed according to the proposed formula of shift parameter and the characteristics of quasi-cyclic LDPC codes

and then the basic matrix was extended by use of the cyclic permutation matrices and all-zero matrices

therefore the check matrix of quasi-cyclic LDPC codes with girth at least eight was finally obtained.Integrating the advantages of PEG algorithm and quasi-cyclic codes

the algorithm's error correction performance is better than that of PEG algorithm in general

it's hardware implementation is more simple than that of PEG algorithm at the same parameters

and the algorithm is flexibly to set the parameters of the LDPC codes.

关键词

Keywords

references

Gallager R G.Low-density parity-check codes[D].Cambridge:M.I.T.Press,1963.

MacKay D J C,Neal R M.Near Shannon limitperformance of low density parity check codes[J].Electronics Letters,1996,32(8):1645-1646.

Hu Xiaoyu,Eleftheriou E,Arnold D M.Regular andirregular progressive edge-growth tanner graphs[J].IEEE Trans.Inform.Theory,2005,51(1):386.

杨华,田应洪,张小军,等.基于范德蒙矩阵的LDPC码构造[J].电子器件,2009(2):413-416,421.Yang Hua,Tian Yinghong,Zhang Xiaojun,et al.Construction of LDPC code based on vandermondematrix[J].Chinese Journal of Electron Device,2009(2):413-416,421.(in Chinese)

袁东风,张海刚.LDPC码理论与应用[M].北京:人民邮电出版社,2008.

Tanner R M.A recursive approach to low complexitycodes[J].IEEE Transactions on Information Theory,1981,27(9):533-547.

张焕明,叶梧.LDPC码的树图法构造[J].电讯技术,2007,47(4):166-168.Zhang Huanming,Ye Wu.Construction of LDPCcodes with tree graph[J].TelecommunicationEngineering,2007,47(4):166-168.(in Chinese)

焦晓鹏,慕建君,周利华.一种Tanner图短环计数新方法[J].西安电子科技大学学报,2010,37(2):311-314.Jiao Xiaopeng,Mu Jianjun,Zhou Lihua.Novelmethod for counting short cycles of tanner graphs[J].Journal of Xidian University,2010,37(2):311-314.(in Chinese)

Mackay D J C.Good error-correcting codes based onvery sparse matrices[J].IEEE Trans.Info.Theory,1999,IT-45(3):399-431.

Richardson T,Urbanke R.Efficient encoding oflow-density parity-check codes[J].IEEE Trans.Info.Theory,2001,47(2):638-656.

Yu Kou,Shu Lin,Fossorier M P C.Low-densityparity-check codes based on finite geometries:Arediscovery and new results[J].IEEE Trans.Inform.Theory,2001,47(7):2711-2736.

Fossorier M.Quasicyclic low density parity checkcodes[J].IEEE Trans.Inform.Theory,2005,50(8):1788-1793.

Ren Pinyi,Yuan Qiang,Wang Rui,et al.Lowcomplexity construction for quasi-cyclic Low-density parity-check codes by Progressive-BlockGrowth[J].Science China Information Sciences,2011,54(2):371-380.

Wang Kaiyao,Xiao Yang,Kim K.Construction ofprotograph LDPC codes with circular generatormatrices[J].Journal of Systems Engineering andElectronics,2011,22(5):840-847.

管武,项海格.具有大码间距和大环路的QC-LDPC码的构造[J].电路与系统学报,2011,16(4):1-5.Guan Wu,Xiang Haige.Construction of QC-LDPCcodes with large minimum distances and large girths[J].Journal of Circuits and Systems,2011,16(4):1-5.(in Chinese)

张国华,王新梅.一类围长至少为6的QC LDPC码的存在性[J].西安电子科技大学学报(自然科学版),2011,38(3):136-139.Zhang Guohua,Wang Xinmei.On the existence of aclass of QC-LDPC codes with girth at least six[J].Journal of Xidian University(Natural ScienceEdition),2011,38(3):136-139.(in Chinese)

Views

209

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

几类图色等价的充分必要条件

机器人机构设计与控制专栏

PEG⁃Like Polymers Based on Low Molecular Weight PEI as Gene Vectors

Study on the Ultrasonic Adsorption of Cr（Ⅵ） in Water by Tea Biochar Magnetic Materials

Research on the Optimal Combination of Tail⁃Beat Frequency and Swing of Fish During Self⁃Propelled Swimming

Related Author

龚和林

舒情

Related Institution

上饶师范学院数学与计算机科学学院

⁰