IEEE International Conference on Circuits and Systems for Communications

Efficient Encoder Design of the Q-LDPC Codes

Li Peng, Guangxi Zhu

Published May 1, 2008• 0 citations

Abstract

This paper have developed farther the method of constructing sparse parity-check matrix (H-matrix) with determinate systemic structure as well as designing practice recursive encoding algorithm of the low-density parity-check (LDPC) codes. It discovers that the LDPC codes based on the circulant-shifted permutation Q-matrix created by N-queens searching algorithm perform better than them based on permutation identity matrix when Hd-matrix in H =[ HpHd] was constructed by using circulant-shifted permutation Q-matrix and identity matrix, respectively. It presents a simple and efficient algorithm of constructing Hdmatrix without 4-cycle and 6-cycle. The presented LDPC encoders require O(M) operation (M is check-bit size). They are rate-compatible and length- compatible encoders that can cover a very wide range of rate from 0.1 to 0.9 and length including any positive integer from 20 to infinity except prime number and multiple prime numbers. The presented LDPC codes with moderate length and 1/2 rate can achieve reliable performance - 10-5~10-6bit error rate (BER) - on an additive white Gaussian noise (AWGN) channel with signal-to-noise ratio (SNR) Eb/Noabout 1.42 dB1.

DOI: 10.1109/iccsc.2008.13

Related papers

The low-density parity-check codes based on The n-queen problem

Li Peng, Guangxi Zhu, Xiao Liu

This paper presents a new family of low-density parity-check (LDPC) code, the sparse parity-check matrix of which is constructed by self-defining non-diagonal identity sub-matrix that is a solution of the "n-queen problem". So this sub-matrix is called the Q-matrix and these LDPC codes are called the Q-matrixes LDPC codes. The Q-matrixes LDPC codes are good or very good codes with iterative decoding and their Tanner graphs are free of 4-lines cycle. Furthermore, they can be created in cycle form. Their encoding can be achieved in linear time. Especially, their code length and code rate can be flexible and quickly adjusted according to the practical situation, and the performance of high rate is also very good. The other unique excellence is that the large sparse parity-check matrixes of long Q-matrixes LDPC codes require very small storage space. The result of this paper is very significant not only for designing low complexity encoder, improving performance and reducing the complexity of the sum-product iterative decoding algorithm, but also for building practice system of encodable and decodable LDPC code.

Oct 15, 20046 citations

A Construction Method of QC-LDPC Codes without Short Cycles

Jianwu Zhang, Chengxia Li, Jianrong Bao

Low-density Parity-check (LDPC) coding is a class of advanced channel coding techniques. To improve the performance of LDPC codes, a simple and effective method to construct QC-LDPC codes without short cycles (cycles of length four and six) is proposed. The approach is especially effective when the parity-check matrix of QC-LDPC codes is composed of circulant permutation matrices. Firstly, we analyze the shapes of the cycles in the exponent matrix, to get the required conditions of no four-cycles and six-cycles. Then we show how to construct the parity-check matrix without four-cycles and six-cycles by filling rows of the exponent matrix with arithmetic sequences. Simulation results show that the proposed codes have better performance than array codes. Though the performance of the proposed codes is not as well as random codes at higher Eb/N0, they can be applied to practical communications because of being encoded in linear time with shift registers.

International Conference on Multimedia Information Networking and SecurityNov 1, 20123 citations

On LDPC Codes and Their Construction

Mohammed Amine Tehami, Malika Tehami, Boucif Beddad +1 more

In this paper, we propose a novel method for constructing low-density parity-check (LDPC) codes that relies on circulant permutation matrices as the main principal elements. A key feature of this construction is the intentional avoidance of short cycles, particularly those of length four, which are known to degrade decoding performance. By eliminating these cycles, the approach contributes to lowering both encoding and decoding complexity, making the codes more efficient to implement. To assess their effectiveness, the proposed LDPC codes are evaluated and compared with uncoded binary phase shift keying (BPSK) transmission over an additive white Gaussian noise (AWGN) channel. The simulation outcomes demonstrate that the structured codes deliver competitive results, achieving error-rate performance similar to, and in some instances exceeding, well-known designs such as progressive edge growth (PEG) and quasi-cyclic (QC) codes.

The Eurasia Proceedings of Science Technology Engineering and MathematicsJan 1, 20260 citations

Quasi-cyclic LDPC codes for fast encoding

Seho Myung, Kyeongcheol Yang, Jaeyoel Kim

In this correspondence we present a special class of quasi-cyclic low-density parity-check (QC-LDPC) codes, called block-type LDPC (B-LDPC) codes, which have an efficient encoding algorithm due to the simple structure of their parity-check matrices. Since the parity-check matrix of a QC-LDPC code consists of circulant permutation matrices or the zero matrix, the required memory for storing it can be significantly reduced, as compared with randomly constructed LDPC codes. We show that the girth of a QC-LDPC code is upper-bounded by a certain number which is determined by the positions of circulant permutation matrices. The B-LDPC codes are constructed as irregular QC-LDPC codes with parity-check matrices of an almost lower triangular form so that they have an efficient encoding algorithm, good noise threshold, and low error floor. Their encoding complexity is linearly scaled regardless of the size of circulant permutation matrices.

IEEE Transactions on Information TheoryJul 19, 2005278 citations

Recursive construction of LDPC codes

Shunliang Mei

To reduce the cycles in the Tanner graph which may affect the code performance,a recursive method to construct low-density parity-check(LDPC) codes was proposed.The method used a parity-check matrix of a short LDPC code as its mother matrix upon which a long code was constructed with circulant permutation matrices.By choosing the circulant permutation matrix parameters properly,the number of cycles having a given length in the Tanner graph of the constructed long codes were equal to or less than that of the short code.Either regular or irregular LDPC codes were constructed.Simulation results show that the LDPC codes constructed by this method have very low error-floor and almost no performance degradation due to their special structure as compared with random LDPC codes.

Journal of Tsinghua University(Science and Technology)Jan 1, 20070 citations

Construction of Quasi-cycle Low-density Parity-check Codes with Low Complexity Degree

Haiyan Cao

Based on the structure of parity-check matrix of RU algorithm,a class of Quasi-cycle Low-density Parity-check(QC-LDPC) codes with complexity is constructed by selecting sub-matrices reasonably to restrict and consisting of lower dual diagonal matrices.Simulation results show that not only the proposed codes have lower complexity,but also the error-correcting performance is better than QC-LDPC codes randomly constructed and practical Block-LDPC codes in the additive white Gaussion noise channel.It can get 0.3 dB Signal to Noise Ratio(SNR) gain at a Bit Error Rate(BRE) of 10-6.

Jisuanji gongchengJan 1, 20110 citations