{"id":"https://openalex.org/W1969723370","doi":"https://doi.org/10.1109/vlsisoc.2011.6081637","title":"A hybrid algorithm for the optimization of area and delay in linear DSP transforms","display_name":"A hybrid algorithm for the optimization of area and delay in linear DSP transforms","publication_year":2011,"publication_date":"2011-10-01","ids":{"openalex":"https://openalex.org/W1969723370","doi":"https://doi.org/10.1109/vlsisoc.2011.6081637","mag":"1969723370"},"language":"en","primary_location":{"id":"doi:10.1109/vlsisoc.2011.6081637","is_oa":false,"landing_page_url":"https://doi.org/10.1109/vlsisoc.2011.6081637","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE/IFIP 19th International Conference on VLSI and System-on-Chip","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/A5089933848","display_name":"Levent Aksoy","orcid":"https://orcid.org/0000-0001-6129-9657"},"institutions":[{"id":"https://openalex.org/I121345201","display_name":"Instituto de Engenharia de Sistemas e Computadores Investiga\u00e7\u00e3o e Desenvolvimento","ror":"https://ror.org/04mqy3p58","country_code":"PT","type":"nonprofit","lineage":["https://openalex.org/I121345201","https://openalex.org/I4210125590"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Levent Aksoy","raw_affiliation_strings":["INESC-ID, Lisboa, Portugal","INESC-ID, Lisbon, Portugal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INESC-ID, Lisboa, Portugal","institution_ids":["https://openalex.org/I121345201"]},{"raw_affiliation_string":"INESC-ID, Lisbon, Portugal","institution_ids":["https://openalex.org/I121345201"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074598853","display_name":"Eduardo Costa","orcid":"https://orcid.org/0000-0003-0521-5898"},"institutions":[{"id":"https://openalex.org/I110676245","display_name":"Universidade Cat\u00f3lica de Pelotas","ror":"https://ror.org/0376myh60","country_code":"BR","type":"education","lineage":["https://openalex.org/I110676245"]},{"id":"https://openalex.org/I121345201","display_name":"Instituto de Engenharia de Sistemas e Computadores Investiga\u00e7\u00e3o e Desenvolvimento","ror":"https://ror.org/04mqy3p58","country_code":"PT","type":"nonprofit","lineage":["https://openalex.org/I121345201","https://openalex.org/I4210125590"]}],"countries":["BR","PT"],"is_corresponding":false,"raw_author_name":"Eduardo Costa","raw_affiliation_strings":["INESC-ID, Lisboa, Portugal","Universidade Catolica de Pelotas, Pelotas, Rio Grande do Sul, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INESC-ID, Lisboa, Portugal","institution_ids":["https://openalex.org/I121345201"]},{"raw_affiliation_string":"Universidade Catolica de Pelotas, Pelotas, Rio Grande do Sul, Brazil","institution_ids":["https://openalex.org/I110676245"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002334825","display_name":"Paulo Flores","orcid":"https://orcid.org/0000-0003-2970-3589"},"institutions":[{"id":"https://openalex.org/I121345201","display_name":"Instituto de Engenharia de Sistemas e Computadores Investiga\u00e7\u00e3o e Desenvolvimento","ror":"https://ror.org/04mqy3p58","country_code":"PT","type":"nonprofit","lineage":["https://openalex.org/I121345201","https://openalex.org/I4210125590"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Paulo Flores","raw_affiliation_strings":["INESC-ID, Lisboa, Portugal","INESC-IDIIST, TU Lisbon, Lisbon, Portugal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INESC-ID, Lisboa, Portugal","institution_ids":["https://openalex.org/I121345201"]},{"raw_affiliation_string":"INESC-IDIIST, TU Lisbon, Lisbon, Portugal","institution_ids":["https://openalex.org/I121345201"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039448613","display_name":"Jos\u00e9 Monteiro","orcid":"https://orcid.org/0000-0003-0603-2268"},"institutions":[{"id":"https://openalex.org/I121345201","display_name":"Instituto de Engenharia de Sistemas e Computadores Investiga\u00e7\u00e3o e Desenvolvimento","ror":"https://ror.org/04mqy3p58","country_code":"PT","type":"nonprofit","lineage":["https://openalex.org/I121345201","https://openalex.org/I4210125590"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Jos\u00e9 Monteiro","raw_affiliation_strings":["INESC-ID, Lisboa, Portugal","INESC-IDIIST, TU Lisbon, Lisbon, Portugal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INESC-ID, Lisboa, Portugal","institution_ids":["https://openalex.org/I121345201"]},{"raw_affiliation_string":"INESC-IDIIST, TU Lisbon, Lisbon, Portugal","institution_ids":["https://openalex.org/I121345201"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"148","last_page":"153"},"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.9988999962806702,"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.9988999962806702,"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/T10232","display_name":"Optical Network Technologies","score":0.9853000044822693,"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"}},{"id":"https://openalex.org/T10363","display_name":"Low-power high-performance VLSI design","score":0.9649999737739563,"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/algorithm","display_name":"Algorithm","score":0.7362504005432129},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5662232637405396},{"id":"https://openalex.org/keywords/hybrid-algorithm","display_name":"Hybrid algorithm (constraint satisfaction)","score":0.47289028763771057},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4599079489707947},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.43603941798210144},{"id":"https://openalex.org/keywords/digital-signal-processing","display_name":"Digital signal processing","score":0.4268147349357605},{"id":"https://openalex.org/keywords/realization","display_name":"Realization (probability)","score":0.4252033531665802},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4244147837162018},{"id":"https://openalex.org/keywords/subtraction","display_name":"Subtraction","score":0.4141589105129242},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30824658274650574},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.29993736743927},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.16067782044410706},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.11524352431297302},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.09907281398773193},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09334644675254822}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7362504005432129},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5662232637405396},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.47289028763771057},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4599079489707947},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.43603941798210144},{"id":"https://openalex.org/C84462506","wikidata":"https://www.wikidata.org/wiki/Q173142","display_name":"Digital signal processing","level":2,"score":0.4268147349357605},{"id":"https://openalex.org/C2781089630","wikidata":"https://www.wikidata.org/wiki/Q21856745","display_name":"Realization (probability)","level":2,"score":0.4252033531665802},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4244147837162018},{"id":"https://openalex.org/C68060419","wikidata":"https://www.wikidata.org/wiki/Q40754","display_name":"Subtraction","level":2,"score":0.4141589105129242},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30824658274650574},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.29993736743927},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.16067782044410706},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.11524352431297302},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.09907281398773193},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09334644675254822},{"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/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/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/vlsisoc.2011.6081637","is_oa":false,"landing_page_url":"https://doi.org/10.1109/vlsisoc.2011.6081637","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE/IFIP 19th International Conference on VLSI and System-on-Chip","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":24,"referenced_works":["https://openalex.org/W1574449651","https://openalex.org/W1594799231","https://openalex.org/W1598284404","https://openalex.org/W2020842839","https://openalex.org/W2050784420","https://openalex.org/W2073419265","https://openalex.org/W2103244632","https://openalex.org/W2106351882","https://openalex.org/W2106564282","https://openalex.org/W2117373759","https://openalex.org/W2120173944","https://openalex.org/W2130846531","https://openalex.org/W2134126310","https://openalex.org/W2139650599","https://openalex.org/W2154656381","https://openalex.org/W2164339744","https://openalex.org/W2561934809","https://openalex.org/W2916844179","https://openalex.org/W3150929007","https://openalex.org/W4244479343","https://openalex.org/W6634366120","https://openalex.org/W6635434933","https://openalex.org/W6655894424","https://openalex.org/W6676053101"],"related_works":["https://openalex.org/W2089041033","https://openalex.org/W2754116932","https://openalex.org/W2256878198","https://openalex.org/W2066599192","https://openalex.org/W2169828363","https://openalex.org/W2352313328","https://openalex.org/W2146038128","https://openalex.org/W2082741271","https://openalex.org/W2770289473","https://openalex.org/W2536892799"],"abstract_inverted_index":{"This":[0,77],"paper":[1,78],"addresses":[2],"the":[3,12,31,42,46,50,60,64,74,82,95,114,117],"problem":[4],"of":[5,8,15,54,73,98,111,116],"multiplierless":[6],"realization":[7],"linear":[9,55],"transforms":[10,56],"using":[11],"fewest":[13,96],"number":[14,97],"addition":[16],"and":[17,20,34,123],"subtraction":[18],"operations":[19,99],"introduces":[21],"a":[22,27,35,92,101,108],"hybrid":[23,83,118],"algorithm":[24,62,84],"that":[25],"incorporates":[26],"graph-based":[28],"technique,":[29],"called":[30],"difference":[32,47,75],"method,":[33],"Common":[36],"Subexpression":[37],"Elimination":[38],"(CSE)":[39],"algorithm.":[40],"In":[41],"proposed":[43,129],"algorithm,":[44],"while":[45],"method":[48],"extracts":[49],"most":[51,65],"promising":[52],"realizations":[53],"in":[57,70,88,125],"each":[58,71],"iteration,":[59],"CSE":[61],"achieves":[63],"common":[66],"minimum":[67],"conflicting":[68],"subexpressions":[69],"solution":[72,93],"method.":[76],"also":[79],"describes":[80],"how":[81],"can":[85],"be":[86],"modified":[87],"order":[89],"to":[90,127],"find":[91],"with":[94],"under":[100],"delay":[102],"constraint.":[103],"The":[104],"experimental":[105],"results":[106],"on":[107],"comprehensive":[109],"set":[110],"instances":[112],"show":[113],"efficiency":[115],"algorithms,":[119],"at":[120],"both":[121],"high-level":[122],"gate-level,":[124],"comparison":[126],"previously":[128],"algorithms.":[130]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}