{"id":"https://openalex.org/W1896103231","doi":"https://doi.org/10.1109/icassp.1982.1171392","title":"The application of dynamic programming to the optimal ordering of digital filter sections","display_name":"The application of dynamic programming to the optimal ordering of digital filter sections","publication_year":2005,"publication_date":"2005-03-24","ids":{"openalex":"https://openalex.org/W1896103231","doi":"https://doi.org/10.1109/icassp.1982.1171392","mag":"1896103231"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.1982.1171392","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.1982.1171392","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":"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/A5012582861","display_name":"Charles M. Rader","orcid":null},"institutions":[{"id":"https://openalex.org/I4210122954","display_name":"MIT Lincoln Laboratory","ror":"https://ror.org/022z6jk58","country_code":"US","type":"facility","lineage":["https://openalex.org/I4210122954","https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"C. Rader","raw_affiliation_strings":["MIT, Lincoln Laboratory, Lexington, MA, USA","MIT Lincoln Laboratory, Lexington, MA, USA"],"affiliations":[{"raw_affiliation_string":"MIT, Lincoln Laboratory, Lexington, MA, USA","institution_ids":["https://openalex.org/I4210122954"]},{"raw_affiliation_string":"MIT Lincoln Laboratory, Lexington, MA, USA","institution_ids":["https://openalex.org/I4210122954"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5012582861"],"corresponding_institution_ids":["https://openalex.org/I4210122954"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.08448867,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"7","issue":null,"first_page":"73","last_page":"76"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.986299991607666,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.986299991607666,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11447","display_name":"Blind Source Separation Techniques","score":0.9797000288963318,"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.9696000218391418,"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/computer-science","display_name":"Computer science","score":0.7275389432907104},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.6763911247253418},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.6092439889907837},{"id":"https://openalex.org/keywords/realization","display_name":"Realization (probability)","score":0.5383175015449524},{"id":"https://openalex.org/keywords/filter","display_name":"Filter (signal processing)","score":0.5184006690979004},{"id":"https://openalex.org/keywords/digital-filter","display_name":"Digital filter","score":0.47611767053604126},{"id":"https://openalex.org/keywords/signal-processing","display_name":"Signal processing","score":0.4719744622707367},{"id":"https://openalex.org/keywords/reactive-programming","display_name":"Reactive programming","score":0.4710412323474884},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4630574882030487},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4548112452030182},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.42994001507759094},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38683536648750305},{"id":"https://openalex.org/keywords/digital-signal-processing","display_name":"Digital signal processing","score":0.3639003038406372},{"id":"https://openalex.org/keywords/inductive-programming","display_name":"Inductive programming","score":0.34657520055770874},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32697224617004395},{"id":"https://openalex.org/keywords/programming-paradigm","display_name":"Programming paradigm","score":0.2745872437953949},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17776110768318176},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09225901961326599}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7275389432907104},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.6763911247253418},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.6092439889907837},{"id":"https://openalex.org/C2781089630","wikidata":"https://www.wikidata.org/wiki/Q21856745","display_name":"Realization (probability)","level":2,"score":0.5383175015449524},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.5184006690979004},{"id":"https://openalex.org/C36390408","wikidata":"https://www.wikidata.org/wiki/Q1163067","display_name":"Digital filter","level":3,"score":0.47611767053604126},{"id":"https://openalex.org/C104267543","wikidata":"https://www.wikidata.org/wiki/Q208163","display_name":"Signal processing","level":3,"score":0.4719744622707367},{"id":"https://openalex.org/C150762246","wikidata":"https://www.wikidata.org/wiki/Q4354073","display_name":"Reactive programming","level":4,"score":0.4710412323474884},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4630574882030487},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4548112452030182},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42994001507759094},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38683536648750305},{"id":"https://openalex.org/C84462506","wikidata":"https://www.wikidata.org/wiki/Q173142","display_name":"Digital signal processing","level":2,"score":0.3639003038406372},{"id":"https://openalex.org/C50033165","wikidata":"https://www.wikidata.org/wiki/Q15712089","display_name":"Inductive programming","level":3,"score":0.34657520055770874},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32697224617004395},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.2745872437953949},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17776110768318176},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09225901961326599},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icassp.1982.1171392","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.1982.1171392","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":7,"referenced_works":["https://openalex.org/W1884533119","https://openalex.org/W2006389550","https://openalex.org/W2067208662","https://openalex.org/W2072054026","https://openalex.org/W2109521093","https://openalex.org/W2142384583","https://openalex.org/W2752908210"],"related_works":["https://openalex.org/W2022585506","https://openalex.org/W1998445782","https://openalex.org/W4387445043","https://openalex.org/W2254582632","https://openalex.org/W3022954388","https://openalex.org/W2575134494","https://openalex.org/W2572482456","https://openalex.org/W2154888102","https://openalex.org/W1980382508","https://openalex.org/W1982419623"],"abstract_inverted_index":{"Dynamic":[0],"Programming":[1],"has":[2],"been":[3],"applied":[4],"to":[5,22,45,79,88,115,126,132,148],"a":[6,33,56,86,101],"number":[7],"of":[8,25,30,49,59,65,73,76,100,140,142,152],"digital":[9,34],"signal":[10,81],"processing":[11,82],"problems.":[12,83],"In":[13,137],"this":[14,128],"paper":[15],"we":[16,104,113],"discuss":[17],"its":[18],"well":[19],"known":[20],"application":[21,75],"the":[23,27,40,46,50,74,98,110,134,138,145],"problem":[24,111,135],"determining":[26],"optimum":[28],"order":[29,131],"sections":[31,144],"in":[32,109,130],"filter":[35,143],"realization.":[36],"We":[37],"show":[38],"that":[39],"method":[41],"is":[42,53,71,124],"quite":[43],"insensitive":[44],"specific":[47],"details":[48],"problem;":[51],"it":[52,117,123],"applicable":[54],"over":[55],"wide":[57],"range":[58],"possible":[60],"optimality":[61],"criteria,":[62],"various":[63],"kinds":[64],"arithmetic,":[66],"scaling":[67],"options,":[68],"etc.":[69],"This":[70],"characteristic":[72],"dynamic":[77,92,119],"programming":[78],"many":[80],"Also,":[84],"since":[85],"problem,":[87],"be":[89,95],"solved":[90],"by":[91],"programming,":[93],"must":[94],"represented":[96],"as":[97],"traversal":[99],"directed":[102],"graph,":[103],"usually":[105],"discover":[106],"unsuspected":[107],"structure":[108,129,146],"when":[112],"attempt":[114],"solve":[116,133],"using":[118],"programming.":[120],"Quite":[121],"often":[122],"necessary":[125],"recognize":[127],"efficiently.":[136],"case":[139],"ordering":[141],"leads":[147],"an":[149],"efficient":[150],"utilization":[151],"memory.":[153]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}