{"id":"https://openalex.org/W2109361433","doi":"https://doi.org/10.1109/iscas.2012.6272099","title":"Multiple real-constant multiplication with improved cost model and greedy and optimal searches","display_name":"Multiple real-constant multiplication with improved cost model and greedy and optimal searches","publication_year":2012,"publication_date":"2012-05-01","ids":{"openalex":"https://openalex.org/W2109361433","doi":"https://doi.org/10.1109/iscas.2012.6272099","mag":"2109361433"},"language":"en","primary_location":{"id":"doi:10.1109/iscas.2012.6272099","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscas.2012.6272099","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Symposium on Circuits and Systems","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/A5063669213","display_name":"Megan Gately","orcid":"https://orcid.org/0009-0000-1795-3949"},"institutions":[{"id":"https://openalex.org/I8692664","display_name":"University of Oklahoma","ror":"https://ror.org/02aqsxs83","country_code":"US","type":"education","lineage":["https://openalex.org/I8692664"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M. B. Gately","raw_affiliation_strings":["School of Electrical and Computer Engineering, University of Oklahama, Norman, OK, USA","School of Electrical and Computer Engineering, University of Oklahoma, Norman, 73019 USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, University of Oklahama, Norman, OK, USA","institution_ids":["https://openalex.org/I8692664"]},{"raw_affiliation_string":"School of Electrical and Computer Engineering, University of Oklahoma, Norman, 73019 USA","institution_ids":["https://openalex.org/I8692664"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067619507","display_name":"Mark Yeary","orcid":"https://orcid.org/0000-0002-1900-7638"},"institutions":[{"id":"https://openalex.org/I8692664","display_name":"University of Oklahoma","ror":"https://ror.org/02aqsxs83","country_code":"US","type":"education","lineage":["https://openalex.org/I8692664"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M. B. Yeary","raw_affiliation_strings":["School of Electrical and Computer Engineering, University of Oklahama, Norman, OK, USA","School of Electrical and Computer Engineering, University of Oklahoma, Norman, 73019 USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, University of Oklahama, Norman, OK, USA","institution_ids":["https://openalex.org/I8692664"]},{"raw_affiliation_string":"School of Electrical and Computer Engineering, University of Oklahoma, Norman, 73019 USA","institution_ids":["https://openalex.org/I8692664"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101932271","display_name":"Choon Yik Tang","orcid":"https://orcid.org/0000-0001-6145-301X"},"institutions":[{"id":"https://openalex.org/I8692664","display_name":"University of Oklahoma","ror":"https://ror.org/02aqsxs83","country_code":"US","type":"education","lineage":["https://openalex.org/I8692664"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"C. Y. Tang","raw_affiliation_strings":["School of Electrical and Computer Engineering, University of Oklahama, Norman, OK, USA","School of Electrical and Computer Engineering, University of Oklahoma, Norman, 73019 USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, University of Oklahama, Norman, OK, USA","institution_ids":["https://openalex.org/I8692664"]},{"raw_affiliation_string":"School of Electrical and Computer Engineering, University of Oklahoma, Norman, 73019 USA","institution_ids":["https://openalex.org/I8692664"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I8692664"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"588","last_page":"591"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms","score":0.9998000264167786,"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/T11034","display_name":"Digital Filter Design and Implementation","score":0.9994000196456909,"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/T11693","display_name":"Cryptography and Residue Arithmetic","score":0.9853000044822693,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/multiplication","display_name":"Multiplication (music)","score":0.7080600261688232},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6955713033676147},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6777252554893494},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5838432312011719},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.353085458278656},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2657334506511688},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2616712749004364},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.14862164855003357},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.0840425193309784}],"concepts":[{"id":"https://openalex.org/C2780595030","wikidata":"https://www.wikidata.org/wiki/Q3860309","display_name":"Multiplication (music)","level":2,"score":0.7080600261688232},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6955713033676147},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6777252554893494},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5838432312011719},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.353085458278656},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2657334506511688},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2616712749004364},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.14862164855003357},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0840425193309784}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iscas.2012.6272099","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscas.2012.6272099","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Symposium on Circuits and Systems","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":11,"referenced_works":["https://openalex.org/W1969483458","https://openalex.org/W1994742438","https://openalex.org/W2001254103","https://openalex.org/W2012056726","https://openalex.org/W2073419265","https://openalex.org/W2105101187","https://openalex.org/W2116166697","https://openalex.org/W2119123290","https://openalex.org/W2127012503","https://openalex.org/W2156990588","https://openalex.org/W4231292842"],"related_works":["https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W2748952813","https://openalex.org/W1531601525","https://openalex.org/W2389640906","https://openalex.org/W4312077400"],"abstract_inverted_index":{"This":[0],"paper":[1],"formulates":[2],"and":[3,100,106,120],"solves":[4],"a":[5,17,26,32,87,103,142],"multiple":[6],"real-constant":[7],"multiplication":[8,24],"(MRCM)":[9],"problem,":[10,84],"where":[11],"the":[12,23,59,66,82,124,133,149,153],"goal":[13],"is":[14,72],"to":[15,39,117,122,128],"find":[16],"multiplierless":[18],"shift-add":[19],"network":[20],"that":[21,92,111,147],"implements":[22],"of":[25,56,61,68,135,144],"signal":[27],"by":[28],"real":[29],"constants,":[30],"in":[31],"way":[33],"which":[34,71],"minimizes":[35],"hardware":[36,51],"cost":[37,52,114],"subject":[38],"error":[40],"constraints.":[41],"Unlike":[42],"our":[43],"previous":[44],"work,":[45],"here":[46],"we":[47,64,140],"consider":[48],"an":[49,95,108,129],"improved":[50],"model,":[53],"whereby":[54],"instead":[55],"simply":[57],"counting":[58],"number":[60,67],"adders":[62],"needed,":[63],"count":[65],"bits":[69],"required,":[70],"more":[73],"realistic.":[74],"We":[75],"also":[76],"introduce":[77],"two":[78,150],"algorithms":[79,151],"for":[80],"solving":[81],"MRCM":[83],"namely:":[85],"(i)":[86],"greedy":[88],"algorithm":[89,110],"without":[90],"backtracking":[91],"heuristically":[93],"traverses":[94],"exponentially":[96],"growing":[97],"search":[98,125],"tree":[99],"rapidly":[101],"produces":[102],"suboptimal":[104],"solution;":[105],"(ii)":[107],"exact":[109],"exploits":[112],"known":[113],"upper":[115],"bounds":[116],"determine":[118],"whether":[119],"how":[121],"expand":[123],"tree,":[126],"leading":[127],"optimal":[130],"solution":[131],"at":[132],"expense":[134],"longer":[136],"execution":[137],"time.":[138],"Finally,":[139],"present":[141],"set":[143],"experimental":[145],"results":[146],"compares":[148],"with":[152],"Hcubalgorithm.":[154]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}