An Algebraic Method for Constructing Efficiently Encodable Irregular LDPC Codes

Hachiro Fujita, Maki Ohata, K. Sakaniwa

In this paper we propose an algebraic construction of efficiently encodable irregular LDPC codes. The proposed irregular LDPC codes have not only an efficient encoding algorithm but also guaranteed minimum distances. Simulation results show that the proposed codes perform well compared to randomly constructed irregular LDPC codes

Bo Zhou

Yuki Taniguchi, Gou Hosoya, Masayuki Goto +1 more

N Cetc

The main influence for the performance of finite length Low-Density Parity-Check(LDPC) codes is analyzed. According to optimum choice for degree distribution, a check matrix is constructed with improved Progressive-Edge-Growth (PEG) algorithm. A practical efficient encoding algorithm is proposed to optimize the check matrix. A finite length irregular LDPC code with low error-floor performance and approximate linear encoding complexity is obtained. This optimization method can be easily extended to general communication channels.

Jinghu Chen, R. Michael Tanner, Juntan Zhang +1 more

In this correspondence, we propose an approach to construct irregular low-density parity-check (LDPC) codes based on quasi-cyclic extension. When decoded iteratively, the constructed irregular LDPC codes exhibit a relatively low error floor in the high signal-to-noise ratio (SNR) region and are subject to relatively few undetected errors. The LDPC codes constructed based on the proposed scheme remain efficiently encodable

Chao Chen