{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,7,7]],"date-time":"2022-07-07T22:26:43Z","timestamp":1657232803809},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2011,12,1]],"date-time":"2011-12-01T00:00:00Z","timestamp":1322697600000},"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. Signal Process."],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1109\/tsp.2011.2168525","type":"journal-article","created":{"date-parts":[[2011,9,23]],"date-time":"2011-09-23T15:11:45Z","timestamp":1316790705000},"page":"6217-6226","source":"Crossref","is-referenced-by-count":9,"title":["A Methodology for Speeding Up Fast Fourier Transform Focusing on Memory Architecture Utilization"],"prefix":"10.1109","volume":"59","author":[{"given":"Vasilios I.","family":"Kelefouras","sequence":"first","affiliation":[]},{"given":"George S.","family":"Athanasiou","sequence":"additional","affiliation":[]},{"given":"Nikolaos","family":"Alachiotis","sequence":"additional","affiliation":[]},{"given":"Harris E.","family":"Michail","sequence":"additional","affiliation":[]},{"given":"Angeliki S.","family":"Kritikakou","sequence":"additional","affiliation":[]},{"given":"Costas E.","family":"Goutis","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","author":"frigo","year":"2001","journal-title":"The Advanced FFT Program Generator GENFFT"},{"key":"ref11","author":"frigo","year":"0","journal-title":"The Fastest Fourier Transform in the West"},{"key":"ref12","author":"oppenheim","year":"1999","journal-title":"Discrete-Time Signal Processing"},{"key":"ref13","author":"smith","year":"2010","journal-title":"The Scientist and Engineer's Guide to Digital Signal Processing"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/268806.268810","article-title":"The Simplescalar Tool Set, Version 2.0","volume":"25","author":"simplescalar","year":"1997","journal-title":"SIGARCH Comput Archit News"},{"key":"ref15","year":"0","journal-title":"Intel Core 2 Duo Processor e6550"},{"key":"ref16","author":"thoziyoor","year":"2006","journal-title":"CACTI 4 0"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814600"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2007.892722"},{"key":"ref19","first-page":"70","article-title":"Twiddle-factor-based FFT algorithm with reduced memory access","author":"jiang","year":"2002","journal-title":"Proc Int Symp Parallel Distrib Process"},{"key":"ref28","year":"0","journal-title":"Documentation for Ubuntu 10 04 LTS"},{"key":"ref4","first-page":"71","article-title":"Automatic performance tuning in the UHFFT library","author":"mirkovic","year":"2001","journal-title":"Proc Int Conf Comput Sci Part I (ICCS)"},{"key":"ref27","author":"price","year":"1995","journal-title":"MIPS IV Instruction Set Revision 3 1"},{"key":"ref3","author":"johnsson","year":"0","journal-title":"Parallel FFT Software"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/989393.989457"},{"key":"ref29","year":"0","journal-title":"Ubuntu manuals"},{"key":"ref5","article-title":"The Fastest Fourier Transform in the West","author":"frigo","year":"1998","journal-title":"Proc Int Conf Acoust Speech Signal Process (ICASSP)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2006.882087"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2004.840301"},{"key":"ref2","year":"0","journal-title":"Spiral"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.1998.681704"},{"key":"ref1","first-page":"2001","article-title":"Automated empirical optimization of software and the atlas project","volume":"27","author":"antoine","year":"2000","journal-title":"Parallel Comput"},{"key":"ref20","first-page":"630","article-title":"A novel address mapping scheduling strategy for continuous flow parallel FFT implementation","author":"zhang","year":"2006","journal-title":"Proc PDTA"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/EIT.2007.4374500"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICECS.2006.379653"},{"key":"ref24","author":"frigo","year":"0","journal-title":"Manual of FFTW"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/EIT.2009.5189656"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1509864.1509865"},{"key":"ref25","author":"pinter","year":"1996","journal-title":"Register Allocation With Instruction Scheduling A New Approach"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/78\/6069620\/06021384.pdf?arnumber=6021384","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:47:32Z","timestamp":1633909652000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6021384\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12]]},"references-count":29,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tsp.2011.2168525","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12]]}}}