Title :
Trapping set enumerators for specific LDPC codes
Author :
Abu-Surra, Shadi ; Declercq, David ; Divsalar, Dariush ; Ryan, William E.
Author_Institution :
Samsung Telecommun. America, Richardson, TX, USA
fDate :
Jan. 31 2010-Feb. 5 2010
Abstract :
In this paper, a method is presented for enumerating the trapping sets of a specific LDPC code given its Tanner graph. The technique involves augmenting the original Tanner graph with additional variable nodes, and then applying a weight-enumeration algorithm to the augmented Tanner graph. The proposed method is used to find trapping set enumerators for several LDPC codes in communication standards. The complexity of the proposed algorithm is discussed.
Keywords :
graph theory; parity check codes; LDPC codes; augmented Tanner graph; communication standards; trapping set enumerator; weight-enumeration algorithm; Code standards; Communication standards; Iterative decoding; Laboratories; Parity check codes; Propulsion; Sections;
Conference_Titel :
Information Theory and Applications Workshop (ITA), 2010
Conference_Location :
San Diego, CA
Print_ISBN :
978-1-4244-7012-9
Electronic_ISBN :
978-1-4244-7014-3
DOI :
10.1109/ITA.2010.5454095
