A heuristic search for good low-density parity-check codes at short block lengths

Author

Mao, Yongyi ; Banihashemi, Amir H.

Author_Institution

Dept. of Electr. & Comput. Eng., Toronto Univ., Ont., Canada

Volume

1

fYear

2001

fDate

11-14 Jun 2001

Firstpage

41

Abstract

For a given block length and given degree sequences of the underlying Tanner graph (TG), the ensemble of short low-density parity-check (LDPC) codes can have considerable variation in performance. We present an efficient heuristic method to find good LDPC codes based on what we define as the girth distribution of the TG. This method can be used effectively to design short codes for applications where delay and complexity are of major concern

Keywords

computational complexity; delays; error detection codes; graph theory; search problems; sequences; LDPC codes; Tanner graph; complexity; degree sequences; delay; efficient heuristic method; girth distribution; heuristic search; low-density parity-check codes; performance; short block lengths; short codes design; Broadband communication; Computational modeling; Delay effects; Distributed computing; Educational institutions; Graph theory; Iterative decoding; Parity check codes; Signal to noise ratio; Systems engineering and theory;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications, 2001. ICC 2001. IEEE International Conference on

Conference_Location

Helsinki

Print_ISBN

0-7803-7097-1

Type

conf

DOI

10.1109/ICC.2001.936269

Filename

936269