{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T15:00:22Z","timestamp":1773414022492,"version":"3.50.1"},"reference-count":38,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T00:00:00Z","timestamp":1653696000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001659","name":"German Research Foundation","doi-asserted-by":"crossref","award":["380524764"],"award-info":[{"award-number":["380524764"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Embed. Comput. Syst."],"published-print":{"date-parts":[[2022,5,31]]},"abstract":"<jats:p>\n            Approximate arithmetic operators, such as adders and multipliers, are increasingly used to satisfy the energy and performance requirements of resource-constrained embedded systems. However, most of the available approximate operators have an application-agnostic design methodology, and the efficacy of these operators can only be evaluated by employing them in the applications. Furthermore, the various available libraries of approximate operators do not share any standard approximation-induction policy to design new operators according to an application\u2019s accuracy and performance constraints. These limitations also hinder the utilization of machine learning models to explore and determine approximate operators according to an application\u2019s requirements. In this work, we present a generic design methodology for implementing FPGA-based application-specific approximate arithmetic operators. Our proposed technique utilizes lookup tables and carry-chains of FPGAs to implement approximate operators according to the input configurations. For instance, for an\n            <jats:inline-formula content-type=\"math\/tex\">\n              <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\( \\text{M}\\times \\text{N} \\)<\/jats:tex-math>\n            <\/jats:inline-formula>\n            accurate multiplier utilizing\n            <jats:italic>K<\/jats:italic>\n            lookup tables, our methodology utilizes\n            <jats:italic>K<\/jats:italic>\n            -bit configurations to design\n            <jats:inline-formula content-type=\"math\/tex\">\n              <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\( 2^K \\)<\/jats:tex-math>\n            <\/jats:inline-formula>\n            approximate multipliers. We then utilize various machine learning models to evaluate and select configurations satisfying application accuracy and performance constraints. We have evaluated our proposed methodology for three benchmark applications, i.e., biomedical signal processing, image processing, and ANNs. We report more non-dominated approximate multipliers with better hypervolume contribution than state-of-the-art designs for these benchmark applications with the proposed design methodology.\n          <\/jats:p>","DOI":"10.1145\/3513262","type":"journal-article","created":{"date-parts":[[2022,2,11]],"date-time":"2022-02-11T16:53:05Z","timestamp":1644598385000},"page":"1-31","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["<i>AppAxO<\/i>\n            : Designing\n            <u>App<\/u>\n            lication-specific\n            <u>A<\/u>\n            ppro\n            <u>x<\/u>\n            imate\n            <u>O<\/u>\n            perators for FPGA-based Embedded Systems"],"prefix":"10.1145","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9774-9522","authenticated-orcid":false,"given":"Salim","family":"Ullah","sequence":"first","affiliation":[{"name":"The Chair for Processor Design, Center for Advancing Electronics Dresden (CfAED), Technische Universit\u00e4t Dresden, Dresden, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2243-5350","authenticated-orcid":false,"given":"Siva Satyendra","family":"Sahoo","sequence":"additional","affiliation":[{"name":"The Chair for Processor Design, Center for Advancing Electronics Dresden (CfAED), Technische Universit\u00e4t Dresden, Dresden, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7523-5152","authenticated-orcid":false,"given":"Nemath","family":"Ahmed","sequence":"additional","affiliation":[{"name":"The Chair for Processor Design, Center for Advancing Electronics Dresden (CfAED), Technische Universit\u00e4t Dresden, Dresden, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6613-2431","authenticated-orcid":false,"given":"Debabrata","family":"Chaudhury","sequence":"additional","affiliation":[{"name":"The Chair for Processor Design, Center for Advancing Electronics Dresden (CfAED), Technische Universit\u00e4t Dresden, Dresden, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7125-1737","authenticated-orcid":false,"given":"Akash","family":"Kumar","sequence":"additional","affiliation":[{"name":"The Chair for Processor Design, Center for Advancing Electronics Dresden (CfAED), Technische Universit\u00e4t Dresden, Dresden, Germany"}]}],"member":"320","published-online":{"date-parts":[[2022,5,28]]},"reference":[{"key":"e_1_3_2_2_2","first-page":"265","volume-title":"Proceedings of the 12th  \\( \\lbrace \\) USENIX \\( \\rbrace \\)  Symposium on Operating Systems Design and Implementation","author":"Abadi Mart\u00edn","year":"2016","unstructured":"Mart\u00edn Abadi, Paul Barham, Jianmin Chen, Zhifeng Chen, Andy Davis, Jeffrey Dean, Matthieu Devin, Sanjay Ghemawat, Geoffrey Irving, Michael Isard, et\u00a0al. 2016. Tensorflow: A system for large-scale machine learning. In Proceedings of the 12th \\( \\lbrace \\) USENIX \\( \\rbrace \\) Symposium on Operating Systems Design and Implementation. 265\u2013283."},{"key":"e_1_3_2_3_2","unstructured":"Anonymous. 2021. MNIST-cnn. Retrieved February 2 2021 from https:\/\/github.com\/integeruser\/MNIST-cnn."},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-739X(97)00021-6"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1973.223648"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.21105\/joss.02338"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7908-2604-3_16"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/2463209.2488873"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.22489\/CinC.2017.065-469"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2211477"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/3386263.3406907"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-9473(01)00065-2"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2012.2217962"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2015.7372600"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2011.2148970"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/VLSID.2011.51"},{"key":"e_1_3_2_17_2","first-page":"1","volume-title":"Proceedings of the 2010 IEEE International Conference of Electron Devices and Solid-state Circuits","author":"Kyaw Khaing Yin","year":"2010","unstructured":"Khaing Yin Kyaw, Wang Ling Goh, and Kiat Seng Yeo. 2010. Low-power high-speed multiplier for error-tolerant application. In Proceedings of the 2010 IEEE International Conference of Electron Devices and Solid-state Circuits. IEEE, 1\u20134."},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"issue":"3","key":"e_1_3_2_19_2","first-page":"18","article-title":"Classification and regression by randomForest","volume":"2","author":"Liaw Andy","year":"2002","unstructured":"Andy Liaw, Matthew Wiener, et\u00a0al. 2002. Classification and regression by randomForest. R News 2, 3 (2002), 18\u201322.","journal-title":"R News"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/2893356"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/3316781.3317781"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.23919\/DATE.2017.7926993"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/2966986.2967021"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/JETCAS.2020.3032495"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/0925-2312(91)90023-5"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/TBME.1985.325532"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2009.2033536"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/DAC18072.2020.9218533"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.23919\/DATE.2018.8342140"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/2966986.2967005"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1145\/2744769.2744778"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1023\/B:STCO.0000035301.49549.88"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/3195970.3196115"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/les.2020.2995053"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1145\/3195970.3195996"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2021.3056337"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2020.2988404"},{"key":"e_1_3_2_38_2","unstructured":"Xilinx. 2017. UltraScale Architecture Configurable Logic Block . https:\/\/docs.xilinx.com\/v\/u\/en-US\/ug574-ultrascale-clb."},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1109\/MDAT.2016.2630270"}],"container-title":["ACM Transactions on Embedded Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3513262","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3513262","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:29Z","timestamp":1750191149000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3513262"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,28]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,5,31]]}},"alternative-id":["10.1145\/3513262"],"URL":"https:\/\/doi.org\/10.1145\/3513262","relation":{},"ISSN":["1539-9087","1558-3465"],"issn-type":[{"value":"1539-9087","type":"print"},{"value":"1558-3465","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,28]]},"assertion":[{"value":"2021-08-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-01-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-05-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}