The DOA Estimation of Multiple Signals based on Weighting MUSIC Algorithm

Similar documents
Direction of Arrival Estimation Method in Underdetermined Condition Zhang Youzhi a, Li Weibo b, Wang Hanli c

Beamforming Based on Suppression Transforming Error for Array Interpolation

Direct Position Determination Algorithm Based on Multi-array in the Presence of Gain-phase Errors

DIRECTION OF ARRIVAL ESTIMATION

Complex Algorithms for Lattice Adaptive IIR Notch Filter

Sparsity Enhanced Beamforming in The Presence of Coherent Signals

Random Variables, Sampling and Estimation

Estimation of Backward Perturbation Bounds For Linear Least Squares Problem

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity

RAINFALL PREDICTION BY WAVELET DECOMPOSITION

Topic 9: Sampling Distributions of Estimators

Orthogonal Gaussian Filters for Signal Processing

Sensitivity Analysis of Daubechies 4 Wavelet Coefficients for Reduction of Reconstructed Image Error

Topic 9: Sampling Distributions of Estimators

ECE 901 Lecture 12: Complexity Regularization and the Squared Loss

Run-length & Entropy Coding. Redundancy Removal. Sampling. Quantization. Perform inverse operations at the receiver EEE

Spectral Partitioning in the Planted Partition Model

Topic 9: Sampling Distributions of Estimators

A statistical method to determine sample size to estimate characteristic value of soil parameters

BIOINF 585: Machine Learning for Systems Biology & Clinical Informatics

Self-normalized deviation inequalities with application to t-statistic

A new iterative algorithm for reconstructing a signal from its dyadic wavelet transform modulus maxima

Rank Modulation with Multiplicity

OPTIMAL PIECEWISE UNIFORM VECTOR QUANTIZATION OF THE MEMORYLESS LAPLACIAN SOURCE

Sparse Bayesian Learning Using Approximate Message Passing

Binary codes from graphs on triples and permutation decoding

Modified Ratio Estimators Using Known Median and Co-Efficent of Kurtosis

Linear Algebra Issues in Wireless Communications

Formation of A Supergain Array and Its Application in Radar

A New Class of Ternary Zero Correlation Zone Sequence Sets Based on Mutually Orthogonal Complementary Sets

Signal Processing in Mechatronics

Topics in Eigen-analysis

PAPER : IIT-JAM 2010

Invariability of Remainder Based Reversible Watermarking

R. van Zyl 1, A.J. van der Merwe 2. Quintiles International, University of the Free State

CHAPTER 4 BIVARIATE DISTRIBUTION EXTENSION

Machine Learning for Data Science (CS4786) Lecture 4

MODEL CHANGE DETECTION WITH APPLICATION TO MACHINE LEARNING. University of Illinois at Urbana-Champaign

(7 One- and Two-Sample Estimation Problem )

Chapter If n is odd, the median is the exact middle number If n is even, the median is the average of the two middle numbers

Information-based Feature Selection

DISTRIBUTION LAW Okunev I.V.

Research Article Health Monitoring for a Structure Using Its Nonstationary Vibration

Last time: Moments of the Poisson distribution from its generating function. Example: Using telescope to measure intensity of an object

OFDM Precoder for Minimizing BER Upper Bound of MLD under Imperfect CSI

THE KALMAN FILTER RAUL ROJAS

Confidence interval for the two-parameter exponentiated Gumbel distribution based on record values

c 2006 Society for Industrial and Applied Mathematics

ECON 3150/4150, Spring term Lecture 3

Session 5. (1) Principal component analysis and Karhunen-Loève transformation

Reliability model of organization management chain of South-to-North Water Diversion Project during construction period

The z-transform. 7.1 Introduction. 7.2 The z-transform Derivation of the z-transform: x[n] = z n LTI system, h[n] z = re j

A note on the modified Hermitian and skew-hermitian splitting methods for non-hermitian positive definite linear systems

Riesz-Fischer Sequences and Lower Frame Bounds

Factor Analysis. Lecture 10: Factor Analysis and Principal Component Analysis. Sam Roweis

Estimation of Population Mean Using Co-Efficient of Variation and Median of an Auxiliary Variable

Variable selection in principal components analysis of qualitative data using the accelerated ALS algorithm

