The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
dsp tips & tricks - the sliding DFT
Abstract
The sliding DFT process for spectrum analysis was presented and shown to be more efficient than the popular Goertzel (1958) algorithm for sample-by-sample DFT bin computations. The sliding DFT provides computational advantages over the traditional DFT or FFT for many applications requiring successive output calculations, especially when only a subset of the DFT output bins are required. Methods for output stabilization as well as time-domain data windowing by means of frequency-domain convolution were also discussed. A modified sliding DFT algorithm, called the sliding Goertzel DFT, was proposed to further reduce the computational workload. We start our sliding DFT discussion by providing a review of the Goertzel algorithm and use its behavior as a yardstick to evaluate the performance of the sliding DFT technique. We examine stability issues regarding the sliding DFT implementation as well as review the process of frequency-domain convolution to accomplish time-domain windowing. Finally, a modified sliding DFT structure is proposed that provides improved computational efficiency.
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
On the use of windows for harmonic analysis with the discrete Fourier transform
Harris, F. J. (1978) · Proceedings of the IEEE · doi:10.1109/proc.1978.10837 · Cited by 7,326 · cited 1×
“He is an associate editor for IEEE Signal Processing Magazine and author of Understanding Digital Signal Processing (Prentice-Hall, 1997).”
BackgroundDigital Signal Processing: Principles, Algorithms, and Applications
Proakis, J. G., & Manolakis, D. G. (1992) · Cited by 4,601
Some windows with very good sidelobe behavior
Nuttall, A. (1981) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1981.1163506 · Cited by 1,057
Theory and application of digital signal processing
Trick, T. (1975) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1975.1162708 · Cited by 906
An Algorithm for the Evaluation of Finite Trigonometric Series
Goertzel, G. (1958) · The American Mathematical Monthly · doi:10.2307/2310304 · Cited by 508
Discrete-Time Signal Processing
Ream, N. (1977) · Electronics and Power · doi:10.1049/ep.1977.0078 · Cited by 312
Generalized sliding FFT and its application to implementation of block LMS adaptive filters
Farhang‐Boroujeny, B., & Gazor, S. (1994) · IEEE Transactions on Signal Processing · doi:10.1109/78.277845 · Cited by 73
Cited by
Model Predictive Control: A Review of Its Applications in Power Electronics
Vazquez, S., Leon, J. I., Franquelo, L. G., Rodriguez, J., Young, H. A., Marquez, A., & Zanchetta, P. (2014) · IEEE Industrial Electronics Magazine · doi:10.1109/mie.2013.2290138 · Cited by 1,191
Data-Driven Science and Engineering: Machine Learning, Dynamical Systems, and Control
Brunton, S. L., & Kutz, J. N. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108380690 · Cited by 1,154
An Islanding Microgrid Power Sharing Approach Using Enhanced Virtual Impedance Control Scheme
He, J., Li, Y. W., Guerrero, J. M., Blaabjerg, F., & Vasquez, J. C. (2013) · IEEE Transactions on Power Electronics · doi:10.1109/tpel.2013.2243757 · Cited by 482
Hammer, J., Fischer, J., Ruescher, J., Schulze-Bonhage, A., Aertsen, A., & Ball, T. (2013) · Frontiers in Neuroscience · doi:10.3389/fnins.2013.00200 · Cited by 49
Fast 2D Complex Gabor Filter With Kernel Decomposition
Kim, J., Um, S., & Min, D. (2018) · IEEE Transactions on Image Processing · doi:10.1109/tip.2017.2783621 · Cited by 23
Metadata
- Authors
- Lyons, R.
- Venue
- IEEE Signal Processing Magazine
- Published
- 2003-03
- Volume
- 20
- Issue
- 2
- Pages
- 74-80
- ISSN
- 1053-5888 (ISSN-L)
- OpenAlex
- W1697514459
- Cited by
- 672
- References
- 7
- FWCI
- 7.32
- 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.