The DOI matches its Crossref record.
A new autoregressive spectrum analysis algorithm
Abstract
A new recursive algorithm for autoregressive (AR) spectral estimation is introduced, based on the least squares solution for the AR parameters using forward and backward linear prediction. The algorithm has computational complexity proportional to the process order squared, comparable to that of the popular Burg algorithm. The computational efficiency is obtained by exploiting the structure of the least squares normal matrix equation, which may be decomposed into products of Toeplitz matrices. AR spectra generated by the new algorithm have improved performance over AR spectra generated by the Burg algorithm. These improvements include less bias in the frequency estimate of spectral components, reduced variance in frequency estimates over an ensemble of spectra, and absence of observed spectral line splitting.
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
No references could be resolved yet.
Research works printed but not linked: 14
- 10.1016/0031-9201(76)90047-9 · DOI · Paper page
- nuttal, 1976, Spectral analysis of a univariate process with bad data points via maximum entropy and linear predictive techniques, 10.21236/ADA024942 · doi:10.21236/ada024942
- andersen, 1978, comments on the performance of maximum entropy algorithms, Proceedings of the IEEE, 66, 1581, 10.1109/PROC.1978.11160 · doi:10.1109/proc.1978.11160
- 10.1109/TASSP.1977.1162989 · DOI
- 10.1109/PROC.1975.9792 · DOI · Paper page
- 10.1190/1.1440413 · DOI · Paper page
- 10.1109/ICASSP.1979.1170768 · doi:10.1109/icassp.1979.1170768
- 10.1016/0031-9201(76)90048-0 · doi:10.1016/0031-9201(76)90048-0
- burg, 1975, Maximum entropy spectral analysis
- 10.1029/JB084iB02p00679 · doi:10.1029/jb084ib02p00679
- 10.1007/BF02506337 · DOI · Paper page
- 10.1029/RG013i001p00183 · DOI · Paper page
- marple, 1978, Frequency resolution of high resolution spectrum analysis techniques, Proc 1st RADC Spectrum Estimation Workshop, 19
- 10.1029/JA082i007p01051 · DOI
Cited by
Spectrum analysis—A modern perspective
Kay, S. M., & Marple, S. L. (1981) · Proceedings of the IEEE · doi:10.1109/proc.1981.12184 · Cited by 3,146
Conjugate Gradient Methods for Toeplitz Systems
Chan, R. H., & Ng, M. K. (1996) · SIAM Review · doi:10.1137/s0036144594276474 · Cited by 801
Accuracy of assessment of cardiac vagal tone by heart rate variability in normal subjects.
Hayano, J., Sakakibara, Y., Yamada, A., Yamada, M., Mukai, S., Fujinami, T., Yokoyama, K., Watanabe, Y., & Takata, K. (1991) · The American Journal of Cardiology · doi:10.1016/0002-9149(91)90445-q · Cited by 746
Very high-frequency rhythmic activity during SEEG suppression in frontal lobe epilepsy
Allen, P. J., Fish, D. R., & Smith, S. J. M. (1992) · Electroencephalography and Clinical Neurophysiology · doi:10.1016/0013-4694(92)90160-j · Cited by 254
Spectral Analysis of Heart Rate Variability: Time Window Matters
Li, K., Rüdiger, H., & Ziemssen, T. (2019) · Frontiers in Neurology · doi:10.3389/fneur.2019.00545 · Cited by 215
Metadata
- Authors
- Marple, L.
- Venue
- IEEE Transactions on Acoustics, Speech, and Signal Processing
- Published
- 1980-08
- Volume
- 28
- Issue
- 4
- Pages
- 441-454
- ISSN
- 0096-3518 (ISSN-L)
- OpenAlex
- W2153859070
- Cited by
- 433
- References
- 0
- FWCI
- 20.48
- 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: A new autoregressive spectrum analysis algorithm. https://app.cochat.ai/papers/10.1109/tassp.1980.1163429
- The paper
- Marple, L. (1980). A new autoregressive spectrum analysis algorithm. IEEE Transactions on Acoustics, Speech, and Signal Processing. https://doi.org/10.1109/tassp.1980.1163429
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.
