Cramer-Rao bound of spatio-temporal linear pre-processing in parameter estimation from sensor array

被引:4
作者
Sellone, F [1 ]
Falletti, E [1 ]
机构
[1] Politecn Torino, Dipartimento Elettron, Smart Ant Grp Polito, I-10129 Turin, Italy
关键词
Cramer-Rao bound; parameter estimation; DOA; spatio-temporal linear pre-processing; rank-deficient pre-processing; full and partial estimation problem;
D O I
10.1016/j.sigpro.2003.11.002
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The knowledge of the Cramer-Rao bound (CRB) for a given estimation problem not only gives a lower bound on the covariance matrix of any unbiased estimator applied to a set of observed data, but it can represent a mean for testing the suitability of given signal structures to provide the necessary information to the parameter estimation. An interesting problem is the evaluation of the CRB in the presence of pre-processing applied to the experimental data. It has been demonstrated that, in general, a linear pre-processing matrix multiplied "on the left-hand side" of the experimental data matrix (left pre-processing) can degrade the performance of any parameter estimator, unless the left pre-processing matrix fulfills proper constraints for the invariance of the pre-processors. This paper is aimed at discussing the performance degradation in parameter estimation due to pre-processing matrices applied "on the right-hand side" of the data matrix (right pre-processing), since this problem seems not to have received the due attention up to this moment, despite this kind of linear pre-processing often occurs in several application contexts in the field of the communications. The paper derives an expression of the deterministic CRB giving a very interesting insight on the structure of the processing matrices, providing the proof that a rank-deficient and/or not orthogonal matrix achieves the same CRB attainable through its full-rank and orthogonalized portion. Furthermore, the conditions upon which the formulation of the CRB for the pre-processed data corresponds to the CRB expression for the unprocessed data are expressed, giving the hypotheses that guarantee any linear pre-processor to be invariant. In order to give practical examples of the meaning and use of the pre-processing approach considered in the paper, some receiving techniques developed for direct sequence code division multiple access systems are briefly investigated and their performance in the context of the direction-of-arrival estimation are discussed on the basis of the CRB of the problem. (C) 2003 Elsevier B.V. All rights reserved.
引用
收藏
页码:387 / 405
页数:19
相关论文
共 35 条
[1]   ON OPTIMAL DIMENSION REDUCTION FOR SENSOR ARRAY SIGNAL-PROCESSING [J].
ANDERSON, S .
SIGNAL PROCESSING, 1993, 30 (02) :245-256
[2]   OPTIMAL DIMENSION REDUCTION FOR ARRAY PROCESSING-GENERALIZED [J].
ANDERSON, S ;
NEHORAI, A .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1995, 43 (08) :2025-2027
[3]   SIGNAL-PROCESSING APPLICATIONS OF OBLIQUE PROJECTION OPERATORS [J].
BEHRENS, RT ;
SCHARF, LL .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1994, 42 (06) :1413-1424
[4]   ASYMPTOTIC RESULTS FOR MAXIMUM-LIKELIHOOD-ESTIMATION WITH AN ARRAY OF SENSORS [J].
BENITZ, GR .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (04) :1374-1385
[5]   DIRECTION FINDING USING NOISE COVARIANCE MODELING [J].
FRIEDLANDER, B ;
WEISS, AJ .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1995, 43 (07) :1557-1567
[6]   Stochastic Cramer-Rao bound for direction estimation in unknown noise fields [J].
Gershman, AB ;
Stoica, P ;
Pesavento, M ;
Larsson, EG .
IEE PROCEEDINGS-RADAR SONAR AND NAVIGATION, 2002, 149 (01) :2-8
[7]  
Golub G. H., 1996, MATRIX COMPUTATIONS
[8]   LOWER BOUNDS FOR PARAMETRIC-ESTIMATION WITH CONSTRAINTS [J].
GORMAN, JD ;
HERO, AO .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1990, 36 (06) :1285-1301
[9]  
Harville D.A, 1997, MATRIX ALGEBRA STATI
[10]  
HASSELL CZW, 1998, 1998 IEEE GLOB TEL C, V1