{"id":"https://openalex.org/W2150570720","doi":"https://doi.org/10.1109/iscas.2006.1692660","title":"Maximum likelihood disjunctive decomposition to reduced multirooted DAG for FIR filter design","display_name":"Maximum likelihood disjunctive decomposition to reduced multirooted DAG for FIR filter design","publication_year":2006,"publication_date":"2006-09-22","ids":{"openalex":"https://openalex.org/W2150570720","doi":"https://doi.org/10.1109/iscas.2006.1692660","mag":"2150570720"},"language":"en","primary_location":{"id":"doi:10.1109/iscas.2006.1692660","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscas.2006.1692660","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 IEEE International Symposium on Circuits and Systems","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/A5029335324","display_name":"Chip-Hong Chang","orcid":"https://orcid.org/0000-0002-8897-6176"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":true,"raw_author_name":"Chip-Hong Chang","raw_affiliation_strings":["Centre for High Performance Embedded Systems, Nanyang Technological University, Singapore"],"affiliations":[{"raw_affiliation_string":"Centre for High Performance Embedded Systems, Nanyang Technological University, Singapore","institution_ids":["https://openalex.org/I172675005"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100400993","display_name":"Jiajia Chen","orcid":"https://orcid.org/0000-0001-9754-6509"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Jiajia Chen","raw_affiliation_strings":["Centre for High Performance Embedded Systems, Nanyang Technological University, Singapore"],"affiliations":[{"raw_affiliation_string":"Centre for High Performance Embedded Systems, Nanyang Technological University, Singapore","institution_ids":["https://openalex.org/I172675005"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042105714","display_name":"A. P. Vinod","orcid":"https://orcid.org/0000-0001-9408-1275"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"A.P. Vinod","raw_affiliation_strings":["Centre for High Performance Embedded Systems, Nanyang Technological University, Singapore"],"affiliations":[{"raw_affiliation_string":"Centre for High Performance Embedded Systems, Nanyang Technological University, Singapore","institution_ids":["https://openalex.org/I172675005"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5029335324"],"corresponding_institution_ids":["https://openalex.org/I172675005"],"apc_list":null,"apc_paid":null,"fwci":0.636,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.69539886,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"cas 30","issue":null,"first_page":"4","last_page":"4"},"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.9998999834060669,"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.9998999834060669,"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.9721999764442444,"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/T10901","display_name":"Advanced Data Compression Techniques","score":0.9674999713897705,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.6177160143852234},{"id":"https://openalex.org/keywords/finite-impulse-response","display_name":"Finite impulse response","score":0.5675195455551147},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5446453094482422},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.5261861085891724},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.5132739543914795},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.48780420422554016},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46813711524009705},{"id":"https://openalex.org/keywords/multiplier","display_name":"Multiplier (economics)","score":0.4255639612674713},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42032307386398315},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4042104482650757},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40367382764816284},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38684940338134766},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2183135449886322}],"concepts":[{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.6177160143852234},{"id":"https://openalex.org/C198386975","wikidata":"https://www.wikidata.org/wiki/Q117785","display_name":"Finite impulse response","level":2,"score":0.5675195455551147},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5446453094482422},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.5261861085891724},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.5132739543914795},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.48780420422554016},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46813711524009705},{"id":"https://openalex.org/C124584101","wikidata":"https://www.wikidata.org/wiki/Q1053266","display_name":"Multiplier (economics)","level":2,"score":0.4255639612674713},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42032307386398315},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4042104482650757},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40367382764816284},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38684940338134766},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2183135449886322},{"id":"https://openalex.org/C139719470","wikidata":"https://www.wikidata.org/wiki/Q39680","display_name":"Macroeconomics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/iscas.2006.1692660","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscas.2006.1692660","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 IEEE International Symposium on Circuits and Systems","raw_type":"proceedings-article"},{"id":"pmh:oai:repository.hkust.edu.hk:1783.1-106781","is_oa":false,"landing_page_url":"http://repository.hkust.edu.hk/ir/Record/1783.1-106781","pdf_url":null,"source":{"id":"https://openalex.org/S4306401796","display_name":"Rare & Special e-Zone (The Hong Kong University of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200769079","host_organization_name":"Hong Kong University of Science and Technology","host_organization_lineage":["https://openalex.org/I200769079"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference paper"},{"id":"pmh:oai:repository.ust.hk:1783.1-106781","is_oa":false,"landing_page_url":"http://lbdiscover.ust.hk/uresolver?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rfr_id=info:sid/HKUST:SPI&rft.genre=article&rft.issn=0271-4310&rft.volume=&rft.issue=&rft.date=2006&rft.spage=613&rft.aulast=Chang&rft.aufirst=&rft.atitle=Maximum+likelihood+disjunctive+decomposition+to+reduced+multirooted+DAG+for+FIR+filter+design&rft.title=Proceedings+-+IEEE+International+Symposium+on+Circuits+and+Systems","pdf_url":null,"source":{"id":"https://openalex.org/S4306401796","display_name":"Rare & Special e-Zone (The Hong Kong University of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200769079","host_organization_name":"Hong Kong University of Science and Technology","host_organization_lineage":["https://openalex.org/I200769079"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference paper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1965846060","https://openalex.org/W2087171258","https://openalex.org/W2096479326","https://openalex.org/W2103244632","https://openalex.org/W2119529071","https://openalex.org/W2120173944","https://openalex.org/W2154656381","https://openalex.org/W2163549778","https://openalex.org/W2169484940","https://openalex.org/W2169792033","https://openalex.org/W6685117948"],"related_works":["https://openalex.org/W2352794675","https://openalex.org/W1539994214","https://openalex.org/W2051228988","https://openalex.org/W4247094814","https://openalex.org/W108531593","https://openalex.org/W2111712077","https://openalex.org/W8810113","https://openalex.org/W2158636562","https://openalex.org/W4313145068","https://openalex.org/W2904242085"],"abstract_inverted_index":{"This":[0],"paper":[1],"extols":[2],"the":[3,10,21,45,54,73,81],"virtues":[4],"of":[5,12,24,44,47,53],"information":[6],"theoretic":[7],"approach":[8,40],"to":[9],"synthesis":[11,75],"reduced":[13,56],"multirooted":[14,57],"directed":[15],"acyclic":[16],"graph":[17,74],"(DAG)":[18],"representation":[19],"for":[20,89],"multiplier":[22],"block":[23],"FIR":[25],"filters.":[26],"The":[27],"proposed":[28,82],"maximum":[29],"likelihood":[30],"decomposition":[31],"algorithm":[32,83],"can":[33],"be":[34],"viewed":[35],"as":[36],"an":[37],"efficient":[38],"divide-and-conquer":[39],"with":[41,86],"dynamic":[42],"tracking":[43],"statistic":[46],"weight-two":[48],"subexpressions.":[49],"As":[50],"isomorphic":[51],"subgraphs":[52],"resultant":[55],"binary":[58],"partition":[59],"tree":[60],"(MBPT)":[61],"represent":[62],"common":[63,67],"subexpressions,":[64],"higher":[65],"weight":[66],"subexpressions":[68],"are":[69],"eliminated":[70],"implicitly":[71],"in":[72],"process.":[76],"Experimental":[77],"results":[78],"show":[79],"that":[80],"produce":[84],"designs":[85],"good":[87],"tradeoffs":[88],"low":[90],"logic":[91,94],"complexity":[92],"and":[93],"depth":[95]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}