DocumentCode
2458256
Title
Modified Progressive Edge-Growth Algorithm for Fast-Encoding LDPC Codes
Author
Jiang, Xueqin ; Lee, Mi Sung ; Lee, Moon Ho
Author_Institution
Dept. of Electron. & Inf. Eng., Chonbuk Nat. Univ., Jeonju, South Korea
fYear
2010
fDate
6-9 Sept. 2010
Firstpage
1
Lastpage
5
Abstract
Progressive edge-growth (PEG) algorithm is known to construct low-density parity-check (LDPC) codes at finite code lengths with large girths. A simple variation of the PEG algorithm, linear-encoding PEG (LPEG) algorithm, can be applied to generate linear encodable LDPC codes. This paper presents a modified LPEG algorithm to construct fast encodable LDPC codes with a certain girth constraint. The presented fast encodable LDPC codes facilitate the parallel encoding processes for parity bit generations. Therefore, their encoding time is much shorter than that of LPEG codes.
Keywords
parity check codes; LDPC codes; PEG algorithm; code genertaion; finite code lengths; girth constraint; linear encoding; low density parity check; parity bit generation; progressive edge growth algorithm; Algorithm design and analysis; Approximation algorithms; Channel coding; Equations; Parity check codes; Partitioning algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
Vehicular Technology Conference Fall (VTC 2010-Fall), 2010 IEEE 72nd
Conference_Location
Ottawa, ON
ISSN
1090-3038
Print_ISBN
978-1-4244-3573-9
Electronic_ISBN
1090-3038
Type
conf
DOI
10.1109/VETECF.2010.5594175
Filename
5594175
Link To Document