{"id":"https://openalex.org/W1554343031","doi":"https://doi.org/10.1109/icassp.1981.1171273","title":"Inverse polynomial transform algorithms for DFTs and convolutions","display_name":"Inverse polynomial transform algorithms for DFTs and convolutions","publication_year":2005,"publication_date":"2005-03-24","ids":{"openalex":"https://openalex.org/W1554343031","doi":"https://doi.org/10.1109/icassp.1981.1171273","mag":"1554343031"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.1981.1171273","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.1981.1171273","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/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.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.06844548,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"6","issue":null,"first_page":"315","last_page":"318"},"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.9994000196456909,"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.9994000196456909,"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.9980999827384949,"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.9710000157356262,"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/polynomial","display_name":"Polynomial","score":0.7239668965339661},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6951786279678345},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.6248834133148193},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6045145392417908},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4794572591781616},{"id":"https://openalex.org/keywords/cyclotomic-fast-fourier-transform","display_name":"Cyclotomic fast Fourier transform","score":0.452536404132843},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3701320290565491},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.21302974224090576},{"id":"https://openalex.org/keywords/fractional-fourier-transform","display_name":"Fractional Fourier transform","score":0.12618395686149597},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08421492576599121},{"id":"https://openalex.org/keywords/fourier-analysis","display_name":"Fourier analysis","score":0.07473894953727722}],"concepts":[{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.7239668965339661},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6951786279678345},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.6248834133148193},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6045145392417908},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4794572591781616},{"id":"https://openalex.org/C43060483","wikidata":"https://www.wikidata.org/wiki/Q17006372","display_name":"Cyclotomic fast Fourier transform","level":5,"score":0.452536404132843},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3701320290565491},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.21302974224090576},{"id":"https://openalex.org/C76563020","wikidata":"https://www.wikidata.org/wiki/Q4817582","display_name":"Fractional Fourier transform","level":4,"score":0.12618395686149597},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08421492576599121},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.07473894953727722},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icassp.1981.1171273","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.1981.1171273","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1833153927","https://openalex.org/W1988356248","https://openalex.org/W1991675203","https://openalex.org/W2144375482","https://openalex.org/W2167872248"],"related_works":["https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2046435967","https://openalex.org/W2053286651","https://openalex.org/W4231775656","https://openalex.org/W2181743346","https://openalex.org/W2187401768","https://openalex.org/W2181413294","https://openalex.org/W2069382757","https://openalex.org/W1554343031"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"introduce":[4],"a":[5,31,69],"new":[6,87],"fast":[7,52,88],"computation":[8],"algorithm":[9],"for":[10,90],"multidimensional":[11,25,91],"DFTs.":[12],"This":[13,47],"method":[14],"uses":[15],"inverse":[16,81],"polynomial":[17,36,65,82],"transforms":[18,66],"to":[19,34,50,61,85],"perform":[20],"an":[21],"efficient":[22],"mapping":[23],"of":[24,64],"DFTS":[26],"into":[27],"one-dimensional":[28],"DFTs":[29],"in":[30,44,72],"way":[32],"similar":[33],"earlier":[35],"transform":[37,83],"techniques,":[38],"but":[39],"with":[40],"all":[41],"operations":[42],"performed":[43],"reversed":[45],"order.":[46],"is":[48],"shown":[49],"yield":[51],"DFT":[53],"algorithms":[54,89],"which":[55],"retain":[56],"the":[57,62,78],"basic":[58],"advantages":[59],"related":[60],"use":[63],"while":[67],"allowing":[68],"significant":[70],"reduction":[71],"round-off":[73],"noise.":[74],"We":[75],"then":[76],"combine":[77],"direct":[79],"and":[80],"methods":[84],"derive":[86],"convolutions.":[92]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}