{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T20:48:20Z","timestamp":1754599700763},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1982,9,1]],"date-time":"1982-09-01T00:00:00Z","timestamp":399686400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1982,9]]},"DOI":"10.1007\/bf02241701","type":"journal-article","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T04:27:02Z","timestamp":1132028822000},"page":"263-276","source":"Crossref","is-referenced-by-count":4,"title":["Algorithm fast fourier transforms with recursively generated trigonometric functions","Algorithmus 49. Schnelle Fouriertransformation mit rekursiv generierten trigonometrischen Funktionen"],"prefix":"10.1007","volume":"29","author":[{"given":"K.","family":"Dobe\u0161","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02241701_CR1","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1109\/TAU.1967.1161899","volume":"15","author":"W. T. Cohran","year":"1967","unstructured":"Cohran, W. T., et al.: What is the fast Fourier transform? IEEE Trans. Audio Electroacoust.AU-15, 45\u201355 (1967).","journal-title":"IEEE Trans. Audio Electroacoust. AU"},{"key":"BF02241701_CR2","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1090\/S0025-5718-1968-0226899-X","volume":"22","author":"G. D. Bergland","year":"1968","unstructured":"Bergland, G. D.: A fast Fourier transform algorithm using base 8. Math. Comp.22,275\u2013279 (1968).","journal-title":"Math. Comp."},{"key":"BF02241701_CR3","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1109\/TAU.1967.1161906","volume":"15","author":"R. C. Singleton","year":"1967","unstructured":"Singleton, R. C.: A method for computing the fast Fourier transform with auxiliary memory and limited high-speed storage. IEEE Trans. Audio Electroacoust.AU-15, 91\u201398 (1967).","journal-title":"IEEE Trans. Audio Electroacoust. AU"},{"key":"BF02241701_CR4","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1145\/362875.362895","volume":"12","author":"R. C. Singleton","year":"1969","unstructured":"Singleton, R. C.: An algol convolution procedure based on the fast Fourier transform. Algorithm 345. Commun. ACM12, 179\u2013184 (1969).","journal-title":"Commun. ACM"},{"key":"BF02241701_CR5","first-page":"83","volume":"17","author":"R. C. Singleton","year":"1969","unstructured":"Singleton, R. C.: An algorithm for computing the mixed radix fast Fourier transform.IEEE Trans. Audio Electroacoust.AU-17, 83\u2013103 (1969).","journal-title":"IEEE Trans. Audio Electroacoust. AU"},{"key":"BF02241701_CR6","volume-title":"Discrete signal processing library, Vol. 1: Fast Fourier transform","author":"K. Dobe\u0161","year":"1977","unstructured":"Dobe\u0161, K.: Discrete signal processing library, Vol. 1: Fast Fourier transform. Geophysical Institute, Czechoslovak Academy of Sci., Prague, 1977."},{"key":"BF02241701_CR7","doi-asserted-by":"crossref","first-page":"268","DOI":"10.2307\/2346723","volume":"24","author":"D. M. Monro","year":"1975","unstructured":"Monro, D. M.: Algorithm AS 83. Complex discrete fast Fourier transform. Appl. Statist.24, 268\u2013272 (1975).","journal-title":"Appl. Statist."},{"key":"BF02241701_CR8","unstructured":"System\/360 scientific subroutine package (FORTRAN). Version III. IBM Application Program."},{"key":"BF02241701_CR9","unstructured":"Brenner, N.: Cooley \u2014 Tukey fast Fourier transform \u2014 FOUR2 in assembler language, 360D-13.4.008. Contributed Program Library. IBM Corporation, 1969."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02241701.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02241701\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02241701","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T11:58:36Z","timestamp":1683287916000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02241701"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,9]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1982,9]]}},"alternative-id":["BF02241701"],"URL":"https:\/\/doi.org\/10.1007\/bf02241701","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,9]]}}}