{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T02:30:07Z","timestamp":1648693807725},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1995,10,1]],"date-time":"1995-10-01T00:00:00Z","timestamp":812505600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Signal Processing"],"published-print":{"date-parts":[[1995,10]]},"DOI":"10.1016\/0165-1684(95)00110-y","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:12:45Z","timestamp":1027635165000},"page":"249-252","source":"Crossref","is-referenced-by-count":0,"title":["Realization of an in-place unscrambler for prime factor algorithm"],"prefix":"10.1016","volume":"46","author":[{"given":"Miodrag","family":"Popovi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dragutin","family":"\u0160evi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"No. 7","key":"10.1016\/0165-1684(95)00110-Y_BIB1","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1109\/29.1631","article-title":"Unscrambling for fast DFT algorithms","volume":"Vol. ASSP-36","author":"Burrus","year":"1988","journal-title":"IEEE Trans. Acoust. Speech Signal Process."},{"issue":"No. 4","key":"10.1016\/0165-1684(95)00110-Y_BIB2","doi-asserted-by":"crossref","first-page":"806","DOI":"10.1109\/TASSP.1981.1163645","article-title":"An in-place, in-order prime factor FFT algorithm","volume":"Vol. ASSP-29","author":"Burrus","year":"1981","journal-title":"IEEE Trans. Acoust. Speech Signal Process."},{"key":"10.1016\/0165-1684(95)00110-Y_BIB3","series-title":"DFT\/FFT and Convolution Algorithms \u2014 Theory and Implementation","author":"Burrus","year":"1985"},{"issue":"No. 7","key":"10.1016\/0165-1684(95)00110-Y_BIB4","doi-asserted-by":"crossref","first-page":"2362","DOI":"10.1109\/78.224245","article-title":"An analysis for the realization of an in-place and in-order prime factor algortihm","volume":"Vol. 41","author":"Lun","year":"1993","journal-title":"IEEE Trans. Signal Process."},{"issue":"No. 2","key":"10.1016\/0165-1684(95)00110-Y_BIB5","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1109\/TASSP.1978.1163065","article-title":"A comparative study of time efficient FFT and WFTA programs for general purpose computers","volume":"Vol. ASSP-26","author":"Morris","year":"1978","journal-title":"IEEE Trans. Acoust. Speech Signal Process."},{"issue":"No. 4","key":"10.1016\/0165-1684(95)00110-Y_BIB6","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1109\/TASSP.1979.1163272","article-title":"Bounds on the minimum number of data transfers in WFTA and FFT programs","volume":"Vol. ASSP-27","author":"Nawab","year":"1979","journal-title":"IEEE Trans. Acoust. Speech Signal Process."},{"issue":"No. 4","key":"10.1016\/0165-1684(95)00110-Y_BIB7","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1109\/TASSP.1979.1163263","article-title":"A Winograd-Fourier transform algorithm for real-valued data","volume":"Vol. ASSP-27","author":"Parsons","year":"1979","journal-title":"IEEE Trans. Acoust. Speech Signal Processing"},{"key":"10.1016\/0165-1684(95)00110-Y_BIB8","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1016\/0021-9991(85)90164-0","article-title":"Implementation of self-sorting in-place prime factor FFT algorithm","volume":"Vol. 58","author":"Temperton","year":"1985","journal-title":"J. Computational Phys."}],"container-title":["Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016516849500110Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016516849500110Y?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T18:24:42Z","timestamp":1555266282000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016516849500110Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,10]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,10]]}},"alternative-id":["016516849500110Y"],"URL":"https:\/\/doi.org\/10.1016\/0165-1684(95)00110-y","relation":{},"ISSN":["0165-1684"],"issn-type":[{"value":"0165-1684","type":"print"}],"subject":[],"published":{"date-parts":[[1995,10]]}}}