International Conference on Information Science and Technology 2011
DOI: 10.1109/icist.2011.5765342
|View full text |Cite
|
Sign up to set email alerts
|

On the explanation of spatial smoothing in MUSIC algorithm for coherent sources

Abstract: Direction of arrival algorithms which exploit the eigenstructure of the spatial covariance matrix (such as MUSIC) encounter difficulties in the presence of strongly correlated sources. Since the broadband polynomial MUSIC is an extension of the narrowband version, it is unsurprising that the same issues arise. In this paper, we extend the spatial smoothing technique to broadband scenarios via spatially averaging polynomial space-time covariance matrices. This is shown to restore the rank of the polynomial sour… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
10
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 18 publications
(10 citation statements)
references
References 5 publications
0
10
0
Order By: Relevance
“…The array is perturbed by a combination of three types of imperfections and the strength of the perturbations is set to 0.1. We compare the proposed DNN‐based method with several widely studied subspace‐based alternatives, Akaike information criterion [40], minimum description length [41], Gerschgorin disk estimator (GDE) [42], traditional eigenvalue decomposition (ED) method [43], spatial smoothing rank [44], improved eigenvalue decomposition algorithm [45], and signal subspace matching [46]. In the GDE algorithm, the adjustment factor is set to 0.8.…”
Section: Results and Analysismentioning
confidence: 99%
“…The array is perturbed by a combination of three types of imperfections and the strength of the perturbations is set to 0.1. We compare the proposed DNN‐based method with several widely studied subspace‐based alternatives, Akaike information criterion [40], minimum description length [41], Gerschgorin disk estimator (GDE) [42], traditional eigenvalue decomposition (ED) method [43], spatial smoothing rank [44], improved eigenvalue decomposition algorithm [45], and signal subspace matching [46]. In the GDE algorithm, the adjustment factor is set to 0.8.…”
Section: Results and Analysismentioning
confidence: 99%
“…The number of frequency shifts is fixed per bandwidth and subcarrier spacing based on empirical evaluations in indoor environments. The smoothing subarray size for all cases is set as N ≈ K Ds /2 following insights from [63], [70] and preliminary evaluations. The number of MPCs specified is scaled with bandwidth as higher resolution estimation of the MPC ToFs is possible with higher bandwidths [57].…”
Section: Discussionmentioning
confidence: 99%
“…Typically, preprocessing steps are necessary for estimating the DOA of coherent sources, as the covariance matrix becomes singular and becomes rank deficient, rendering accurate DOA estimation of such signals very difficult [8][9]. Specific approaches, like spatial smoothing, can be employed during the preprocessing phase to enhance the rank of the covariance matrix [10][11][12][13][14][15][16][17], but their performance and computational complexity exhibit much variation. These operations add to the complexity and computation cost of DOA estimation.…”
Section: Figure 1 Some Applications Of Doa Estimationmentioning
confidence: 99%