International Conference on Communications, Circuits and Systems

Algebraic Constructions of Nonbinary Quasi-Cyclic LDPC Codes

Shu Hwa Lin, Shumei Song, Ying Tai, Lan Lan, Lingqi Zeng

Published Jun 1, 2006• 19 citations

Abstract

In the late 1950's and early 1960's, finite fields were successfully used to construct linear block codes, especially cyclic codes, with large minimum distances for correcting random errors with algebraic decoding, such as Bose-Chaudhuri-Hocqenghem (BCH) and Reed-Solomon (RS) codes. Recently it has been shown that finite fields can also be used successfully to construct binary quasi-cyclic (QC)-LDPC codes that perform very well not only over the AWGN channel but also over the binary erasure channel with iterative decoding, besides being efficiently encodable. This paper is concerned with constructions of nonbinary QC-LDPC codes based on finite fields

DOI: 10.1109/icccas.2006.284883

Related papers

Construction of Quasi-Cyclic LDPC Codes for AWGN and Binary Erasure Channels: A Finite Field Approach

Lan Lan, Lingqi Zeng, Y.Y. Tai +3 more

In the late 1950s and early 1960s, finite fields were successfully used to construct linear block codes, especially cyclic codes, with large minimum distances for hard-decision algebraic decoding, such as Bose-Chaudhuri-Hocquenghem (BCH) and Reed-Solomon (RS) codes. This paper shows that finite fields can also be successfully used to construct algebraic low-density parity-check (LDPC) codes for iterative soft-decision decoding. Methods of construction are presented. LDPC codes constructed by these methods are quasi-cyclic (QC) and they perform very well over the additive white Gaussian noise (AWGN), binary random, and burst erasure channels with iterative decoding in terms of bit-error probability, block-error probability, error-floor, and rate of decoding convergence, collectively. Particularly, they have low error floors. Since the codes are QC, they can be encoded using simple shift registers with linear complexity.

IEEE Transactions on Information TheoryJun 28, 2007263 citations

Constructions of quasi-cyclic LDPC codes for the AWGN and binary erasure channels based on finite fields and affine mappings

Longwen Lan, Lingqi Zeng, Y.Y. Tai +2 more

This paper presents two algebraic methods for constructing efficiently encodable quasi-cyclic (QC) LDPC codes that perform well on both the AWGN and binary erasure channels with iterative decoding in terms of bit-error performance, block error performance and error-floor, collectively. The constructions are based on the cyclic subgroups of the multiplicative groups of finite fields and affine mappings

IEEE International Symposium on Information Theory (ISIT)Jan 1, 200518 citations

A unified approach to the construction of binary and nonbinary quasi-cyclic LDPC codes based on finite fields

Shumei Song, Bo Zhou, Shu Hwa Lin +1 more

A unified approach for constructing binary and nonbinary quasi-cyclic LDPC codes under a single framework is presented. Six classes of binary and nonbinary quasi-cyclic LDPC codes are constructed based on primitive elements, additive subgroups, and cyclic subgroups of finite fields. Numerical results show that the codes constructed perform well over the AWGN channel with iterative decoding.

IEEE Transactions on CommunicationsJan 1, 2009104 citations

Construction of nonbinary LDPC codes: prime difference approach

Xin Zhao, Lijun Zhang, L. L. Cheng

This paper presents an algebraic method for constructing structural nonbinary LDPC codes based on the prime difference over finite field. The approach gives a class of quasi-cyclic (QC)-LDPC codes with girth at least 6. Especially, the approach can construct a class of short length code and the decoding complexity is low. Simulation results show that the constructed codes decoded with iterative decoding perform well over the AWGN channel using BPSK transmission in terms of bit-error probability and rate of decoding convergence, collectively.

IET International Conference on Wireless, Mobile and Multimedia Networks (ICWMMN)Jan 1, 20110 citations

Quasi-Cyclic LDPC Codes on Cyclic Subgroups of Finite Fields

Li Guo Zhang, Shu Lin, Khaled Abdel-Ghaffar +2 more

A new class of quasi-cyclic LDPC codes whose parity-check matrices are arrays of circulant permutation matrices constructed based on cyclic subgroups of finite fields is presented. This class of codes contains several known classes of algebraic quasi-cyclic LDPC codes as subclasses. Experimental results show that the codes constructed perform very well over the AWGN channel when decoded with iterative decoding based on belief propagation. This class of new QC-LDPC codes contains a subclass of codes which have large minimum distances. Combinatorial expressions for the ranks of the parity-check matrices of a subclass of codes constructed based on fields of characteristic two are given.

IEEE Transactions on CommunicationsJun 28, 201134 citations

Construction of structured low density lattice codes based on finite fields

Jiayun Li, Shu‐Tao Xia, Xinji Liu

Finite fields were successfully used to construct algebraic low-density parity-check (LDPC) codes, especially Quasi-Cyclic LDPC codes. These LDPC codes with large minimum distances have lower error floor, linear complexity of encoding and are more practical for hard-decision algebraic decoding. In this paper, we show that finite fields can also be successfully used to construct algebraic low-density lattice codes (LDLC), denoted by structured LDLC. A general framework to construct algebraic LDLC is presented. LDLC constructed by this general framework have comparable performance to the corresponding random codes over addition white Gaussian noise (AWGN) channel with iterative soft-decision decoding in terms of symbol-error probability. Furthermore, the general framework is extended to complex low-density lattice codes (CLDLC) and results in algebraic CLDLC which perform very well for small dimensions.

IEEE Symposium on Computers and Communications (ISCC)Jul 1, 20150 citations