Mathematical Statistics - MS

A THRESHOLD DENOISING METHOD BASED ON EMD

Minimum Dominating Set Approach to Analysis and Control of Biological Networks

Stochastic Matrices in a Finite Field

CSE 527, Additional notes on MLE & EM

The target reliability and design working life

Linear Regression Demystified

The AMSU Observation Bias Correction and Its Application Retrieval Scheme, and Typhoon Analysis

Frequency Domain Filtering

Some Explicit Formulae of NAF and its Left-to-Right. Analogue Based on Booth Encoding

17. Joint distributions of extreme order statistics Lehmann 5.1; Ferguson 15

Lecture 2: Monte Carlo Simulation

The improvement of the volume ratio measurement method in static expansion vacuum system

For a 3 3 diagonal matrix we find. Thus e 1 is a eigenvector corresponding to eigenvalue λ = a 11. Thus matrix A has eigenvalues 2 and 3.

OBJECTIVES. Chapter 1 INTRODUCTION TO INSTRUMENTATION FUNCTION AND ADVANTAGES INTRODUCTION. At the end of this chapter, students should be able to:

Free Space Optical Wireless Communications under Turbulence Channel Effect

6. Kalman filter implementation for linear algebraic equations. Karhunen-Loeve decomposition

Summary: CORRELATION & LINEAR REGRESSION. GC. Students are advised to refer to lecture notes for the GC operations to obtain scatter diagram.

1 Inferential Methods for Correlation and Regression Analysis

Study on Coal Consumption Curve Fitting of the Thermal Power Based on Genetic Algorithm

Continuous Data that can take on any real number (time/length) based on sample data. Categorical data can only be named or categorised

Excellent Performances of The Third-level Disturbed Chaos in The Cryptography Algorithm and The Spread Spectrum Communication

MOMENT-METHOD ESTIMATION BASED ON CENSORED SAMPLE

Polynomial Functions and Their Graphs

The Local Harmonious Chromatic Problem

Bayesian Methods: Introduction to Multi-parameter Models

TEACHER CERTIFICATION STUDY GUIDE

arxiv: v1 [math.fa] 3 Apr 2016

x c the remainder is Pc ().

Interval Intuitionistic Trapezoidal Fuzzy Prioritized Aggregating Operators and their Application to Multiple Attribute Decision Making

Filter banks. Separately, the lowpass and highpass filters are not invertible. removes the highest frequency 1/ 2and

577. Estimation of surface roughness using high frequency vibrations

TR/46 OCTOBER THE ZEROS OF PARTIAL SUMS OF A MACLAURIN EXPANSION A. TALBOT

Erick L. Oberstar Fall 2001 Project: Sidelobe Canceller & GSC 1. Advanced Digital Signal Processing Sidelobe Canceller (Beam Former)

Bounds for the Extreme Eigenvalues Using the Trace and Determinant

Discrete Orthogonal Moment Features Using Chebyshev Polynomials

Chapter 12 EM algorithms The Expectation-Maximization (EM) algorithm is a maximum likelihood method for models that have hidden variables eg. Gaussian

Confidence Interval for Standard Deviation of Normal Distribution with Known Coefficients of Variation

Estimation of the Mean and the ACVF

Assumptions. Motivation. Linear Transforms. Standard measures. Correlation. Cofactor. γ k

Lecture 8: October 20, Applications of SVD: least squares approximation

Overview. p 2. Chapter 9. Pooled Estimate of. q = 1 p. Notation for Two Proportions. Inferences about Two Proportions. Assumptions

Numerical Solution of the Two Point Boundary Value Problems By Using Wavelet Bases of Hermite Cubic Spline Wavelets

Transcription:

