{"id":"https://openalex.org/W1566387478","doi":"https://doi.org/10.1109/icassp.1978.1170580","title":"New algorithms for convolution and DFT based on polynomial transforms","display_name":"New algorithms for convolution and DFT based on polynomial transforms","publication_year":2005,"publication_date":"2005-03-24","ids":{"openalex":"https://openalex.org/W1566387478","doi":"https://doi.org/10.1109/icassp.1978.1170580","mag":"1566387478"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.1978.1170580","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.1978.1170580","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICASSP '78. 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.6359,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.65947409,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"3","issue":null,"first_page":"638","last_page":"641"},"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.9984999895095825,"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.9814000129699707,"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/convolution","display_name":"Convolution (computer science)","score":0.7668942809104919},{"id":"https://openalex.org/keywords/discrete-fourier-transform","display_name":"Discrete Fourier transform (general)","score":0.7000243663787842},{"id":"https://openalex.org/keywords/convolution-theorem","display_name":"Convolution theorem","score":0.677876889705658},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5943287014961243},{"id":"https://openalex.org/keywords/overlap\u2013add-method","display_name":"Overlap\u2013add method","score":0.5863611698150635},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.55504310131073},{"id":"https://openalex.org/keywords/circular-convolution","display_name":"Circular convolution","score":0.5398845076560974},{"id":"https://openalex.org/keywords/cyclotomic-fast-fourier-transform","display_name":"Cyclotomic fast Fourier transform","score":0.530976414680481},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.520943284034729},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5106084942817688},{"id":"https://openalex.org/keywords/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.4747267961502075},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.39340734481811523},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3933117389678955},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33916598558425903},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.3240223228931427},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.19415494799613953},{"id":"https://openalex.org/keywords/fourier-analysis","display_name":"Fourier analysis","score":0.19136399030685425},{"id":"https://openalex.org/keywords/fractional-fourier-transform","display_name":"Fractional Fourier transform","score":0.15594589710235596},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.13253307342529297},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08585208654403687}],"concepts":[{"id":"https://openalex.org/C45347329","wikidata":"https://www.wikidata.org/wiki/Q5166604","display_name":"Convolution (computer science)","level":3,"score":0.7668942809104919},{"id":"https://openalex.org/C57733114","wikidata":"https://www.wikidata.org/wiki/Q1006032","display_name":"Discrete Fourier transform (general)","level":5,"score":0.7000243663787842},{"id":"https://openalex.org/C79587385","wikidata":"https://www.wikidata.org/wiki/Q2638931","display_name":"Convolution theorem","level":5,"score":0.677876889705658},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5943287014961243},{"id":"https://openalex.org/C181002996","wikidata":"https://www.wikidata.org/wiki/Q1611641","display_name":"Overlap\u2013add method","level":5,"score":0.5863611698150635},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.55504310131073},{"id":"https://openalex.org/C194980680","wikidata":"https://www.wikidata.org/wiki/Q245450","display_name":"Circular convolution","level":5,"score":0.5398845076560974},{"id":"https://openalex.org/C43060483","wikidata":"https://www.wikidata.org/wiki/Q17006372","display_name":"Cyclotomic fast Fourier transform","level":5,"score":0.530976414680481},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.520943284034729},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5106084942817688},{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.4747267961502075},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.39340734481811523},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3933117389678955},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33916598558425903},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3240223228931427},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.19415494799613953},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.19136399030685425},{"id":"https://openalex.org/C76563020","wikidata":"https://www.wikidata.org/wiki/Q4817582","display_name":"Fractional Fourier transform","level":4,"score":0.15594589710235596},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.13253307342529297},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08585208654403687},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icassp.1978.1170580","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.1978.1170580","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICASSP '78. 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":6,"referenced_works":["https://openalex.org/W1908016184","https://openalex.org/W1991675203","https://openalex.org/W2005015931","https://openalex.org/W2099526344","https://openalex.org/W2326491596","https://openalex.org/W2583733925"],"related_works":["https://openalex.org/W2133436097","https://openalex.org/W4372260258","https://openalex.org/W2106721858","https://openalex.org/W4386106541","https://openalex.org/W2170755202","https://openalex.org/W61755830","https://openalex.org/W2110104525","https://openalex.org/W2162994284","https://openalex.org/W2483197055","https://openalex.org/W1520593799"],"abstract_inverted_index":{"Discrete":[0],"transforms,":[1],"defined":[2],"in":[3,22,48],"rings":[4],"of":[5,62],"polynomials,":[6],"have":[7,14],"been":[8],"introduced":[9],"recently.":[10],"These":[11],"polynomial":[12,33],"transforms":[13,68],"the":[15,32,60],"convolution":[16],"property":[17],"and":[18,65],"can":[19,43,55],"be":[20,44,57],"computed":[21,45],"ordinary":[23],"arithmetic,":[24],"without":[25],"multiplications.":[26],"We":[27],"show":[28],"that,":[29],"by":[30],"combining":[31],"transform":[34],"approach":[35],"with":[36],"a":[37],"split":[38],"nesting":[39],"technique,":[40],"multidimensional":[41],"convolutions":[42,64],"very":[46],"efficiently":[47],"general":[49],"purpose":[50],"computers.":[51],"This":[52],"computation":[53],"method":[54],"also":[56],"used":[58],"for":[59],"evaluation":[61],"one-dimensional":[63],"discrete":[66],"Fourier":[67],"(DFT's).":[69]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}