The DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index.
Newtonized Orthogonal Matching Pursuit: Frequency Estimation Over the Continuum
Open accessAbstract
We propose a fast sequential algorithm for the fundamental problem of estimating frequencies and amplitudes of a noisy mixture of sinusoids. The algorithm is a natural generalization of Orthogonal Matching Pursuit (OMP) to the continuum using Newton refinements, and hence is termed Newtonized OMP (NOMP). Each iteration consists of two phases: detection of a new sinusoid, and sequential Newton refinements of the parameters of already detected sinusoids. The refinements play a critical role in two ways: 1) sidestepping the potential basis mismatch from discretizing a continuous parameter space and 2) providing feedback for locally refining parameters estimated in previous iterations. We characterize convergence and provide a constant false alarm rate (CFAR) based termination criterion. By benchmarking against the Cramér-Rao Bound, we show that NOMP achieves near-optimal performance under a variety of conditions. We compare the performance of NOMP with classical algorithms such as MUSIC and more recent Atomic norm Soft Thresholding (AST) and Lasso algorithms, both in terms of frequency estimation accuracy and run time.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
A new look at the statistical model identification
Akaike, H. (1974) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1974.1100705 · Cited by 51,879
Estimating the Dimension of a Model
Schwarz, G. (1978) · The Annals of Statistics · doi:10.1214/aos/1176344136 · Cited by 47,033
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Multiple 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
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
Signal 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
Matching pursuits with time-frequency dictionaries
Mallat, S. G., & Zhang, Z. (1993) · IEEE Transactions on Signal Processing · doi:10.1109/78.258082 · Cited by 9,112
ESPRIT-estimation of signal parameters via rotational invariance techniques
Roy, R., & Kailath, T. (1989) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/29.32276 · Cited by 7,289
Detection, Estimation, And Modulation Theory
Trees, H. L. V. (1968) · Cited by 5,969
CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
Needell, D., & Tropp, J. A. (2009) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2008.07.002 · Cited by 4,326
Cited by
Channel Estimation for Extremely Large-Scale Massive MIMO Systems
Han, Y., Jin, S., Wen, C.-K., & Ma, X. (2020) · IEEE Wireless Communications Letters · doi:10.1109/lwc.2019.2963877 · Cited by 282
Beam Alignment in mmWave V2X Communications: A Survey
Tan, J., Luan, T. H., Guan, W., Wang, Y., Peng, H., Zhang, Y., Zhao, D., & Lu, N. (2024) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2024.3383093 · Cited by 75
Metadata
- Authors
- Mamandipoor, B., Ramasamy, D., & Madhow, U.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2016-10-01
- Volume
- 64
- Issue
- 19
- Pages
- 5066-5081
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2139961842
- Cited by
- 262
- References
- 43
- FWCI
- 12.95
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Newtonized Orthogonal Matching Pursuit: Frequency Estimation Over the Continuum. https://app.cochat.ai/papers/10.1109/tsp.2016.2580523
- The paper
- Mamandipoor, B., Ramasamy, D., & Madhow, U. (2016). Newtonized Orthogonal Matching Pursuit: Frequency Estimation Over the Continuum. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2016.2580523
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.