{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T08:11:44Z","timestamp":1776759104750,"version":"3.51.2"},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1985,8,1]],"date-time":"1985-08-01T00:00:00Z","timestamp":491702400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1985,8,1]],"date-time":"1985-08-01T00:00:00Z","timestamp":491702400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1985,8]]},"DOI":"10.1016\/0743-7315(85)90025-5","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"219-237","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"title":["Fast fourier transform processors using Gaussian residue arithmetic"],"prefix":"10.1016","volume":"2","author":[{"given":"Alvin M.","family":"Despain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Allen M.","family":"Peterson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oscar S.","family":"Rothaus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erling H.","family":"Wold","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0743-7315(85)90025-5_BIB1","first-page":"248","author":"Knuth","year":"1969"},{"key":"10.1016\/0743-7315(85)90025-5_BIB2","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1090\/S0025-5718-1965-0178586-1","article-title":"An algorithm for the machine calculation of complex Fourier series","volume":"19","author":"Cooley","year":"1965","journal-title":"Math Comp."},{"key":"10.1016\/0743-7315(85)90025-5_BIB3","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1111\/j.2517-6161.1958.tb00300.x","article-title":"The interaction algorithm and practical Fourier analysis","volume":"20","author":"Good","year":"1958","journal-title":"J. Royal Statist. Soc. Ser. B"},{"key":"10.1016\/0743-7315(85)90025-5_BIB4","first-page":"1107","article-title":"Discrete Fourier transforms when the number of data samples is prime","volume":"56","author":"Rader","year":"1968"},{"key":"10.1016\/0743-7315(85)90025-5_BIB5","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1109\/TASSP.1977.1162973","article-title":"A prime factor FFT algorithm using high-speed convolution","volume":"ASSP-25","author":"Kolba","year":"1977","journal-title":"IEEE Trans. Acoust. Speech. Signal Process"},{"key":"10.1016\/0743-7315(85)90025-5_BIB6","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1090\/S0025-5718-1978-0468306-4","article-title":"On computing the discrete Fourier transfrom","volume":"32","author":"Winograd","year":"1978","journal-title":"Math Comp."},{"key":"10.1016\/0743-7315(85)90025-5_BIB7","series-title":"Number Theory in Digital Signal Processing","author":"McClellan","year":"1979"},{"key":"10.1016\/0743-7315(85)90025-5_BIB8","series-title":"Residue Arithmetic and Its Applications to Computer Technology","author":"Szabo","year":"1967"},{"key":"10.1016\/0743-7315(85)90025-5_BIB9","series-title":"Proc. 15th Asilomar Conf.","first-page":"70","article-title":"Application of residue number system to complex digital filters","author":"Leung","year":"1981"},{"key":"10.1016\/0743-7315(85)90025-5_BIB10","series-title":"Proc. ICASSP","article-title":"Applications of quadratic-like complex residue number system arithmetic to ultrasonics","author":"Soderstrand","year":"1984"},{"key":"10.1016\/0743-7315(85)90025-5_BIB11","first-page":"65","article-title":"Theoria residuorum biquadraticorum","volume":"Vol. 2","author":"Gauss","year":"1973"},{"key":"10.1016\/0743-7315(85)90025-5_BIB12","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1109\/TC.1979.1675363","article-title":"Very fast Fourier transform algorithms for hardware implementation","volume":"C-28","author":"Despain","year":"1979","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(85)90025-5_BIB13","first-page":"414","article-title":"Pipeline and parallel-pipeline FFT processors for VLSI implementations","author":"Wold","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(85)90025-5_BIB14","series-title":"Digital Signal Processing","author":"Oppenheim","year":"1975"},{"key":"10.1016\/0743-7315(85)90025-5_BIB15","doi-asserted-by":"crossref","first-page":"993","DOI":"10.1109\/T-C.1974.223800","article-title":"Fourier transform computers using CORDIC iterations","volume":"C-23","author":"Despain","year":"1974","journal-title":"IEEE Trans. Comput."}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731585900255?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731585900255?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:29:09Z","timestamp":1757514549000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743731585900255"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,8]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1985,8]]}},"alternative-id":["0743731585900255"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(85)90025-5","relation":{},"ISSN":["0743-7315"],"issn-type":[{"value":"0743-7315","type":"print"}],"subject":[],"published":{"date-parts":[[1985,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Fast fourier transform processors using Gaussian residue arithmetic","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-7315(85)90025-5","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1985 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}