The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
State-space and singular-value decomposition-based approximation methods for the harmonic retrieval problem
Abstract
We present new high-resolution methods for the problem of retrieving sinusoidal processes from noisy measurements. The approach taken is by use of the so-called principal-components method, which is a singular-value-decomposition-based approximate modeling method. The low-rank property and the algebraic structure of both the data matrix and the covariance matrix (under noise-free conditions) form the basis of exact modeling methods. In a noisy environment, however, the rank property is often perturbed, and singular-value decomposition is used to obtain a low-rank approximant in factored form. The underlying algebraic structure of these factors leads naturally to least-squares estimates of the state-space parameters of the sinusoidal process. This forms the basis of the Toeplitz approximation method, which offers a robust Pisarenko-like spectral estimate from the covariance sequence. Furthermore, the principle of Pisarenko’s method is extended to harmonic retrieval directly from time-series data, which leads to a direct-data approximation method. Our simulation results indicate that favorable resolution capability (compared with existing methods) can be achieved by the above methods. The application of these principles to two-dimensional signals is also discussed.
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
Singular value decomposition and least squares solutions
Golub, G. H., & Reinsch, C. (1970) · Numerische Mathematik · doi:10.1007/bf02163027 · Cited by 2,929
Cited by
Matrix pencil method for estimating parameters of exponentially damped/undamped sinusoids in noise
Hua, Y., & Sarkar, T. K. (1990) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/29.56027 · Cited by 1,537
Separable nonlinear least squares: the variable projection method and its applications
Golub, G., & Pereyra, V. (2003) · Inverse Problems · doi:10.1088/0266-5611/19/2/201 · Cited by 760
Subspace-based signal analysis using singular value decomposition
Van Der Veen, A.-J., Deprettere, E. F., & Swindlehurst, A. L. (1993) · Proceedings of the IEEE · doi:10.1109/5.237536 · Cited by 348
Signal decomposition and reconstruction using complex exponential models
James Hu, S.-L., Yang, W.-L., & Li, H.-J. (2013) · Mechanical Systems and Signal Processing · doi:10.1016/j.ymssp.2013.06.037 · Cited by 94
Metadata
- Authors
- Kung, S. Y., Arun, K. S., & Bhaskar Rao, D. V.
- Venue
- Journal of the Optical Society of America
- Publisher
- Optica Publishing Group
- Published
- 1983-12-01
- Volume
- 73
- Issue
- 12
- Pages
- 1799
- ISSN
- 0030-3941 (ISSN-L)
- OpenAlex
- W1967486001
- Cited by
- 406
- References
- 1
- FWCI
- 2.79
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: State-space and singular-value decomposition-based approximation methods for the harmonic retrieval problem. https://app.cochat.ai/papers/10.1364/josa.73.001799
- The paper
- Kung, S. Y., Arun, K. S., & Bhaskar Rao, D. V. (1983). State-space and singular-value decomposition-based approximation methods for the harmonic retrieval problem. Journal of the Optical Society of America. https://doi.org/10.1364/josa.73.001799
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.