准循环LDPC码最小汉明距离的计算与校验矩阵的改善
Computation and Reformation of the Minimum Distance and Check Array of QC LDPC Codes
-
摘要: 基于线性代数的基本原理和线性分组码的结构特点,提出了能准确计算QC LDPC码最小汉明距离的方法,并对计算复杂度进行估计;然后针对QC LDPC码的结构特点,对其校验矩阵进行改善,以增大码字的最小汉明距离,从而得到更好的译码性能.其中,计算最小汉明距离的方法同样适用于普通的线性分组码.Abstract: Based on the principles of linear algebra and linear block codes, a method is proposed to calculate the minimum distance of a group of QC LDPC codes as well as other kinds of linear block codes.A estimation of time complexity is stated too.A method of generating larger minimum distance by reforming the check array is given for QC LDPC codes based on its special structure.
下载:
