Please login using the form on menu list.|
It is required to login for Full-Text PDF.
Proposal of the Fast Kernel MUSIC Algorithm
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Vol.E79-A No.8 pp.1232-1239
Publication Date: 1996/08/20
Print ISSN: 0916-8508
Type of Manuscript: Special Section PAPER (Special Section on Digital Signal Processing)
Full Text: PDF(616.4KB)
It is an important problem in fields of radar, sonar, and so on to estimate parameters of closely spaced multiple signals. The MUSIC algorithm with the forward-backward (FB) spatial smoothing is considered as the most effective technique at present for the problem with coherent signals in a variety of fields. We have applied this in Laser Microvision. Recently, Shimotahira has proposed the Kernel MUSIC algorithm, which is applicable to cases when signal vectors and noise vectors are orthogonal. It also utilizes Gaussian elimination of the covariance matrix instead of eigenvalue analysis to estimate noise vectors. Although the amount of computation by the Kernel MUSIC algorithm became lighter than that of the conventional MUSIC algorithm, the covariance matrix was formed to estimate noise vectors and also all noise vectors were used to analyze the MUSIC eigenspectrum. The heaviest amount of computation in the Kernel MUSIC algorithm exists in the transformation of the covariance matrix and the analysis of the MUSIC eigenspectrum. We propose a more straightforward algorithm to estimate noise vectors without forming a covariance matrix, easier algorithm to analyze the MUSIC eigenspectrum. The superior characteristics will be demonstrated by results of numerical simulation.