Abstract

Two direction finding algorithms are presented for nonGaussian signals, which are based on the fourth-order cumulants of the data received by the array. The first algorithm is similar to MUSIC, while the second is asymptotically minimum variance in a certain sense. The first algorithm requires singular value decomposition of the cumulant matrix, while the second is based on nonlinear minimization of a certain cost function. The performance of the minimum variance algorithm can be assessed by analytical means, at least for the case of discrete probability distributions of the source signals and spatially uncorrelated Gaussian noise. The numerical experiments performed seem to confirm the insensitivity of these algorithms to the (Gaussian) noise parameters.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Keywords

AlgorithmMathematicsHigher-order statisticsSingular value decompositionGaussianGaussian noiseNoise (video)Computer scienceSignal processingApplied mathematicsArtificial intelligence

Affiliated Institutions

Related Publications

Publication Info

Year
1991
Type
article
Volume
39
Issue
9
Pages
2016-2024
Citations
297
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

297
OpenAlex

Cite This

B. Porat, B. Friedlander (1991). Direction finding algorithms based on high-order statistics. IEEE Transactions on Signal Processing , 39 (9) , 2016-2024. https://doi.org/10.1109/78.134434

Identifiers

DOI
10.1109/78.134434