• Title/Summary/Keyword: circulant permutation matrix

Search Result 6, Processing Time 0.02 seconds

A Design of ALT LDPC Codes Using Circulant Permutation Matrices (순환 치환 행렬을 이용한 ALT LDPC 부호의 설계)

  • Lee, Kwang-Jae
    • 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.

Efficient design of LDPC code Using circulant matrix and eIRA code (순환 행렬과 eIRA 부호를 이용한 효율적인 LDPC 부호화기 설계)

  • Bae Seul-Ki;Kim Joon-Sung;Song Hong-Yeop
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.2C
    • /
    • pp.123-129
    • /
    • 2006
  • In this paper, we concentrate on reducing the complexity for efficient encoder. We design structural LDPC code using circulant matrix and permutation matrix and eIRA code. It is possible to design low complex encoder by using shift register and differential encoder and interleaver than general LDPC encoder that use matrix multiplication operation. The code designed by this structure shows similar performance as random code. And the proposed codes can considerably reduce a number of XOR gates.

Fast Multi-Rate LDPC Encoder Architecture for WiBro System (WiBro 시스템을 위한 고속 LDPC 인코더 설계)

  • Kim, Jeong-Ki;S.P., Balakannan;Lee, Moon-Ho
    • 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.

A study on the structure of concordance matrices of Li type PBIB designs ($L_i$ 계획에서 조화행렬의 구조에 관한 연구)

  • 배종성
    • 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.

  • PDF

An F-LDPC Codes Based on Jacket Pattern (재킷 패턴 기반의 F-LDPC 부호)

  • Lee, Kwang-Jae;Kang, Seung-Son
    • 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.

Efficient Design of Structured LDPC Codes (구조적 LDPC 부호의 효율적인 설계)

  • Chung Bi-Woong;Kim Joon-Sung;Song Hong-Yeop
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.1C
    • /
    • pp.14-19
    • /
    • 2006
  • The high encoding complexity of LDPC codes can be solved by designing structured parity-check matrix. If the parity-check matrix of LDPC codes is composed of same type of blocks, decoder implementation can be simple, this structure allow structured decoding and required memory for storing the parity-check matrix can be reduced largely. In this parer, we propose a construction algorithm for short block length structured LDPC codes based on girth condition, PEG algorithm and variable node connectivity. The code designed by this algorithm shows similar performance to other codes without structured constraint in low SNR and better performance in high SNR than those by simulation