QC-LDPC码的置换矩阵循环移位次数设计

 本文提出了一种循环移位次数的代数设计方法,该方法可用来构造基于置换矩阵的QC-LDPC码的稀疏奇偶校验矩阵H 。这个方法的基本思路是：将构造 q×t置换阵列 H矩阵的问题转化为构造 q×t下标矩阵 S(H)=[aij]的问题,然后根据Fosserier的充分必要条件,设计出能消除小围长（girth）的下标计算表达式 aij=f(q.t.n)。由该方法构造的H 矩阵能消除4环长,围长至少是6。

Shift Value Design of Permutation Matrices for QC- LDPC Codes

This paper presents an algebraic method for designing circulant-shift values of permutation matrices in an array sparse parity-chick matrix which defines the QC-LDPC codes.The basic ideal is that the problem of constructing an array H-matrix by the permutation matrix can be converted into the problem of constructing a subscript matrix,and then all elements(subscript values) in this subscript matrix,i.e.,the circulant-shift values of all permutation matrices in the array H-matrix,can be computed by a well-de...