Presentation 2011-08-25
Efficient Encoding for LDPC codes
Tomoharu Shibuya,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) It is well known that LDPC codes can exhibit excellent performance by iterative decoding with O(n) computational complexity. As for their encoding, however, no algorithm has been developed that can be executed with computation less than O(n^2). Therefore, it has been one of the most important research subject to reduce computational complexity of encoding of LDPC codes. In this paper, we will survey the conventional approaches to reduce computational complexity of encoding of LDPC codes. Then the encoding method of LDPC codes that can be executed with O(n) computation will be introduced.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) LDPC codes / Encoding algorithm / Direct method for linear systems / Dulmage-Mendelsohn (DM) decomposition / Block triangularization
Paper # SAT2011-20,RCS2011-115
Date of Issue

Conference Information
Committee SAT
Conference Date 2011/8/18(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Satellite Telecommunications (SAT)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Efficient Encoding for LDPC codes
Sub Title (in English)
Keyword(1) LDPC codes
Keyword(2) Encoding algorithm
Keyword(3) Direct method for linear systems
Keyword(4) Dulmage-Mendelsohn (DM) decomposition
Keyword(5) Block triangularization
1st Author's Name Tomoharu Shibuya
1st Author's Affiliation Department of Information and Communication Sciences, Sophia University()
Date 2011-08-25
Paper # SAT2011-20,RCS2011-115
Volume (vol) vol.111
Number (no) 179
Page pp.pp.-
#Pages 6
Date of Issue