• Title/Summary/Keyword: permutation matrix

Search Result 58, Processing Time 0.025 seconds

Eigenvalues of Non-Sylvester Hadamard Matrices Constructed by Monomial Permutation Matrices (단항순열행렬에 의해 구성된 비실베스터 하다마드 행렬의 고유치)

  • Lee Seung-Rae;No Jong-Seon;Sung Koeng-Mo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.4C
    • /
    • pp.434-440
    • /
    • 2006
  • In this paper, the eigenvalues of various non-Sylvester Hadamard matrices constructed by monomial permutation matrices are derived, which shows the relation between the eigenvalues of the newly constructed matrix and Sylvester Hadamard matrix.

Permutation Algorithm for fast Hadamard Transform (고속하다마드 변환을 위한 치환기법)

  • Nam, Ji-Tak;Park, Jin-Bae;Choi, Yun-Ho;Joo, Young-Hoon
    • Proceedings of the KIEE Conference
    • /
    • 1997.07b
    • /
    • pp.616-619
    • /
    • 1997
  • The spectrum-recovery scheme in Hadamard transform spectroscopy is commonly implemented with a fast Hadamard transform (FHT). When the Hadamard or simplex matrix corresponding to the mask does not have the same ordering as the Hadamard matrix corresponding to the FHT, a modification is required. When the two Hadamard matrices are in the same equivalence class, this modification can be implemented as a permutation scheme. This paper investigates permutation schemes for this application. This paper is to relieve the confusion about the applicability of existing techniques, reveals a new, more efficient method: and leads to an extension that allows a permutation scheme to be applied to any Hadamard or simplex matrix in the appropriate equivalence class.

  • PDF

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.

Consistency Test in the House of Quality using Permutation Test (순열검정을 이용한 품질의 집의 일관성 검정)

  • Kim, Kyungmee O.
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.34 no.1
    • /
    • pp.42-48
    • /
    • 2008
  • The house of quality (HOQ) involves subjective and ambiguous information typically through a likert scale, It isimportant to validate consistency of such input in the HOQ before rating the fmal importance of technicalrequirements, Previously, a methodology was developed to test the consistency of relationship strengths in theHOQ between roof matrix and relationship matrix. We described disadvantages of the previous method andpropose a new approach based on the permutation test. Advantages of the proposed method are illustrated withan example.

GENERALIZED ALTERNATING SIGN MATRICES AND SIGNED PERMUTATION MATRICES

  • Brualdi, Richard A.;Kim, Hwa Kyung
    • Journal of the Korean Mathematical Society
    • /
    • v.58 no.4
    • /
    • pp.921-948
    • /
    • 2021
  • We continue the investigations in [6] extending the Bruhat order on n × n alternating sign matrices to our more general setting. We show that the resulting partially ordered set is a graded lattice with a well-define rank function. Many illustrative examples are given.

On Fast M-Gold Hadamard Sequence Transform (고속 M-Gold-Hadamard 시퀀스 트랜스폼)

  • Lee, Mi-Sung;Lee, Moon-Ho;Park, Ju-Yong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.47 no.7
    • /
    • pp.93-101
    • /
    • 2010
  • In this paper we generate Gold-sequence by using M-sequence which is made by two primitive polynomial of GF(2). Generally M-sequence is generated by linear feedback shift register code generator. Here we show that this matrix of appropriate permutation has Hadamard matrix property. This matrix proves that Gold-sequence through two M-sequence and additive matrix of one column has one of major properties of Hadamard matrix, orthogonal. and this matrix show another property that multiplication with one matrix and transpose matrix of this matrix have the result of unit matrix. Also M-sequence which is made by linear feedback shift register gets Hadamard matrix property mentioned above by adding matrices of one column and one row. And high-speed conversion is possible through L-matrix and the S-matrix.

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.

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.

A NOTE ON FLIP SYSTEMS

  • Lee, Sung-Seob
    • Honam Mathematical Journal
    • /
    • v.29 no.3
    • /
    • pp.341-350
    • /
    • 2007
  • A dynamical system with a skew-commuting involution map is called a flip system. Every flip system on a subshift of finite type is represented by a pair of matrices, one of which is a permutation matrix. The transposition number of this permutation matrix is studied. We define an invariant, called the flip number, that measures the complexity of a flip system, and prove some results on it. More properties of flips on subshifts of finite type with symmetric adjacency matrices are investigated.

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