{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T14:26:28Z","timestamp":1761661588501},"reference-count":20,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"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":[[1998,12]]},"DOI":"10.1016\/s0165-1684(98)00152-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:18:19Z","timestamp":1027599499000},"page":"291-299","source":"Crossref","is-referenced-by-count":11,"title":["Real-time implementation of the split-radix FFT \u2013 An algorithm to efficiently construct local butterfly modules"],"prefix":"10.1016","volume":"71","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(98)00152-2_BIB1","doi-asserted-by":"crossref","unstructured":"M.M. Anguh, Quadtree and symmetry in FFT computation of digital images, IEEE Trans. Signal Process. 45 (12) (December. 1997) 2896\u20132899.","DOI":"10.1109\/78.650247"},{"key":"10.1016\/S0165-1684(98)00152-2_BIB2","doi-asserted-by":"crossref","unstructured":"S. Barash, Y. Ritov, Logarithmic pruning of FFT frequencies, IEEE Trans. Signal Process. 41 (3) (March 1993) 1398\u20131400.","DOI":"10.1109\/78.205740"},{"key":"10.1016\/S0165-1684(98)00152-2_BIB3","doi-asserted-by":"crossref","unstructured":"V. Boriakoff, FFT computation with systolic arrays, A new architecture, IEEE Trans. Circuit Systems \u2013 II: Analog Digital Signal Process. 41 (4) (April 1994) 278\u2013284.","DOI":"10.1109\/82.285710"},{"key":"10.1016\/S0165-1684(98)00152-2_BIB4","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1090\/S0025-5718-1965-0178586-1","article-title":"An algorithm for machine computation of complex Fourier series","volume":"19","author":"Cooley","year":"1965","journal-title":"Math. Comput."},{"key":"10.1016\/S0165-1684(98)00152-2_BIB5","unstructured":"R. Cooper, J.W. Osselton, J.C. Shaw, EEG Technol, 3rd ed., Ch. 6 Butterworth Inc, Woburn, MA, 1980."},{"key":"10.1016\/S0165-1684(98)00152-2_BIB6","doi-asserted-by":"crossref","unstructured":"P. Duhamel, Implementation of `split-radix' 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(98)00152-2_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(98)00152-2_BIB8","doi-asserted-by":"crossref","unstructured":"S. He, M. Torkelson, Computing partial DFT for comb spectrum evaluation, IEEE Signal Process. Lett. 3 (6) (June 1996), 173\u2013175.","DOI":"10.1109\/97.503281"},{"key":"10.1016\/S0165-1684(98)00152-2_BIB9","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(98)00152-2_BIB10","doi-asserted-by":"crossref","unstructured":"K. Nagai, Pruning the decimation-in-time FFT algorithm with frequency shift, IEEE Trans. Acoust. Speech Signal Process. ASSP-34 (4) (August 1986) 1008\u20131010.","DOI":"10.1109\/TASSP.1986.1164900"},{"key":"10.1016\/S0165-1684(98)00152-2_BIB11","unstructured":"A.V. Oppenheim, R.W. Schafer, Discrete-Time Signal Process. Ch. 9, Prentice-Hall, Englewood Cliffs, NJ, 1989."},{"key":"10.1016\/S0165-1684(98)00152-2_BIB12","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(98)00152-2_BIB13","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(98)00152-2_BIB14","doi-asserted-by":"crossref","unstructured":"I.W. Selesnick, C.S. Burrus, Automatic generation of prime length FFT programs, IEEE Trans. Signal Process. 44 (1) (January 1996) 14\u201324.","DOI":"10.1109\/78.482008"},{"key":"10.1016\/S0165-1684(98)00152-2_BIB15","doi-asserted-by":"crossref","unstructured":"A.N. Skodras, Efficient computation of the split-radix FFT, IEE Proc. 139 (1) (February 1992) 56\u201360.","DOI":"10.1049\/ip-f-2.1992.0006"},{"key":"10.1016\/S0165-1684(98)00152-2_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(98)00152-2_BIB17","doi-asserted-by":"crossref","unstructured":"H.V. Sorensen, M.T. Heideman, C.S. Burrus, On computing the split-radix FFT, IEEE Trans. Acoust. Speech Signal Process. ASSP-34 (1) (February 1986) 152\u2013156.","DOI":"10.1109\/TASSP.1986.1164804"},{"key":"10.1016\/S0165-1684(98)00152-2_BIB18","doi-asserted-by":"crossref","unstructured":"T.V. Sreenivas, P.V.S. Rao, High resolution narrow-band spectra by FFT pruning, IEEE Trans. Acoust. Speech Signal Process. ASSP-28 (2) (April 1980) 254\u2013257.","DOI":"10.1109\/TASSP.1980.1163376"},{"key":"10.1016\/S0165-1684(98)00152-2_BIB19","doi-asserted-by":"crossref","unstructured":"P.R. Uniyal, Transforming real-valued sequences: fast Fourier versus fast Hartley transform algorithms, IEEE Trans. Signal Process. 42 (11) (November 1994) 3249\u20133254.","DOI":"10.1109\/78.330387"},{"key":"10.1016\/S0165-1684(98)00152-2_BIB20","doi-asserted-by":"crossref","unstructured":"J. You, S.S. Wong, Serial-parallel FFT array processor, IEEE Trans. Signal Process. 41 (3) (March 1993) 1472\u20131476.","DOI":"10.1109\/78.205760"}],"container-title":["Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0165168498001522?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0165168498001522?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T00:07:13Z","timestamp":1578701233000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0165168498001522"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,12]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,12]]}},"alternative-id":["S0165168498001522"],"URL":"https:\/\/doi.org\/10.1016\/s0165-1684(98)00152-2","relation":{},"ISSN":["0165-1684"],"issn-type":[{"value":"0165-1684","type":"print"}],"subject":[],"published":{"date-parts":[[1998,12]]}}}