{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T11:11:33Z","timestamp":1680347493301},"reference-count":14,"publisher":"Walter de Gruyter GmbH","issue":"3","funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["450987171"],"award-info":[{"award-number":["450987171"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,27]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>We present the design and a closed-form error analysis of accuracy-configurable multipliers via segmented carry chains. To address this problem, we model the approximate partial-product accumulations as a sequential process. According to a given splitting point of the carry chains, the technique herein discussed allows varying the quality of the accumulations and, consequently, the overall product. Due to these shorter critical paths, such kinds of approximate multipliers can trade-off accuracy for an increased performance whilst exploiting the inherent area savings of sequential over combinatorial approaches. We implemented multiple architectures targeting FPGAs and ASICs with different bit-widths and accuracy configurations to 1) estimate resources, power consumption, and delay, as well as to 2) evaluate those error metrics that belong to the so-called #P-complete class.<\/jats:p>","DOI":"10.1515\/itit-2021-0040","type":"journal-article","created":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T09:50:21Z","timestamp":1649238621000},"page":"89-98","source":"Crossref","is-referenced-by-count":0,"title":["Design and error analysis of accuracy-configurable sequential multipliers via segmented carry chains"],"prefix":"10.1515","volume":"64","author":[{"given":"Jorge","family":"Echavarria","sequence":"first","affiliation":[{"name":"Department of Computer Science , Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg (FAU) , Erlangen , Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Wildermann","sequence":"additional","affiliation":[{"name":"Department of Computer Science , Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg (FAU) , Erlangen , Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oliver","family":"Keszocze","sequence":"additional","affiliation":[{"name":"Department of Computer Science , Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg (FAU) , Erlangen , Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Faramarz","family":"Khosravi","sequence":"additional","affiliation":[{"name":"Department of Computer Science , Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg (FAU) , Erlangen , Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Becher","sequence":"additional","affiliation":[{"name":"Department of Computer Science , Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg (FAU) , Erlangen , Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00fcrgen","family":"Teich","sequence":"additional","affiliation":[{"name":"Department of Computer Science , Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg (FAU) , Erlangen , Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"374","published-online":{"date-parts":[[2022,4,6]]},"reference":[{"key":"2023033121051272199_j_itit-2021-0040_ref_001","unstructured":"W. Liu, T. Zhang, E. McLarnon, M. O\u2019Neill, P. Montuschi, and F. Lombardi, \u201cDesign and analysis of majority logic based approximate adders and multipliers,\u201d IEEE Transactions on Emerging Topics in Computing, 2019."},{"key":"2023033121051272199_j_itit-2021-0040_ref_002","doi-asserted-by":"crossref","unstructured":"N. Van Toan and J. Lee, \u201cFPGA-based Multi-Level Approximate Multipliers for High-Performance Error-Resilient Applications,\u201d IEEE Access, 2020.","DOI":"10.1109\/ACCESS.2020.2970968"},{"key":"2023033121051272199_j_itit-2021-0040_ref_003","doi-asserted-by":"crossref","unstructured":"V. Mrazek, R. Hrbacek, Z. Vas\u00edcek, and L. Sekanina, \u201cEvoapprox8b: Library of approximate adders and multipliers for circuit design and benchmarking of approximation methods,\u201d in Design, Automation & Test in Europe Conference & Exhibition, DATE 2017, Lausanne, Switzerland, March 27\u201331, 2017, D. Atienza and G.\u2009D. Natale, Eds. IEEE, 2017, pp.\u2009258\u2013261. [Online]. Available: https:\/\/doi.org\/10.23919\/DATE.2017.7926993.","DOI":"10.23919\/DATE.2017.7926993"},{"key":"2023033121051272199_j_itit-2021-0040_ref_004","doi-asserted-by":"crossref","unstructured":"W. Liu, T. Cao, P. Yin, Y. Zhu, C. Wang, E.\u2009E. S. Jr., and F. Lombardi, \u201cDesign and analysis of approximate redundant binary multipliers,\u201d IEEE Trans. Computers, vol.\u200968, no.\u20096, pp.\u2009804\u2013819, 2019. [Online]. Available: https:\/\/doi.org\/10.1109\/TC.2018.2890222.","DOI":"10.1109\/TC.2018.2890222"},{"key":"2023033121051272199_j_itit-2021-0040_ref_005","doi-asserted-by":"crossref","unstructured":"A. Chandrasekharan, D. Gro\u00dfe, and R. Drechsler, Design Automation Techniques for Approximation Circuits: Verification, Synthesis and Test. Springer International Publishing, 01 2019.","DOI":"10.1007\/978-3-319-98965-5"},{"key":"2023033121051272199_j_itit-2021-0040_ref_006","doi-asserted-by":"crossref","unstructured":"M. Shafique, W. Ahmad, R. Hafiz, and J. Henkel, \u201cA low latency generic accuracy configurable adder,\u201d in Proceedings of the 52nd Annual Design Automation Conference, San Francisco, CA, USA, June 7\u201311, 2015, 2015, pp.\u200986:1\u201386:6. [Online]. Available: https:\/\/doi.org\/10.1145\/2744769.2744778.","DOI":"10.1145\/2744769.2744778"},{"key":"2023033121051272199_j_itit-2021-0040_ref_007","doi-asserted-by":"crossref","unstructured":"J. Echavarria, S. Wildermann, A. Becher, J. Teich, and D. Ziener, \u201cFAU: Fast and error-optimized approximate adder units on LUT-Based FPGAs,\u201d in 2016 International Conference on Field-Programmable Technology, FPT 2016, Xi\u2019an, China, December 7\u20139, 2016, 2016, pp.\u2009213\u2013216. [Online]. Available: https:\/\/doi.org\/10.1109\/FPT.2016.7929536.","DOI":"10.1109\/FPT.2016.7929536"},{"key":"2023033121051272199_j_itit-2021-0040_ref_008","doi-asserted-by":"crossref","unstructured":"J. Echavarria, S. Wildermann, E. Potwigin, and J. Teich, \u201cEfficient arithmetic error rate calculus for visibility reduced approximate adders,\u201d Embedded Systems Letters, vol.\u200910, no.\u20092, pp.\u200937\u201340, 2018. [Online]. Available: https:\/\/doi.org\/10.1109\/LES.2017.2760922.","DOI":"10.1109\/LES.2017.2760922"},{"key":"2023033121051272199_j_itit-2021-0040_ref_009","doi-asserted-by":"crossref","unstructured":"O. Keszocze, M. Soeken, and R. Drechsler, \u201cThe complexity of error metrics,\u201d Information Processing Letters, vol.\u2009139, pp.\u20091\u20137, 2018. [Online]. Available: http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0020019018301352.","DOI":"10.1016\/j.ipl.2018.06.010"},{"key":"2023033121051272199_j_itit-2021-0040_ref_010","doi-asserted-by":"crossref","unstructured":"H. Vollmer, Introduction to Circuit Complexity: A Uniform Approach, 2007th ed., ser. Texts in Theoretical Computer Science. An EATCS Series, P. Viaroli, P. Lasserre, and P. Campostrini, Eds. Springer, 1999.","DOI":"10.1007\/978-3-662-03927-4"},{"key":"2023033121051272199_j_itit-2021-0040_ref_011","doi-asserted-by":"crossref","unstructured":"J. Bonnot, V. Camus, K. Desnos, and D. Menard, \u201cAdaptive Simulation-based Framework for Error Characterization of Inexact Circuits,\u201d Microelectronics Reliability, vol.\u200996, pp.\u200960\u201370, May 2019. [Online]. Available: https:\/\/hal.archives-ouvertes.fr\/hal-02094908.","DOI":"10.1016\/j.microrel.2019.02.007"},{"key":"2023033121051272199_j_itit-2021-0040_ref_012","doi-asserted-by":"crossref","unstructured":"W. Liu, J. Xu, D. Wang, C. Wang, P. Montuschi, and F. Lombardi, \u201cDesign and evaluation of approximate logarithmic multipliers for low power error-tolerant applications,\u201d IEEE Trans. on Circuits and Systems, vol.\u200965-I, no.\u20099, pp.\u20092856\u20132868, 2018. [Online]. Available: https:\/\/doi.org\/10.1109\/TCSI.2018.2792902.","DOI":"10.1109\/TCSI.2018.2792902"},{"key":"2023033121051272199_j_itit-2021-0040_ref_013","doi-asserted-by":"crossref","unstructured":"Y. Guo, H. Sun, and S. Kimura, \u201cSmall-Area and Low-Power FPGA-Based Multipliers using Approximate Elementary Modules,\u201d in 25th Asia and South Pacific Design Automation Conference, ASP-DAC 2020, Beijing, China, January 13\u201316, 2020, 2020.","DOI":"10.1109\/ASP-DAC47756.2020.9045546"},{"key":"2023033121051272199_j_itit-2021-0040_ref_014","doi-asserted-by":"crossref","unstructured":"Z. Ebrahimi, S. Ullah, and A. Kumar, \u201cLeAp: Leading-one Detection-based Softcore Approximate Multipliers with Tunable Accuracy,\u201d in 25th Asia and South Pacific Design Automation Conference, ASP-DAC 2020, Beijing, China, January 13\u201316, 2020, 2020.","DOI":"10.1109\/ASP-DAC47756.2020.9045171"}],"container-title":["it - Information Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/itit-2021-0040\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/itit-2021-0040\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T10:35:15Z","timestamp":1680345315000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/itit-2021-0040\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,6]]},"references-count":14,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2022,4,6]]},"published-print":{"date-parts":[[2022,6,27]]}},"alternative-id":["10.1515\/itit-2021-0040"],"URL":"https:\/\/doi.org\/10.1515\/itit-2021-0040","relation":{},"ISSN":["2196-7032","1611-2776"],"issn-type":[{"value":"2196-7032","type":"electronic"},{"value":"1611-2776","type":"print"}],"subject":[],"published":{"date-parts":[[2022,4,6]]}}}