{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:30:42Z","timestamp":1725496242846},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540772231"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77224-8_34","type":"book-chapter","created":{"date-parts":[[2007,11,29]],"date-time":"2007-11-29T10:38:56Z","timestamp":1196332736000},"page":"291-300","source":"Crossref","is-referenced-by-count":11,"title":["The Tangent FFT"],"prefix":"10.1007","author":[{"given":"Daniel J.","family":"Bernstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"34_CR1","unstructured":"1968 Fall Joint Computer Conference. In: AFIPS conference proceedings, vol. 33, part one. See [13] (1968)"},{"key":"34_CR2","doi-asserted-by":"publisher","first-page":"297","DOI":"10.2307\/2003354","volume":"19","author":"J.W. Cooley","year":"1965","unstructured":"Cooley, J.W., Tukey, J.W.: An Algorithm for the Machine Calculation of Complex Fourier Series. Mathematics of Computation\u00a019, 297\u2013301 (1965)","journal-title":"Mathematics of Computation"},{"key":"34_CR3","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1049\/el:19840012","volume":"20","author":"P. Duhamel","year":"1984","unstructured":"Duhamel, P., Hollmann, H.: Split-Radix FFT algorithm. Electronics Letters\u00a020, 14\u201316 (1984)","journal-title":"Electronics Letters"},{"key":"34_CR4","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0165-1684(90)90158-U","volume":"19","author":"P. Duhamel","year":"1990","unstructured":"Duhamel, P., Vetterli, M.: Fast Fourier Transforms: a Tutorial Review and a State of the Art. Signal Processing\u00a019, 259\u2013299 (1990)","journal-title":"Signal Processing"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"Fiduccia, C.M.: Polynomial Evaluation Via the Division Algorithm: the Fast Fourier Transform Revisited. In: [10], pp. 88\u201393 (1972)","DOI":"10.1145\/800152.804900"},{"key":"34_CR6","unstructured":"Gauss, C.F.: Werke, Band 3 K\u00f6niglichen Gesellschaft der Wissenschaften. G\u00f6ttingen (1866)"},{"key":"34_CR7","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1109\/TSP.2006.882087","volume":"55","author":"S.G. Johnson","year":"2007","unstructured":"Johnson, S.G., Frigo, M.: A Modified Split-Radix FFT with Fewer Arithmetic Operations. IEEE Trans. on Signal Processing\u00a055, 111\u2013119 (2007)","journal-title":"IEEE Trans. on Signal Processing"},{"key":"34_CR8","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s00607-007-0222-6","volume":"80","author":"T.J. Lundy","year":"2007","unstructured":"Lundy, T.J., Van Buskirk, J.: A New Matrix Approach to Real FFTs and Convolutions of Length 2\n                    k\n                  . Computing\u00a080, 23\u201345 (2007)","journal-title":"Computing"},{"key":"34_CR9","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1109\/TASSP.1984.1164395","volume":"32","author":"J.B. Martens","year":"1984","unstructured":"Martens, J.B.: Recursive Cyclotomic Factorization\u2014A New Algorithm for Calculating the Discrete Fourier Transform. IEEE Trans. Acoustics, Speech, and Signal Processing\u00a032, 750\u2013761 (1984)","journal-title":"IEEE Trans. Acoustics, Speech, and Signal Processing"},{"key":"34_CR10","unstructured":"Rosenberg, A.L.: Fourth Annual ACM Symposium on Theory Of Computing. Association for Computing Machinery, New York (1972)"},{"key":"34_CR11","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1109\/TASSP.1986.1164804","volume":"34","author":"H.V. Sorensen","year":"1986","unstructured":"Sorensen, H.V., Heideman, M.T., Burrus, C.S.: On Computing the Split-Radix FFT. IEEE Trans. Acoustics, Speech, and Signal Processing\u00a034, 152\u2013156 (1986)","journal-title":"IEEE Trans. Acoustics, Speech, and Signal Processing"},{"key":"34_CR12","first-page":"262","volume":"6","author":"M. Vetterli","year":"1984","unstructured":"Vetterli, M., Nussbaumer, H.J.: Simple FFT and DCT Algorithms with Reduced Number of Operations. Signal Processing\u00a06, 262\u2013278 (1984)","journal-title":"Signal Processing"},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"Yavne, R.: An Economical Method for Calculating the Discrete Fourier Transform. In: [1], pp. 115\u2013125 (1968)","DOI":"10.1145\/1476589.1476610"},{"key":"34_CR14","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1023\/A:1008078815026","volume":"20","author":"F. Zhou","year":"1998","unstructured":"Zhou, F., Kornerup, P.: A New Fast Discrete Fourier Transform. J. VLSI Signal Processing\u00a020, 219\u2013232 (1998)","journal-title":"J. VLSI Signal Processing"}],"container-title":["Lecture Notes in Computer Science","Applied Algebra, Algebraic Algorithms and Error-Correcting Codes"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77224-8_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:04:47Z","timestamp":1619521487000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77224-8_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540772231"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77224-8_34","relation":{},"subject":[]}}