{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T16:35:52Z","timestamp":1765038952169},"reference-count":17,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1999,12,1]],"date-time":"1999-12-01T00:00:00Z","timestamp":944006400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Signal Processing"],"published-print":{"date-parts":[[1999,12]]},"DOI":"10.1016\/s0165-1684(99)00098-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:18:19Z","timestamp":1027599499000},"page":"251-259","source":"Crossref","is-referenced-by-count":15,"title":["Real-time implementation of the moving FFT algorithm"],"prefix":"10.1016","volume":"79","author":[{"given":"Pei-Chen","family":"Lo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu-Yun","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0165-1684(99)00098-5_BIB1","doi-asserted-by":"crossref","unstructured":"M.G. Amin, A new approach to recursive Fourier transform, Proc. IEEE 75 (11) (November 1987) 1537\u20131538.","DOI":"10.1109\/PROC.1987.13915"},{"key":"10.1016\/S0165-1684(99)00098-5_BIB2","doi-asserted-by":"crossref","unstructured":"J.L. Aravena, Recursive moving window DFT algorithm, IEEE Trans. Comput. 39 (1) (January 1990) 145\u2013148.","DOI":"10.1109\/12.46292"},{"key":"10.1016\/S0165-1684(99)00098-5_BIB3","doi-asserted-by":"crossref","unstructured":"G. Bongiovanni, P. Corsini, G. Frosini, Procedures for computing the discrete Fourier transform on staggered blocks, IEEE Trans. Acoust. Speech Signal Process. ASSP-24 (2) (April 1976) 132\u2013137.","DOI":"10.1109\/TASSP.1976.1162787"},{"key":"10.1016\/S0165-1684(99)00098-5_BIB4","doi-asserted-by":"crossref","unstructured":"W. Chen, N. Kehtamavaz, T.W. Spencer, An efficient recursive algorithm for time-varying Fourier transform, IEEE Trans. Signal Process. 41 (7) (July 1993) 2488\u20132490.","DOI":"10.1109\/78.224256"},{"key":"10.1016\/S0165-1684(99)00098-5_BIB5","doi-asserted-by":"crossref","unstructured":"J.W. Cooley, J.W. Tukey, An algorithm for machine computation of complex Fourier series, Math. Comput. 19 (April 1965) 297\u2013301.","DOI":"10.1090\/S0025-5718-1965-0178586-1"},{"key":"10.1016\/S0165-1684(99)00098-5_BIB6","doi-asserted-by":"crossref","unstructured":"P. Duhamel, Implementation of `split-radix\u2019 FFT algorithms for complex real and real-symmetric data, IEEE Trans. Acoust. Speech Signal Process. ASSP-34 (April 1986) 285\u2013295.","DOI":"10.1109\/TASSP.1986.1164811"},{"key":"10.1016\/S0165-1684(99)00098-5_BIB7","doi-asserted-by":"crossref","unstructured":"P. Duhamel, H. Hollmann, Split radix FFT algorithm, Electron. Lett. 20 (1) (January 1984) 14\u201316.","DOI":"10.1049\/el:19840012"},{"key":"10.1016\/S0165-1684(99)00098-5_BIB8","doi-asserted-by":"crossref","unstructured":"B.G. Goldberg, A continuous recursive DFT analyzer \u2013 The discrete coherent memory filter, IEEE Trans. Acoust. Speech Signal Process. ASSP-28 (6) (December 1980) 760\u2013762.","DOI":"10.1109\/TASSP.1980.1163475"},{"key":"10.1016\/S0165-1684(99)00098-5_BIB9","doi-asserted-by":"crossref","unstructured":"J.H. Halberstein, Recursive, complex Fourier analysis for real-time applications, Proc. IEEE (Lett.) 54 (June 1966) 903.","DOI":"10.1109\/PROC.1966.4920"},{"key":"10.1016\/S0165-1684(99)00098-5_BIB10","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/S0165-1684(98)00152-2","article-title":"Real-time implementation of the split-radix FFT \u2013 An algorithm to efficiently construct local butterfly modules","volume":"71","author":"Lo","year":"1998","journal-title":"Signal Processing"},{"key":"10.1016\/S0165-1684(99)00098-5_BIB11","doi-asserted-by":"crossref","unstructured":"J.D. Markel, FFT pruning, IEEE Trans. Audio Electroacoust. AU-19 (4) (December 1971) 305\u2013311.","DOI":"10.1109\/TAU.1971.1162205"},{"key":"10.1016\/S0165-1684(99)00098-5_BIB12","unstructured":"A.V. Oppenheim, R.W. Schafer, Discrete-Time Signal Processing, Prentice-Hall, Englewood Cliffs, NJ, 1989, Chapter 9."},{"key":"10.1016\/S0165-1684(99)00098-5_BIB13","doi-asserted-by":"crossref","unstructured":"D.E. Paneras, R. Mani, S.H. Nawab, STFT computation using pruned FFT algorithms, IEEE Signal Process. Lett. 1 (4) (April 1994) 61\u201363.","DOI":"10.1109\/97.295333"},{"key":"10.1016\/S0165-1684(99)00098-5_BIB14","doi-asserted-by":"crossref","unstructured":"C. Roche, A split-radix partial input\/output fast Fourier transform algorithm, IEEE Trans. Signal Process. 40 (5) (May 1992) 1273\u20131276.","DOI":"10.1109\/78.134493"},{"key":"10.1016\/S0165-1684(99)00098-5_BIB15","doi-asserted-by":"crossref","unstructured":"B.G. Sherlock, D.M. Manro, Moving discrete Fourier transform, IEE Proc.-F 139 (4) (August 1992) 279\u2013282.","DOI":"10.1049\/ip-f-2.1992.0038"},{"key":"10.1016\/S0165-1684(99)00098-5_BIB16","doi-asserted-by":"crossref","unstructured":"H.V. Sorensen, C.S. Burrus, Efficient computation of the DFT with only a subset of input or output points, IEEE Trans. Signal Process. 41 (3) (March 1993) 1184\u20131200.","DOI":"10.1109\/78.205723"},{"key":"10.1016\/S0165-1684(99)00098-5_BIB17","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0165-1684(83)90071-3","article-title":"Recursion in short-time signal analysis","volume":"5","author":"Unser","year":"1983","journal-title":"Signal Processing"}],"container-title":["Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0165168499000985?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0165168499000985?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T02:25:48Z","timestamp":1556245548000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0165168499000985"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,12]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1999,12]]}},"alternative-id":["S0165168499000985"],"URL":"https:\/\/doi.org\/10.1016\/s0165-1684(99)00098-5","relation":{},"ISSN":["0165-1684"],"issn-type":[{"value":"0165-1684","type":"print"}],"subject":[],"published":{"date-parts":[[1999,12]]}}}