DocumentCode
2027627
Title
Robust array processing detectors in dependent noise
Author
Ketel, Mohammed ; Kurz, Ludwik
Author_Institution
Polytech. Univ., Brooklyn, NY, USA
Volume
4
fYear
1993
fDate
27-30 April 1993
Firstpage
49
Abstract
The theory of m-interval partitioning is extended and applied to the problem of sequentially detecting weak signals in time-dependent noise by using an array of sensors. Each sample vector of the data is transformed, via a suboptimum projection, into a single variable with univariate distribution upon which the sequential test is applied. The recursive evaluation of the projected data can reduce the complexity and the time to decision of the sequential detector considerably. The resultant array processor is easily implemented and is adaptable to slowly changing noise conditions.<>
Keywords
array signal processing; computational complexity; noise; signal detection; time-varying systems; array processing detectors; complexity; m-interval partitioning; sequential test; suboptimum projection; time to decision; time-dependent noise; univariate distribution;
fLanguage
English
Publisher
ieee
Conference_Titel
Acoustics, Speech, and Signal Processing, 1993. ICASSP-93., 1993 IEEE International Conference on
Conference_Location
Minneapolis, MN, USA
ISSN
1520-6149
Print_ISBN
0-7803-7402-9
Type
conf
DOI
10.1109/ICASSP.1993.319591
Filename
319591
Link To Document