• Title/Summary/Keyword: unitary matrix

Search Result 44, Processing Time 0.024 seconds

A Channel State Information Feedback Method for Massive MIMO-OFDM

  • Kudo, Riichi;Armour, Simon M.D.;McGeehan, Joe P.;Mizoguchi, Masato
    • Journal of Communications and Networks
    • /
    • v.15 no.4
    • /
    • pp.352-361
    • /
    • 2013
  • Combining multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) with a massive number of transmit antennas (massive MIMO-OFDM) is an attractive way of increasing the spectrum efficiency or reducing the transmission energy per bit. The effectiveness of Massive MIMO-OFDM is strongly affected by the channel state information (CSI) estimation method used. The overheads of training frame transmission and CSI feedback decrease multiple access channel (MAC) efficiency and increase the CSI estimation cost at a user station (STA). This paper proposes a CSI estimation scheme that reduces the training frame length by using a novel pilot design and a novel unitary matrix feedback method. The proposed pilot design and unitary matrix feedback enable the access point (AP) to estimate the CSI of the signal space of all transmit antennas using a small number of training frames. Simulations in an IEEE 802.11n channel verify the attractive transmission performance of the proposed methods.

LEAST SQUARES SOLUTIONS OF THE MATRIX EQUATION AXB = D OVER GENERALIZED REFLEXIVE X

  • Yuan, Yongxin
    • Journal of applied mathematics & informatics
    • /
    • v.26 no.3_4
    • /
    • pp.471-479
    • /
    • 2008
  • Let $R\;{\in}\;C^{m{\times}m}$ and $S\;{\in}\;C^{n{\times}n}$ be nontrivial unitary involutions, i.e., $R^*\;=\;R\;=\;R^{-1}\;{\neq}\;I_m$ and $S^*\;=\;S\;=\;S^{-1}\;{\neq}\;I_m$. We say that $G\;{\in}\;C^{m{\times}n}$ is a generalized reflexive matrix if RGS = G. The set of all m ${\times}$ n generalized reflexive matrices is denoted by $GRC^{m{\times}n}$. In this paper, an efficient method for the least squares solution $X\;{\in}\;GRC^{m{\times}n}$ of the matrix equation AXB = D with arbitrary coefficient matrices $A\;{\in}\;C^{p{\times}m}$, $B\;{\in}\;C^{n{\times}q}$and the right-hand side $D\;{\in}\;C^{p{\times}q}$ is developed based on the canonical correlation decomposition(CCD) and, an explicit formula for the general solution is presented.

  • PDF

Partly Random Multiple Weighting Matrices Selection for Orthogonal Random Beamforming

  • Tan, Li;Li, Zhongcai;Xu, Chao;Wang, Desheng
    • Journal of Communications and Networks
    • /
    • v.18 no.6
    • /
    • pp.892-901
    • /
    • 2016
  • In the multi-user multiple-input multiple-output (MIMO) system, orthogonal random beamforming (ORBF) scheme is proposed to serve multiple users simultaneously in order to achieve the multi-user diversity gain. The opportunistic space-division multiple access system (OSDMA-S) scheme performs multiple weighting matrices during the training phase and chooses the best weighting matrix to be used to broadcast data during the transmitting phase. The OSDMA-S scheme works better than the original ORBF by decreasing the inter-user interference during the transmitting phase. To save more time in the training phase, a partly random multiple weighting matrices selection scheme is proposed in this paper. In our proposed scheme, the Base Station does not need to use several unitary matrices to broadcast pilot symbol. Actually, only one broadcasting operation is needed. Each subscriber generates several virtual equivalent channels with a set of pre-saved unitary matrices and the channel status information gained from the broadcasting operation. The signal-to-interference and noise ratio (SINR) of each beam in each virtual equivalent channel is calculated and fed back to the base station for the weighting matrix selection and multi-user scheduling. According to the theoretical analysis, the proposed scheme relatively expands the transmitting phase and reduces the interactive complexity between the Base Station and subscribers. The asymptotic analysis and the simulation results show that the proposed scheme improves the throughput performance of the multi-user MIMO system.

A fast M-band discrete wavelet transform algorithm using factorization of lossless matrix when the length of bases equals to 2M (기저의 길이 L=2M인 경우 무손실 행렬의 분해를 이용한 고속 M-대역 이산 웨이브렛 변환 알고리즘)

  • 권상근;이동식
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.12
    • /
    • pp.2706-2713
    • /
    • 1997
  • The fast implementation algorithm of M-band discrete wavelet transform is propsed using the factorization of lossless matrix when the length of discrete orthogonal wavelet bases equals to 2M. In computational complexity when direct filtering method is employed, the number of multiplicationand addition is (2M$^{2}$) and (2M$^{2}$ -M), respectively. But by proposed algorithm, it can be reduced to (M$^{2}$+M) and (M$^{2}$+2M-1), respectively. and it is possible to reduce the compuatational complexity further when unitary matrix employed to design the discrete or thogonal wavelet basis has the fast algorithm.

  • PDF

