Constructing Quasi-Cyclic LDPC Codes For Efficient Encoding Based on Fast Gauss Elimination

Author

Jinsha Yuan ; Zhixiong Chen

Author_Institution

Sch. of Electr. & Electron. Eng., North China Electr. Power Univ., Baoding

fYear

2008

fDate

12-14 Oct. 2008

Firstpage

1

Lastpage

4

Abstract

In this paper, a fast gauss eliminating algorithm for parity-check matrices of Quasi-Cyclic LDPC codes is proposed firstly. Enlightened by the gauss elimination, some Quasi-Cyclic square matrices with full rank are constructed. By proper matrix extension based on the full rank square matrices, we construct a kind of parity-check matrices whose column weights are either two or three. It is suitable for efficient encoding procedures in with a linear complexity. Simulation results show a better performance compared to array based LDPC codes and LDPC codes in 802.11n standard.

Keywords

IEEE standards; cyclic codes; parity check codes; wireless LAN; 802.11n standard; LDPC codes; fast gauss eliminating algorithm; quasi-cyclic codes; square matrices; Code standards; Decoding; Encoding; Error correction codes; Gaussian processes; Metropolitan area networks; Parity check codes; Power engineering and energy; Quantum cascade lasers; Wireless LAN;

fLanguage

English

Publisher

ieee

Conference_Titel

Wireless Communications, Networking and Mobile Computing, 2008. WiCOM '08. 4th International Conference on

Conference_Location

Dalian

Print_ISBN

978-1-4244-2107-7

Electronic_ISBN

978-1-4244-2108-4

Type

conf

DOI

10.1109/WiCom.2008.364

Filename

4678273