2015
DOI: 10.1109/jsen.2015.2428814
|View full text |Cite
|
Sign up to set email alerts
|

Low-Complexity Range-Azimuth FMCW Radar Sensor Using Joint Angle and Delay Estimation Without SVD and EVD

Abstract: A low complexity range-azimuth frequencymodulated continuous-waveform (FMCW) radar sensor using joint angle and delay estimation method without singular value decomposition (SVD) and eigenvalue decomposition (EVD) is presented in this paper. Conventional joint angle and delay estimation techniques exploit the dual-shift-invariant structure of received signals through matrix decompositions, such as SVD and EVD, which increases the computational burden. The proposed method utilizes the dual-shift-invariant struc… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
40
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
6
1
1

Relationship

2
6

Authors

Journals

citations
Cited by 50 publications
(44 citation statements)
references
References 35 publications
0
40
0
Order By: Relevance
“…show deteriorated performance in the SNR range below 5 dB when the number of targets is unknown [24].…”
Section: Liturature Study and Problem Formulationmentioning
confidence: 99%
See 1 more Smart Citation
“…show deteriorated performance in the SNR range below 5 dB when the number of targets is unknown [24].…”
Section: Liturature Study and Problem Formulationmentioning
confidence: 99%
“…In FMCW radar systems, beat signals convey range and angle information, which enables to estimate the azimuth, elevation, range, and velocity of unknown targets via joint parameter estimation techniques such as 2D-MUSIC, 2D-ESPRIT, JADE, and multidimensional Capon [24]. However, such multi-dimensional sub-space techniques increased the computational complexity quite a lot, which needs to be considered in a real-time FMCW automotive radar system.…”
Section: Liturature Study and Problem Formulationmentioning
confidence: 99%
“…Then, it satisfies [ 21 ] where T denotes full rank M by M transformation matrix. From U s , the pairs of sub-matrices such that { U s, 0 , U s, 1 }, { U s,X _0 , U s,X _1 }, and { U s,Y _0 , U s,Y _1 } can be defined such that …”
Section: Proposed Algorithmmentioning
confidence: 99%
“…In order to make it easy to understand the proposed 3D estimation algorithm in Section 4, the conventional 1D [23] and 2D [24] super-resolution algorithms by using correlation matrix are introduced in this section.…”
Section: Conventional Algorithmsmentioning
confidence: 99%