Sparse Direction of Arrival Estimation Using Co-Prime Arrays with Off-Grid Targets
The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Abstract
In this letter, we consider the problem of direction of arrival estimation using sparsity enforced reconstruction methods. Co-prime arrays with$M + N$sensors are utilized to increase the degrees of the freedom from$O(M + N)$to$O(MN)$. The key to the success of sparse-based direction of arrival estimation is that every target must fall on the predefined grid. Off-grid targets can highly jeopardize the reconstruction performance. In this letter, we use joint sparsity reconstruction methods to explore the underlying structure between the sparse signal and the gird mismatch. Two types of sparse reconstruction methods, the greedy method and the convex relaxation method, are considered. By implementing numerical experiments, we demonstrate that our proposed methods can fully utilize the virtual aperture created by co-prime arrays and also outperform the previously proposed MUSIC method with spatial smoothing.
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
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482 · cited 1×
“There are two major categories of these algorithms: one is greedy algorithms, such as orthogonal matching pursuit (OMP) [7]; The other is convex relaxation algorithms, such as LASSO [8].”
MethodMultiple emitter location and signal parameter estimation
Schmidt, R. (1986) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.1986.1143830 · Cited by 14,718 · cited 1×
“It is well known that the number of targets which can be detected by using the MUSIC algorithm [3] with a traditional linear array consisting of N sensors is at most N-1.”
BackgroundAn Introduction To Compressive Sampling
Candes, E. J., & Wakin, M. B. (2008) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.914731 · Cited by 10,017 · cited 1×
“Recently compressed sensing has been a very active research area by exploring the sparsity of the original signal [6].”
BackgroundSignal Recovery From Random Measurements Via Orthogonal Matching Pursuit
Tropp, J. A., & Gilbert, A. C. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.909108 · Cited by 9,653 · cited 1×
“There are two major categories of these algorithms: one is greedy algorithms, such as orthogonal matching pursuit (OMP) [7]; The other is convex relaxation algorithms, such as LASSO [8].”
MethodNested Arrays: A Novel Approach to Array Processing With Enhanced Degrees of Freedom
Pal, P., & Vaidyanathan, P. P. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2010.2049264 · Cited by 2,148 · cited 2×
“In [1], a nested array structure was proposed to detect with only sensors.”
BackgroundSparse Sensing With Co-Prime Samplers and Arrays
Vaidyanathan, P. P., & Pal, P. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2010.2089682 · Cited by 1,832 · cited 2×
“To overcome this problem, co-prime arrays were proposed in [2], and it was shown that this structure can detect as many as targets with only sensors.”
BackgroundBlock-Sparse Signals: Uncertainty Relations and Efficient Recovery
Eldar, Y. C., Kuppinger, P., & Bolcskei, H. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2010.2044837 · Cited by 1,313 · cited 1×
“In this work, we extend the traditional OMP to the joint OMP (J-OMP) algorithm which is a special case of the block OMP introduced in [13], and we also consider the situation when one base of the received signal is known, i.”
MethodSensitivity 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 · cited 1×
“The main assumption of implementing traditional compressed sensing for DOA estimation is that the locations of the targets must fall on the predefined grid, otherwise the compressed sensing suffers from dictionary mismatches and the performance is deteriorated [10].”
BackgroundSparsity-based DOA estimation using co-prime arrays
Zhang, Y. D., Amin, M. G., & Himed, B. (2013) · 2013 IEEE International Conference on Acoustics, Speech and Signal Processing · doi:10.1109/icassp.2013.6638403 · Cited by 384 · cited 2×
“However, the application of spatial smoothing leads to a significant reduction of the obtained virtual array, thus the detection performance is compromised [5].”
BackgroundMethodJoint Sparse Recovery Method for Compressed Sensing With Structured Dictionary Mismatches
Tan, Z., Yang, P., & Nehorai, A. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2343940 · Cited by 172 · cited 6×
“To overcome the above difficulty, the idea of joint sparsity was used in [11], [12] by considering the mismatch of the grid and also exploring the joint sparsity between original signal and the grid mismatch variables.”
BackgroundMethodInfluentialSelf-citation
Cited by
Direction of Arrival Estimation Using Co-Prime Arrays: A Super Resolution Viewpoint
Tan, Z., Eldar, Y. C., & Nehorai, A. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2354316 · Cited by 302
Self-citation
Metadata
- Authors
- Tan, Z., & Nehorai, A.
- Venue
- IEEE Signal Processing Letters
- Published
- 2014-01
- Volume
- 21
- Issue
- 1
- Pages
- 26-29
- ISSN
- 1070-9908 (ISSN-L)
- 1558-2361
- OpenAlex
- W2010066971
- Cited by
- 180
- References
- 12
- FWCI
- 28.03
- Type
- journal article
- Language
- en
- Open access
- closed
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.