{"id":"https://openalex.org/W1569002003","doi":"https://doi.org/10.1109/ecctd.2005.1523161","title":"A detailed complexity model for multiple constant multiplication and an algorithm to minimize the complexity","display_name":"A detailed complexity model for multiple constant multiplication and an algorithm to minimize the complexity","publication_year":2006,"publication_date":"2006-10-11","ids":{"openalex":"https://openalex.org/W1569002003","doi":"https://doi.org/10.1109/ecctd.2005.1523161","mag":"1569002003"},"language":"en","primary_location":{"id":"doi:10.1109/ecctd.2005.1523161","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ecctd.2005.1523161","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2005 European Conference on Circuit Theory and Design, 2005.","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/A5052646180","display_name":"Kenny Johansson","orcid":null},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"K. Johansson","raw_affiliation_strings":["Linkopings universitet, Linkoping, SE","[Dept. of Electr. Eng., Linkoping Univ., Sweden]"],"affiliations":[{"raw_affiliation_string":"Linkopings universitet, Linkoping, SE","institution_ids":["https://openalex.org/I102134673"]},{"raw_affiliation_string":"[Dept. of Electr. Eng., Linkoping Univ., Sweden]","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028423819","display_name":"Oscar Gustafsson","orcid":"https://orcid.org/0000-0003-3470-3911"},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"O. Gustafsson","raw_affiliation_strings":["Linkopings universitet, Linkoping, SE","[Dept. of Electr. Eng., Linkoping Univ., Sweden]"],"affiliations":[{"raw_affiliation_string":"Linkopings universitet, Linkoping, SE","institution_ids":["https://openalex.org/I102134673"]},{"raw_affiliation_string":"[Dept. of Electr. Eng., Linkoping Univ., Sweden]","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077056160","display_name":"Lars Wanhammar","orcid":null},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"L. Wanhammar","raw_affiliation_strings":["Department of Electrical Engineering, Link\u00f6ping University, Linkoping, Sweden","[Dept. of Electr. Eng., Linkoping Univ., Sweden]"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Link\u00f6ping University, Linkoping, Sweden","institution_ids":["https://openalex.org/I102134673"]},{"raw_affiliation_string":"[Dept. of Electr. Eng., Linkoping Univ., Sweden]","institution_ids":["https://openalex.org/I102134673"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5052646180"],"corresponding_institution_ids":["https://openalex.org/I102134673"],"apc_list":null,"apc_paid":null,"fwci":3.869,"has_fulltext":false,"cited_by_count":41,"citation_normalized_percentile":{"value":0.93397875,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"3","issue":null,"first_page":"465","last_page":"468"},"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.9994999766349792,"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.9994999766349792,"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.9991000294685364,"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/T11693","display_name":"Cryptography and Residue Arithmetic","score":0.994700014591217,"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/computer-science","display_name":"Computer science","score":0.6478129625320435},{"id":"https://openalex.org/keywords/multiplication","display_name":"Multiplication (music)","score":0.5942484736442566},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5424559712409973},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5355648398399353},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4928593635559082},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3346083462238312},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2606106400489807}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6478129625320435},{"id":"https://openalex.org/C2780595030","wikidata":"https://www.wikidata.org/wiki/Q3860309","display_name":"Multiplication (music)","level":2,"score":0.5942484736442566},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5424559712409973},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5355648398399353},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4928593635559082},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3346083462238312},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2606106400489807},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/ecctd.2005.1523161","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ecctd.2005.1523161","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2005 European Conference on Circuit Theory and Design, 2005.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.407.5346","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.407.5346","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.es.isy.liu.se/publications/papers_and_reports/2005/kennyj_ecctd_2005.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1590193206","https://openalex.org/W1594799231","https://openalex.org/W1865434818","https://openalex.org/W1929845150","https://openalex.org/W2077881312","https://openalex.org/W2096479326","https://openalex.org/W2103244632","https://openalex.org/W2105101187","https://openalex.org/W2119529071","https://openalex.org/W2123392663","https://openalex.org/W2132324656","https://openalex.org/W2154656381","https://openalex.org/W2169484940","https://openalex.org/W6635434933","https://openalex.org/W6639150868"],"related_works":["https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W3093936885","https://openalex.org/W2994146737","https://openalex.org/W295308437","https://openalex.org/W2992046671","https://openalex.org/W2106539092","https://openalex.org/W4205300683","https://openalex.org/W56570565","https://openalex.org/W2189341500"],"abstract_inverted_index":{"Multiple":[0],"constant":[1,30,72],"multiplication":[2],"(MCM)":[3],"has":[4],"been":[5],"an":[6],"active":[7],"research":[8],"area":[9],"for":[10,68],"the":[11,21,33,41,82,99,110],"last":[12],"decade.":[13],"Most":[14],"work":[15],"so":[16],"far":[17],"have":[18,103],"only":[19],"considered":[20],"number":[22,28,42,106,111],"of":[23,29,43,71,107,112],"additions":[24,77,108],"to":[25,50],"realize":[26,51],"a":[27,55,86,104],"multiplications":[31],"with":[32,96],"same":[34],"input.":[35],"In":[36],"this":[37],"work,":[38],"we":[39],"consider":[40],"full":[44,113],"and":[45,54,78],"half":[46],"adder":[47,114],"cells":[48,115],"required":[49],"those":[52],"additions,":[53],"novel":[56,87],"complexity":[57,63,84],"measure":[58,64,85],"is":[59,90],"proposed.":[60],"The":[61],"proposed":[62,83,100],"can":[65],"be":[66],"utilized":[67],"all":[69],"types":[70],"operations":[73],"based":[74],"on":[75,81],"shifts,":[76],"subtractions.":[79],"Based":[80],"MCM":[88,101],"algorithm":[89,102],"presented.":[91],"Simulations":[92],"show":[93],"that":[94],"compared":[95],"previous":[97],"algorithms,":[98],"similar":[105],"while":[109],"are":[116],"significantly":[117],"reduced.":[118]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":7}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}