Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

A Fast Multiple-Source Detection and Localization Array Signal Processing Algorithm Using the Spatial Filtering and ML Approach

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Tadaion, A.A. ; Dept. of Electr. Eng., Yazd Univ ; Derakhtian, M. ; Gazor, S. ; Aref, M.R.

We propose a computationally efficient algorithm for detection of multiple signals that also gives a rough estimation of their direction of arrivals (DOAs). The narrowband received signals from a uniform linear array are first filtered by a set of orthogonal filters, e.g., by a fast Fourier transformation, in order to separate the sources into multiple spatial intervals. This transformation converts the complicated multihypothesis problem of source detection and localization into multiple binary hypothesis testing problems. For an additive white Gaussian noise (AWGN) environment, the maximum-likelihood (ML) solution of these interrelated tests requires substantially less computational complexity than that of the multihypothesis problem. For each spatial interval, a binary test detects the presence of a single source and thus gives a rough localization. We employ generalized-likelihood ratio (GLR) tests as the detection criterion, assuming that the number of sources, their power, and the noise variance are all unknown. We also show that the optimal uniformly most powerful invariant (UMPI) detector does not exist. However, we derive a UMPI detector that uses some extra information and as a result provides an upper bound performance for evaluation of any invariant detector. Simulations illustrate that the proposed noniterative GLR test performs efficiently for various number of observed data snapshots and signal-to-noise-ratios (SNR)s, and its performance is comparable to the upper bound performance. We used the proposed algorithm for the initialization of the iterative implementation of the standard ML localization. This combination is a high-resolution localization algorithm with a low computational complexity

Published in:

Signal Processing, IEEE Transactions on  (Volume:55 ,  Issue: 5 )