DMCA
A Sub-Nyquist Radar Prototype: Hardware and Algorithms (2013)
Citations: | 7 - 5 self |
Citations
1657 | Matching pursuits with time-frequency dictionaries
- Mallat, Zhang
- 1993
(Show Context)
Citation Context ...al-time algorithms have been proposed that can be shown to recover the true sparse vector under appropriate conditions [13]. In our simulations, we use the orthogonal matching pursuit (OMP) algorithm =-=[19, 20]-=-. There have been several other works that employ CS algorithms in the context of radar signal processing such as [21–26]. However, these papers either do not address sample rate reduction and continu... |
1427 | Compressive sampling - Candès - 2006 |
1090 |
Multiple emitter location and signal parameter estimation,” Antennas and Propagation
- Schmidt
- 1986
(Show Context)
Citation Context ...methods, and generally require the measurements to form a consecutive subset of the signal’s Fourier coefficients. An exception is the MUSIC algorithm, which can be applied on any set of coefficients =-=[32]-=-. While these techniques work well at high SNR; their performance deteriorates at low SNR values. In [8] it was suggested to use a nonconsecutive set of Fourier coefficients selected in a distributed ... |
951 |
Communication in the presence of noise
- Shannon
- 1949
(Show Context)
Citation Context ... MF is known to maximize the effective signal-to-noise ratio (SNR). The MF stage is typically carried out digitally, after sampling the detected analog signal. Classic Shannon-Nyquist sampling theory =-=[3]-=- guarantees full recovery of a general bandlimited analog signal from samples taken at twice its baseband bandwidth. However, applying this framework to modern radar systems typically results in extre... |
795 | Signal recovery from random measurements via orthogonal mathching pursuit
- Tropp, Gilbert
(Show Context)
Citation Context ...al-time algorithms have been proposed that can be shown to recover the true sparse vector under appropriate conditions [13]. In our simulations, we use the orthogonal matching pursuit (OMP) algorithm =-=[19, 20]-=-. There have been several other works that employ CS algorithms in the context of radar signal processing such as [21–26]. However, these papers either do not address sample rate reduction and continu... |
347 | Introduction to the non-asymptotic analysis of random matrices
- Vershynin
- 2012
(Show Context)
Citation Context ...stricted isometry property (RIP). Selecting the frequency samples uniformly at random, it is known that if K ≥ CL(log N)4, (6) for some positive constant C, then A obeys the RIP with high probability =-=[33]-=-. In contrast, for consecutive frequency selection the RIP is not generally satisfied, unless the cardinality of κ is significantly increased. However, applying random frequency sampling is not practi... |
338 | Sampling signals with finite rate of innovation
- Vetterli, Marziliano, et al.
(Show Context)
Citation Context ...n that obtained by Nyquist sampling. Related works [6–8] treat ultrasound signal sampling and are readily adapted to the radar scenario. These methods are based on the finite rate of innovation (FRI) =-=[9]-=- and Xampling [10, 11] approaches. The FRI framework treats sampling and recovery of signals characterized by a finite number of degrees of freedom per unit time and is based on connecting sampling th... |
255 | On sparse reconstruction from Fourier and Gaussian measurements
- Rudelson, Vershynin
(Show Context)
Citation Context ...fficiently from random frequency samples in the presence of noise providing theoretical justification to our approach. The use of frequency samples for CS of signals sparse in time is also studied in =-=[16]-=-. In order to choose appropriate frequencies to process we connect our problem to that of beampattern design in array processing, and rely on ideas obtained in that context. In particular, it is known... |
217 |
Using the Matrix Pencil Method to Estimate the Parameters of a Sum of Complex Exponentials
- Sarkar, Pereira
- 1995
(Show Context)
Citation Context ...ion III. The remainder of this section is devoted to reviewing algorithmic approaches for solving (3). B. Recovery Algorithm Many mature techniques for solving (3) exist, including matrix pencil (MP) =-=[31]-=-, annihilating filter [9], and others that can be found in [5]. These algorithms arise from spectral analysis methods, and generally require the measurements to form a consecutive subset of the signal... |
149 | High-resolution radar via compressed sensing - Herman, Strohmer |
132 |
Introduction to Spectral Analysis. Upper Saddle River
- Stoica, Moses
- 1997
(Show Context)
Citation Context ...e parametric problem, from a small number of measurements taken after appropriate analog prefiltering. The estimation problem is solved in the frequency domain using known tools from array processing =-=[5]-=-, with the necessary number of measurements typically much smaller than that obtained by Nyquist sampling. Related works [6–8] treat ultrasound signal sampling and are readily adapted to the radar sce... |
110 | Compresed Sensing: Theory and Applications
- Eldar, Kutyniok
- 2012
(Show Context)
Citation Context ...ch is impractical for real-time applications such as radar sensing. Many polynomial-time algorithms have been proposed that can be shown to recover the true sparse vector under appropriate conditions =-=[13]-=-. In our simulations, we use the orthogonal matching pursuit (OMP) algorithm [19, 20]. There have been several other works that employ CS algorithms in the context of radar signal processing such as [... |
108 | Compressive Radar Imaging - Baraniuk, Steeghs - 2007 |
98 | Structured compressed sensing: From theory to applications - Duarte, Eldar - 2011 |
89 | Theory and implementation of an analog-to-information converter using random demodulation - Laska, Kirolos, et al. - 2007 |
76 |
Fundamentals of Radar Signal Processing
- Richards
- 2005
(Show Context)
Citation Context ...e targets’ location in space and their velocity. Traditional processing methods in both literature and practice involve a preliminary stage, referred to as matched filtering (MF) or pulse compression =-=[1, 2]-=-, in which the transmitted pulse is correlated with the received signal. For the problem of detecting targets in white Gaussian noise, the MF is known to maximize the effective signal-to-noise ratio (... |
65 | Xampling: Analog to digital at sub-Nyquist rates
- Mishali, Eldar
(Show Context)
Citation Context ...y Nyquist sampling. Related works [6–8] treat ultrasound signal sampling and are readily adapted to the radar scenario. These methods are based on the finite rate of innovation (FRI) [9] and Xampling =-=[10, 11]-=- approaches. The FRI framework treats sampling and recovery of signals characterized by a finite number of degrees of freedom per unit time and is based on connecting sampling theory with array proces... |
65 |
Noise Figures of Radio Receivers
- Friis
- 1944
(Show Context)
Citation Context ...uation of 6.28 dB. The preliminary LPF and the antialiasing LPF have very small insertion loss, and therefore their NFs are negligible. To obtain the total NF of the system, we use the Friis equation =-=[35]-=-, NFsystem = NF1 + N∑ n=2 NFn − 1∏n−1 m=1 Gm (10) where Gn and N Fn are the gain and NF of the nth component in the channel, respectively, and N is the number of total components. Incorporating the fa... |
42 | Multichannel sampling of pulse streams at the rate of innovation
- Gedalyahu, Tur, et al.
- 2011
(Show Context)
Citation Context ...veral random groups of coefficients can yield similar performance, while resulting in a simple ADC structure. Our hardware prototype implements a combination of the multichannel topology suggested in =-=[7]-=- and the filtering approach presented in [6], additionally taking into account the practical challenges they impose. In particular, our board consists of 4 channels, each comprising a bandpass crystal... |
36 | Xampling: Signal acquisition and processing in union of subspaces
- Mishali, Eldar, et al.
(Show Context)
Citation Context ...y Nyquist sampling. Related works [6–8] treat ultrasound signal sampling and are readily adapted to the radar scenario. These methods are based on the finite rate of innovation (FRI) [9] and Xampling =-=[10, 11]-=- approaches. The FRI framework treats sampling and recovery of signals characterized by a finite number of degrees of freedom per unit time and is based on connecting sampling theory with array proces... |
33 | On compressive sensing applied to radar - Ender - 2009 |
30 | Innovation rate sampling of pulse streams with application to ultrasound imaging
- Tur, Eldar, et al.
- 2011
(Show Context)
Citation Context ...d similar performance, while resulting in a simple ADC structure. Our hardware prototype implements a combination of the multichannel topology suggested in [7] and the filtering approach presented in =-=[6]-=-, additionally taking into account the practical challenges they impose. In particular, our board consists of 4 channels, each comprising a bandpass crystal filter with a random effective carrier freq... |
27 |
A mathematical theory of antenna arrays with randomly spaced elements
- Lo
- 1964
(Show Context)
Citation Context ...rray processing, and rely on ideas obtained in that context. In particular, it is known in the array processing literature that random frequencies spread over a wide aperture lead to good performance =-=[17, 18]-=-. However, in the context of ADC design this choice corresponds to a complicated receiver structure. Instead, we show that choosing several random groups of coefficients can yield similar performance,... |
20 | Eldar, “Identification of parametric underspread linear systems and super-resolution radar
- Bajwa, Gedalyahu, et al.
- 2011
(Show Context)
Citation Context ...wing sampling rates required due to the desire to increase resolution necessitate sophisticated analog front ends and imply higher power consumption and vast memory capacity. Recently, new approaches =-=[4]-=- to radar processing were introduced, which allow practical solution of the parametric problem, from a small number of measurements taken after appropriate analog prefiltering. The estimation problem ... |
15 | A sub-nyquist rate sampling receiver exploiting compressive sensing - Chen, Yu, et al. - 2011 |
9 | Matched filtering from limited frequency samples
- Eftekhari, Romberg, et al.
- 2013
(Show Context)
Citation Context ...n about the parameters of interest. Our prototype allows to obtain these needed frequency coefficients directly from the analog input using simple analog filters and low rate sampling. The results of =-=[15]-=- establish that a single delay can be found efficiently from random frequency samples in the presence of noise providing theoretical justification to our approach. The use of frequency samples for CS ... |
9 | Signal extraction using compressed sensing for passive radar with OFDM signals - Berger, Zhou, et al. - 2008 |
9 |
Sparse estimation of spectral lines: Grid selection problems and their solutions
- Stoica, Babu
- 2012
(Show Context)
Citation Context ...practical from a hardware perspective, and therefore a rule for selecting a good constellation of frequency samples is desired. Some practical guidelines for choosing the frequencies are suggested in =-=[34]-=-. The authors consider an equivalent problem to (3), with the roles of frequency and time interchanged. That is, the measurement vector consists of time samples of a signal, described by a spectral li... |
8 | Adaptive Compressed Sensing Radar Oriented Toward Cognitive Detection in Dynamic Sparse Target Scene - Zhang, Zhu, et al. - 2012 |
8 | Sub-Nyquist radar via Doppler focusing
- Bar-Ilan, Eldar
(Show Context)
Citation Context ... point targets assumed to be stationary or moving at very slow velocities, so that no Doppler shift is incorporated into the model. We show how to adapt the results to allow for Doppler processing in =-=[30]-=-. The parameters {al, tl}Ll=1 correspond to the estimated pulses’ amplitudes and delays, respectively, and are proportional to the targets’ distance from the receiver and their radar cross section (RC... |
7 |
Pulse compression- key to more efficient radar transmission,”
- Cook
- 1960
(Show Context)
Citation Context ...e targets’ location in space and their velocity. Traditional processing methods in both literature and practice involve a preliminary stage, referred to as matched filtering (MF) or pulse compression =-=[1, 2]-=-, in which the transmitted pulse is correlated with the received signal. For the problem of detecting targets in white Gaussian noise, the MF is known to maximize the effective signal-to-noise ratio (... |
7 | Spatial compressive sensing for MIMO radar
- Rossi, Haimovich, et al.
- 2014
(Show Context)
Citation Context ...rray processing, and rely on ideas obtained in that context. In particular, it is known in the array processing literature that random frequencies spread over a wide aperture lead to good performance =-=[17, 18]-=-. However, in the context of ADC design this choice corresponds to a complicated receiver structure. Instead, we show that choosing several random groups of coefficients can yield similar performance,... |
7 | A compressed sensing parameter extraction platform for radar pulse signal acquisition,” Submitted to - Yoo, Turnes, et al. - 2012 |
6 | Compressed Beamforming in Ultrasound Imaging
- Wagner, Eldar, et al.
- 2012
(Show Context)
Citation Context ...ficients. An exception is the MUSIC algorithm, which can be applied on any set of coefficients [32]. While these techniques work well at high SNR; their performance deteriorates at low SNR values. In =-=[8]-=- it was suggested to use a nonconsecutive set of Fourier coefficients selected in a distributed manner, as many detection systems (such as ultrasound in [8] and radar in our work) benefit from wide fr... |
2 | High-Resolution Range-Doppler Imaging by Coherent Block-Sparse Estimation - Demissie - 2012 |
2 | Pulse compression-key to more efficient radar transmission - Cook - 1960 |