欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
对于围长（girth）至少为8的低密度奇偶校验（LDPC）码,目前的绝大多数构造方法都需要借助于计算机搜索。受贪婪构造算法启发,该文利用完全确定的方式构造出一类围长为8的（3,L）-规则QC-LDPC码。这类QC-LDPC码的校验矩阵由3×L个P×P的循环置换矩阵构成。对于任意整数P≥3L^2/4,这类校验矩阵的围长均为8。
英文摘要：
Most of the proposed constructions for Low-Density Parity-Check （LDPC） codes with girth at least eight are focused on （semi-） stochastic methods with the aid of computer search. Motivated by the resulting parity-check matrices obtained from the Greedy construction idea, a deterministic method is presented to construct a novel family of girth-8 （3,L）-regular Quasi-Cyclic （QC-） LDPC codes. The parity-check matrix of the new code consists of 3 × LP × Pcyclic permutation matrices and the girth of its Tanner graph is eight for arbitrary integer P ≥ 3L^2/ 4.
同期刊论文项目
同项目期刊论文
The Periodic Half-width Microstrip Leaky-Wave Antenna with a Backward to Forward Scanning Capability
A New Time Domain Solution for the Multiple Diffraction of Spherical Waves by an Array of Nonperfect
Nonbinary LDPC codes constructed based on a cyclic MDS code and a low-complexity nonbinary message-p
Linearly time-varying channel estimation and training power allocation for MIMOOFDM systems using su
Linearly Time-Varying Channel Estimation and Symbol Detection for OFDMA Uplink Using Superimposed Tr
Optimal Estimation of Linearly Time-Varying MIMO/OFDM Channels Modeled by a Complex Exponential Basi
期刊信息
位置：