{"id":"https://openalex.org/W1833153927","doi":"https://doi.org/10.1109/icassp.1980.1170902","title":"Fast polynomial transform methods for multidimensional DFTs","display_name":"Fast polynomial transform methods for multidimensional DFTs","publication_year":2005,"publication_date":"2005-03-24","ids":{"openalex":"https://openalex.org/W1833153927","doi":"https://doi.org/10.1109/icassp.1980.1170902","mag":"1833153927"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.1980.1170902","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.1980.1170902","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/A5109244935","display_name":"H. Nussbaumer","orcid":null},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"H. Nussbaumer","raw_affiliation_strings":["IBM Laboratory, La Gaude, France","IBM Laboratory, LA GAUDE, FRANCE"],"affiliations":[{"raw_affiliation_string":"IBM Laboratory, La Gaude, France","institution_ids":[]},{"raw_affiliation_string":"IBM Laboratory, LA GAUDE, FRANCE","institution_ids":["https://openalex.org/I1341412227"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5109244935"],"corresponding_institution_ids":["https://openalex.org/I1341412227"],"apc_list":null,"apc_paid":null,"fwci":0.3179,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.5434295,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"5","issue":null,"first_page":"235","last_page":"237"},"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.9997000098228455,"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.9997000098228455,"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.9983000159263611,"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/T11417","display_name":"Advancements in PLL and VCO Technologies","score":0.9927999973297119,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.7463719248771667},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.7141530513763428},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6246515512466431},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5718593001365662},{"id":"https://openalex.org/keywords/split-radix-fft-algorithm","display_name":"Split-radix FFT algorithm","score":0.5036775469779968},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.441755086183548},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4215680956840515},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.36259883642196655},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.26823490858078003},{"id":"https://openalex.org/keywords/fractional-fourier-transform","display_name":"Fractional Fourier transform","score":0.18581727147102356},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.10995090007781982},{"id":"https://openalex.org/keywords/fourier-analysis","display_name":"Fourier analysis","score":0.10466250777244568}],"concepts":[{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.7463719248771667},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.7141530513763428},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6246515512466431},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5718593001365662},{"id":"https://openalex.org/C103755468","wikidata":"https://www.wikidata.org/wiki/Q17103599","display_name":"Split-radix FFT algorithm","level":5,"score":0.5036775469779968},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.441755086183548},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4215680956840515},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.36259883642196655},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.26823490858078003},{"id":"https://openalex.org/C76563020","wikidata":"https://www.wikidata.org/wiki/Q4817582","display_name":"Fractional Fourier transform","level":4,"score":0.18581727147102356},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.10995090007781982},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.10466250777244568}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icassp.1980.1170902","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.1980.1170902","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2064980790","https://openalex.org/W2100812050","https://openalex.org/W2124977657","https://openalex.org/W2167872248"],"related_works":["https://openalex.org/W2185259940","https://openalex.org/W2168413811","https://openalex.org/W2977460836","https://openalex.org/W2031343199","https://openalex.org/W2113951268","https://openalex.org/W4226515754","https://openalex.org/W2144412928","https://openalex.org/W2356814585","https://openalex.org/W2200032781","https://openalex.org/W2073634370"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"introduce":[4],"a":[5,25,45,72,79],"new":[6,69],"fast":[7],"computation":[8],"algorithm":[9],"for":[10,89],"multidimensional":[11,18],"DFTs.":[12],"This":[13],"method":[14,70],"maps":[15],"efficiently":[16],"some":[17],"DFTs":[19,22],"into":[20],"one-dimensional":[21],"by":[23,50],"using":[24,51],"single":[26],"polynomial":[27,33,58,101],"transform":[28,34,59,102],"and":[29,39,63,96],"auxiliary":[30,92],"calculations.":[31],"The":[32,54],"is":[35,61,65],"computed":[36],"without":[37],"multiplications":[38],"all":[40],"calculations":[41,93],"are":[42,94,104],"performed":[43],"with":[44,56],"reduced":[46],"number":[47,83],"of":[48,78,84],"additions":[49],"FFT-type":[52],"algorithms.":[53],"relationship":[55],"earlier":[57],"approaches":[60],"explored":[62],"it":[64],"shown":[66],"that":[67],"the":[68,76,91],"yields":[71],"simpler":[73],"structure":[74],"at":[75],"expense":[77],"slight":[80],"increase":[81],"in":[82],"arithmetic":[85],"operations.":[86],"Various":[87],"techniques":[88,103],"reducing":[90],"investigated":[95],"schemes":[97],"which":[98],"combine":[99],"different":[100],"presented.":[105]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}