{"id":"https://openalex.org/W2100812050","doi":"https://doi.org/10.1109/icassp.1979.1170654","title":"New polynomial transform algorithms for fast DFT computation","display_name":"New polynomial transform algorithms for fast DFT computation","publication_year":2005,"publication_date":"2005-03-24","ids":{"openalex":"https://openalex.org/W2100812050","doi":"https://doi.org/10.1109/icassp.1979.1170654","mag":"2100812050"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.1979.1170654","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.1979.1170654","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICASSP '79. 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/A5109244935","display_name":"H. Nussbaumer","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"H. Nussbaumer","raw_affiliation_strings":["IBM Laboratory, La Gaude, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM Laboratory, La Gaude, France","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110111798","display_name":"P. Quandalle","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"P. Quandalle","raw_affiliation_strings":["IBM Laboratory, La Gaude, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM Laboratory, La Gaude, France","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.324,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.58474127,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"4","issue":null,"first_page":"510","last_page":"513"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11034","display_name":"Digital Filter Design and Implementation","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T11034","display_name":"Digital Filter Design and Implementation","score":0.9998000264167786,"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.9950000047683716,"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/T11435","display_name":"Polynomial and algebraic computation","score":0.982699990272522,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.7853695154190063},{"id":"https://openalex.org/keywords/discrete-fourier-transform","display_name":"Discrete Fourier transform (general)","score":0.7709888815879822},{"id":"https://openalex.org/keywords/cyclotomic-fast-fourier-transform","display_name":"Cyclotomic fast Fourier transform","score":0.7188442349433899},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6334881782531738},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.618571400642395},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5916144847869873},{"id":"https://openalex.org/keywords/split-radix-fft-algorithm","display_name":"Split-radix FFT algorithm","score":0.5829311609268188},{"id":"https://openalex.org/keywords/prime-factor-fft-algorithm","display_name":"Prime-factor FFT algorithm","score":0.5732148885726929},{"id":"https://openalex.org/keywords/raders-fft-algorithm","display_name":"Rader's FFT algorithm","score":0.5509931445121765},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.5110675096511841},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4867722988128662},{"id":"https://openalex.org/keywords/discrete-hartley-transform","display_name":"Discrete Hartley transform","score":0.42465895414352417},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40501800179481506},{"id":"https://openalex.org/keywords/fractional-fourier-transform","display_name":"Fractional Fourier transform","score":0.3919874429702759},{"id":"https://openalex.org/keywords/fourier-analysis","display_name":"Fourier analysis","score":0.27414846420288086},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.10154801607131958}],"concepts":[{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.7853695154190063},{"id":"https://openalex.org/C57733114","wikidata":"https://www.wikidata.org/wiki/Q1006032","display_name":"Discrete Fourier transform (general)","level":5,"score":0.7709888815879822},{"id":"https://openalex.org/C43060483","wikidata":"https://www.wikidata.org/wiki/Q17006372","display_name":"Cyclotomic fast Fourier transform","level":5,"score":0.7188442349433899},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6334881782531738},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.618571400642395},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5916144847869873},{"id":"https://openalex.org/C103755468","wikidata":"https://www.wikidata.org/wiki/Q17103599","display_name":"Split-radix FFT algorithm","level":5,"score":0.5829311609268188},{"id":"https://openalex.org/C77928272","wikidata":"https://www.wikidata.org/wiki/Q7243214","display_name":"Prime-factor FFT algorithm","level":5,"score":0.5732148885726929},{"id":"https://openalex.org/C69598009","wikidata":"https://www.wikidata.org/wiki/Q7280126","display_name":"Rader's FFT algorithm","level":5,"score":0.5509931445121765},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.5110675096511841},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4867722988128662},{"id":"https://openalex.org/C192853989","wikidata":"https://www.wikidata.org/wiki/Q1006531","display_name":"Discrete Hartley transform","level":5,"score":0.42465895414352417},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40501800179481506},{"id":"https://openalex.org/C76563020","wikidata":"https://www.wikidata.org/wiki/Q4817582","display_name":"Fractional Fourier transform","level":4,"score":0.3919874429702759},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.27414846420288086},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.10154801607131958}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icassp.1979.1170654","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.1979.1170654","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICASSP '79. IEEE International Conference on Acoustics, Speech, and Signal Processing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1566387478","https://openalex.org/W1966904279","https://openalex.org/W1991675203","https://openalex.org/W1997654368","https://openalex.org/W2005015931","https://openalex.org/W2064980790","https://openalex.org/W2099526344","https://openalex.org/W2167872248","https://openalex.org/W4254389654"],"related_works":["https://openalex.org/W2028911956","https://openalex.org/W1952542430","https://openalex.org/W2016307700","https://openalex.org/W333228003","https://openalex.org/W1974963296","https://openalex.org/W2134128809","https://openalex.org/W2138986063","https://openalex.org/W1976055929","https://openalex.org/W2154006536","https://openalex.org/W2034310980"],"abstract_inverted_index":{"Polynomial":[0],"transforms":[1,34],"defined":[2],"in":[3,56],"rings":[4],"of":[5,20],"polynomials,":[6],"have":[7],"been":[8],"introduced":[9],"recently":[10],"and":[11,51],"shown":[12],"to":[13,48],"give":[14],"efficient":[15,60],"algorithms":[16,53],"for":[17,30],"the":[18,62,68],"computation":[19],"two-dimensional":[21],"convolutions.":[22],"In":[23],"this":[24],"paper,":[25],"we":[26],"present":[27],"two":[28],"methods":[29],"computing":[31],"discrete":[32],"Fourier":[33,64,70],"(DFT)":[35],"by":[36],"polynomial":[37],"transforms.":[38],"We":[39],"show":[40],"that":[41,54],"these":[42],"techniques":[43],"are":[44],"particularly":[45],"well":[46],"adapted":[47],"multidimensional":[49],"DFTs":[50],"yield":[52],"are,":[55],"many":[57],"instances,":[58],"more":[59],"than":[61],"fast":[63],"transform":[65],"(FFT)":[66],"or":[67],"Winograd":[69],"Transform":[71],"(WFTA).":[72]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}