Title :
Optimal dimension reduction for sensor array signal processing
Author_Institution :
Dept. of Electr. Eng., Linkoping Univ., Sweden
Abstract :
The computational complexity for direction-of-arrival estimation using sensor arrays increases very rapidly with the number of sensors in the array. One way to lower the amount of computations is to employ some kind of reduction of the data dimension. This is usually accomplished by employing linear transformations for mapping full-dimension data into a lower-dimensional space. In the present work, a transformation matrix is derived, that makes it possible to attain the full-dimension Cramer-Rao bound also in the reduced space. A bound on the dimension of the reduced data set is given, above which it is always possible to obtain the same accuracy for the lower-dimension estimates of the source localizations as that achievable by using the full-dimension data. Furthermore, a method is devised for designing the transformation matrix
Keywords :
computational complexity; matrix algebra; parameter estimation; signal processing; transforms; computational complexity; direction-of-arrival estimation; full-dimension Cramer-Rao bound; lower-dimensional space; optimal dimension reduction; reduced space; sensor array signal processing; transformation matrix; Additive noise; Array signal processing; Computational complexity; Direction of arrival estimation; Electrostatic precipitators; Geometry; Sensor arrays; Signal design; Signal processing algorithms; Signal to noise ratio;
Conference_Titel :
Signals, Systems and Computers, 1991. 1991 Conference Record of the Twenty-Fifth Asilomar Conference on
Conference_Location :
Pacific Grove, CA
Print_ISBN :
0-8186-2470-1
DOI :
10.1109/ACSSC.1991.186580