{"id":"https://openalex.org/W2155752194","doi":"https://doi.org/10.1109/icassp.1982.1171385","title":"The design of optimal DFT algorithms using dynamic programming","display_name":"The design of optimal DFT algorithms using dynamic programming","publication_year":2005,"publication_date":"2005-03-24","ids":{"openalex":"https://openalex.org/W2155752194","doi":"https://doi.org/10.1109/icassp.1982.1171385","mag":"2155752194"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.1982.1171385","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.1982.1171385","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICASSP '82. IEEE International Conference on Acoustics, Speech, and Signal Processing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5111668184","display_name":"Howard Johnson","orcid":null},"institutions":[{"id":"https://openalex.org/I74775410","display_name":"Rice University","ror":"https://ror.org/008zs3103","country_code":"US","type":"education","lineage":["https://openalex.org/I74775410"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"H. Johnson","raw_affiliation_strings":["Electrical Engineering Department, Rice University, Houston, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical Engineering Department, Rice University, Houston, TX, USA","institution_ids":["https://openalex.org/I74775410"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020160495","display_name":"C.S. Burrus","orcid":null},"institutions":[{"id":"https://openalex.org/I74775410","display_name":"Rice University","ror":"https://ror.org/008zs3103","country_code":"US","type":"education","lineage":["https://openalex.org/I74775410"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"C. Burrus","raw_affiliation_strings":["Electrical Engineering Department, Rice University, Houston, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical Engineering Department, Rice University, Houston, TX, USA","institution_ids":["https://openalex.org/I74775410"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I74775410"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"7","issue":null,"first_page":"20","last_page":"23"},"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.9965000152587891,"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.9965000152587891,"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.9930999875068665,"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/T11749","display_name":"Iterative Learning Control Systems","score":0.9772999882698059,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/algorithm","display_name":"Algorithm","score":0.7274847030639648},{"id":"https://openalex.org/keywords/discrete-fourier-transform","display_name":"Discrete Fourier transform (general)","score":0.665961503982544},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6182286739349365},{"id":"https://openalex.org/keywords/prime","display_name":"Prime (order theory)","score":0.5984311103820801},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5260429382324219},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4570988416671753},{"id":"https://openalex.org/keywords/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.44123682379722595},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.4296819865703583},{"id":"https://openalex.org/keywords/factor","display_name":"Factor (programming language)","score":0.4286026060581207},{"id":"https://openalex.org/keywords/prime-factor-fft-algorithm","display_name":"Prime-factor FFT algorithm","score":0.4166693687438965},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.29272323846817017},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2738407552242279},{"id":"https://openalex.org/keywords/fractional-fourier-transform","display_name":"Fractional Fourier transform","score":0.1332300901412964},{"id":"https://openalex.org/keywords/fourier-analysis","display_name":"Fourier analysis","score":0.12311646342277527}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7274847030639648},{"id":"https://openalex.org/C57733114","wikidata":"https://www.wikidata.org/wiki/Q1006032","display_name":"Discrete Fourier transform (general)","level":5,"score":0.665961503982544},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6182286739349365},{"id":"https://openalex.org/C184992742","wikidata":"https://www.wikidata.org/wiki/Q7243229","display_name":"Prime (order theory)","level":2,"score":0.5984311103820801},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5260429382324219},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4570988416671753},{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.44123682379722595},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.4296819865703583},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.4286026060581207},{"id":"https://openalex.org/C77928272","wikidata":"https://www.wikidata.org/wiki/Q7243214","display_name":"Prime-factor FFT algorithm","level":5,"score":0.4166693687438965},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.29272323846817017},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2738407552242279},{"id":"https://openalex.org/C76563020","wikidata":"https://www.wikidata.org/wiki/Q4817582","display_name":"Fractional Fourier transform","level":4,"score":0.1332300901412964},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.12311646342277527},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icassp.1982.1171385","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.1982.1171385","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICASSP '82. 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/W1985765205","https://openalex.org/W2005015931","https://openalex.org/W2155752194","https://openalex.org/W2341171179"],"related_works":["https://openalex.org/W2031343199","https://openalex.org/W2356814585","https://openalex.org/W2012363129","https://openalex.org/W3046688035","https://openalex.org/W4362564158","https://openalex.org/W2155491755","https://openalex.org/W2154006536","https://openalex.org/W2348800014","https://openalex.org/W1820187807","https://openalex.org/W2365391860"],"abstract_inverted_index":{"A":[0],"broad":[1],"class":[2,79],"of":[3,40,48,73,94],"efficient,":[4],"discrete":[5],"Fourier":[6,64],"transform":[7],"algorithms":[8,15,51],"is":[9,52,81,98,107],"developed":[10],"by":[11],"partitioning":[12],"short":[13,20],"DFT":[14,50],"into":[16,24],"factors.":[17],"The":[18,71],"factored":[19],"DFT's":[21,26],"are":[22],"combined":[23],"longer":[25],"using":[27],"a":[28,35,45,95,101,110],"prime":[29,58],"factor":[30,59],"algorithm":[31,60,76,106],"(PFA).":[32],"By":[33],"exploiting":[34],"property":[36],"which":[37,54,80],"allows":[38],"some":[39],"the":[41,57,62,86],"factors":[42],"to":[43,85],"commute,":[44],"large":[46],"set":[47],"possible":[49],"generated":[53],"contains":[55],"both":[56],"and":[61,90,100],"Winograd":[63],"Transform":[65],"Algorithm":[66],"(WFTA)":[67],"as":[68,109],"special":[69],"cases.":[70],"problem":[72],"finding":[74],"an":[75],"from":[77],"this":[78],"optimal":[82],"with":[83],"respect":[84],"specific":[87],"add,":[88],"multiply,":[89],"data":[91],"transfer":[92],"characteristics":[93],"partlcular":[96],"implementation":[97],"posed,":[99],"highly":[102],"effective":[103],"dynamic":[104],"programming":[105],"presented":[108],"solution.":[111]},"counts_by_year":[],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}