{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T16:49:37Z","timestamp":1743266977160,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031215131"},{"type":"electronic","value":"9783031215148"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-21514-8_33","type":"book-chapter","created":{"date-parts":[[2022,12,16]],"date-time":"2022-12-16T13:23:13Z","timestamp":1671196993000},"page":"397-407","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Scalable Construction of\u00a0Formal Error Guaranteed LUT-Based Approximate Multipliers with\u00a0Analytical Worst-Case Error Bound"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2447-7060","authenticated-orcid":false,"given":"Anishetti","family":"Venkatesh","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7237-5878","authenticated-orcid":false,"given":"Chandan Kumar","family":"Jha","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0584-7967","authenticated-orcid":false,"given":"G. U.","family":"Vinod","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6516-4175","authenticated-orcid":false,"given":"Masahiro","family":"Fujita","sequence":"additional","affiliation":[]},{"given":"Virendra","family":"Singh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,17]]},"reference":[{"key":"33_CR1","doi-asserted-by":"publisher","unstructured":"Mrazek, V., Vasicek, Z., Sekanina, L., Jiang, H., Han, J.: Scalable construction of approximate multipliers with formally guaranteed worst case error. IEEE Trans. Very Large Scale Integr. (VLSI) Syst. 26(11), 2572\u20132576 (2018). https:\/\/doi.org\/10.1109\/TVLSI.2018.2856362","DOI":"10.1109\/TVLSI.2018.2856362"},{"key":"33_CR2","doi-asserted-by":"publisher","unstructured":"Vinod, G.U., Vineesh, V.S., Tudu, J.T., Fujita, M., Singh, V.: LUT-based circuit approximation with targeted error guarantees. In: 2020 IEEE 29th Asian Test Symposium (ATS), pp. 1\u20136 (2020). https:\/\/doi.org\/10.1109\/ATS49688.2020.9301574","DOI":"10.1109\/ATS49688.2020.9301574"},{"key":"33_CR3","doi-asserted-by":"publisher","unstructured":"Mrazek, V., Sekanina, L., Vasicek, Z.: Using libraries of approximate circuits in design of hardware accelerators of deep neural networks. In: 2020 2nd IEEE International Conference on Artificial Intelligence Circuits and Systems (AICAS), pp. 243\u2013247 (2020). https:\/\/doi.org\/10.1109\/AICAS48895.2020.9073837","DOI":"10.1109\/AICAS48895.2020.9073837"},{"key":"33_CR4","unstructured":"Evo Approximate library. https:\/\/ehw.fit.vutbr.cz\/evoapproxlib"},{"key":"33_CR5","doi-asserted-by":"publisher","first-page":"177309","DOI":"10.1109\/ACCESS.2019.2958605","volume":"7","author":"Z Vasicek","year":"2019","unstructured":"Vasicek, Z.: Formal methods for exact analysis of approximate circuits. IEEE Access 7, 177309\u2013177331 (2019). https:\/\/doi.org\/10.1109\/ACCESS.2019.2958605","journal-title":"IEEE Access"},{"key":"33_CR6","doi-asserted-by":"publisher","unstructured":"\u010ce\u0161ka, M., Matya\u0161, J., Mrazek, V., Sekanina, L., Vasicek, Z., Vojnar, T.: Approximating complex arithmetic circuits with formal error guarantees: 32-bit multipliers accomplished. In: 2017 IEEE\/ACM International Conference on Computer-Aided Design (ICCAD), pp. 416\u2013423 (2017). https:\/\/doi.org\/10.1109\/ICCAD.2017.8203807","DOI":"10.1109\/ICCAD.2017.8203807"},{"key":"33_CR7","doi-asserted-by":"publisher","unstructured":"Hashemi, S., Tann, H., Reda, S.: BLASYS: approximate logic synthesis using boolean matrix factorization. In: 2018 55th ACM\/ESDA\/IEEE Design Automation Conference (DAC), pp. 1\u20136 (2018). https:\/\/doi.org\/10.1109\/DAC.2018.8465702","DOI":"10.1109\/DAC.2018.8465702"},{"key":"33_CR8","doi-asserted-by":"publisher","unstructured":"Venkataramani, S., Sabne, A., Kozhikkottu, V., Roy, K., Raghunathan, A.: SALSA: systematic logic synthesis of approximate circuits. In: DAC Design Automation Conference 2012, pp. 796\u2013801 (2012). https:\/\/doi.org\/10.1145\/2228360.2228504","DOI":"10.1145\/2228360.2228504"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Fr\u00f6hlich, S., Gro\u00dfe, D., Drechsler, R.: Approximate hardware generation using symbolic computer algebra employing grobner basis. In: Design, Automation & Test in Europe Conference & Exhibition (DATE) 2018, pp. 889\u2013892 (2018)","DOI":"10.23919\/DATE.2018.8342133"},{"key":"33_CR10","unstructured":"YOSYS tool. http:\/\/www.clifford.at\/yosys\/"}],"container-title":["Communications in Computer and Information Science","VLSI Design and Test"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-21514-8_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,16]],"date-time":"2022-12-16T13:26:01Z","timestamp":1671197161000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21514-8_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031215131","9783031215148"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21514-8_33","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"17 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"VDAT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on VLSI Design and Test","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jammu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"vdat2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iitjammu.ac.in\/vdat2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"220","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}