469 research outputs found
Cognitive Sub-Nyquist Hardware Prototype of a Collocated MIMO Radar
We present the design and hardware implementation of a radar prototype that
demonstrates the principle of a sub-Nyquist collocated multiple-input
multiple-output (MIMO) radar. The setup allows sampling in both spatial and
spectral domains at rates much lower than dictated by the Nyquist sampling
theorem. Our prototype realizes an X-band MIMO radar that can be configured to
have a maximum of 8 transmit and 10 receive antenna elements. We use frequency
division multiplexing (FDM) to achieve the orthogonality of MIMO waveforms and
apply the Xampling framework for signal recovery. The prototype also implements
a cognitive transmission scheme where each transmit waveform is restricted to
those pre-determined subbands of the full signal bandwidth that the receiver
samples and processes. Real-time experiments show reasonable recovery
performance while operating as a 4x5 thinned random array wherein the combined
spatial and spectral sampling factor reduction is 87.5% of that of a filled
8x10 array.Comment: 5 pages, Compressed Sensing Theory and its Applications to Radar,
Sonar and Remote Sensing (CoSeRa) 201
Spatial Compressive Sensing for MIMO Radar
We study compressive sensing in the spatial domain to achieve target
localization, specifically direction of arrival (DOA), using multiple-input
multiple-output (MIMO) radar. A sparse localization framework is proposed for a
MIMO array in which transmit and receive elements are placed at random. This
allows for a dramatic reduction in the number of elements needed, while still
attaining performance comparable to that of a filled (Nyquist) array. By
leveraging properties of structured random matrices, we develop a bound on the
coherence of the resulting measurement matrix, and obtain conditions under
which the measurement matrix satisfies the so-called isotropy property. The
coherence and isotropy concepts are used to establish uniform and non-uniform
recovery guarantees within the proposed spatial compressive sensing framework.
In particular, we show that non-uniform recovery is guaranteed if the product
of the number of transmit and receive elements, MN (which is also the number of
degrees of freedom), scales with K(log(G))^2, where K is the number of targets
and G is proportional to the array aperture and determines the angle
resolution. In contrast with a filled virtual MIMO array where the product MN
scales linearly with G, the logarithmic dependence on G in the proposed
framework supports the high-resolution provided by the virtual array aperture
while using a small number of MIMO radar elements. In the numerical results we
show that, in the proposed framework, compressive sensing recovery algorithms
are capable of better performance than classical methods, such as beamforming
and MUSIC.Comment: To appear in IEEE Transactions on Signal Processin
Target Estimation in Colocated MIMO Radar via Matrix Completion
We consider a colocated MIMO radar scenario, in which the receive antennas
forward their measurements to a fusion center. Based on the received data, the
fusion center formulates a matrix which is then used for target parameter
estimation. When the receive antennas sample the target returns at Nyquist
rate, and assuming that there are more receive antennas than targets, the data
matrix at the fusion center is low-rank. When each receive antenna sends to the
fusion center only a small number of samples, along with the sample index, the
receive data matrix has missing elements, corresponding to the samples that
were not forwarded. Under certain conditions, matrix completion techniques can
be applied to recover the full receive data matrix, which can then be used in
conjunction with array processing techniques, e.g., MUSIC, to obtain target
information. Numerical results indicate that good target recovery can be
achieved with occupancy of the receive data matrix as low as 50%.Comment: 5 pages, ICASSP 201
- …