The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
High-Resolution Radar via Compressed Sensing
Open accessAbstract
A stylized compressed sensing radar is proposed in which the time-frequency plane is discretized into an N times N grid. Assuming the number of targets K is small (i.e., K Lt N2), then we can transmit a sufficiently ldquoincoherentrdquo pulse and employ the techniques of compressed sensing to reconstruct the target scene. A theoretical upper bound on the sparsity K is presented. Numerical simulations verify that even better performance can be achieved in practice. This novel-compressed sensing approach offers great potential for better resolution over classical radar.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994
Donoho, D. L. (2004) · Cited by 16,703
Candes, E. J., Romberg, J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862083 · Cited by 15,639
Fundamentals of Wireless Communication
Tse, D., & Viswanath, P. (2005) · doi:10.1017/cbo9780511807213 · Cited by 13,162
Greed is Good: Algorithmic Results for Sparse Approximation
Tropp, J. A. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.834793 · Cited by 3,635
Foundations of Time-Frequency Analysis
Gröchenig, K. (2001) · Applied and Numerical Harmonic Analysis · doi:10.1007/978-1-4612-0003-1 · Cited by 2,923
Characterization of Randomly Time-Variant Linear Channels
Bello, P. (1963) · IEEE Transactions on Communications · doi:10.1109/tcom.1963.1088793 · Cited by 2,398
Lower bounds on the maximum cross correlation of signals (Corresp.)
Welch, L. (1974) · IEEE Transactions on Information Theory · doi:10.1109/tit.1974.1055219 · Cited by 1,291
Sparse representations in unions of bases
Gribonval, R., & Nielsen, M. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.820031 · Cited by 960
Grassmannian frames with applications to coding and communication
Strohmer, T., & Heath, R. W. (2003) · Applied and Computational Harmonic Analysis · doi:10.1016/s1063-5203(03)00023-x · Cited by 955
Self-citationUniform Uncertainty Principle and Signal Recovery via Regularized Orthogonal Matching Pursuit
Needell, D., & Vershynin, R. (2009) · Foundations of Computational Mathematics · doi:10.1007/s10208-008-9031-3 · Cited by 952
Baraniuk, R., & Steeghs, P. (2007) · 2007 IEEE Radar Conference · doi:10.1109/radar.2007.374203 · Cited by 889
A generalized uncertainty principle and sparse representation in pairs of bases
Elad, M., & Bruckstein, A. M. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.801410 · Cited by 673
Symmetric informationally complete–positive operator valued measures and the extended Clifford group
Appleby, D. M. (2005) · Journal of Mathematical Physics · doi:10.1063/1.1896384 · Cited by 304
The Closest Packing of Spherical Caps in n Dimensions
Rankin, R. A. (1955) · Proceedings of the Glasgow Mathematical Association · doi:10.1017/s2040618500033219 · Cited by 217
Complex sequences with low periodic correlations (Corresp.)
Alltop, W. (1980) · IEEE Transactions on Information Theory · doi:10.1109/tit.1980.1056185 · Cited by 215
On the conditioning of random subdictionaries
Tropp, J. A. (2008) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2007.09.001 · Cited by 212
Radar Ambiguity Functions and Group Theory
Auslander, L., & Tolimieri, R. (1985) · SIAM Journal on Mathematical Analysis · doi:10.1137/0516043 · Cited by 128
Planat, M. R. P., Rosu, H. C., & Perrine, S. (2006) · Foundations of Physics · doi:10.1007/s10701-006-9079-3 · Cited by 54
Characterization of Randomly TimeVariant Linear Channels
(2009) · Institute of Electrical and Electronics Engineers eBooks · doi:10.1109/9780470546543.ch38 · Cited by 47
Planat, M. R. P., Rosu, H. C., Perrine, S., & Санига, М. (2006) · HAL · Cited by 33
Cited by
Compressed Sensing Off the Grid
Tang, G., Bhaskar, B. N., Shah, P., & Recht, B. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2277451 · Cited by 1,163
Structured Compressed Sensing: From Theory to Applications
Duarte, M. F., & Eldar, Y. C. (2011) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2011.2161982 · Cited by 1,128
Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals
Tropp, J. A., Laska, J. N., Duarte, M. F., Romberg, J. K., & Baraniuk, R. G. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2034811 · Cited by 1,089
Off-Grid Direction of Arrival Estimation Using Sparse Bayesian Inference
Yang, Z., Xie, L., & Zhang, C. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2222378 · Cited by 968
Sensitivity to Basis Mismatch in Compressed Sensing
Chi, Y., Scharf, L. L., Pezeshki, A., & Calderbank, A. R. (2011) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2011.2112650 · Cited by 920
Metadata
- Authors
- Herman, M. A., & Strohmer, T.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2009-06
- Volume
- 57
- Issue
- 6
- Pages
- 2275-2284
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2140122025
- Cited by
- 1,048
- References
- 21
- FWCI
- 76.90
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.