{"id":"https://openalex.org/W1701544538","doi":"https://doi.org/10.1109/icassp.1981.1171278","title":"On the simulation of residue number systems","display_name":"On the simulation of residue number systems","publication_year":2005,"publication_date":"2005-03-24","ids":{"openalex":"https://openalex.org/W1701544538","doi":"https://doi.org/10.1109/icassp.1981.1171278","mag":"1701544538"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.1981.1171278","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.1981.1171278","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICASSP '81. IEEE International Conference on Acoustics, Speech, and Signal Processing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5047836842","display_name":"G.R. Redinbo","orcid":"https://orcid.org/0000-0003-0331-1448"},"institutions":[{"id":"https://openalex.org/I165799507","display_name":"Rensselaer Polytechnic Institute","ror":"https://ror.org/01rtyzb94","country_code":"US","type":"education","lineage":["https://openalex.org/I165799507"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"G. Redinbo","raw_affiliation_strings":["Rensselaer Polytechnic Institute, Troy, New York"],"affiliations":[{"raw_affiliation_string":"Rensselaer Polytechnic Institute, Troy, New York","institution_ids":["https://openalex.org/I165799507"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033180096","display_name":"W. Hunnebeck","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"W. Hunnebeck","raw_affiliation_strings":["Hamilton Test Systems, Windsor Locks, CT, USA"],"affiliations":[{"raw_affiliation_string":"Hamilton Test Systems, Windsor Locks, CT, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5047836842"],"corresponding_institution_ids":["https://openalex.org/I165799507"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.11151458,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"6","issue":null,"first_page":"339","last_page":"342"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9945999979972839,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9945999979972839,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11693","display_name":"Cryptography and Residue Arithmetic","score":0.9905999898910522,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9878000020980835,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.8775500059127808},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6209670901298523},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6048038005828857},{"id":"https://openalex.org/keywords/residue-number-system","display_name":"Residue number system","score":0.6018321514129639},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.5279399752616882},{"id":"https://openalex.org/keywords/split-radix-fft-algorithm","display_name":"Split-radix FFT algorithm","score":0.514270007610321},{"id":"https://openalex.org/keywords/prime-factor-fft-algorithm","display_name":"Prime-factor FFT algorithm","score":0.46144264936447144},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4217785894870758},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.40996572375297546},{"id":"https://openalex.org/keywords/computational-science","display_name":"Computational science","score":0.3231985867023468},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.316045343875885},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2784474194049835},{"id":"https://openalex.org/keywords/fourier-analysis","display_name":"Fourier analysis","score":0.14498740434646606},{"id":"https://openalex.org/keywords/fractional-fourier-transform","display_name":"Fractional Fourier transform","score":0.12125906348228455}],"concepts":[{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.8775500059127808},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6209670901298523},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6048038005828857},{"id":"https://openalex.org/C71480937","wikidata":"https://www.wikidata.org/wiki/Q3086516","display_name":"Residue number system","level":2,"score":0.6018321514129639},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.5279399752616882},{"id":"https://openalex.org/C103755468","wikidata":"https://www.wikidata.org/wiki/Q17103599","display_name":"Split-radix FFT algorithm","level":5,"score":0.514270007610321},{"id":"https://openalex.org/C77928272","wikidata":"https://www.wikidata.org/wiki/Q7243214","display_name":"Prime-factor FFT algorithm","level":5,"score":0.46144264936447144},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4217785894870758},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.40996572375297546},{"id":"https://openalex.org/C459310","wikidata":"https://www.wikidata.org/wiki/Q117801","display_name":"Computational science","level":1,"score":0.3231985867023468},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.316045343875885},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2784474194049835},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.14498740434646606},{"id":"https://openalex.org/C76563020","wikidata":"https://www.wikidata.org/wiki/Q4817582","display_name":"Fractional Fourier transform","level":4,"score":0.12125906348228455},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icassp.1981.1171278","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.1981.1171278","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICASSP '81. IEEE International Conference on Acoustics, Speech, and Signal Processing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1489433220","https://openalex.org/W1672001399","https://openalex.org/W2025402512","https://openalex.org/W2080195769","https://openalex.org/W2081934516","https://openalex.org/W2148682337","https://openalex.org/W2182112064","https://openalex.org/W3137605980","https://openalex.org/W4244663218"],"related_works":["https://openalex.org/W2031343199","https://openalex.org/W2977460836","https://openalex.org/W2356814585","https://openalex.org/W2144412928","https://openalex.org/W2113951268","https://openalex.org/W4362564158","https://openalex.org/W1984254719","https://openalex.org/W2185259940","https://openalex.org/W2012363129","https://openalex.org/W2144032791"],"abstract_inverted_index":{"It":[0,66],"is":[1,64,67,78,92],"sometimes":[2],"difficult":[3],"to":[4,36,80],"simulate":[5,37],"on":[6],"general":[7],"purpose":[8],"computers":[9],"the":[10,38,55,81,84,87,97,102,110],"performance":[11],"of":[12,30,83,86,113],"digital":[13],"systems":[14],"that":[15,26],"use":[16,29],"residue":[17,88],"number":[18,45,98],"systems.":[19,46],"This":[20],"paper":[21],"demonstrates":[22],"a":[23,31,93,119],"new":[24],"technique":[25],"makes":[27],"effective":[28],"Fast":[32],"Fourier":[33],"Transform":[34],"(FFT)":[35],"basic":[39],"arithmetic":[40,62],"operations":[41,52,71],"required":[42],"by":[43,69],"such":[44,51],"An":[47],"algorithm":[48],"for":[49],"performing":[50],"which":[53],"involves":[54],"FFT,":[56],"standard":[57],"programming":[58],"techniques":[59],"and":[60,101,116],"normal":[61],"computations":[63],"presented.":[65],"exemplified":[68],"consider":[70],"in":[72],"finite":[73],"fields.":[74],"The":[75],"FFT":[76,111],"size":[77,85,100],"proportional":[79],"exponent":[82],"system.":[89],"Thus":[90],"there":[91],"logarithmetic":[94],"relationship":[95],"between":[96,109],"system's":[99],"transform":[103],"length.":[104],"Favarable":[105],"comparisons":[106],"are":[107],"given":[108],"mechanization":[112],"this":[114],"approach":[115],"one":[117],"employing":[118],"more":[120],"conventional":[121],"assembly":[122],"language":[123],"implementation.":[124]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}