• Title/Summary/Keyword: 공간 공분산 행렬

Search Result 46, Processing Time 0.026 seconds

Performance Analysis of the Array Shape Estimation Methods Based on the Nearfield Signal Modeling (근거리 신호 모델링을 기반으로 한 어레이 형상 추정 기법들의 성능 분석)

  • Park, Hee-Young;Lee, Chung-Yong
    • The Journal of the Acoustical Society of Korea
    • /
    • v.27 no.5
    • /
    • pp.221-228
    • /
    • 2008
  • To estimate array shape with reference sources in SONAR systems, nearfield signal modeling is required for the reference sources near a towed array. Array shape estimation method based on the nearfield signal modeling generally exploits the spatial covariance matrix of the received reference sources. Among those method, nearfield eigenvector method uses the eigenvector corresponding to the maximum eigenvalue as a steering vector of the reference source. In this paper, we propose a simplified subspace fitting method based on the nearfield signal modeling with spherical wave modeling. Furthermore, we analyze performance of the array shape estimation methods based on the nearfield signal modeling for various environments. The results of the numerical experiments indicate that the simplified subspace fitting method and the nearfield eigenvector method with single reference source shows almost similar performance. Furthermore, the simplified subspace fitting method with 2 reference sources consistently estimates the shape of the array regardless of the incident angle of the reference sources, whereas the nearfield eigenvector method cannot apply for the case of 2 reference sources.

Efficient Speaker Identification based on Robust VQ-PCA (강인한 VQ-PCA에 기반한 효율적인 화자 식별)

  • Lee Ki-Yong
    • Journal of Internet Computing and Services
    • /
    • v.5 no.3
    • /
    • pp.57-62
    • /
    • 2004
  • In this paper, an efficient speaker identification based on robust vector quantizationprincipal component analysis (VQ-PCA) is proposed to solve the problems from outliers and high dimensionality of training feature vectors in speaker identification, Firstly, the proposed method partitions the data space into several disjoint regions by roust VQ based on M-estimation. Secondly, the robust PCA is obtained from the covariance matrix in each region. Finally, our method obtains the Gaussian Mixture model (GMM) for speaker from the transformed feature vectors with reduced dimension by the robust PCA in each region, Compared to the conventional GMM with diagonal covariance matrix, under the same performance, the proposed method gives faster results with less storage and, moreover, shows robust performance to outliers.

  • PDF

An Optimization method of CDHMM using Genetic Algorithms (유전자 알고리듬을 이용한 CDHMM의 최적화)

  • 백창흠
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • 1998.06c
    • /
    • pp.71-74
    • /
    • 1998
  • HMM (hidden Markov model)을 이용한 음성인식은 현재 가장 널리 쓰여지고 있는 방법으로, 이 중 CDHMM (continuous observation density HMM)은 상태에서 관측심볼확률을 연속확률밀도를 사용하여 표현한다. 본 논문에서는 가우스 혼합밀도함수를 사용하는 CDHMM의 상태천이확률과, 관측심볼확률을 표현하기 위한 인자인 평균벡터, 공분산 행렬, 가지하중값을 유전자 알고리듬을 사용하여 최적화하는 방법을 제안하였다. 유전자 알고리듬은 매개변수 최적화문제에 대하여 자연의 진화원리를 모방한 알고리듬으로, 염색체 형태로 표현된 개체군 (population) 중에서 환경에 대한 적합도 (fitness)가 높은 개체가 높은 확률로 살아남아 재생 (reproduction)하게 되며, 교배 (crossover)와 돌연변이 (mutation) 연산 후에 다음 세대 개체군을 형성하게 되고, 이러한 과정을 반복하면서 최적의 개체를 구하게 된다. 본 논문에서는 상태천이확률, 평균벡터, 공분산행렬, 가지하중값을 부동소수점수 (floating point number)의 유전자형으로 표현하여 유전자 알고리듬을 수행하였다. 유전자 알고리듬은 복잡한 탐색공간에서 최적의 해를 찾는데 효과적으로 적용되었다.

  • PDF

A comparison study of Bayesian variable selection methods for sparse covariance matrices (희박 공분산 행렬에 대한 베이지안 변수 선택 방법론 비교 연구)

  • Kim, Bongsu;Lee, Kyoungjae
    • The Korean Journal of Applied Statistics
    • /
    • v.35 no.2
    • /
    • pp.285-298
    • /
    • 2022
  • Continuous shrinkage priors, as well as spike and slab priors, have been widely employed for Bayesian inference about sparse regression coefficient vectors or covariance matrices. Continuous shrinkage priors provide computational advantages over spike and slab priors since their model space is substantially smaller. This is especially true in high-dimensional settings. However, variable selection based on continuous shrinkage priors is not straightforward because they do not give exactly zero values. Although few variable selection approaches based on continuous shrinkage priors have been proposed, no substantial comparative investigations of their performance have been conducted. In this paper, We compare two variable selection methods: a credible interval method and the sequential 2-means algorithm (Li and Pati, 2017). Various simulation scenarios are used to demonstrate the practical performances of the methods. We conclude the paper by presenting some observations and conjectures based on the simulation findings.

