Title :
LDPC Codes of Arbitrary Girth
Author :
Asamov, Tsvetan ; Aydin, Nuh
Author_Institution :
Kenyon Coll., Gambier
Abstract :
For regular, degree two LDPC (low density parity-check) codes, there is a strong relationship between high girth and performance. This article presents a greedy algorithm, called successive level growth (SLG), for the construction of LDPC codes with arbitrarily specified girth. The simulation results show that our codes exhibit significant coding gains over randomly constructed LDPC codes and in some cases outperform PEG codes in the additive white Gaussian noise channel.
Keywords :
Gaussian noise; greedy algorithms; parity check codes; Gaussian noise channel; LDPC codes; PEG codes; arbitrarily specified girth; coding gains; greedy algorithm; low density parity-check; successive level growth; Additive white noise; Bipartite graph; Educational institutions; Greedy algorithms; Joining processes; Mathematics; Parity check codes; Sparse matrices; Sum product algorithm; Virtual colonoscopy; LDPC codes; Successive Level Growth (SLG); large girth;
Conference_Titel :
Information Theory, 2007. CWIT '07. 10th Canadian Workshop on
Conference_Location :
Edmonton, Alta.
Print_ISBN :
1-4244-0769-9
Electronic_ISBN :
1-4244-0769-9
DOI :
10.1109/CWIT.2007.375703
