Construction Methods of High Performance LDPC Codes

高性能LDPC码的构造方法

• 批准号: 18560368
• 负责人: SAKANIWA Kohichi
• 金额: $ 2.51万
• 依托单位: Tokyo Institute of Technology
• 依托单位国家: 日本
• 项目类别: Grant-in-Aid for Scientific Research (C)
• 财政年份: 2006
• 资助国家: 日本
• 起止时间: 2006 至 2007
• 项目状态: 已结题
• 来源: https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-18560368/
• 关键词: LDPC codes; Multi-Edge type; symmetry property; Density Evolution; Modified Expander codes; repetition decoding; MDS array codes; decodable in linear time; 密度発展性; 繰り返し符号法

Though the LDPC (Low Density Parity Check) codes are known as the codes to attain very good and close performance to the Shannon's limit, there still remain some basic problems to be resolved: e.g., (1) to derive detailed described code ensembles and evaluate their performance efficiently, (2) to construct LDPC codes with algebraic structure which are important in practical implementation.To solve these two basic problems, we in this research have proposed (1) a new class of Multi-Edge type LDPC code ensembles and an efficient DE (Density Evolution) for the proposed ensembles, (2) new modified expander codes and MDS (Maximum Distance Separable) array codes which are easy to implement as well as high performance.In the fiscal year 2006, (1) we developed DE (Density Evolution) for the new class of Multi-Edge type LDPC code ensembles which are constructed based on the newly found symmetry property, (2) proposed Justesen like modified expander codes which are decodable in linear time with the minimum distance repeat decoding and having asymptotically good performance.In the fiscal year 2007, (1) for the proposed new class of Multi-Edge type LDPC code ensembles, we have derived the weight distributions and the Stopping Set distributions and confirmed the effectiveness of the proposed code ensembles, (2) by comparing the proposed codes with the corresponding conventional ones we have found that the proposed codes exhibit sufficiently good performance and are thought to be very effective in practice.

尽管LDPC（低密度均衡检查）代码被称为实现Shannon限制的良好和紧密性能的代码，但仍有一些基本问题要解决： （1）针对拟议的合奏的新型多层型LDPC代码组合和有效的DE（密度进化），（2）新的修改后的扩展器代码和MDS（最大距离可分开）阵列代码易于实现以及高性能以及高度性能。新发现的对称性属性，（2）提出的贾斯森如修改的扩展器代码，可以在线性时间内与最小距离重复解码并具有渐近性能的最小距离。将所提出的代码与相应的常规代码进行比较，我们发现所提出的代码表现出足够好的性能，并且在实践中被认为非常有效。

项目成果

詳細に規定された非正則LDPC符号アンサンブルのBP復号における漸近的なエラーフロアの解析

明确指定不规则LDPC码系综BP解码中的渐近误差层分析

• 发表时间: 2007
• 作者: 森 立平;笠井 健太;渋谷 智治;坂庭 好一
• 通讯作者: 坂庭 好一

符号長に比例する最小距離を有する Two-Edge type LDPC符号アンサンブルの条件

最小距离与码长成正比的双边型 LDPC 码集成的条件

• 发表时间: 2007
• 作者: 中仙道 剛;{笠井 健太};渋谷 智治;坂庭 好一
• 通讯作者: 坂庭 好一

Evolution of Degree Distribution of Resid- ual Graphs for Detailedly Represented Irregular LDPC Code Ensembles

详细表示的不规则LDPC码系综残差图度分布的演化

• 发表时间: 2007
• 作者: T.;Nozaki;K.;Kasai;T.;Shibuya;K.;Sakaniwa
• 通讯作者: Sakaniwa

Second Support Weight Distribution of Regular LDPC Code Ensembles

常规LDPC码系综的第二支持权重分布

• 发表时间: 2006
• 作者: T. Itsui;K. Kasai;R. Ikegaya;T. Shibuya and K. Sakaniwa
• 通讯作者: T. Shibuya and K. Sakaniwa

Performance Analysis of LDPC Code Ensembles with Support Weight Distribution

支持权重分布的 LDPC 码系性能分析

• 发表时间: 2006
• 作者: T.;Itsui;K.;Kasai;T.;Shibuya;K.;Sakaniwa
• 通讯作者: Sakaniwa