, pp.10-106 http://dx.doi.org/10.1457/astl.016.137.19 The DOA Estimatio of ultiple Sigals based o Weightig USIC Algorithm Chagga Shu a, Yumi Liu State Key Laboratory of IPOC, Beijig Uiversity of Posts ad Telecommuicatios, Beijig 100876, Chia a bupt_scg@163.com Abstract. The classical USIC algorithm does some preprocessig of the sigal covariace matrix by eigevalue decompositio, ad the two orthogoal subspaces called sigal subspace ad oise subspace are divided. Thus the effect of evirometal oise is limited to a certai extet. With the decrease of the sigal agle iterval ad the sigal-oise ratio, the classical USIC algorithm has certai limitatios i multiple sigals estimatio such as loss ad cofusio, which meas the method of estimatio is uable to distiguish those sigals we eed. To this problem, a modified USIC algorithm is proposed. By itroducig a weightig fuctio i the spatial spectrum, some weighted operatio are give to the steerig vectors i USIC spatial spectrum, makig the most of subspaces ad there eigevalues. The subsequet simulatios are take to verify that uder the coditio of a small sigal agle iterval ad a low sigal-oise ratio, the improved algorithm could provide a better sigal resolutio ad offer more accurate estimated results tha the classical. Keywords: USIC algorithm, weightig fuctio, eigevalue decompositio. 1 Itroductio ultiple sigal classificatio algorithm [1] (USIC) is oe of the methods about array sigal processig [-4]. This algorithm has a good performace of sigal estimatio, for istace, a sigificat estimatio variace which is close to the cramer-rao boud ad a moderate computatioal work. Takig eigevalue decompositio [5] (EVD) with the covariace matrix which is made up of array sigals, the two subspaces called sigal subspace ad oise subspace are divided ad the orthogoality betwee them is utilized to build the spatial spectrum which iclude the sigal parameters, such as Directio of Arrival [6,7] (DOA) ad locatio. The classical USIC algorithm has certai limitatios i DOA estimatio especially i multiple sigals estimatio. Whe the several icidet agles of sigals are close, the divisio of subspaces appears blurred which causes a certai loss ad cofusio of sigal parameters. To get more accurate iformatio about target azimuth, some improvemets are put forward. A ovel weightig fuctio W is itroduced to the USIC spatial spectrum. By some weighted operatio to the steerig vectors i spatial ISSN: 87-133 ASTL Copyright 016 SERSC

spectrum, the improved algorithm could provide a better oise suppressio ad more accurate estimated results. Research ethod Cosider a uiform liear array (ULA) for the coveiece purpose. Some array parameters are give. The umber of array elemets is. The spacig betwee two adjacet elemets is d 0.5, where is the carrier wavelegth. Suppose that there are N ( N ) far-field arrowbad sigals arrive at the ULA with a agle, as show i Fig.1. Fig.1. Uiform liear array The evirometal parameters are also give. Suppose that there is a zero mea ad the variace Gaussia white oise (GWN) i the eviromet, havig o correlatio with the sigals moitored. The data received by array elemets ca be expressed as, X ( t) AS( t) N( t) (1) Where A [ ( 1), ( ),, ( N )] deotes the array maifold matrix, deotes the steerig vector. S( t) [ s 1( t), s( t),, s ( )] T N t j si( ) / j ( 1)si( ) / ( ) [1, e i,, e i ] i deotes the vector of source waveforms, N( t) [ 1( t), ( t),, ( )] T t deotes the vector of oise received by array elemets. Some coditios should be satisfied before we use USIC algorithm to estimate the sigal parameters. First, the umber of array elemets should be more tha the sigal umber. The, the steerig vectors made up by sigals with differet icidet agles are idepedet. Also, a o-sigular matrix for covariace matrix is ecessary. The last, the evirometal oise should satisfy the coditio as follow, Copyright 016 SERSC 103

E{ i ( t)} 0 E{ i( t) i ( t)} T E{ i( t) i ( t)} 0 Cosider a covariace matrix of array sigals R X, take eigevalue decompositio ad arrage the eigevalues from large to small, The we get 1 N N 1 (3) R U U U U (4) X s s s Where Us [ u1, u un] deotes the sigal subspace, correspodig to the N large eigevalues of s diag{ 1,, N}. U [ un 1, un, u ] deotes the oise subspace, correspodig to the N small eigevalues of diag{,, }. Whe k N 1,,, N1 N To come to this case, we get, Further, RX k kuk uk R AR A I u X k ( S ) k AR A u S k 1 Auk () (5) 0 (6) 0 (7) N1 AU N( - N ) 0 (8) From the formula above we kow that the array maifold ad oise subspace have orthogoality. It is worth otig that the sigal subspace is spaed by the steerig vector of array maifold. We ca cosider that the sigal subspace ad oise subspace satisfy the orthogoal coditio, marked spau s spau. The the spatial spectrum of USIC is costructed as follow, P ( ) 1 ( ) U U a( ) (9) USIC a The scaig the spatial spectrum withi the searchig scope, the N icidet agles will be foud. The steps of algorithm are as follows, 1. Accordig to the data received by array, calculate the covariace matrix R.. Do eigevalue decompositio with R, get the eigevalues ad correspodig eigevectors 104 Copyright 016 SERSC

