{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T18:22:05Z","timestamp":1777918925300,"version":"3.51.4"},"reference-count":94,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T00:00:00Z","timestamp":1557532800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Circuits Syst Signal Process"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s00034-019-01136-8","type":"journal-article","created":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T14:58:38Z","timestamp":1557586718000},"page":"5665-5698","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":61,"title":["50 Years of FFT Algorithms and Applications"],"prefix":"10.1007","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1387-0702","authenticated-orcid":false,"given":"G. Ganesh","family":"Kumar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Subhendu K.","family":"Sahoo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pramod Kumar","family":"Meher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,11]]},"reference":[{"key":"1136_CR1","doi-asserted-by":"crossref","unstructured":"O. Abari, E. Hamed, H. Hassanieh, A. Agarwal, D. Katabi, A.P. Chandrakasan, V. Stojanovic, 27.4 a 0.75-million-point fourier-transform chip for frequency-sparse signals, in 2014 IEEE International Solid-State Circuits Conference Digest of Technical Papers (ISSCC). (IEEE, 2014), pp. 458\u2013459","DOI":"10.1109\/ISSCC.2014.6757512"},{"key":"1136_CR2","doi-asserted-by":"crossref","unstructured":"A. Agarwal, H. Hassanieh, O. Abari, E. Hamed, D. Katabi et\u00a0al., High-throughput implementation of a million-point sparse Fourier Transform, in 2014 24th International Conference on Field Programmable Logic and Applications (FPL) (IEEE, 2014a), pp. 1\u20136","DOI":"10.1109\/FPL.2014.6927450"},{"key":"1136_CR3","doi-asserted-by":"crossref","unstructured":"A. Agarwal, H. Hassanieh, O. Abari, E. Hamed, D. Katabi et\u00a0al., High-throughput implementation of a million-point sparse Fourier Transform, in 2014 24th International Conference on Field Programmable Logic and Applications (FPL) (IEEE, 2014b), pp. 1\u20136","DOI":"10.1109\/FPL.2014.6927450"},{"issue":"1","key":"1136_CR4","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1109\/T-C.1974.223784","volume":"100","author":"N Ahmed","year":"1974","unstructured":"N. Ahmed, T. Natarajan, K.R. Rao, Discrete cosine transform. IEEE Trans. Comput. 100(1), 90\u201393 (1974)","journal-title":"IEEE Trans. Comput."},{"key":"1136_CR5","doi-asserted-by":"crossref","unstructured":"M. Aminian, M. Saeedi, M.S. Zamani, M. Sedighi, Fpga-based circuit model emulation of quantum algorithms, in 2008 IEEE Computer Society Annual Symposium on VLSI. (IEEE, 2008), pp. 399\u2013404","DOI":"10.1109\/ISVLSI.2008.43"},{"issue":"10","key":"1136_CR6","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1109\/TCSII.2013.2273841","volume":"60","author":"M Ayinala","year":"2013","unstructured":"M. Ayinala, Y. Lao, K.K. Parhi, An in-place FFT architecture for real-valued signals. IEEE Trans. Circuits Syst. II Express Briefs 60(10), 652\u2013656 (2013)","journal-title":"IEEE Trans. Circuits Syst. II Express Briefs"},{"issue":"3","key":"1136_CR7","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s11265-009-0364-1","volume":"58","author":"K Babionitakis","year":"2010","unstructured":"K. Babionitakis, V.A. Chouliaras, K. Manolopoulos, K. Nakos, D. Reisis, N. Vlassopoulos, Fully systolic FFT architecture for giga-sample applications. J. Signal Process. Syst. 58(3), 281\u2013299 (2010)","journal-title":"J. Signal Process. Syst."},{"issue":"2","key":"1136_CR8","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1109\/TAU.1969.1162043","volume":"17","author":"G Bergland","year":"1969","unstructured":"G. Bergland, A radix-eight fast Fourier transform subroutine for real-valued series. IEEE Trans. Audio Electroacoustics 17(2), 138\u2013144 (1969)","journal-title":"IEEE Trans. Audio Electroacoustics"},{"issue":"10","key":"1136_CR9","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1145\/364096.364118","volume":"11","author":"GD Bergland","year":"1968","unstructured":"G.D. Bergland, Numerical analysis: a fast Fourier transform algorithm for real-valued series. Commun. ACM 11(10), 703\u2013710 (1968)","journal-title":"Commun. ACM"},{"issue":"6","key":"1136_CR10","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1109\/82.686687","volume":"45","author":"G Bi","year":"1998","unstructured":"G. Bi, Y.Q. Chen, Fast DFT algorithms for length n= q* $$ 2^m $$. IEEE Trans. Circuits Syst. II Analog Digit. Signal Process. 45(6), 685\u2013690 (1998)","journal-title":"IEEE Trans. Circuits Syst. II Analog Digit. Signal Process."},{"issue":"9","key":"1136_CR11","doi-asserted-by":"publisher","first-page":"1723","DOI":"10.1109\/TCSI.2004.834508","volume":"51","author":"S Bouguezel","year":"2004","unstructured":"S. Bouguezel, M.O. Ahmad, M.S. Swamy, A new radix-2\/8 FFT algorithm for length-q$$\\times $$ $$ 2^m $$ DFTs. IEEE Trans. Circuits Syst. I Regul. Pap. 51(9), 1723\u20131732 (2004)","journal-title":"IEEE Trans. Circuits Syst. I Regul. Pap."},{"issue":"12","key":"1136_CR12","doi-asserted-by":"publisher","first-page":"1832","DOI":"10.1364\/JOSA.73.001832","volume":"73","author":"RN Bracewell","year":"1983","unstructured":"R.N. Bracewell, Discrete hartley transform. JOSA 73(12), 1832\u20131835 (1983)","journal-title":"JOSA"},{"issue":"1","key":"1136_CR13","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/0021-9991(73)90173-3","volume":"12","author":"O Buneman","year":"1973","unstructured":"O. Buneman, Inversion of the Helmholtz (or Laplace-Poisson) operator for slab geometry. J. Comput. Phys. 12(1), 124\u2013130 (1973)","journal-title":"J. Comput. Phys."},{"issue":"4","key":"1136_CR14","doi-asserted-by":"publisher","first-page":"806","DOI":"10.1109\/TASSP.1981.1163645","volume":"29","author":"C Burrus","year":"1981","unstructured":"C. Burrus, P. Eschenbacher, An in-place, in-order prime factor FFT algorithm. IEEE Trans. Acoust. Speech Signal Process. 29(4), 806\u2013817 (1981)","journal-title":"IEEE Trans. Acoust. Speech Signal Process."},{"issue":"1","key":"1136_CR15","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.cam.2006.11.025","volume":"212","author":"Z Chen","year":"2008","unstructured":"Z. Chen, L. Zhang, Vector coding algorithms for multidimensional discrete Fourier transform. J. Comput. Appl. Math. 212(1), 63\u201374 (2008)","journal-title":"J. Comput. Appl. Math."},{"key":"1136_CR16","doi-asserted-by":"publisher","unstructured":"T. Cho, H. Lee, J. Park, C. Park, A high-speed low-complexity modified radix-$$2^{5}$$ FFT processor for gigabit WPAN applications, in 2011 IEEE International Symposium on Circuits and Systems (ISCAS) (2011), pp. 1259\u20131262. https:\/\/doi.org\/10.1109\/ISCAS.2011.5937799","DOI":"10.1109\/ISCAS.2011.5937799"},{"key":"1136_CR17","unstructured":"J.-R. Choi, S.-B. Park, D.-S. Han, S.-H. Park, A 2048 complex point FFT architecture for digital audio broadcasting system, in The 2000 IEEE International Symposium on Circuits and Systems, 2000. Proceedings. ISCAS 2000 Geneva, vol.\u00a05 (IEEE, 2000), pp. 693\u2013696"},{"issue":"10","key":"1136_CR18","doi-asserted-by":"publisher","first-page":"1664","DOI":"10.1109\/PROC.1967.5957","volume":"55","author":"WT Cochran","year":"1967","unstructured":"W.T. Cochran, J.W. Cooley, D.L. Favin, H.D. Helms, R.A. Kaenel, W.W. Lang, G.C. Maling Jr., D.E. Nelson, C.M. Rader, P.D. Welch, What is the fast Fourier transform? Proc. IEEE 55(10), 1664\u20131674 (1967)","journal-title":"Proc. IEEE"},{"issue":"90","key":"1136_CR19","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1090\/S0025-5718-1965-0178586-1","volume":"19","author":"J Cooley","year":"1965","unstructured":"J. Cooley, J. Tukey, An algorithm for the machine calculation of complex Fourier series. Math. Comput. 19(90), 297\u2013301 (1965)","journal-title":"Math. Comput."},{"key":"1136_CR20","volume-title":"Fast Fourier Transform Processors: Implementing FFT and IFFT Cores for OFDM Communication Systems","author":"A Cort\u00e9s","year":"2012","unstructured":"A. Cort\u00e9s, I. V\u00e9lez, J. Sevillano, M. Turrillas, Fast Fourier Transform Processors: Implementing FFT and IFFT Cores for OFDM Communication Systems (INTECH Open Access Publisher, London, 2012)"},{"issue":"4","key":"1136_CR21","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0016-0032(42)90767-1","volume":"233","author":"GC Danielson","year":"1942","unstructured":"G.C. Danielson, C. Lanczos, Some improvements in practical Fourier analysis and their application to X-ray scattering from liquids. J. Franklin Inst. 233(4), 365\u2013380 (1942)","journal-title":"J. Franklin Inst."},{"issue":"2","key":"1136_CR22","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1109\/TASSP.1986.1164811","volume":"34","author":"P Duhamel","year":"1986","unstructured":"P. Duhamel, Implementation of \u201cSplit-radix\u201d FFT algorithms for complex, real, and real-symmetric data. IEEE Trans. Acoust. Speech Signal Process. 34(2), 285\u2013295 (1986). https:\/\/doi.org\/10.1109\/TASSP.1986.1164811","journal-title":"IEEE Trans. Acoust. Speech Signal Process."},{"issue":"1","key":"1136_CR23","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1049\/el:19840012","volume":"20","author":"P Duhamel","year":"1984","unstructured":"P. Duhamel, H. Hollmann, Split radix. FFT algorithm. Electron. Lett. 20(1), 14\u201316 (1984). https:\/\/doi.org\/10.1049\/el:19840012","journal-title":"Electron. Lett."},{"issue":"4","key":"1136_CR24","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0165-1684(90)90158-U","volume":"19","author":"P Duhamel","year":"1990","unstructured":"P. Duhamel, M. Vetterli, Fast Fourier transforms: a tutorial review and a state of the art. Signal Process. 19(4), 259\u2013299 (1990)","journal-title":"Signal Process."},{"key":"1136_CR25","doi-asserted-by":"crossref","unstructured":"V.K. Dwivedi, P. Kumar, G. Singh, A novel blind frequency offset estimation method for OFDM systems, in International Conference on Recent Advances in Microwave Theory and Applications, 2008. MICROWAVE 2008 (IEEE, 2008), pp. 668\u2013675","DOI":"10.1109\/AMTA.2008.4762985"},{"key":"1136_CR26","doi-asserted-by":"publisher","unstructured":"C.-P. Fan, M.-S. Lee, G.-A. Su, A low multiplier and multiplication costs 256-point FFT implementation with simplified radix-$$2^{4}$$ SDF architecture, in IEEE Asia Pacific Conference on Circuits and Systems, 2006. APCCAS 2006 (2006), pp. 1935\u20131938. https:\/\/doi.org\/10.1109\/APCCAS.2006.342239","DOI":"10.1109\/APCCAS.2006.342239"},{"key":"1136_CR27","unstructured":"M. Frigo, S.G. Johnson, FFTW: an adaptive software architecture for the FFT, in Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, 1998, vol.\u00a03 (IEEE, 1998), pp. 1381\u20131384"},{"issue":"12","key":"1136_CR28","doi-asserted-by":"publisher","first-page":"2634","DOI":"10.1109\/TCSI.2009.2017125","volume":"56","author":"M Garrido","year":"2009","unstructured":"M. Garrido, K.K. Parhi, J. Grajal, A pipelined FFT architecture for real-valued signals. IEEE Trans. Circuits Syst. I Regul. Pap. 56(12), 2634\u20132643 (2009)","journal-title":"IEEE Trans. Circuits Syst. I Regul. Pap."},{"issue":"1","key":"1136_CR29","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1109\/TVLSI.2011.2178275","volume":"21","author":"M Garrido","year":"2013","unstructured":"M. Garrido, J. Grajal, M. Sanchez, O. Gustafsson, Pipelined radix-$$2^{k}$$ feedforward FFT architectures. IEEE Trans. Very Large Scale Integr. (VLSI) Syst. 21(1), 23\u201332 (2013). https:\/\/doi.org\/10.1109\/TVLSI.2011.2178275","journal-title":"IEEE Trans. Very Large Scale Integr. (VLSI) Syst."},{"issue":"10","key":"1136_CR30","doi-asserted-by":"publisher","first-page":"974","DOI":"10.1109\/TCSII.2016.2538119","volume":"63","author":"M Garrido","year":"2016","unstructured":"M. Garrido, S.-J. Huang, S.-G. Chen, O. Gustafsson, The serial commutator FFT. IEEE Trans. Circuits Syst. II Express Briefs 63(10), 974\u2013978 (2016)","journal-title":"IEEE Trans. Circuits Syst. II Express Briefs"},{"key":"1136_CR31","doi-asserted-by":"crossref","unstructured":"W.M. Gentleman, G. Sande, Fast Fourier transforms: for fun and profit, in Proceedings of the November 7\u201310, 1966, Fall Joint Computer Conference (ACM, 1966), pp. 563\u2013578","DOI":"10.1145\/1464291.1464352"},{"key":"1136_CR32","doi-asserted-by":"crossref","unstructured":"B. Ghazi, H. Hassanieh, P. Indyk, D. Katabi, E. Price, L. Shi, Sample-optimal average-case sparse Fourier transform in two dimensions. arXiv preprint arXiv:1303.1209 (2013)","DOI":"10.1109\/Allerton.2013.6736670"},{"issue":"2","key":"1136_CR33","doi-asserted-by":"publisher","first-page":"32","DOI":"10.3390\/info7020032","volume":"7","author":"JD Gibson","year":"2016","unstructured":"J.D. Gibson, Speech compression. Information 7(2), 32 (2016)","journal-title":"Information"},{"key":"1136_CR34","doi-asserted-by":"crossref","unstructured":"A.C. Gilbert, S. Muthukrishnan, M. Strauss, Improved time bounds for near-optimal sparse Fourier representations, in Optics and Photonics 2005 (International Society for Optics and Photonics, 2005)","DOI":"10.1117\/12.615931"},{"key":"1136_CR35","doi-asserted-by":"publisher","first-page":"34","DOI":"10.2307\/2310304","volume":"65","author":"G Goertzel","year":"1958","unstructured":"G. Goertzel, An algorithm for the evaluation of finite trigonometric series. Am. Math. Mon. 65, 34\u201335 (1958)","journal-title":"Am. Math. Mon."},{"key":"1136_CR36","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1111\/j.2517-6161.1958.tb00300.x","volume":"20","author":"IJ Good","year":"1958","unstructured":"I.J. Good, The interaction algorithm and practical Fourier analysis. J. R. Stat. Soc. Ser. B (Methodol.) 20, 361\u2013372 (1958)","journal-title":"J. R. Stat. Soc. Ser. B (Methodol.)"},{"key":"1136_CR37","unstructured":"M.N. Haque, M.S. Uddin, M. Abdullah-Al-Wadud, Y. Chung, Fast reconstruction technique for medical images using graphics processing unit, in Signal Processing, Image Processing and Pattern Recognition (2011), pp. 300\u2013309"},{"key":"1136_CR38","unstructured":"D. Harris, J.H. McClellan, D. Chan, H. Schuessler, Vector radix fast Fourier transform, in IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP\u201977, vol.\u00a02 (IEEE, 1977), pp. 548\u2013551"},{"key":"1136_CR39","doi-asserted-by":"crossref","unstructured":"H. Hassanieh, P. Indyk, D. Katabi, E. Price, Nearly optimal sparse fourier transform. CoRR, arxiv:abs\/1201.2501 (2012a)","DOI":"10.1145\/2213977.2214029"},{"key":"1136_CR40","doi-asserted-by":"crossref","unstructured":"H. Hassanieh, P. Indyk, D. Katabi, E. Price, Simple and practical algorithm for sparse Fourier transform, in Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SIAM, 2012b), pp. 1183\u20131194","DOI":"10.1137\/1.9781611973099.93"},{"key":"1136_CR41","doi-asserted-by":"publisher","unstructured":"S. He, M. Torkelson, A new approach to pipeline FFT processor, in Proceedings of IPPS \u201996, The 10th International Parallel Processing Symposium, 1996 (1996), pp. 766\u2013770. https:\/\/doi.org\/10.1109\/IPPS.1996.508145","DOI":"10.1109\/IPPS.1996.508145"},{"issue":"3","key":"1136_CR42","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF00348431","volume":"34","author":"MT Heideman","year":"1985","unstructured":"M.T. Heideman, D.H. Johnson, C.S. Burrus, Gauss and the history of the fast Fourier transform. Arch. Hist. Exact Sci. 34(3), 265\u2013277 (1985)","journal-title":"Arch. Hist. Exact Sci."},{"key":"1136_CR43","doi-asserted-by":"crossref","unstructured":"S.-H. Hsieh, C.-S. Lu, S.-C. Pei, Sparse fast Fourier transform by downsampling, in 2013 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) (IEEE, 2013), pp. 5637\u20135641","DOI":"10.1109\/ICASSP.2013.6638743"},{"issue":"3","key":"1136_CR44","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s10208-009-9057-1","volume":"10","author":"MA Iwen","year":"2010","unstructured":"M.A. Iwen, Combinatorial sublinear-time Fourier algorithms. Found. Comput. Math. 10(3), 303\u2013338 (2010)","journal-title":"Found. Comput. Math."},{"issue":"4","key":"1136_CR45","doi-asserted-by":"publisher","first-page":"1322","DOI":"10.1109\/TCE.2007.4429219","volume":"53","author":"RM Jiang","year":"2007","unstructured":"R.M. Jiang, An area-efficient FFT architecture for OFDM digital video broadcasting. IEEE Trans. Consum. Electron. 53(4), 1322\u20131326 (2007)","journal-title":"IEEE Trans. Consum. Electron."},{"issue":"1","key":"1136_CR46","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1109\/TSP.2006.882087","volume":"55","author":"SG Johnson","year":"2007","unstructured":"S.G. Johnson, M. Frigo, A modified split-radix FFT with fewer arithmetic operations. IEEE Trans. Signal Process. 55(1), 111\u2013119 (2007)","journal-title":"IEEE Trans. Signal Process."},{"issue":"8","key":"1136_CR47","first-page":"1740","volume":"88","author":"O Jung-Yeol","year":"2005","unstructured":"O. Jung-Yeol, L. Myoung-Seob, New radix-2 to the 4th power pipeline FFT processor. IEICE Trans. Electron. 88(8), 1740\u20131746 (2005)","journal-title":"IEICE Trans. Electron."},{"issue":"11","key":"1136_CR48","doi-asserted-by":"publisher","first-page":"1380","DOI":"10.1109\/PROC.1981.12184","volume":"69","author":"SM Kay","year":"1981","unstructured":"S.M. Kay, S.L. Marple, Spectrum analysisa modern perspective. Proc. IEEE 69(11), 1380\u20131419 (1981)","journal-title":"Proc. IEEE"},{"key":"1136_CR49","first-page":"a1b3","volume":"1","author":"M Khalil-Hani","year":"2015","unstructured":"M. Khalil-Hani, Y. Lee, M. Marsono, An accurate FPGA-based hardware emulation on quantum Fourier transform. Quantum 1, a1b3 (2015)","journal-title":"Quantum"},{"issue":"4","key":"1136_CR50","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1109\/TASSP.1977.1162973","volume":"25","author":"D Kolba","year":"1977","unstructured":"D. Kolba, T. Parks, A prime factor FFT algorithm using high-speed convolution. IEEE Trans. Acoust. Speech Signal Process. 25(4), 281\u2013294 (1977). https:\/\/doi.org\/10.1109\/TASSP.1977.1162973","journal-title":"IEEE Trans. Acoust. Speech Signal Process."},{"issue":"6","key":"1136_CR51","doi-asserted-by":"publisher","first-page":"1331","DOI":"10.1137\/0222080","volume":"22","author":"E Kushilevitz","year":"1993","unstructured":"E. Kushilevitz, Y. Mansour, Learning decision trees using the Fourier spectrum. SIAM J. Comput. 22(6), 1331\u20131348 (1993)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"1136_CR52","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1109\/TSP.2014.2379678","volume":"63","author":"K Li","year":"2015","unstructured":"K. Li, W. Zheng, K. Li, A fast algorithm with less operations for length-DFTs. IEEE Trans. Signal Process. 63(3), 673\u2013683 (2015)","journal-title":"IEEE Trans. Signal Process."},{"key":"1136_CR53","volume-title":"Very Large FFT for TMS320C6678 Processors","author":"X Li","year":"2015","unstructured":"X. Li, E. Blinka, Very Large FFT for TMS320C6678 Processors (Texas Instruments, Dallas, 2015)"},{"key":"1136_CR54","unstructured":"Y. Liao, Phase and Frequency Estimation\u2013High-Accuracy and Low-Complexity Techniques. Ph.D. thesis, Worcester Polytechnic Institute (2011)"},{"key":"1136_CR55","doi-asserted-by":"publisher","DOI":"10.1142\/3724","volume-title":"Introduction to Quantum Computation and Information","author":"H-K Lo","year":"1998","unstructured":"H.-K. Lo, T. Spiller, S. Popescu, Introduction to Quantum Computation and Information (World Scientific, Singapore, 1998)"},{"issue":"4","key":"1136_CR56","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1109\/TAU.1971.1162205","volume":"19","author":"J Markel","year":"1971","unstructured":"J. Markel, FFT pruning. IEEE Trans. Audio Electroacoustics 19(4), 305\u2013311 (1971). https:\/\/doi.org\/10.1109\/TAU.1971.1162205","journal-title":"IEEE Trans. Audio Electroacoustics"},{"issue":"5","key":"1136_CR57","doi-asserted-by":"publisher","first-page":"1038","DOI":"10.1109\/78.295213","volume":"42","author":"SA Martucci","year":"1994","unstructured":"S.A. Martucci, Symmetric convolution and the discrete sine and cosine transforms. IEEE Trans. Signal Process. 42(5), 1038\u20131051 (1994)","journal-title":"IEEE Trans. Signal Process."},{"issue":"8","key":"1136_CR58","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1109\/TCSII.2006.875379","volume":"53","author":"PK Meher","year":"2006","unstructured":"P.K. Meher, Efficient systolic implementation of DFT using a low-complexity convolution-like formulation. IEEE Trans. Circuits Syst. II Express Briefs 53(8), 702\u2013706 (2006)","journal-title":"IEEE Trans. Circuits Syst. II Express Briefs"},{"issue":"12","key":"1136_CR59","doi-asserted-by":"publisher","first-page":"2836","DOI":"10.1109\/TCSI.2015.2495724","volume":"62","author":"PK Meher","year":"2015","unstructured":"P.K. Meher, B.K. Mohanty, S.K. Patel, S. Ganguly, T. Srikanthan, Efficient vlsi architecture for decimation-in-time fast fourier transform of real-valued data. IEEE Trans. Circuits Syst. I Regul. Pap. 62(12), 2836\u20132845 (2015)","journal-title":"IEEE Trans. Circuits Syst. I Regul. Pap."},{"issue":"11","key":"1136_CR60","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1109\/LSP.2006.879475","volume":"13","author":"MJ Narasimha","year":"2006","unstructured":"M.J. Narasimha, Modified overlap-add and overlap-save convolution algorithms for real signals. IEEE Signal Process. Lett. 13(11), 669\u2013671 (2006)","journal-title":"IEEE Signal Process. Lett."},{"issue":"8","key":"1136_CR61","doi-asserted-by":"publisher","first-page":"3364","DOI":"10.1109\/TIP.2012.2197010","volume":"21","author":"M Narwaria","year":"2012","unstructured":"M. Narwaria, W. Lin, I.V. McLoughlin, S. Emmanuel, L.-T. Chia, Fourier transform-based scalable image quality measure. IEEE Trans. Image Process. 21(8), 3364\u20133377 (2012)","journal-title":"IEEE Trans. Image Process."},{"issue":"4","key":"1136_CR62","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/j.spl.2006.08.025","volume":"77","author":"XS Ni","year":"2007","unstructured":"X.S. Ni, X. Huo, Statistical interpretation of the importance of phase information in signal and image reconstruction. Stat. Probab. Lett. 77(4), 447\u2013454 (2007)","journal-title":"Stat. Probab. Lett."},{"issue":"5","key":"1136_CR63","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1109\/PROC.1981.12022","volume":"69","author":"AV Oppenheim","year":"1981","unstructured":"A.V. Oppenheim, J.S. Lim, The importance of phase in signals. Proc. IEEE 69(5), 529\u2013541 (1981)","journal-title":"Proc. IEEE"},{"key":"1136_CR64","volume-title":"Discrete-Time Signal Processing","author":"AV Oppenheim","year":"1989","unstructured":"A.V. Oppenheim, R.W. Schafer, J.R. Buck et al., Discrete-Time Signal Processing, vol. 2 (Prentice-Hall, Englewood Cliffs, 1989)"},{"key":"1136_CR65","volume-title":"The Fast Fourier Transform and Its Applications","author":"E Oran Brigham","year":"1988","unstructured":"E. Oran Brigham, The Fast Fourier Transform and Its Applications (Prentice Hall, Englewood Cliffs, 1988)"},{"key":"1136_CR66","unstructured":"S.-Y. Peng, K.-T. Shr, C.-M. Chen, Y.-H. Huang, Energy-efficient 128 2048\/1536-point FFT processor with resource block mapping for 3GPP-LTE system, in 2010 International Conference on Green Circuits and Systems (ICGCS) (IEEE, 2010), pp. 14\u201317"},{"issue":"6316","key":"1136_CR67","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1126\/science.354.6316.1090","volume":"354","author":"G Popkin","year":"2016","unstructured":"G. Popkin, Quest for qubits. Science 354(6316), 1090\u20131093 (2016). https:\/\/doi.org\/10.1126\/science.354.6316.1090","journal-title":"Science"},{"key":"1136_CR68","unstructured":"I. Present, Cramming more components onto integrated circuits. Read. Comput. Archit. 56 (2000)"},{"issue":"5","key":"1136_CR69","doi-asserted-by":"publisher","first-page":"1153","DOI":"10.1109\/TASSP.1986.1164954","volume":"34","author":"J Princen","year":"1986","unstructured":"J. Princen, A. Bradley, Analysis\/synthesis filter bank design based on time domain aliasing cancellation. IEEE Trans. Acoust. Speech. Signal Process. 34(5), 1153\u20131161 (1986)","journal-title":"IEEE Trans. Acoust. Speech. Signal Process."},{"key":"1136_CR70","volume-title":"Fast Fourier Transform-Algorithms and Applications","author":"KR Rao","year":"2011","unstructured":"K.R. Rao, D.N. Kim, J.J. Hwang, Fast Fourier Transform-Algorithms and Applications (Springer, Berlin, 2011)"},{"issue":"5","key":"1136_CR71","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1109\/TIT.1974.1055282","volume":"20","author":"D Rife","year":"1974","unstructured":"D. Rife, R. Boorstyn, Single tone parameter estimation from discrete-time observations. IEEE Trans. Inf. Theory 20(5), 591\u2013598 (1974)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1136_CR72","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"R.L. Rivest, A. Shamir, L. Adleman, A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"key":"1136_CR73","first-page":"443","volume":"48","author":"C Runge","year":"1903","unstructured":"C. Runge, Zeit. f. Math. u. Phys 48, 443\u2013456 (1903)","journal-title":"Zeit. f. Math. u. Phys"},{"issue":"3\u20134","key":"1136_CR74","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF02242355","volume":"7","author":"A Sch\u00f6nhage","year":"1971","unstructured":"A. Sch\u00f6nhage, V. Strassen, Schnelle multiplikation grosser zahlen. Computing 7(3\u20134), 281\u2013292 (1971)","journal-title":"Computing"},{"issue":"4","key":"1136_CR75","doi-asserted-by":"publisher","first-page":"1181","DOI":"10.1109\/78.752621","volume":"47","author":"BR Sekhar","year":"1999","unstructured":"B.R. Sekhar, K. Prabhu, Radix-2 decimation-in-frequency algorithm for the computation of the real-valued fft. IEEE Trans. Signal Process. 47(4), 1181\u20131184 (1999)","journal-title":"IEEE Trans. Signal Process."},{"key":"1136_CR76","unstructured":"L. Shi et\u00a0al., Imaging Applications of the Sparse FFT. Ph.D. thesis, Massachusetts Institute of Technology (2013)"},{"issue":"2","key":"1136_CR77","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1109\/LSP.2006.882108","volume":"14","author":"H Shu","year":"2007","unstructured":"H. Shu, X. Bao, C. Toumoulin, L. Luo, Radix-3 algorithm for the fast computation of forward and inverse MDCT. IEEE Signal Process. Lett. 14(2), 93\u201396 (2007)","journal-title":"IEEE Signal Process. Lett."},{"issue":"2","key":"1136_CR78","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1109\/TASSP.1977.1162924","volume":"25","author":"H Silverman","year":"1977","unstructured":"H. Silverman, An introduction to programming the Winograd Fourier transform algorithm (WFTA). IEEE Trans. Acoust. Speech Signal Process. 25(2), 152\u2013165 (1977)","journal-title":"IEEE Trans. Acoust. Speech Signal Process."},{"key":"1136_CR79","doi-asserted-by":"publisher","DOI":"10.1109\/9780470544792","volume-title":"Handbook of Real-Time Fast Fourier Transforms","author":"WW Smith","year":"1995","unstructured":"W.W. Smith, J.M. Smith, Handbook of Real-Time Fast Fourier Transforms, vol. 55 (IEEE Press, New York, 1995)"},{"issue":"6","key":"1136_CR80","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1109\/TASSP.1987.1165220","volume":"35","author":"HV Sorensen","year":"1987","unstructured":"H.V. Sorensen, D. Jones, M. Heideman, C. Burrus, Real-valued fast Fourier transform algorithms. IEEE Trans. Acoust. Speech Signal Process. 35(6), 849\u2013863 (1987)","journal-title":"IEEE Trans. Acoust. Speech Signal Process."},{"issue":"5","key":"1136_CR81","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1109\/97.917698","volume":"8","author":"D Takahashi","year":"2001","unstructured":"D. Takahashi, An extended split-radix FFT algorithm. IEEE Signal Process. Lett. 8(5), 145\u2013147 (2001)","journal-title":"IEEE Signal Process. Lett."},{"key":"1136_CR82","doi-asserted-by":"crossref","unstructured":"D. Takahashi, A radix-16 FFT algorithm suitable for multiply-add instruction based on Goedecker method, in International Conference on Multimedia and Expo, ICME\u201903, vol.\u00a02 (IEEE, 2003), pp. II\u2013845","DOI":"10.1109\/ICME.2003.1221749"},{"issue":"6","key":"1136_CR83","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1109\/TC.1985.5009414","volume":"100","author":"FJ Taylor","year":"1985","unstructured":"F.J. Taylor, G. Papadourakis, A. Skavantzos, A. Stouraitis, A radix-4 FFT using complex RNS arithmetic. IEEE Trans. Comput. 100(6), 573\u2013576 (1985)","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"1136_CR84","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/0021-9991(85)90164-0","volume":"58","author":"C Temperton","year":"1985","unstructured":"C. Temperton, Implementation of a self-sorting in-place prime factor FFT algorithm. J. Comput. Phys. 58(3), 283\u2013299 (1985)","journal-title":"J. Comput. Phys."},{"key":"1136_CR85","doi-asserted-by":"crossref","unstructured":"M. Turrillas, A. Cort\u00e9s, I. V\u00e9lez, J.F. Sevillano, A. Irizar, An FFT core for DVB-T2 receivers, in 16th IEEE International Conference on Electronics, Circuits, and Systems, 2009. ICECS 2009 (IEEE, 2009), pp. 120\u2013123","DOI":"10.1109\/ICECS.2009.5410934"},{"issue":"10","key":"1136_CR86","doi-asserted-by":"publisher","first-page":"1311","DOI":"10.1016\/j.mejo.2013.10.016","volume":"45","author":"M Turrillas","year":"2014","unstructured":"M. Turrillas, A. Cort\u00e9s, I. V\u00e9lez, J.F. Sevillano, A. Irizar, An area-efficient radix-$$ 2^8 $$ FFT algorithm for DVB-T2 receivers. Microelectron. J. 45(10), 1311\u20131318 (2014)","journal-title":"Microelectron. J."},{"key":"1136_CR87","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970999","volume-title":"Computational Frameworks for the Fast Fourier Transform","author":"C Van Loan","year":"1992","unstructured":"C. Van Loan, Computational Frameworks for the Fast Fourier Transform (SIAM, Philadelphia, 1992)"},{"key":"1136_CR88","doi-asserted-by":"crossref","unstructured":"S. Wang, V.M. Patel, A. Petropulu, An efficient high-dimensional sparse Fourier transform. arXiv preprint arXiv:1610.01050 (2016)","DOI":"10.1109\/ICASSP.2017.7952976"},{"issue":"6","key":"1136_CR89","doi-asserted-by":"publisher","first-page":"2735","DOI":"10.1109\/TAES.2017.2714918","volume":"53","author":"S Wang","year":"2017","unstructured":"S. Wang, V.M. Patel, A. Petropulu, The robust sparse fourier transform (RSFT) and its application in radar signal processing. IEEE Trans. Aerosp. Electron. Syst. 53(6), 2735\u20132755 (2017)","journal-title":"IEEE Trans. Aerosp. Electron. Syst."},{"issue":"2","key":"1136_CR90","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1109\/TAU.1967.1161901","volume":"15","author":"P Welch","year":"1967","unstructured":"P. Welch, The use of fast Fourier transform for the estimation of power spectra: a method based on time averaging over short, modified periodograms. IEEE Trans. Audio Electroacoustics 15(2), 70\u201373 (1967)","journal-title":"IEEE Trans. Audio Electroacoustics"},{"key":"1136_CR91","doi-asserted-by":"publisher","unstructured":"L.P. Yaroslavsky, Fast transforms in image processing: compression, restoration, and resampling. Adv. Electr. Eng. (2014). https:\/\/doi.org\/10.1155\/2014\/276241","DOI":"10.1155\/2014\/276241"},{"key":"1136_CR92","doi-asserted-by":"crossref","unstructured":"R. Yavne, An economical method for calculating the discrete Fourier transform, in Proceedings of the December 9\u201311, 1968, Fall Joint Computer Conference, Part I (ACM, 1968), pp. 115\u2013125","DOI":"10.1145\/1476589.1476610"},{"issue":"9","key":"1136_CR93","doi-asserted-by":"publisher","first-page":"1793","DOI":"10.1109\/TVLSI.2014.2350017","volume":"23","author":"C Yu","year":"2015","unstructured":"C. Yu, M.-H. Yen, Area-efficient 128-to 2048\/1536-point pipeline FFT processor for LTE and mobile WiMAX systems. IEEE Trans. Very Large Scale Integr. (VLSI) Syst. 23(9), 1793\u20131800 (2015)","journal-title":"IEEE Trans. Very Large Scale Integr. (VLSI) Syst."},{"issue":"2","key":"1136_CR94","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1109\/TCSII.2013.2291098","volume":"61","author":"W Zheng","year":"2014","unstructured":"W. Zheng, K. Li, K. Li, A fast algorithm based on SRFFT for length DFTs. IEEE Trans. Circuits Syst. II Express Briefs 61(2), 110\u2013114 (2014)","journal-title":"IEEE Trans. Circuits Syst. II Express Briefs"}],"container-title":["Circuits, Systems, and Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00034-019-01136-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00034-019-01136-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00034-019-01136-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,17]],"date-time":"2024-07-17T22:46:52Z","timestamp":1721256412000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00034-019-01136-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,11]]},"references-count":94,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["1136"],"URL":"https:\/\/doi.org\/10.1007\/s00034-019-01136-8","relation":{},"ISSN":["0278-081X","1531-5878"],"issn-type":[{"value":"0278-081X","type":"print"},{"value":"1531-5878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5,11]]},"assertion":[{"value":"12 October 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 May 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 May 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}