Study of short-length low-density-parity-check codes

Anand Anbalagan, Sivakannan Subramani, C. Kamalanathan +1 more

李铁楠, 单秀玲

Aditya Ramamoorthy, Richard D. Wesel

We present a construction algorithm for short block length irregular low-density parity-check (LDPC) codes. Based on a novel interpretation of stopping sets in terms of the parity-check matrix, we present an approximate trellis-based search algorithm that detects many stopping sets. Growing the parity check matrix by a combination of random generation and the trellis-based search, we obtain codes that possess error floors orders of magnitude below randomly constructed codes and significantly better than other comparable constructions.

Marco Baldi

Yongyi Mao, Amir H. Banihashemi

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.

Frank Kienle