3. Determie the sigal umbers ad divide the sigal subspace U s ad ocie subspace U. 4. Costruct the spatial spectrum of USIC algorithm P USIC, search the spectral peaks ad fid the icidet agles of sigals. To get more accurate iformatio about target azimuth, some improvemets are put forward. I classical USIC algorithm, if the umber of sigals we estimated is error, the oise subspace divided is ot i coformity with the actual, leadig to a big error eve a failed DOA estimatio, especially i the case of a small SNR. A advisable method is that all the characteristic vectors of the sigal covariace matrix are cosidered ad a ovel weightig should be take to the characteristic vectors. After this, the proper weight coefficiet will reduce the effect of sigal eigevectors ad the oise eigevectors are etirely used. The ovel weightig fuctio W is itroduced to the USIC spatial spectrum, the the spatial spectrum chages as, P q 1 0 0 0 q 0 0 0 W 0 0 q 0 0 (10) 1 a ( ) Uˆ Uˆ WUˆ Uˆ a( ) (11) USIC N N N N I the formula above, i, i 1,, is the eigevalues of the array covariace matrix. q 0 is a customized parameter. Differet W causes differet estimatio performace. Whe W is a uit matrix, that meas a uiform weightig is selected to the eigevectors, which evolve ito a classical W e e, where 1 [1,0,,0] T e L belogs to a vector of algorithm. Whe 1 1 oise subspaces, the miimum ier product algorithm correspod. 3 Coclusio This article proposes the cyclic cross correlatio USIC algorithm to estimate multiple sigals with less array elemets. Simulatio results show that the cyclic cross correlatio USIC algorithm ca provide a better estimatio performace especially whe the sigals umber is more tha the array elemets. This algorithm has a better oise suppressio ad a larger array aperture tha the stadard, havig a certai referece value. Copyright 016 SERSC 105

Ackowledgemets. The author ackowledges the fudig of followig sciece foudatio: Natioal Natural Sciece Foudatio of Chia (Grat Nos. 6090808, 60971068, 10979065, ad 617501) Refereces 1. Schmidt, R.: ultiple emitter locatio ad sigal parameter estimatio [J]. IEEE trasactios o Ateas ad Propagatio, (1986), 34(3): 76-80. Kim, J.., Lee, O.K., Ye, J.C.: Compressive USIC: Revisitig the Lik betwee Compressive Sesig ad Array Sigal Processig [J]. IEEE trasactios o iformatio theory, (01) vol.58, o.1, pp: 78-301. 3. Tweg, R., Porat, B.: Numerical optimizatio method for array sigal processig [J]. IEEE trasactios o aerospace ad electroic systems, (1999) vol.35, o., pp: 549-565. 4. Otterste, B., Stoica, P., Roy, R.: Covariace matchig estimatio techiques for array sigal processig applicatios [J]. Digital sigal processig, (1998) vol.8, o.3, pp: 185-10. 5. Jeffers, R., Bell, K.L., Va,.L.: Trees. Broadbad passive rage estimatio usig USIC [C]. IEEE Iteratioal Coferece o Acoustics, Speech ad Sigal Processig, (00) vol.3, pp: 91-94. 6. Becheikh,. L., Wag, Y.: Joit DOD-DOA estimatio usig combied ESPRIT- USIC approach i IO radar [J]. Electroics Letters, (010) vol.46, o. 15, pp: 1081-108. 7. Li, J.-D., Fag, W.-., Wag, Y.Y.: FSF USIC for joit DOA ad frequecy estimatio ad its performace aalysis [J]. IEEE Trasactios o sigal processig, (006) vol.54, o. 1, pp: 459-454. 106 Copyright 016 SERSC