• Title/Summary/Keyword: Subspace Estimation

Search Result 100, Processing Time 0.034 seconds

MUSIC-Based Direction Finding through Simple Signal Subspace Estimation (간단한 신호 부공간 추정을 통한 MUSIC 기반의 효과적인 도래방향 탐지)

  • Choi, Yang-Ho
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.48 no.4
    • /
    • pp.153-159
    • /
    • 2011
  • The MUSIC (MUltiple SIgnal Classification) method estimates the directions of arrival (DOAs) of the signals impinging on a sensor array based on the fact that the noise subspace is orthogonal to the signal subspace. In the conventional MUSIC, an estimate of the basis for the noise subspace is obtained by eigendecomposing the sample matrix, which is computationally expensive. In this paper, we present a simple DOA estimation method which finds an estimate of the signal subspace basis directly from the columns of the sample matrix from which the noise power components are removed. DOA estimates are obtained by searching for minimum points of a cost function which is defined using the estimated signal subspace basis. The minimum points are efficiently found through the Brent method which employs parabolic interpolation. Simulation shows that the simple estimation method virtually has the same performance as the complex conventional method based on the eigendecomposition.

Performance Analysis of Blind Channel Estimation for Precoded Multiuser Systems

  • Xu, Zhengyuan
    • Journal of Communications and Networks
    • /
    • v.4 no.3
    • /
    • pp.189-198
    • /
    • 2002
  • Precoder has been shown to be able to provide source diversity and design flexibility. In this paper we employ precoding techniques for block transmission based on a multirate filterbank structure. To accommodate multiuser communication with variable data rates, different precoders with corresponding coefficients and up/down sampling rates are used. However, due to unknown multipath distortion, different interferences may exist in the received data, such as multiuser interference, intersymbol interference and interblock interference. To estimate channel parameters for a desired user, we employ all structured signature waveforms associated with different symbols of that user and apply subspace techniques. Therefore better performance of channel estimator can be achieved than the conventional subspace method based only on the signature of the current symbol. The delay for that user can also be jointly estimated. Channel identifiability conditions and asymptotic channel estimation error are investigated in detail. Numerical examples are provided to justify the proposed method. gest either multicode (MC) or multiple processing gain (MPG) mechanism [2], while requiring data rates to be integral multiples of some basic low-rate. In order to support variable rate transmission however, a comprehensive scheme needs to be investigated.

Efficient DOA Estimation of Coherent Signals Using ESPRIT (ESPRIT을 이용한 효율적인 코히런트 신호의 도래각 추정)

  • Choi, Yang-Ho
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.49 no.9
    • /
    • pp.164-171
    • /
    • 2012
  • ESPRIT(Estimation of Signal Parameter via Rotational Invariance Techniques) estimates DOAs(directions of arrival) of the incident signals on a sensor array by exploiting the shift invariance between its two subarrays. This paper suggests an efficient DOA estimation method based on ESPRIT when coherent signals impinge on the sensor array. When applying ESPRIT, it is necessary to find a signal subspace. Though the widely known SS(spatial smoothing) method allows us to obtain a signal subspace in the presence of coherent signals, its computational complexity is very high. Recently a CV(correlation vector) based method has been presented which is computationally simple. However, the number of resolvable signals in the method is smaller than that in the SS based method when multiple coherent signal groups are present. The proposed method in this paper, which obtains a signal subspace by utilizing only part of the correlation matrix, significantly reduces the computational complexity as compared with the SS based one, while the former is resolving the same number of coherent signals as the latter,

Time-Delay Estimation in the Multi-Path Channel based on Maximum Likelihood Criterion

  • Xie, Shengdong;Hu, Aiqun;Huang, Yi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.4
    • /
    • pp.1063-1075
    • /
    • 2012
  • To locate an object accurately in the wireless sensor networks, the distance measure based on time-delay plays an important role. In this paper, we propose a maximum likelihood (ML) time-delay estimation algorithm in multi-path wireless propagation channel. We get the joint probability density function after sampling the frequency domain response of the multi-path channel, which could be obtained by the vector network analyzer. Based on the ML criterion, the time-delay values of different paths are estimated. Considering the ML function is non-linear with respect to the multi-path time-delays, we first obtain the coarse values of different paths using the subspace fitting algorithm, then take them as an initial point, and finally get the ML time-delay estimation values with the pattern searching optimization method. The simulation results show that although the ML estimation variance could not reach the Cramer-Rao lower bounds (CRLB), its performance is superior to that of subspace fitting algorithm, and could be seen as a fine algorithm.

A Subspace-based Array Shape Estimation Method Using Nearfield Source Model (근거리 신호 모델을 이용한 부공간 근사 기반의 어레이 형상 추정 기법)

  • 박희영;오원천;강현우;윤대희;이충용
    • The Journal of the Acoustical Society of Korea
    • /
    • v.23 no.2
    • /
    • pp.125-133
    • /
    • 2004
  • Most of the way shape estimation method using reference sources assume that the reference sources are in the farfield. That is, the reference sources are assumed to be far from the array. However, in applications of the array with reference sources, the reference sources are not far from the way, so that in practical ocean environments, the conventional method using farfield source model fail to estimate the positions of the hydrophones. In this paper, based on the nearfield source model, a subspace-based array shape estimation method was proposed. In the proposed method, nearfield reference source is modeled using the differential time delay at each hydrophone, and nearfield parameters are derived. Using these parameters, a subspace-based array shape estimation method that generalizes the existing farfield subspace fitting method which can work regardless of the range of the source is proposed. The Cramer-Rao lower bound for the proposed method is investigated. The results of the numerical experiments indicate that the proposed method performs well in estimating the shape of a perturbed way regardless of the ranges of the reference sources.

