• 제목/요약/키워드: Orthogonal Matrix

검색결과 268건 처리시간 0.021초

Quasi-Orthogonal Space-Time Block Codes Designs Based on Jacket Transform

  • Song, Wei;Lee, Moon-Ho;Matalgah, Mustafa M.;Guo, Ying
    • Journal of Communications and Networks
    • /
    • 제12권3호
    • /
    • pp.240-245
    • /
    • 2010
  • Jacket matrices, motivated by the complex Hadamard matrix, have played important roles in signal processing, communications, image compression, cryptography, etc. In this paper, we suggest a novel approach to design a simple class of space-time block codes (STBCs) to reduce its peak-to-average power ratio. The proposed code provides coding gain due to the characteristics of the complex Hadamard matrix, which is a special case of Jacket matrices. Also, it can achieve full rate and full diversity with the simple decoding. Simulations show the good performance of the proposed codes in terms of symbol error rate. For generality, a kind of quasi-orthogonal STBC may be similarly designed with the improved performance.

Understanding of unsteady pressure fields on prisms based on covariance and spectral proper orthogonal decompositions

  • Hoa, Le Thai;Tamura, Yukio;Matsumoto, Masaru;Shirato, Hiromichi
    • Wind and Structures
    • /
    • 제16권5호
    • /
    • pp.517-540
    • /
    • 2013
  • This paper presents applications of proper orthogonal decomposition in both the time and frequency domains based on both cross spectral matrix and covariance matrix branches to analyze multi-variate unsteady pressure fields on prisms and to study spanwise and chordwise pressure distribution. Furthermore, modification of proper orthogonal decomposition is applied to a rectangular spanwise coherence matrix in order to investigate the spanwise correlation and coherence of the unsteady pressure fields. The unsteady pressure fields have been directly measured in wind tunnel tests on some typical prisms with slenderness ratios B/D=1, B/D=1 with a splitter plate in the wake, and B/D=5. Significance and contribution of the first covariance mode associated with the first principal coordinates as well as those of the first spectral eigenvalue and associated spectral mode are clarified by synthesis of the unsteady pressure fields and identification of intrinsic events inside the unsteady pressure fields. Spanwise coherence of the unsteady pressure fields has been mapped the first time ever for better understanding of their intrinsic characteristics.

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

  • 이미성;이문호;박주용
    • 대한전자공학회논문지TC
    • /
    • 제47권7호
    • /
    • pp.93-101
    • /
    • 2010
  • 본 논문에서는 GF(2)에서의 두 생성다항식에 의해 생성된 M-sequence로 Gold-Sequence를 생성한 후, Permutation을 해줌으로써 Hadamard 행렬의 특성을 가지게 됨을 살펴보았다. M-sequence는 선형 귀환 천이 레지스터 부호 생성기(Linear feedback shift register code generator)에 의해 생성되었으며, 두 개의 M-sequence에 의해 생성된 Gold-sequence의 첫 열에 $8\times1$의 영행렬을 추가하고 Permutation을 시켜줌으로써 Hadamard 행렬의 주요 성질인 직교성(Orthogonal)과 한 행렬과 이 행렬의 Transpose시킨 행렬의 결과가 단위행렬이 되고, 역행렬은 element-wise Inverse가 되며, 고속 Jacket행렬의 성질을 만족한다. 또한 선형 귀환 축차 생성기를 통하여 생성된 M-sequence의 1행과 1열을 추가함으로써 위에서 언급한 Hadamard 행렬의 주요 성질을 만족하고 L-matrix 와 S-matrix 를 통하여 고속변환이 가능함을 보인다.

Research on Camouflaged Encryption Scheme Based on Hadamard Matrix and Ghost Imaging Algorithm

  • Leihong, Zhang;Yang, Wang;Hualong, Ye;Runchu, Xu;Dawei, Zhang
    • Current Optics and Photonics
    • /
    • 제5권6호
    • /
    • pp.686-698
    • /
    • 2021
  • A camouflaged encryption scheme based on Hadamard matrix and ghost imaging is proposed. In the process of the encryption, an orthogonal matrix is used as the projection pattern of ghost imaging to improve the definition of the reconstructed images. The ciphertext of the secret image is constrained to the camouflaged image. The key of the camouflaged image is obtained by the method of sparse decomposition by principal component orthogonal basis and the constrained ciphertext. The information of the secret image is hidden into the information of the camouflaged image which can improve the security of the system. In the decryption process, the authorized user needs to extract the key of the secret image according to the obtained random sequences. The real encrypted information can be obtained. Otherwise, the obtained image is the camouflaged image. In order to verify the feasibility, security and robustness of the encryption system, binary images and gray-scale images are selected for simulation and experiment. The results show that the proposed encryption system simplifies the calculation process, and also improves the definition of the reconstructed images and the security of the encryption system.

근사직교블럭화를 평가하기 위한 측도 (Measures for Evaluating Nearly Orthogonal Blocking)

  • 장대흥
    • 응용통계연구
    • /
    • 제15권1호
    • /
    • pp.179-186
    • /
    • 2002
  • 반응표면분석시 모든 실험이 동일한 조건 하에서 이루어지어야 하는 데 그렇지 못할 경우 우리는 블럭화를 행하게 된다. 반응 표면분석모형으로서 우리는 주로 2차 모형을 사용한다. 본 논문은 우리가 반응표면분석모형으로서 2차 모형을 사용할 때 근사직교블럭화를 평가하기 위한 간단한 측도들을 제시한다.

