IEEE Transactions on Communications

Design of regular (2,d/sub c/)-LDPC codes over GF(q) using their binary images

Charly Poulliat, M.P.C. Fossorier, David Declercq

Published Oct 1, 2008• 306 citations

Abstract

In this paper, a method to design regular (2, dc)- LDPC codes over GF(q) with both good waterfall and error floor properties is presented, based on the algebraic properties of their binary image. First, the algebraic properties of rows of the parity check matrix H associated with a code are characterized and optimized to improve the waterfall. Then the algebraic properties of cycles and stopping sets associated with the underlying Tanner graph are studied and linked to the global binary minimum distance of the code. Finally, simulations are presented to illustrate the excellent performance of the designed codes.

DOI: 10.1109/tcomm.2008.060527

Related papers

1 Design of regular (2, dc)-LDPC codes over GF(q) using their binary images

Charly Poulliat, M.P.C. Fossorier, David Declercq

Abstract — In this paper, a method to design regular (2, dc)-LDPC codes over GF(q) with both good waterfall and error floor properties is presented, based on the algebraic properties of their binary image. First, the algebraic properties of rows of the parity check matrix H associated with a code are characterized and optimized to improve the waterfall. Then the algebraic properties of cycles and stopping sets associated with the underlying Tanner graph are studied and linked to the global binary minimum distance of the code. Finally, simulations are presented to illustrate the excellent performance of the designed codes. Index Terms — channel coding, error correction coding, nonbinary LDPC codes, iterative decoding, binary image. I.

Aug 24, 20130 citations

Design of non binary LDPC codes using their binary image: algebraic properties

Charly Poulliat, M.P.C. Fossorier, David Declercq

In this paper, we develop algebraic properties of regular (2, tr, N) non binary LDPC codes designed using their binary image. First, we characterize the algebraic properties of optimized rows of the parity check matrix H associated with a code, and then we study the algebraic properties of cycles and stopping sets associated with the underlaying Tanner graph

IEEE International Symposium on Information Theory (ISIT)Jul 1, 200637 citations

Using binary images of non binary LDPC codes to improve overall performance

Charly Poulliat, M.P.C. Fossorier, David Declercq

In this paper, we address the problem of the optimization of non binary LDPC codes for finite lengths. Using the binary image of the code, we provide a method for both waterfall and error floor improvements based on the algebraic properties of rows, cycles and stopping sets.

Apr 3, 200624 citations

Construction of Quasi-Cyclic GF(q)-LDPC Codes Achieving the Upper Bound on the Minimum Hamming Distance

Xinmei Wang

In order to construct nonbinary low-density parity-check(LDPC) codes with good waterfall and error floor properties,a method to improve the minimum Hamming distance of a class of nonbinary quasi-cyclic(QC) LDPC codes is presented.Two upper bounds on the minimum Hamming distance are derived for the nonbinary QC LDPC codes whose parity-check matrices consist of weight-2 columns.A special base matrix design allowing linear encoding in a parallel manner is also proposed.In addition,the design principals are given,according to which,the parallel and efficiently encodable codes reaching the upper bound on the minimum Hamming distance can be developed.Simulation shows that the proposed codes have both good waterfall and error floor properties.

Beijing Youdian Xueyuan xuebaoJan 1, 20120 citations

Design of Quasi-Cyclic Cycle LDPC Codes over GF(q)

HU Shu-kai, Chao Chen, Rong Xia Sun +1 more

Quasi-cyclic (QC) low-density parity-check (LDPC) codes have several appealing properties regarding decoding, storage requirements and encoding aspects. In this paper, we focus on the QC LDPC codes over GF(q) whose parity-check matrices have fixed column weight j=2. By investigating two subgraphs in the Tanner graphs of the corresponding base matrices, we derive two upper bounds on the minimum Hamming distance for this class of codes. In addition, a method is proposed to construct QC LDPC codes over GF(q), which have good Hamming distance distributions. Simulations show that our designed codes have good performance.

IEICE Transactions on CommunicationsJan 1, 20120 citations

Design of high-rate irregular non-binary LDPC codes using algorithmic stopping-set cancellation

Sudarsan V. S. Ranganathan, D. Divsalar, Kasra Vakilinia +1 more

Following Poulliat et al.'s design of (2, dc) nonbinary LDPC (NB-LDPC) codes, this paper designs high-rate irregular NB-LDPC codes by addressing the problem of minimum symbol distance. The design procedure first identifies all stopping sets up to weight five in an LDPC code and enumerates them via a message passing algorithm. For each identified stopping set, careful labeling forces its corresponding parity-check sub-matrix to be full rank, thereby preventing the stopping set from being a sub-code and ensuring a minimum distance of at least six symbols. Simulation results for codes designed through this procedure show a significant improvement in the error-floor region over randomized labeling.

IEEE International Symposium on Information Theory (ISIT)Jun 1, 20147 citations