An Algebraic Method for Constructing Efficiently Encodable Irregular LDPC Codes

摘要

Low-density parity-check (LDPC) codes are one of the most promising next-generation error-correcting codes and have been intensively studied in recent years. LDPC codes are classified into two classes namely, regular LDPC codes and irregular ones. Irregular LDPC codes outperform regular ones, but require higher complexity to implement than regular ones. 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.