{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T14:04:25Z","timestamp":1773842665223,"version":"3.50.1"},"reference-count":50,"publisher":"Association for Computing Machinery (ACM)","issue":"4","funder":[{"DOI":"10.13039\/501100001659","name":"German Research Foundation","doi-asserted-by":"crossref","award":["DR 287\/35-2 - project number 406079023"],"award-info":[{"award-number":["DR 287\/35-2 - project number 406079023"]}],"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. Des. Autom. Electron. Syst."],"published-print":{"date-parts":[[2025,7,31]]},"abstract":"<jats:p>Approximate circuits have become ubiquitous in error-resilient applications. These circuits provide large reductions in area, power, and delay at the cost of erroneous computations. The error-resilient applications produce acceptable output quality, even after the introduction of erroneous computations. However, we observed that the error resilience of an application varies widely with respect to the applied inputs. Since prior works have mostly focused on using samples from a uniform distribution while designing the approximate circuits, they are unable to exploit input aware properties to design optimal circuits. Hence, in this work, we bridge this gap and propose Formally Verified Library of Input Data Aware Approximate Circuits (FV-LIDAC). FV-LIDAC is the first formally verified library of input distribution aware approximate arithmetic circuits. We use three of the most widely occurring distributions, namely uniform, normal, and exponential distributions, to show that optimal design sets are heavily dependent on the input data. FV-LIDAC chooses the best designs among millions of functional approximated adder and multiplier circuits, depending upon the inputs. Since there are no existing input-aware approximate circuit libraries, we compared FV-LIDAC against state-of-the-art input-unaware EvoApproxLib, to further highlight the need for FV-LIDAC. Additionally, we perform case studies on real-world applications to further highlight the improvement over state-of-the-art. We aim to make the Pareto-optimal designs available as open source to stimulate further research.<\/jats:p>","DOI":"10.1145\/3744710","type":"journal-article","created":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T01:46:58Z","timestamp":1749779218000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["FV-LIDAC: Formally Verified Library of Input Data Aware Approximate Arithmetic Circuits"],"prefix":"10.1145","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4000-6207","authenticated-orcid":false,"given":"Sallar","family":"Ahmadi-Pour","sequence":"first","affiliation":[{"name":"Group of Computer Architecture, University of Bremen Faculty 3 Mathematics and Computer Science","place":["Bremen, Germany"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3069-8791","authenticated-orcid":false,"given":"Sajjad","family":"Parvin","sequence":"additional","affiliation":[{"name":"Computer Science, University of Bremen Faculty 03 Mathematics and Computer Science","place":["Bremen, Germany"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9490-4470","authenticated-orcid":false,"given":"Chandan Kumar","family":"Jha","sequence":"additional","affiliation":[{"name":"Computer Science, University of Bremen Faculty 03 Mathematics and Computer Science","place":["Bremen, Germany"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9872-1740","authenticated-orcid":false,"given":"Rolf","family":"Drechsler","sequence":"additional","affiliation":[{"name":"Computer Science, University of Bremen Faculty 03 Mathematics and Computer Science","place":["Bremen, Germany"]},{"name":"Cyber-Physical Systems, DFKI","place":["Bremen, Germany"]}]}],"member":"320","published-online":{"date-parts":[[2025,7,9]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2020.3020792"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2022.3210252"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.mejo.2016.04.006"},{"key":"e_1_3_1_5_2","article-title":"ASAP7 PDK and Cell Library","author":"Clark Lawrence T.","year":"2023","unstructured":"Lawrence T. Clark, Vinay Vashishtha, Lucian Shifren, Aditya Gujja, Saurabh Sinha, Brian Cline, Chandarasekaran Ramamurthy, and Greg Yeric. 2023. ASAP7 PDK and Cell Library. Retrieved from https:\/\/github.com\/The-OpenROAD-Project\/asap7. (2023).","journal-title":"https:\/\/github.com\/The-OpenROAD-Project\/asap7"},{"key":"e_1_3_1_6_2","article-title":"Kodak Lossless True Color Image Suite","author":"Company Eastman Kodak","year":"1991","unstructured":"Eastman Kodak Company. 1991. Kodak Lossless True Color Image Suite. Retrieved from https:\/\/r0k.us\/graphics\/kodak\/. (1991).","journal-title":"https:\/\/r0k.us\/graphics\/kodak\/"},{"key":"e_1_3_1_7_2","first-page":"349","article-title":"Some schemes for parallel multipliers","volume":"34","author":"Dadda L.","year":"1965","unstructured":"L. Dadda. 1965. Some schemes for parallel multipliers. Alta Frequenza 34, 1 (1965), 349\u2013356.","journal-title":"Alta Frequenza"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/3572772"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2211477"},{"key":"e_1_3_1_10_2","article-title":"ENAP: An efficient number-aware pruning framework for design space exploration of approximate configurations","author":"Dou Yuqin","year":"2023","unstructured":"Yuqin Dou, Chenghua Wang, Roger Woods, and Weiqiang Liu. 2023. ENAP: An efficient number-aware pruning framework for design space exploration of approximate configurations. IEEE Transactions on Circuits and Systems I: Regular Papers 70, 5 (2023), 2062\u20132073.","journal-title":"IEEE Transactions on Circuits and Systems I: Regular Papers"},{"key":"e_1_3_1_11_2","article-title":"py-paretoarchive","year":"2023","unstructured":"ehwFIT. 2023. py-paretoarchive. Retrieved from https:\/\/github.com\/ehw-fit\/py-paretoarchive. (2023).","journal-title":"https:\/\/github.com\/ehw-fit\/py-paretoarchive"},{"key":"e_1_3_1_12_2","doi-asserted-by":"crossref","first-page":"284","DOI":"10.23919\/DATE.2019.8715138","volume-title":"Proceedings of the 2019 Design, Automation & Test in Europe Conference & Exhibition (DATE\u201919)","author":"Froehlich Saman","year":"2019","unstructured":"Saman Froehlich, Daniel Gro\u00dfe, and Rolf Drechsler. 2019. One method-all error-metrics: A three-stage approach for error-metric evaluation in approximate computing. In Proceedings of the 2019 Design, Automation & Test in Europe Conference & Exhibition (DATE\u201919). IEEE, 284\u2013287."},{"key":"e_1_3_1_13_2","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/978-3-319-54157-0_18","volume-title":"Proceedings of the Evolutionary Multi-Criterion Optimization","author":"Glasmachers Tobias","year":"2017","unstructured":"Tobias Glasmachers. 2017. A fast incremental BSP tree archive for non-dominated points. In Proceedings of the Evolutionary Multi-Criterion Optimization, Heike Trautmann, G\u00fcnter Rudolph, Kathrin Klamroth, Oliver Sch\u00fctze, Margaret Wiecek, Yaochu Jin, and Christian Grimme (Eds.). Springer International Publishing, Cham, 252\u2013266."},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2012.2217962"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-020-2649-2"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"issue":"2","key":"e_1_3_1_17_2","first-page":"767","article-title":"Analysis of worst-case data dependent temporal approximation in floating point units","volume":"68","author":"Jha Chandan Kumar","year":"2020","unstructured":"Chandan Kumar Jha, Ishita Doshi, and Joycee Mekie. 2020. Analysis of worst-case data dependent temporal approximation in floating point units. IEEE Transactions on Circuits and Systems II: Express Briefs 68, 2 (2020), 767\u2013771.","journal-title":"IEEE Transactions on Circuits and Systems II: Express Briefs"},{"key":"e_1_3_1_18_2","article-title":"cecApprox: Enabling automated combinational equivalence checking for approximate circuits","author":"Jha Chandan Kumar","year":"2024","unstructured":"Chandan Kumar Jha, Muhammad Hassan, and Rolf Drechsler. 2024. cecApprox: Enabling automated combinational equivalence checking for approximate circuits. IEEE Transactions on Circuits and Systems I: Regular Papers 71, 7 (2024), 3282\u20133293.","journal-title":"IEEE Transactions on Circuits and Systems I: Regular Papers"},{"key":"e_1_3_1_19_2","article-title":"Single exact single approximate adders and single exact dual approximate adders","author":"Jha Chandan Kumar","year":"2023","unstructured":"Chandan Kumar Jha, Ankita Nandi, and Joycee Mekie. 2023. Single exact single approximate adders and single exact dual approximate adders. IEEE Transactions on Very Large Scale Integration (VLSI) Systems 31, 7 (2023), 907\u2013916.","journal-title":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/JXCDC.2022.3222015"},{"issue":"2","key":"e_1_3_1_21_2","first-page":"385","article-title":"Energy and error analysis framework for approximate computing in mobile applications","volume":"67","author":"Jha Chandan Kumar","year":"2019","unstructured":"Chandan Kumar Jha, Sneha N. Ved, Ishant Anand, and Joycee Mekie. 2019. Energy and error analysis framework for approximate computing in mobile applications. IEEE Transactions on Circuits and Systems II: Express Briefs 67, 2 (2019), 385\u2013389.","journal-title":"IEEE Transactions on Circuits and Systems II: Express Briefs"},{"key":"e_1_3_1_22_2","first-page":"1","volume-title":"Proceedings of the 2021 IEEE International Symposium on Circuits and Systems (ISCAS\u201921)","author":"Jha Chandan Kumar","year":"2021","unstructured":"Chandan Kumar Jha, Sumit Walia, Gagan Kanojia, and Joycee Mekie. 2021. FPCAM: Floating point configurable approximate multiplier for error resilient applications. In Proceedings of the 2021 IEEE International Symposium on Circuits and Systems (ISCAS\u201921). IEEE, 1\u20135."},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2020.3006451"},{"key":"e_1_3_1_24_2","first-page":"248","volume-title":"Proceedings of the 26th Asia and South Pacific Design Automation Conference","author":"Kemp Taylor","year":"2021","unstructured":"Taylor Kemp, Yao Yao, and Younghyun Kim. 2021. MIPAC: Dynamic input-aware accuracy control for dynamic auto-tuning of iterative approximate computing. In Proceedings of the 26th Asia and South Pacific Design Automation Conference. 248\u2013253."},{"key":"e_1_3_1_25_2","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1109\/DDECS54261.2022.9770152","volume-title":"Proceedings of the 2022 25th International Symposium on Design and Diagnostics of Electronic Circuits and Systems (DDECS\u201922)","author":"Klhufek Jan","year":"2022","unstructured":"Jan Klhufek and Vojtech Mrazek. 2022. ArithsGen: Arithmetic circuit generator for hardware accelerators. In Proceedings of the 2022 25th International Symposium on Design and Diagnostics of Electronic Circuits and Systems (DDECS\u201922). IEEE, 44\u201347."},{"key":"e_1_3_1_26_2","unstructured":"Alex Krizhevsky and Geoffrey Hinton. 2009. Learning multiple layers of features from tiny images. (2009)."},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"e_1_3_1_28_2","article-title":"Learning to discover social circles in ego networks","author":"Leskovec Jure","year":"2012","unstructured":"Jure Leskovec and Julian Mcauley. 2012. Learning to discover social circles in ego networks. Advances in Neural Information Processing Systems 27, 1 (2012), 539\u2013547.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2022.3197229"},{"key":"e_1_3_1_30_2","first-page":"920","volume-title":"Proceedings of the 2021 Design, Automation & Test in Europe Conference & Exhibition (DATE\u201921)","author":"Ma Dongning","year":"2021","unstructured":"Dongning Ma, Rahul Thapa, Xingjian Wang, Xun Jiao, and Cong Hao. 2021. Workload-aware approximate computing configuration. In Proceedings of the 2021 Design, Automation & Test in Europe Conference & Exhibition (DATE\u201921). IEEE, 920\u2013925."},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2946513"},{"key":"e_1_3_1_32_2","first-page":"1","volume-title":"Proceedings of the 56th Annual Design Automation Conference 2019","author":"Mrazek Vojtech","year":"2019","unstructured":"Vojtech Mrazek, Muhammad Abdullah Hanif, Zdenek Vasicek, Lukas Sekanina, and Muhammad Shafique. 2019. autoax: An automatic design space exploration and circuit building methodology utilizing libraries of approximate components. In Proceedings of the 56th Annual Design Automation Conference 2019. 1\u20136."},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.23919\/DATE.2017.7926993"},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.5555\/1816384"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2078195"},{"key":"e_1_3_1_36_2","first-page":"1","volume-title":"Proceedings of the 2022 IEEE International Conference on Automation, Quality and Testing, Robotics (AQTR\u201922)","author":"Piri Ali","year":"2022","unstructured":"Ali Piri, Sepide Saeedi, Mario Barbareschi, Bastien Deveautour, Stefano Di Carlo, Ian O\u2019Connor, Alessandro Savino, Marcello Traiola, and Alberto Bosio. 2022. Input-aware approximate computing. In Proceedings of the 2022 IEEE International Conference on Automation, Quality and Testing, Robotics (AQTR\u201922). IEEE, 1\u20136."},{"key":"e_1_3_1_37_2","volume-title":"Digital Integrated Circuits a Design Perspective","author":"Rabaey Jan M.","year":"1999","unstructured":"Jan M. Rabaey. 1999. Digital Integrated Circuits a Design Perspective."},{"key":"e_1_3_1_38_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2020.2968905"},{"key":"e_1_3_1_39_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2019.2918241"},{"key":"e_1_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2020.3014430"},{"key":"e_1_3_1_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/2897937.2906199"},{"key":"e_1_3_1_42_2","volume-title":"Digital Computer Arithmetic Datapath Design Using Verilog HDL (2004 ed.)","author":"Stine James E.","year":"2003","unstructured":"James E. Stine. 2003. Digital Computer Arithmetic Datapath Design Using Verilog HDL (2004 ed.). Springer, New York, NY."},{"key":"e_1_3_1_43_2","first-page":"552","volume-title":"Proceedings of the Advanced Signal Processing Algorithms, Architectures, and Implementations XIII","volume":"5205","author":"Townsend Whitney J.","year":"2003","unstructured":"Whitney J. Townsend, Earl E. Swartzlander Jr, and Jacob A. Abraham. 2003. A comparison of Dadda and Wallace multiplier delays. In Proceedings of the Advanced Signal Processing Algorithms, Architectures, and Implementations XIII, Vol. 5205. SPIE, 552\u2013560."},{"key":"e_1_3_1_44_2","doi-asserted-by":"publisher","DOI":"10.1145\/3513262"},{"key":"e_1_3_1_45_2","doi-asserted-by":"crossref","DOI":"10.1109\/TVLSI.2023.3273478","article-title":"Efficient error estimation for high-level design space exploration of approximate computing systems","author":"Vaeztourshizi Marzieh","year":"2023","unstructured":"Marzieh Vaeztourshizi and Massoud Pedram. 2023. Efficient error estimation for high-level design space exploration of approximate computing systems. IEEE Transactions on Very Large Scale Integration (VLSI) Systems 31, 7 (2023), 917\u2013930.","journal-title":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems"},{"key":"e_1_3_1_46_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2958605"},{"key":"e_1_3_1_47_2","first-page":"294","volume-title":"Proceedings of the 2020 Design, Automation & Test in Europe Conference & Exhibition (DATE\u201920)","author":"Vaverka Filip","year":"2020","unstructured":"Filip Vaverka, Vojtech Mrazek, Zdenek Vasicek, and Lukas Sekanina. 2020. Tfapprox: Towards a fast emulation of dnn approximate hardware accelerators on gpu. In Proceedings of the 2020 Design, Automation & Test in Europe Conference & Exhibition (DATE\u201920). IEEE, 294\u2013297."},{"key":"e_1_3_1_48_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2016.2643639"},{"key":"e_1_3_1_49_2","volume-title":"CMOS VLSI Design: A Circuits and Systems Perspective","author":"Weste Neil H. E.","year":"2015","unstructured":"Neil H. E. Weste and David Harris. 2015. CMOS VLSI Design: A Circuits and Systems Perspective. Pearson Education India."},{"key":"e_1_3_1_50_2","unstructured":"Han Xiao Kashif Rasul and Roland Vollgraf. 2017. Fashion-mnist: A novel image dataset for benchmarking machine learning algorithms. arXiv:1708.07747. Retrieved from https:\/\/arxiv.org\/abs\/1708.07747 (2017)."},{"key":"e_1_3_1_51_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2016.2587696"}],"container-title":["ACM Transactions on Design Automation of Electronic Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3744710","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,9]],"date-time":"2025-07-09T12:20:50Z","timestamp":1752063650000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3744710"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,9]]},"references-count":50,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,7,31]]}},"alternative-id":["10.1145\/3744710"],"URL":"https:\/\/doi.org\/10.1145\/3744710","relation":{},"ISSN":["1084-4309","1557-7309"],"issn-type":[{"value":"1084-4309","type":"print"},{"value":"1557-7309","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,9]]},"assertion":[{"value":"2024-07-10","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-06-09","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-07-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}