DocumentCode
2055391
Title
Grouping-and-shifting designs for structured LDPC codes with large girth
Author
Lu, Jin ; Moura, José M F ; Niesen, Urs
Author_Institution
Dept. of Electr. & Comput. Eng., Carnegie Mellon Univ., Pittsburgh, PA, USA
fYear
2004
fDate
27 June-2 July 2004
Firstpage
236
Abstract
We introduce a method to design structured LDPC codes with large girth and flexible code rates. The method is simple to explain: we divide the nodes in the Tanner graph into groups and connect nodes in these groups according to a set of parameters called shifts. We derive a general theorem on the shifts to prevent small cycles. Simulations show that these codes, GS-LDPC codes, outperform random LDPC codes.
Keywords
graph theory; group codes; parity check codes; random codes; Tanner graph; flexible code rate; girth code; grouping code; random code; shifting design; structured LDPC code; Bipartite graph; Data storage systems; Decision support systems; Decoding; Design methodology; Parity check codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
Print_ISBN
0-7803-8280-3
Type
conf
DOI
10.1109/ISIT.2004.1365275
Filename
1365275
Link To Document