{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:02:29Z","timestamp":1740135749814,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T00:00:00Z","timestamp":1565049600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T00:00:00Z","timestamp":1565049600000},"content-version":"vor","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":[[2020,3]]},"DOI":"10.1007\/s00034-019-01228-5","type":"journal-article","created":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T18:03:37Z","timestamp":1565114617000},"page":"1630-1648","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Constructing Fast Algorithms by Expanding a Set of Matrices into Rank-1 Matrices"],"prefix":"10.1007","volume":"39","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9927-644X","authenticated-orcid":false,"suffix":"Jr.","given":"G.","family":"Jer\u00f4nimo da Silva","sequence":"first","affiliation":[]},{"given":"R. M.","family":"Campello de Souza","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,6]]},"reference":[{"key":"1228_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511760921","volume-title":"Fast Algorithms for Signal Processing","author":"RE Blahut","year":"2010","unstructured":"R.E. Blahut, Fast Algorithms for Signal Processing, 2nd edn. (Cambridge University Press, New York, 2010)","edition":"2"},{"issue":"12","key":"1228_CR2","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. J. Opt. Soc. Am. 73(12), 1832\u20131835 (1983). https:\/\/doi.org\/10.1364\/JOSA.73.001832","journal-title":"J. Opt. Soc. Am."},{"issue":"8","key":"1228_CR3","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1109\/31.85638","volume":"38","author":"SC Chan","year":"1991","unstructured":"S.C. Chan, K.L. Ho, On indexing the prime factor fast Fourier transform algorithm. IEEE Trans. Circuits Syst. 38(8), 951\u2013953 (1991). https:\/\/doi.org\/10.1109\/31.85638","journal-title":"IEEE Trans. Circuits Syst."},{"issue":"90","key":"1228_CR4","doi-asserted-by":"publisher","first-page":"297","DOI":"10.2307\/2003354","volume":"19","author":"JW Cooley","year":"1965","unstructured":"J.W. Cooley, J.W. Tukey, An algorithm for the machine calculation of complex Fourier series. Math. Comput. 19(90), 297\u2013301 (1965). https:\/\/doi.org\/10.2307\/2003354","journal-title":"Math. Comput."},{"key":"1228_CR5","volume-title":"Digital Design: A Systems Approach","author":"W Dally","year":"2012","unstructured":"W. Dally, R. Harting, Digital Design: A Systems Approach (Cambridge University Press, Cambridge, 2012)"},{"issue":"3","key":"1228_CR6","doi-asserted-by":"publisher","first-page":"1040","DOI":"10.1016\/j.dsp.2013.01.003","volume":"23","author":"GJ da Silva Jr","year":"2013","unstructured":"G.J. da Silva Jr., R.M. Campello de Souza, Minimum multiplicative complexity algorithm for computing a single component of the discrete Fourier transform. Digital Signal Process. 23(3), 1040\u20131043 (2013). https:\/\/doi.org\/10.1016\/j.dsp.2013.01.003","journal-title":"Digital Signal Process."},{"issue":"7","key":"1228_CR7","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1109\/97.700916","volume":"5","author":"MD Felder","year":"1998","unstructured":"M.D. Felder, J.C. Mason, B.L. Evans, Efficient dual-tone multifrequency detection using the nonuniform discrete Fourier transform. IEEE Signal Process. Lett. 5(7), 160\u2013163 (1998). https:\/\/doi.org\/10.1109\/97.700916","journal-title":"IEEE Signal Process. Lett."},{"issue":"1","key":"1228_CR8","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(1), 34\u201335 (1958)","journal-title":"Am. Math. Mon."},{"key":"1228_CR9","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":"1228_CR10","doi-asserted-by":"publisher","unstructured":"O. Gustafsson, A.G. Dempster, L. Wanhammar, Extended results for minimum-adder constant integer multipliers, in IEEE International Symposium on Circuits and Systems, 2002. ISCAS 2002, vol.\u00a01, pp. 73\u201376 (2002). https:\/\/doi.org\/10.1109\/ISCAS.2002.1009780","DOI":"10.1109\/ISCAS.2002.1009780"},{"key":"1228_CR11","doi-asserted-by":"publisher","unstructured":"W. Han, A.T. Erdogan, T. Arslan, M. Hasan, The development of high performance FFT IP cores through hybrid low power algorithmic methodology, in Proceedings of the 2005 Asia and South Pacific Design Automation Conference, ASP-DAC\u201905, pp. 549\u2013552. ACM, New York, NY, USA (2005). https:\/\/doi.org\/10.1145\/1120725.1120959","DOI":"10.1145\/1120725.1120959"},{"key":"1228_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-3912-3","volume-title":"Multiplicative Complexity, Convolution, and the DFT","author":"MT Heideman","year":"1988","unstructured":"M.T. Heideman, Multiplicative Complexity, Convolution, and the DFT (Springer, New York, 1988)"},{"key":"1228_CR13","volume-title":"Matrix Analysis","author":"RA Horn","year":"2013","unstructured":"R.A. Horn, C.R. Johnson, Matrix Analysis, 2nd edn. (Cambridge University Press, Cambridge, 2013)","edition":"2"},{"issue":"4","key":"1228_CR14","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":"3","key":"1228_CR15","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0024-3795(75)90071-3","volume":"10","author":"JC Lafon","year":"1975","unstructured":"J.C. Lafon, Optimum computation of p bilinear forms. Linear Algebra Appl. 10(3), 225\u2013240 (1975). https:\/\/doi.org\/10.1016\/0024-3795(75)90071-3","journal-title":"Linear Algebra Appl."},{"issue":"10","key":"1228_CR16","doi-asserted-by":"publisher","first-page":"3221","DOI":"10.1007\/s00034-015-9990-y","volume":"34","author":"I Mamatha","year":"2015","unstructured":"I. Mamatha, T.S.B. Sudarshan, S. Tripathi, N. Bhattar, Triple-matrix product-based 2D systolic implementation of discrete Fourier transform. Circuits Syst. Signal Process. 34(10), 3221\u20133239 (2015). https:\/\/doi.org\/10.1007\/s00034-015-9990-y","journal-title":"Circuits Syst. Signal Process."},{"key":"1228_CR17","series-title":"Signals and Communication Technology","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-45309-0","volume-title":"Digital Signal Processing with Field Programmable Gate Arrays","author":"U Meyer-Baese","year":"2014","unstructured":"U. Meyer-Baese, Digital Signal Processing with Field Programmable Gate Arrays, 4th edn., Signals and Communication Technology (Springer, Berlin, 2014)","edition":"4"},{"issue":"2.7","key":"1228_CR18","doi-asserted-by":"publisher","first-page":"409","DOI":"10.14419\/ijet.v7i2.7.10755","volume":"7","author":"R Nikhil","year":"2018","unstructured":"R. Nikhil, G. Veerendra, J.R.M.S. Harsha, V. Prabhakar, Implementation of time efficient hybrid multiplier for FFT computation. Int. J. Eng. Technol. 7(2.7), 409\u2013413 (2018)","journal-title":"Int. J. Eng. Technol."},{"key":"1228_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4020-6629-0","volume-title":"Fast Fourier Transform\u2014Algorithms and Applications","author":"K Rao","year":"2010","unstructured":"K. Rao, D. Kim, J.J. Hwang, Fast Fourier Transform\u2014Algorithms and Applications (Springer, Dordrecht, 2010). https:\/\/doi.org\/10.1007\/978-1-4020-6629-0"},{"issue":"10","key":"1228_CR20","doi-asserted-by":"publisher","first-page":"3759","DOI":"10.1007\/s00034-015-0217-z","volume":"35","author":"LZ Shi","year":"2016","unstructured":"L.Z. Shi, J.M. Guo, Design of an 8-channel FFT processor for IEEE 802.11ac MIMO-OFDM WLAN system. Circuits Syst. Signal Process. 35(10), 3759\u20133769 (2016). https:\/\/doi.org\/10.1007\/s00034-015-0217-z","journal-title":"Circuits Syst. Signal Process."},{"key":"1228_CR21","first-page":"44","volume":"458","author":"LH Thomas","year":"1963","unstructured":"L.H. Thomas, Using a computer to solve problems in physics. Appl. Dig. Comput. 458, 44\u201345 (1963)","journal-title":"Appl. Dig. Comput."},{"key":"1228_CR22","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1090\/S0025-5718-1978-0468306-4","volume":"32","author":"S Winograd","year":"1978","unstructured":"S. Winograd, On computing the discrete Fourier transform. Math. Comput. 32, 175\u2013199 (1978). https:\/\/doi.org\/10.1090\/S0025-5718-1978-0468306-4","journal-title":"Math. Comput."},{"key":"1228_CR23","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970364","volume-title":"Arithmetic Complexity of Computations","author":"S Winograd","year":"1980","unstructured":"S. Winograd, Arithmetic Complexity of Computations (SIAM Publications, Bristol, 1980)"}],"container-title":["Circuits, Systems, and Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00034-019-01228-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00034-019-01228-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00034-019-01228-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,21]],"date-time":"2024-07-21T19:09:10Z","timestamp":1721588950000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00034-019-01228-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,6]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["1228"],"URL":"https:\/\/doi.org\/10.1007\/s00034-019-01228-5","relation":{},"ISSN":["0278-081X","1531-5878"],"issn-type":[{"type":"print","value":"0278-081X"},{"type":"electronic","value":"1531-5878"}],"subject":[],"published":{"date-parts":[[2019,8,6]]},"assertion":[{"value":"29 January 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 July 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 July 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 August 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}