2014
DOI: 10.1587/transcom.e97.b.2110
|View full text |Cite
|
Sign up to set email alerts
|

DOA Estimation for Multi-Band Signal Sources Using Compressed Sensing Techniques with Khatri-Rao Processing

Abstract: SUMMARYMuch attention has recently been paid to direction of arrival (DOA) estimation using compressed sensing (CS) techniques, which are sparse signal reconstruction methods. In our previous study, we developed a method for estimating the DOAs of multi-band signals that uses CS processing and that is based on the assumption that incident signals have the same complex amplitudes in all the bands. That method has a higher probability of correct estimation than a single-band DOA estimation method using CS. In th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
13
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 17 publications
(13 citation statements)
references
References 18 publications
0
13
0
Order By: Relevance
“…On the other hand, the array input along the X-axis is also IEICE Communications Express, Vol. , [1][2][3][4][5][6] given by,…”
Section: System Descriptionmentioning
confidence: 99%
See 2 more Smart Citations
“…On the other hand, the array input along the X-axis is also IEICE Communications Express, Vol. , [1][2][3][4][5][6] given by,…”
Section: System Descriptionmentioning
confidence: 99%
“…Since the computation for matrix inversion of H is the most dominant in HQR, its complexity is compared. Suppose the complexity order of Gaussian elimination based matrix inversion, straightforward 2D-DOA estimation requires O((L θ × L ϕ ) 3 ) whereas the proposed method can reduce it to O((L θ + L ϕ ) 3 ). These operations must be repeated until the convergence condition is satisfied.…”
Section: System Descriptionmentioning
confidence: 99%
See 1 more Smart Citation
“…Note that the problem of l 0 ‐minimisation is non‐deterministic polynomial‐hard and l 0 ‐norm in (4) can be transformed into l 1 ‐norm. The signal reconstruction can be solved as the following problem: argminbold-italicααtrue2.470em2.470emtrue∥11ems.t.1emy=AαThe problem in (5) is convex, and the available methods are convex optimisation algorithms [28, 29], such as the BP algorithm. However, the conditions that guarantee l 0 ‐minimisation and l 1 ‐minimisation are not always satisfied [30].…”
Section: Theoretical Analysismentioning
confidence: 99%
“…To find the virtual elements and extend the array aperture, the KR subspace approach [11], [24] is applied. By using this approach, we can extend the DOFs of the NSCA and be able to perform underdetermined DOA estimation.…”
Section: Nested Sparse Circular Arraymentioning
confidence: 99%