AN ITERATIVE METHOD FOR ORTHOGONAL PROJECTIONS OF GENERALIZED INVERSES

  • Srivastava, Shwetabh;Gupta, D.K.
    • Journal of applied mathematics & informatics
    • /
    • 제32권1_2호
    • /
    • pp.61-74
    • /
    • 2014
  • This paper describes an iterative method for orthogonal projections $AA^+$ and $A^+A$ of an arbitrary matrix A, where $A^+$ represents the Moore-Penrose inverse. Convergence analysis along with the first and second order error estimates of the method are investigated. Three numerical examples are worked out to show the efficacy of our work. The first example is on a full rank matrix, whereas the other two are on full rank and rank deficient randomly generated matrices. The results obtained by the method are compared with those obtained by another iterative method. The performance measures in terms of mean CPU time (MCT) and the error bounds for computing orthogonal projections are listed in tables. If $Z_k$, k = 0,1,2,... represents the k-th iterate obtained by our method then the sequence of the traces {trace($Z_k$)} is a monotonically increasing sequence converging to the rank of (A). Also, the sequence of traces {trace($I-Z_k$)} is a monotonically decreasing sequence converging to the nullity of $A^*$.

3차원 직조형 금속복합재료의 제조와 특성분석 (Fabrication and Characterization of Al Matrix Composites Reinforced with 3-D Orthogonal Carbon Textile Preforms)

  • 이상관;변준형;홍순형
    • 한국복합재료학회:학술대회논문집
    • /
    • 한국복합재료학회 2002년도 춘계학술발표대회 논문집
    • /
    • pp.188-191
    • /
    • 2002
  • 3-D orthogonal woven carbon/Al composites were fabricated using a pressure infiltration casting method. Especially, to minimize geometrical deformation of fiber pattern and $Al_4C_3$ formation, the process parameters of the minimum pressurizing force, melting temperature, delay and holding time of molten aluminum pressurizing was optimized through the PC-controlled monitoring system. Resonant ultrasound spectroscopy (RUS) was utilized to measure the effective elastic constants of 3-D orthogonal woven carbon/Al composites. The CTE measurement was conducted using strain gages in a heating oven.

  • PDF

Jacket 행렬의 성질과 특성 (Properties and Characteristics of Jacket Matrices)

  • 양재승;박주용;이문호
    • 한국인터넷방송통신학회논문지
    • /
    • 제15권3호
    • /
    • pp.25-33
    • /
    • 2015
  • 양면을 뒤집어 입을 수 있는 Jacket처럼, 내부 및 외부 양 쪽 모두 호환이 가능한 행렬을 Jacket 행렬이라 한다. element-wise inverse와 block-wise inverse 과정을 통해 Jacket 행렬은 안 쪽 요소와 바깥쪽 요소 모두를 가진다. 이 개념은 1989년에 저자 중 한 명인 이문호 교수에 의해 이루어진 것으로서, 2000년에는 최종적으로 Jacket 행렬이라 부르게 되었다. 이것은 잘 알려진 Hadamard 행렬의 가장 일반적인 확장으로서, 직교와 비직교 행렬에 대한 성질을 포함하고 있다. Jacket 행렬은 정보 및 통신 분야 이론의 많은 문제들을 해석하는데 이용된다. 본 논문에서는 Jacket 행렬의 성질과 특성, 예를 들어 determinants와 eigenvalues, Kronecker product에 대해서 다룬다. 이 연산들은 신호 처리와 직교 코드 디자인에 매우 유용하다. 또한, 본 논문은 복잡성이 낮은 매우 간단한 수학적 모델을 통해 이들의 유용성을 계산한 결과를 제시한다.

A Study on Circular Filtering in Orthogonal Transform Domain

  • Song, Bong-Seop;Lee, Sang-Uk
    • Journal of Electrical Engineering and information Science
    • /
    • 제1권2호
    • /
    • pp.125-133
    • /
    • 1996
  • In this paper, we dicuss on the properties related to the circular filtering in orthogonal transform domain. The efficient filtering schemes in six orthogonal transform domains are presented by generalizing the convolution-multiplication property of the DFT. In brief, the circular filtering can be accomplished by multiplying the transform domain filtering matrix W, which is shown to be very sparse, yielding the computational gains compared with the time domain processing. As an application, decimation and interpolation techniques in orthogonal transform domains are also investigated.

  • PDF

UNIVARIATE TRUNCATED MOMENT PROBLEMS VIA WEAKLY ORTHOGONAL POLYNOMIAL SEQUENCES

  • Seonguk Yoo
    • East Asian mathematical journal
    • /
    • 제40권1호
    • /
    • pp.25-36
    • /
    • 2024
  • Full univariate moment problems have been studied using continued fractions, orthogonal polynomials, spectral measures, and so on. On the other hand, the truncated moment problem has been mainly studied through confirming the existence of the extension of the moment matrix. A few articles on the multivariate moment problem implicitly presented about some results of this note, but we would like to rearrange the important results for the existence of a representing measure of a moment sequence. In addition, new techniques with orthogonal polynomials will be introduced to expand the means of studying truncated moment problems.