A METHOD FOR SOLVING OF LINEAR SYSTEM WITH NORMAL COEFFICIENT MATRICES

  • KAMALVAND, M.GHASEMI;FARAZMANDNIA, B.;ALIYARI, M.
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.24 no.3
    • /
    • pp.305-320
    • /
    • 2020
  • This study aims to generalize MINRES-N2 method [1]. It means that we tend to obtain an algorithm to transfer each normal matrix - that its eigenvalues belong to an algebraic curve of low degree k- to its condensed form through using a unitary similarity transformation. Then, we aim to obtain a method to solve a system of linear equations that its coefficient matrix is equal to such a matrix by utilizing it. Finally this method is compared to the well-known GMRES method through using numerical examples. The results obtained through examples show that the given method is more efficient than GMRES.

A FAMILY RESOLVENT COCYCLE AND HIGHER SPECTRAL FLOW

  • Sun, Aihui;Wang, Jian;Wang, Yong
    • Bulletin of the Korean Mathematical Society
    • /
    • v.54 no.4
    • /
    • pp.1387-1407
    • /
    • 2017
  • In this paper, we introduce a family resolvent cocycle and express the Chern Character of Dai-Zhang higher spectral flow as a pairing of a family resolvent cocycle and the odd Chern character of a unitary matrix, which generalize the odd index formula of Carey et al. to the family case.

Function Embedding and Projective Measurement of Quantum Gate by Probability Amplitude Switch (확률진폭 스위치에 의한 양자게이트의 함수 임베딩과 투사측정)

  • Park, Dong-Young
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.12 no.6
    • /
    • pp.1027-1034
    • /
    • 2017
  • In this paper, we propose a new function embedding method that can measure mathematical projections of probability amplitude, probability, average expectation and matrix elements of stationary-state unit matrix at all control operation points of quantum gates. The function embedding method in this paper is to embed orthogonal normalization condition of probability amplitude for each control operating point into a binary scalar operator by using Dirac symbol and Kronecker delta symbol. Such a function embedding method is a very effective means of controlling the arithmetic power function of a unitary gate in a unitary transformation which expresses a quantum gate function as a tensor product of a single quantum. We present the results of evolutionary operation and projective measurement when we apply the proposed function embedding method to the ternary 2-qutrit cNOT gate and compare it with the existing methods.

Spatial Spectrum Estimation of Broadband Incoherent Signals using Rotation of Signal Subspace Via Signal Enhancement (신호부각에 의한 신호 부공간 회전을 이용한 광대역 인코히어런트 신호의 공간 스펙트럼 추정)

  • 김영수;이계산;김정근
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.15 no.7
    • /
    • pp.669-676
    • /
    • 2004
  • In this paper, a new algorithm is proposed for resolving multiple broadband incoherent sources incident on a uniform linear array. The proposed method dose not require any initial estimates for finding the transformation matrix, while the Coherent Signal-Subspace Method(CSM) proposed by Wang and Kaveh requires preliminary estimates of multigroup source location. An effective procedure is derived for finding the enhanced spectral density matrix at the center frequency using signal enhancement approach and then constructing a common signal subspace by selecting a unitary transformation matrix which is obtained via rotation of signal subspace method. The proposed approach is found to provide superior performance relative to that obtained with the CSM method in terms of sample bias of direction-of-arrival estimates.

A Novel Visual Servoing Method Using QR Decomposition and Disturbance Observer (QR분해와 외란관측기를 이용한 시각구동 방법)

  • 이준수;서일홍;유범재;오상록
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.6 no.6
    • /
    • pp.462-470
    • /
    • 2000
  • This paper proposes a visual servoing method based on QR decomposition and disturbance observer. The QR decomposition factors the image feature Jacobian into a unitary matrix and an upper triangular matrix. And it is shown that several performance indices such as measurement sensitivity of visual features, sensitivity of the control to noise and controllability can be improved for any general image feature Jacobian by QR decomposition and disturbance observer. To show the validity of the proposed approach, visual servoing with stereo vision is carried out for a Samsung FARAMAN 6-axis industrial robot manipulator.

  • PDF

Robust Observer Design for Multi-Output Systems Using Eigenstructure Assignment (고유구조 지정을 이용한 다중출력 시스템의 강인한 관측기 설계)

  • Huh, Kun-Soo;Nam, Joon-Chul
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.28 no.11
    • /
    • pp.1621-1628
    • /
    • 2004
  • This paper proposes a design methodology for the robust observer using the eigenstructure assignment in multi-output systems so that the observer is less sensitive to the ill-conditioning factors such as unknown initial estimation error, modeling error and measurement bias in transient and steady-state observer performance. The robustness of the observer can be achieved by selecting the desired eigenvector matrix to have a small condition number that guarantees the small upper bound of the estimation error. So the left singular vectors of the unitary matrix spanned by space of the achievable eigenvectors are selected as a desired eigenvectors. Also, this paper proposes how to select the desired eigenvector based on the measure of observability and designs the observer with small gain. An example of a spindle drive system is simulated to validate the robustness to the ill-conditioning factors in the observer performance.