{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T03:28:14Z","timestamp":1729654094075,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1109\/stc-csit.2017.8098785","type":"proceedings-article","created":{"date-parts":[[2017,11,9]],"date-time":"2017-11-09T16:50:03Z","timestamp":1510246203000},"page":"276-278","source":"Crossref","is-referenced-by-count":0,"title":["Performance evaluation of the program of DCT-II using cyclic convolutions"],"prefix":"10.1109","author":[{"given":"Ihor","family":"Prots'ko","sequence":"first","affiliation":[]},{"given":"Roman","family":"Rikmas","sequence":"additional","affiliation":[]},{"given":"Marta","family":"Mashevska","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Math kernel library","year":"2012","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CADSM.2007.4297512"},{"journal-title":"Patent of Ukraine ?","year":"2006","author":"prots'ko","key":"ref12"},{"key":"ref13","first-page":"1","article-title":"Algorithm of Efficient Computation of DCT I-IV Using Cyclic Convolutions","volume":"7","author":"prots'ko","year":"2013","journal-title":"International Journal of Circuits Systems and Signal Processing"},{"key":"ref14","first-page":"116","article-title":"The program implementation of the synthesis the efficient algorithms for computation of DCT-II via cyclic convolutions","author":"prots'ko","year":"2014","journal-title":"Proceedings of the IXth International Scientific and Technical Conference"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2004.840301"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/78.482008"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511760921"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.73.4.1005"},{"journal-title":"FFTW Homepage","year":"0","key":"ref6"},{"key":"ref5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-81897-4","author":"nussbaumer","year":"1982","journal-title":"Fast Fourier Transform and Convolution Algorithms"},{"journal-title":"Nukada FFT Library","year":"2011","author":"nukada","key":"ref8"},{"journal-title":"SPIRAL Homepage","year":"0","key":"ref7"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1109\/PROC.1968.6477","article-title":"discrete fourier transforms when the number of data samples is prime","volume":"56","author":"rader","year":"1968","journal-title":"Proceedings of the IEEE"},{"key":"ref1","first-page":"114","article-title":"Becoming of Discrete Harmonic Transform Using Cyclic Convolutions","volume":"1","author":"prots'ko","year":"2015","journal-title":"J Circuits Syst Signal Processing"},{"journal-title":"CUFFT libray","article-title":"2701 San Tomas Expressway","year":"2012","key":"ref9"}],"event":{"name":"2017 12th International Scientific and Technical Conference on Computer Sciences and Information Technologies (CSIT)","start":{"date-parts":[[2017,9,5]]},"location":"Lviv","end":{"date-parts":[[2017,9,8]]}},"container-title":["2017 12th International Scientific and Technical Conference on Computer Sciences and Information Technologies (CSIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8086159\/8098722\/08098785.pdf?arnumber=8098785","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T19:13:23Z","timestamp":1570302803000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8098785\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/stc-csit.2017.8098785","relation":{},"subject":[],"published":{"date-parts":[[2017,9]]}}}