{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:04:11Z","timestamp":1750309451384,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,9,30]],"date-time":"2024-09-30T00:00:00Z","timestamp":1727654400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,9,30]]},"DOI":"10.1145\/3695794.3695818","type":"proceedings-article","created":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T04:06:53Z","timestamp":1733976413000},"page":"245-256","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Memory Efficiency Oriented Fine-Grain Representation and Optimization of FFT"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-7310-8299","authenticated-orcid":false,"given":"Salvatore","family":"Servodio","sequence":"first","affiliation":[{"name":"University of Delaware, Delaware, MD, United States"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5079-3219","authenticated-orcid":false,"given":"Xiaoming","family":"Li","sequence":"additional","affiliation":[{"name":"University of Delaware, Delaware, MD, United States"}]}],"member":"320","published-online":{"date-parts":[[2024,12,11]]},"reference":[{"key":"e_1_3_3_1_2_2","doi-asserted-by":"crossref","unstructured":"L. Bluestein. 1970. A linear filtering approach to the computation of discrete Fourier transform. Audio and Electroacoustics IEEE Transactions on 18 4 (1970) 451\u2013455.","DOI":"10.1109\/TAU.1970.1162132"},{"key":"e_1_3_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/1810085.1810128"},{"key":"e_1_3_3_1_4_2","doi-asserted-by":"publisher","unstructured":"J.W. Cooley P.A.W. Lewis and P.D. Welch. 1970. The fast Fourier transform algorithm: Programming considerations in the calculation of sine cosine and Laplace transforms. Journal of Sound and Vibration 12 3 (1970) 315\u2013337. 10.1016\/0022-460X(70)90075-1","DOI":"10.1016\/0022-460X(70)90075-1"},{"key":"e_1_3_3_1_5_2","doi-asserted-by":"crossref","unstructured":"J.W. Cooley and J.W. Tukey. 1965. An algorithm for the machine computation of complex Fourier series. Math. Comp. 19 90 (1965) 297\u2013301.","DOI":"10.1090\/S0025-5718-1965-0178586-1"},{"key":"e_1_3_3_1_6_2","doi-asserted-by":"crossref","unstructured":"P. Duhamel and M. Vetterli. 1990. Fast fourier transforms: a tutorial review and a state of the art. Signal Process. 19 4 (April 1990) 259\u2013299.","DOI":"10.1016\/0165-1684(90)90158-U"},{"key":"e_1_3_3_1_7_2","doi-asserted-by":"crossref","unstructured":"M. Frigo and SG Johnson. 1997. The Fastest Fourier Transform in the West. (1997).","DOI":"10.21236\/ADA479065"},{"key":"e_1_3_3_1_8_2","doi-asserted-by":"crossref","unstructured":"Matteo Frigo and Steven\u00a0G. Johnson. 2005. The Design and Implementation of FFTW3. Proceeding of the IEEE 93 2 (2005) 216\u2013231.","DOI":"10.1109\/JPROC.2004.840301"},{"key":"e_1_3_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.5555\/1413370.1413373"},{"key":"e_1_3_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/1810085.1810127"},{"key":"e_1_3_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/1995896.1995937"},{"key":"e_1_3_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/1654059.1654090"},{"key":"e_1_3_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.5555\/1413370.1413376"},{"key":"e_1_3_3_1_14_2","doi-asserted-by":"crossref","unstructured":"CM Rader. 1968. Discrete Fourier transforms when the number of data samples is prime. Proc. IEEE 56 6 (1968) 1107\u20131108.","DOI":"10.1109\/PROC.1968.6477"},{"key":"e_1_3_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPCCC51483.2021.9679431"},{"key":"e_1_3_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139871495"},{"key":"e_1_3_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970364"},{"key":"e_1_3_3_1_18_2","doi-asserted-by":"publisher","unstructured":"S. Zaks. 1980. Lexicographic Generation of Ordered Trees. Theoretical Computer Science 10 1 (1980) 63\u201381. 10.1016\/0304-3975(80)90073-0","DOI":"10.1016\/0304-3975(80)90073-0"}],"event":{"name":"MEMSYS '24: The International Symposium on Memory Systems","acronym":"MEMSYS '24","location":"Washington DC USA"},"container-title":["Proceedings of the International Symposium on Memory Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3695794.3695818","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3695794.3695818","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:10:06Z","timestamp":1750295406000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3695794.3695818"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,30]]},"references-count":17,"alternative-id":["10.1145\/3695794.3695818","10.1145\/3695794"],"URL":"https:\/\/doi.org\/10.1145\/3695794.3695818","relation":{},"subject":[],"published":{"date-parts":[[2024,9,30]]},"assertion":[{"value":"2024-12-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}