2007 Fiscal Year Final Research Report Summary
Construction Methods of High Performance LDPC Codes
| Project/Area Number |
18560368
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Communication/Network engineering
|
|---|
| Research Institution | Tokyo Institute of Technology |
|---|
Principal Investigator |
SAKANIWA Kohichi Tokyo Institute of Technology, Graduate School of Science & Engineering, Professor (30114870)
|
|---|
| Project Period (FY) |
2006 – 2007
|
| Keywords | LDPC codes / Multi-Edge type / symmetry property / Density Evolution / Modified Expander codes / repetition decoding / MDS array codes / decodable in linear time |
|---|
| Research Abstract |
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.
|
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
[Presentation] Constant Relative Minimum Dis-tance,"2007
Author(s)
T., Nakasendo, K., Kasai, T., Shibuya, K., Sakaniwa
Organizer
Proc. of SITA (Symposium on Information Theory and its Applications) 2007, pp.319-324
Place of Presentation
Kashiko-jima Japan
Year and Date
2007-10-28
Description
「研究成果報告書概要(欧文)」より
-
-
-
-
-
-
-
-
-
-
-
[Presentation] Support Weight Distribution of Regular LDPC Code Ensembles2006
Author(s)
T., Itsui, K., Kasai, R., Ikegaya, T., Shibuya, K., Sakaniwa
Organizer
Proc. of ISITA (International Symposium on Information Theory and its Applications) 2006, pp.729-734
Place of Presentation
Seoul Korea
Year and Date
2006-10-30
Description
「研究成果報告書概要(欧文)」より
-
-
-
-
-
[Presentation] Second Support Weight Distribu-tion of Regular LDPC Code Ensembles2006
Author(s)
T., Itsui, K., Kasai, R., Ikegaya, T., Shibuya, K., Sakaniwa
Organizer
Proc. IEEE ISIT 2006, pp.2879-2883
Place of Presentation
Seattle USA
Year and Date
2006-07-13
Description
「研究成果報告書概要(欧文)」より
