{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:58:29Z","timestamp":1740131909100,"version":"3.37.3"},"reference-count":46,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2017,8,1]],"date-time":"2017-08-01T00:00:00Z","timestamp":1501545600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100003593","name":"CNPq","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006162","name":"FACEPE","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100006162","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100000038","name":"NSERC","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2017,8,1]]},"DOI":"10.1109\/tc.2017.2677427","type":"journal-article","created":{"date-parts":[[2017,3,2]],"date-time":"2017-03-02T19:35:44Z","timestamp":1488483344000},"page":"1442-1448","source":"Crossref","is-referenced-by-count":12,"title":["DFT Computation Using Gauss-Eisenstein Basis: FFT Algorithms and VLSI Architectures"],"prefix":"10.1109","volume":"66","author":[{"given":"Diego F. G.","family":"Coelho","sequence":"first","affiliation":[]},{"given":"Renato J.","family":"Cintra","sequence":"additional","affiliation":[]},{"given":"Nilanka","family":"Rajapaksha","sequence":"additional","affiliation":[]},{"given":"Gihan J.","family":"Mendis","sequence":"additional","affiliation":[]},{"given":"Arjuna","family":"Madanayake","sequence":"additional","affiliation":[]},{"given":"Vassil S.","family":"Dimitrov","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1201\/9781420040937"},{"key":"ref38","volume":"2","author":"apostol","year":"1968","journal-title":"Calculus"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2003.10.004"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/B978-012373624-6\/50003-5"},{"key":"ref31","first-page":"11\/1","article-title":"multiplication by an integer using minimum adders","author":"dempster","year":"1994","journal-title":"IEE Colloquium on Mathematical Aspects of Digital Signal Processing (Digest No 1994\/034)"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/BF01683270"},{"key":"ref37","volume":"1","author":"apostol","year":"1966","journal-title":"Calculus"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1049\/el:19860239"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2009.2036384"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2012.2221171"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2014.2298283"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1155\/2011\/136319"},{"key":"ref11","volume":"1","author":"oppenheim","year":"2009","journal-title":"Discrete Time Signal Processing"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1986.1164826"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.1993.342526"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1049\/el.2012.0577"},{"key":"ref15","first-page":"1","article-title":"Efficient implementation of 3780-point FFT on a 16-core processor","author":"yang","year":"2013","journal-title":"10th IEEE Int ASIC Conf"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/WCINS.2010.5541737"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/FPL.2009.5272266"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/11.992857"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/NORCHP.2011.6126703"},{"journal-title":"An Introduction to the Theory of Numbers","year":"1968","author":"hardy","key":"ref28"},{"key":"ref4","first-page":"675","article-title":"Eisenstein residue number system with applications to DSP","volume":"2","author":"dimitrov","year":"1997","journal-title":"Proc 40th Midwest Symp Circuits Syst"},{"key":"ref27","article-title":"Representa&#x00E7;&#x00E3;o num&#x00E9;rica em inteiros\n de Gauss-Eisenstein","author":"coelho","year":"2012","journal-title":"Anais do XX Simp&#x00F3;sio Bras de Telecomunica&#x00E7;&#x00F5;es"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511760921"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2011.2181232"},{"journal-title":"A First Course in Abstract Algebra","year":"2003","author":"fraleigh","key":"ref29"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1987.1057322"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057081"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1980.1163370"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISED.2010.27"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/78.661325"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TENCON.2005.301206"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/CoolChips.2016.7503678"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/0030-4018(88)90242-8"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/JSSC.2003.822776"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1977.1162924"},{"article-title":"Radix-12 DFT\/FFT building block","year":"1993","author":"white","key":"ref21"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s00034-011-9332-7"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIM.2005.847206"},{"key":"ref41","first-page":"1","article-title":"FPGA design and implementation of radix-2 fast\n Fourier transform algorithm with 16 and 32 points","author":"saenz","year":"2015","journal-title":"Proc IEEE Int Autumn Meet Power Electron Comput"},{"key":"ref23","first-page":"289","article-title":"A multi-core mapping implementation of 3780-point FFT","author":"chen","year":"2012","journal-title":"Proc IEEE Int SOC Conf"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1155\/S1110865703309060"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1981.1163631"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/SPICES.2015.7091472"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/61.311153"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/12\/7972690\/07869325.pdf?arnumber=7869325","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:15:27Z","timestamp":1642004127000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7869325\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,1]]},"references-count":46,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tc.2017.2677427","relation":{},"ISSN":["0018-9340"],"issn-type":[{"type":"print","value":"0018-9340"}],"subject":[],"published":{"date-parts":[[2017,8,1]]}}}