{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T14:45:39Z","timestamp":1761057939016},"reference-count":20,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[1985,2,1]],"date-time":"1985-02-01T00:00:00Z","timestamp":476064000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Acoust., Speech, Signal Process."],"published-print":{"date-parts":[[1985,2]]},"DOI":"10.1109\/tassp.1985.1164526","type":"journal-article","created":{"date-parts":[[2004,4,28]],"date-time":"2004-04-28T16:42:45Z","timestamp":1083170565000},"page":"248-254","source":"Crossref","is-referenced-by-count":13,"title":["On the structure of efficient DFT algorithms"],"prefix":"10.1109","volume":"33","author":[{"given":"H.","family":"Johnson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Burrus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970364"},{"key":"ref11b","year":"1982","journal-title":"IEEE ICASSP"},{"key":"ref12","year":"1981","journal-title":"Large DFT Modules 11 13 17 19 and 25"},{"key":"ref13","article-title":"Speeding up the discrete Fourier transform by formal algebraic operations","author":"beth","year":"1983","journal-title":"AEU"},{"key":"ref11a","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1983.1164071"},{"key":"ref14","author":"morris","year":"1983","journal-title":"Digital Signal Processing Software"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/0165-1684(83)90021-X"},{"key":"ref17","year":"1979","journal-title":"LINPACK User's Guide"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCS.1983.1085292"},{"key":"ref4","author":"mcclellan","year":"1979","journal-title":"Number Theory in Digital Signal Processing"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1977.1162973"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1982.1163852"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1981.1163645"},{"key":"ref8","first-page":"827","article-title":"Winograd convolution algorithms over finite fields","volume":"29","author":"rice","year":"1980","journal-title":"Congressus Numeratium"},{"key":"ref7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-81897-4","author":"nussbaumer","year":"1982","journal-title":"Fast Fourier Transform and Convolution Algorithms"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1977.1162924"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.73.4.1005"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1977.1162981"},{"key":"ref16b","year":"0"},{"key":"ref16a","author":"johnson","year":"1982","journal-title":"The design of DFT algorithms"}],"container-title":["IEEE Transactions on Acoustics, Speech, and Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx6\/29\/26189\/01164526.pdf?arnumber=1164526","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T15:39:57Z","timestamp":1638200397000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1164526\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,2]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,2]]}},"URL":"https:\/\/doi.org\/10.1109\/tassp.1985.1164526","relation":{},"ISSN":["0096-3518"],"issn-type":[{"value":"0096-3518","type":"print"}],"subject":[],"published":{"date-parts":[[1985,2]]}}}