{"id":"https://openalex.org/W2097529788","doi":"https://doi.org/10.1109/icassp.1980.1170995","title":"Floating point error bound in the prime factor FFT","display_name":"Floating point error bound in the prime factor FFT","publication_year":2005,"publication_date":"2005-03-24","ids":{"openalex":"https://openalex.org/W2097529788","doi":"https://doi.org/10.1109/icassp.1980.1170995","mag":"2097529788"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.1980.1170995","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.1980.1170995","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICASSP '80. 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/A5112772811","display_name":"D.C. Munson","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D. Munson","raw_affiliation_strings":["Coordinated Science Laboratory, and Department of Electrical Engineering, University of Illinois, Urbana, IL, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Coordinated Science Laboratory, and Department of Electrical Engineering, University of Illinois, Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069653119","display_name":"Bede Liu","orcid":null},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bede Liu","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, Princeton University, Princeton, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, Princeton University, Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.17007882,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"5","issue":null,"first_page":"69","last_page":"72"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11034","display_name":"Digital Filter Design and Implementation","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9944999814033508,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.9328426122665405},{"id":"https://openalex.org/keywords/split-radix-fft-algorithm","display_name":"Split-radix FFT algorithm","score":0.7736528515815735},{"id":"https://openalex.org/keywords/prime-factor-fft-algorithm","display_name":"Prime-factor FFT algorithm","score":0.7028458118438721},{"id":"https://openalex.org/keywords/prime","display_name":"Prime (order theory)","score":0.6265812516212463},{"id":"https://openalex.org/keywords/floating-point","display_name":"Floating point","score":0.5990864038467407},{"id":"https://openalex.org/keywords/raders-fft-algorithm","display_name":"Rader's FFT algorithm","score":0.5473768711090088},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5217429399490356},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4974654018878937},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4934300482273102},{"id":"https://openalex.org/keywords/expression","display_name":"Expression (computer science)","score":0.4848159849643707},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.48164787888526917},{"id":"https://openalex.org/keywords/fixed-point-arithmetic","display_name":"Fixed-point arithmetic","score":0.4494955241680145},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4485906958580017},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.43342214822769165},{"id":"https://openalex.org/keywords/factor","display_name":"Factor (programming language)","score":0.43124592304229736},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4178907871246338},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.16552460193634033},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.10541200637817383},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.09922930598258972},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08240368962287903},{"id":"https://openalex.org/keywords/fourier-analysis","display_name":"Fourier analysis","score":0.07207950949668884}],"concepts":[{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.9328426122665405},{"id":"https://openalex.org/C103755468","wikidata":"https://www.wikidata.org/wiki/Q17103599","display_name":"Split-radix FFT algorithm","level":5,"score":0.7736528515815735},{"id":"https://openalex.org/C77928272","wikidata":"https://www.wikidata.org/wiki/Q7243214","display_name":"Prime-factor FFT algorithm","level":5,"score":0.7028458118438721},{"id":"https://openalex.org/C184992742","wikidata":"https://www.wikidata.org/wiki/Q7243229","display_name":"Prime (order theory)","level":2,"score":0.6265812516212463},{"id":"https://openalex.org/C84211073","wikidata":"https://www.wikidata.org/wiki/Q117879","display_name":"Floating point","level":2,"score":0.5990864038467407},{"id":"https://openalex.org/C69598009","wikidata":"https://www.wikidata.org/wiki/Q7280126","display_name":"Rader's FFT algorithm","level":5,"score":0.5473768711090088},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5217429399490356},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4974654018878937},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4934300482273102},{"id":"https://openalex.org/C90559484","wikidata":"https://www.wikidata.org/wiki/Q778379","display_name":"Expression (computer science)","level":2,"score":0.4848159849643707},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.48164787888526917},{"id":"https://openalex.org/C163973906","wikidata":"https://www.wikidata.org/wiki/Q649900","display_name":"Fixed-point arithmetic","level":3,"score":0.4494955241680145},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4485906958580017},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.43342214822769165},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.43124592304229736},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4178907871246338},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.16552460193634033},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.10541200637817383},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.09922930598258972},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08240368962287903},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.07207950949668884},{"id":"https://openalex.org/C166386157","wikidata":"https://www.wikidata.org/wiki/Q1477735","display_name":"Short-time Fourier transform","level":4,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icassp.1980.1170995","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.1980.1170995","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICASSP '80. IEEE International Conference on Acoustics, Speech, and Signal Processing","raw_type":"proceedings-article"},{"id":"pmh:ADA091696","is_oa":false,"landing_page_url":"http://oai.dtic.mil/oai/oai?&amp;verb=getRecord&amp;metadataPrefix=html&amp;identifier=ADA091696","pdf_url":null,"source":{"id":"https://openalex.org/S4406923043","display_name":"Defense Technical Information Center (DTIC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"DTIC AND NTIS","raw_type":"Text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1985765205","https://openalex.org/W1985896262","https://openalex.org/W1997654368","https://openalex.org/W2005015931","https://openalex.org/W2051150863","https://openalex.org/W2065387773","https://openalex.org/W2159447938","https://openalex.org/W4254389654"],"related_works":["https://openalex.org/W2144412928","https://openalex.org/W2554524608","https://openalex.org/W2113951268","https://openalex.org/W2977460836","https://openalex.org/W4362564158","https://openalex.org/W2031343199","https://openalex.org/W2042527476","https://openalex.org/W2159447938","https://openalex.org/W2513406307","https://openalex.org/W2065778560"],"abstract_inverted_index":{"The":[0],"prime":[1],"factor":[2],"FFT":[3,49,69],"<PF":[4],"FFT),":[5],"developed":[6],"by":[7,18,33],"Kolba":[8],"and":[9,37],"Parks,":[10],"makes":[11],"use":[12],"of":[13,28,77,98],"recent":[14],"computational":[15],"complexity":[16],"results":[17],"Winograd":[19],"to":[20,92,96],"compute":[21],"the":[22,34,44,47,64,67,75,78,83],"DFT":[23],"with":[24],"a":[25,61],"fewer":[26],"number":[27],"multiplications":[29],"than":[30],"that":[31],"required":[32],"FFT.":[35],"Patterson":[36],"McClellan":[38],"have":[39],"derived":[40],"an":[41,80],"expression":[42,81],"for":[43,82],"MSE":[45,65,85],"in":[46,66],"PF":[48,68],"assuming":[50,70],"finite":[51],"precision":[52],"fixed":[53],"point":[54,72],"arithmetic.":[55,73],"In":[56,74],"this":[57],"paper":[58],"we":[59],"derive":[60],"bound":[62],"on":[63],"floating":[71],"course":[76],"derivation":[79],"actual":[84],"is":[86,90],"also":[87],"presented,":[88],"but":[89],"seen":[91],"be":[93,97],"too":[94],"complicated":[95],"practical":[99],"use.":[100]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}