2017
DOI: 10.3390/s17112549
|View full text |Cite
|
Sign up to set email alerts
|

Dimension-Factorized Range Migration Algorithm for Regularly Distributed Array Imaging

Abstract: The two-dimensional planar MIMO array is a popular approach for millimeter wave imaging applications. As a promising practical alternative, sparse MIMO arrays have been devised to reduce the number of antenna elements and transmitting/receiving channels with predictable and acceptable loss in image quality. In this paper, a high precision three-dimensional imaging algorithm is proposed for MIMO arrays of the regularly distributed type, especially the sparse varieties. Termed the Dimension-Factorized Range Migr… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2020
2020

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 20 publications
(22 reference statements)
0
1
0
Order By: Relevance
“…However, this last step is crucial and represents the most time-consuming process in this algorithm, especially for large arrays of unequal sizes where prior zero padding and spatial interpolation are required to work with suitable plane wave grids. Sparse arrays have been implemented in the MIMO systems to mitigate this computational limitation, exploiting the complementary spatial diversities of the transmit and receive arrays to ensure a full k-space coverage [19], [20] enabling the development of appropriate rapid processing techniques in this paper [21]. Furthermore, the recent development of compressive systems allowing for the multiplexing of a very large number of transmitted and received waveforms [14], [22] helped overcoming the hardware limitations inherent to high-resolution systems, leading to a growing need of efficient MIMO algorithms compatible with large and densely populated antenna arrays.…”
Section: Mimo Near-field Imaging Problemmentioning
confidence: 99%
“…However, this last step is crucial and represents the most time-consuming process in this algorithm, especially for large arrays of unequal sizes where prior zero padding and spatial interpolation are required to work with suitable plane wave grids. Sparse arrays have been implemented in the MIMO systems to mitigate this computational limitation, exploiting the complementary spatial diversities of the transmit and receive arrays to ensure a full k-space coverage [19], [20] enabling the development of appropriate rapid processing techniques in this paper [21]. Furthermore, the recent development of compressive systems allowing for the multiplexing of a very large number of transmitted and received waveforms [14], [22] helped overcoming the hardware limitations inherent to high-resolution systems, leading to a growing need of efficient MIMO algorithms compatible with large and densely populated antenna arrays.…”
Section: Mimo Near-field Imaging Problemmentioning
confidence: 99%