• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.1
• /
• pp.117-124
• /
• 2012

In this paper, we propose a simple H parity check matrix from the CPM(circulant permutation matrix), which can easily avoid the cycle-4, and approach to flexible code rates and lengths. As a result, the operations of the submatrices will become the multiplications between several CPMs, the calculations of the LDPC(low density parity check) encoding could be simplest. Also we consider the fast encoding problem for LDPC codes. The proposed constructions could lead to fast encoding based on the simplest matrices operations for both regular and irregular LDPC codes.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.11
• /
• pp.36-42
• /
• 2010

This paper presents a hybrid approach to the construction of quasi-cyclic (QC) low-density parity-check (LDPC) codes based on parallel bundles in Euclidean geometries and circulant permutation matrices. Codes constructed by this method are shown to be regular with large girth and low density. Simulation results show that these codes perform very well with iterative decoding and achieve reasonably large coding gains over uncoded system.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.7
• /
• pp.1-8
• /
• 2008

Low Density Parity Check codes(LDPC) are recently focused on communication systems due to its good performance. The standard of WiBro has also included LDPC codes as a channel coding. The weak point of implementation for LDPC encoder is that conventional binary Matrix Vector Multiplier has many clock cycles which limit throughput. In this paper, we propose semi-parallel architecture by using cyclic shift registers and exclusive-OR without conventional Matrix Vector Multipliers over the standard parity check matrices with Circulant Permutation Matrices(CPM). Furthermore, multi-rate encoder is designed by using proposed architecture. Our encoder with multi-rate for IEEE 802.16e LDPC has lower clock cycles and higher throughput.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.9 no.4
• /
• pp.403-408
• /
• 2014

In this paper, we consider the encoding scheme of low density codes. In particular, we propose the fast encoding algorithm of the low density codes using circulant permutation matrices, The fast encoding algorithm is similar to the fast Hadamard transform, and the results show that the proposed scheme is a simple and fast encoding algorithm of the low density codes.

• The Korean Journal of Applied Statistics
• /
• v.7 no.2
• /
• pp.289-297
• /
• 1994

A block design will be said to have Property C if the concordance matrix can be expressed as a linear combination of Kronecker product of permutation matrices. No matrix inversions are necessary for the intrablock analysis of the block designs which possesses the Property C(Paik, 1985). In this paper, in order to show the Li type PBIB designs possesses the Property C, we suggest the structure of the concordance matrices of Li type PBIB designs are multi-nested block circulant pattern.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.2
• /
• pp.317-325
• /
• 2012

In this paper, we consider the encoding scheme of Low Density Parity Check codes. In particular, using the Jacket Pattern and circulant permutation matrices, we propose the simple encoding scheme of Richardson's lower triangular matrix. These encoding scheme can be extended to a flexible code rate. Based on the simple matrix process, also we can design low complex and simple encoders for the flexible code rates.