Soft Sensor Design Using Image Analysis and its Industrial Applications Part 1. Estimation and Monitoring of Product Appearance (화상분석을 이용한 소프트 센서의 설계와 산업응용사례 1. 외관 품질의 수치적 추정과 모니터링)

  • Liu, J. Jay
    • Korean Chemical Engineering Research
    • /
    • v.48 no.4
    • /
    • pp.475-482
    • /
    • 2010
  • In this work, soft sensor based on image anlaysis is proposed for quantitatively estimating the visual appearance of manufactured products and is applied to quality monitoring. The methodology consists of three steps; (1) textural feature extraction from product images using wavelet transform, (2) numerical estimation of the product appearance through projection of the textural features on subspace, and (3) use of latent variables of textural features (i.e., numerical estimates of product appearance). The focus of this approach is on the consistent and quantitative estimation of continuous variations in visual appearance rather than on classification into discrete classes. This approach is illustrated through the application to the estimation and monitoring of the appearance of engineered stone countertops.

Extended PASTd (Projection Approximation Subspace Tracking with Deflation) Algorithm for time-varying DOA estimation (시변 방위 추정을 위한 Extended PASTd (Projection Approximation Subspace Tracking with Deflation) 알고리즘)

  • Lim Jun-Seok;Lee Jong-Myong
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • spring
    • /
    • pp.189-192
    • /
    • 2000
  • 본 논문은 Nonstationary 환경에서 동작하는 소나의 DOA추정의 정확도를 높이기 위하여 가변 망각인자를 도입한 새로운 Extended PASTd (Extended Projection Approximation of Subspace Tracking with deflation) 을 제안하고 기존 알고리즘과 비교함으로써 새로운 알고리즘의 향상된 성능을 보인다.

  • PDF

Determination of flutter derivatives by stochastic subspace identification technique

  • Qin, Xian-Rong;Gu, Ming
    • Wind and Structures
    • /
    • v.7 no.3
    • /
    • pp.173-186
    • /
    • 2004
  • Flutter derivatives provide the basis of predicting the critical wind speed in flutter and buffeting analysis of long-span cable-supported bridges. In this paper, one popular stochastic system identification technique, covariance-driven Stochastic Subspace Identification(SSI in short), is firstly presented for estimation of the flutter derivatives of bridge decks from their random responses in turbulent flow. Secondly, wind tunnel tests of a streamlined thin plate model and a ${\Pi}$ type blunt bridge section model are conducted in turbulent flow and the flutter derivatives are determined by SSI. The flutter derivatives of the thin plate model identified by SSI are very comparable to those identified by the unifying least-square method and Theodorson's theoretical values. As to the ${\Pi}$ type section model, the effect of turbulence on aerodynamic damping seems to be somewhat notable, therefore perhaps the wind tunnel tests for flutter derivative estimation of those models with similar blunt sections should be conducted in turbulent flow.

Estimation of AOA Using WSF for Wireless Communications (무선통신에서 WSF을 이용한 신호 도래각 추정)

  • Kim Suk Chan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.6C
    • /
    • pp.551-559
    • /
    • 2005
  • Estimation of unknown signal parameters with sensor array measurements has been investigated quite extensively. Also, there has been in recent years an explosive increase in the number of mobile users in wireless cellular systems, thus contributing to growing levels of multi-user interference. To overcome this problem, application of adaptive antenna array techniques to further increase the channel capacity has been discussed. In this paper, a new model of locally scattered signals in the vicinity of mobiles is proposed by defining the mean steering vector and is manipulated mathematically for several distributions. Under this model an estimation method of the angle of arrival(AOA) is investigated based on a weighted subspace fitting(WSF) technique. Statistical analysis and simulations are also considered.

An online Calibration Algorithm using binary spreading code for the CDMA-based Adaptive Antenna Array

  • Lee, Chong-Hyun
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.20 no.9
    • /
    • pp.32-39
    • /
    • 2006
  • In this paper, an iterative subspace-based calibration algorithm for a CDMA-based antenna array in the presence of unknown gain and phase error is presented. The algorithm does not depend on the array geometry and does not require a prior knowledge of the Directions Of Arrival (DOA) of the signals. The method requires the code sequence of a reference user only. The proposed algorithm is based on the subspace method and root finding approach, and it provides estimates of the calibration vector, the DOA and the channel impulse response, by using the code sequence of a reference user. The performance of the proposed algorithm was investigated by means of computer simulations and was verified using field data measured through a custom-built W-CDMA test-bed. The data show that experimental results match well with the theoretical calibration algorithm. Also, teh study propose an efficient algorithm using the simulated annealing technique. This algorithm overcomes the requirement of initial guessing in the subspace-based approach.