A Study on Signal Sub Spatial Method for Removing Noise and Interference of Mobile Target (이동 물체의 잡음과 간섭제거를 위한 신호 부 공간기법에 대한 연구)

  • Lee, Min-Soo
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.8 no.3
    • /
    • pp.224-228
    • /
    • 2015
  • In this paper, we study the method for desired signals estimation that array antennas are received signals. We apply sub spatial method of direction of arrival algorithm and adaptive array antennas in order to remove interference and noise signal of received antenna signals. Array response vector of adaptive array antenna is probability, it is correctly estimation of direction of arrival of targets to update weight signal. Desired signals are estimated updating covariance matrix after moving interference and noise signals among received signals. We estimate signals using eigen decomposition and eigen value, high resolution direction of arrival estimation algorithm is devided signal sub spatial and noise sub spatial. Though simulation, we analyze to compare proposed method with general method.

A Robust Receiver for Generalized Spatial Modulation under Channel Information Errors (채널 정보 오차에 강인한 일반화 공간변조 수신기)

  • Lee, JaeSeong;Woo, DaeWi;Jeon, EunTak;Yoon, SungMin;Lee, Kyungchun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.1
    • /
    • pp.45-51
    • /
    • 2016
  • In this paper, we develop an iterative maximum likelihood (ML) receiver for generalized spatial modulation systems. In the proposed ML receiver, to mitigate the deleterious effect of channel information errors on symbol detection, the instantaneous covariance matrix of effective noise is estimated, which is then used to obtain improved ML solutions. The estimated covariance matrix is updated through multiple iterations to enhance the estimation accuracy. The simulation results show that the proposed ML receiver outperforms the conventional ML detection scheme, which does not take the effect of channel information errors into account.

Low-Complexity Robust ML Signal Detection for Generalized Spatial Modulation (일반화 공간변조를 위한 저복잡도 강인 최대 우도 신호 검파)

  • Kim, Jeong-Han;Yoon, Tae-Seon;Oh, Se-Hoon;Lee, Kyungchun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.3
    • /
    • pp.516-522
    • /
    • 2017
  • In this paper, we propose a maximum likelihood signal detection scheme for a generalized spatial modulation system that activates only a subset of transmit antennas among multiple antennas and transmits information through the indexes of active antennas as well as through the transmit symbols. The proposed maximum likelihood receiver extracts a set of candidate solutions based on their a posteriori probabilities to lower the computational load of the robust receiver under channel information errors. Then, the chosen candidate solutions are exploited to estimate the covariance matrix of effective noise. Simulation results show that the proposed maximum likelihood detection scheme achieves better error performance than a receiver that does not take into account the channel information errors. It is also seen that it reduces the computational complexity with the same bit error rate performance as the conventional robust maximum likelihood receiver.

Forward/Backward First Order Statistics Algorithm for the estimation of DOA in a Multipath environment (다중경로 환경에서 DOA를 추정하기 위한 Forward/Backward First Order Statistics Algorithm)

  • 김한수
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • 1998.06c
    • /
    • pp.221-224
    • /
    • 1998
  • 간섭신호가 원하는 신호에 coherent한 경우에는 원하는 신호와 간섭신호간의 cross correlation에 의해 공분산 행렬의 rank가 줄어들게 되어 coherent한 간섭신호의 도래각을 추정할 수 없게 된다. 이러한 문제를 해결하기 위해 발표된 기존의 방법중 대칭 어레이(Symmetric array)방법은 계산량이 많아지고 공간 스무딩(Spatial Smoothing)방법은 array aperture size에서 손해를 보게 되어 분해능이 떨어지는 단점이 있다[1,2,3].

  • PDF

Subspace-Based Adaptive Beamforming with Off-Diagonal Elements (비 대각요소를 이용한 부공간에서의 적응 빔 형성 기법)

  • Choi Yang-Ho;Eom Jae-Hyuck
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.1A
    • /
    • pp.84-92
    • /
    • 2004
  • Eigenstructure-based adaptive beamfoming has advantages of fast convergence and the insentivity to errors in the arrival angle of the desired signal. Eigen-decomposing the sample matrix to extract a basis for the Sl (signal plus interference) subspace, however, is very computationally expensive. In this paper, we present a simple subspace based beamforming which utilizes off-diagonal elements of the sample matrix to estimate the Sl subspace. The outputs of overlapped subarrays are combined to produce the final adaptive output, which improves SINR (signal-to-interference-plus-noise ratio) comapred to exploiting a single subarray. The proposed adaptive beamformer, which employs an efficient angle estimation is very roubust to errors in both the arrival angles and the number of the incident signals, while the eigenstructure-based beamforer suffers from severe performance degradation.

Fast Monopulse Method Using Noise-Jamming Subspace (재밍 환경에서 잡음 부공간을 이용한 고속 모노펄스 방법)

  • Lim, Jong-Hwan;Kim, Jae-Hak;Yang, Hoon-Gee
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.25 no.3
    • /
    • pp.372-375
    • /
    • 2014
  • A monopulse based on maximum likelihood(ML) in jamming scenario can suppress jamming signal using an inverse matrix of a covariance matrix. In order to achieve adequate suppression of jamming signal, the sufficient number of snapshots is required. However, this is not possible in high PRF scenario, which hinders a real-time tracking. Moreover, even with the large number of snapshots, the estimation accuracy of the target direction is decreased in low JNR(Jammer to Noise Ratio) due to insufficient jammer suppression. In this paper, we propose a monopulse algorithm that doesn't degrade performance significantly with a small number of snapshots and in low JNR. We show its derivation that exploits noise-jammer subspace of a covariance matrix, along with its performance through simulation.