Abstract
In approximate circuits, the functionality of the circuit is modified to improve non-functional parameters such as area, power, and delay. These circuits are targeted for error-resilient applications like image processing, neural networks, etc. These applications can achieve acceptable output results even after the introduction of approximation in computations. Error computation becomes crucial in these applications and can be done either using simulation or formal approaches. Both these methods of error computation are not scalable for circuits with inputs larger than 32 bits. In this work, we used scalable construction of large array multipliers using smaller formally worst-case error guaranteed array multipliers obtained using an LUT-SAT based approach and guaranteed overall worst-case error bounds analytically. Our 8 \(\times \) 8 approximate multipliers based on the LUT-SAT approach have 0.59% less area as compared to the state-of-the-art EvoApprox library-based multipliers. We compared the 16 \(\times \) 16 multipliers constructed using four 8 \(\times \) 8 LUT-SAT-based multipliers with 16 \(\times \) 16 multipliers constructed using four 8 \(\times \) 8 Evo multipliers. We have performed the area and various error metric comparisons.
C. K. Jha—The work was carried out when Chandan Kumar Jha was at CADSL, IIT Bombay.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
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–2576 (2018). https://doi.org/10.1109/TVLSI.2018.2856362
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–6 (2020). https://doi.org/10.1109/ATS49688.2020.9301574
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–247 (2020). https://doi.org/10.1109/AICAS48895.2020.9073837
Evo Approximate library. https://ehw.fit.vutbr.cz/evoapproxlib
Vasicek, Z.: Formal methods for exact analysis of approximate circuits. IEEE Access 7, 177309–177331 (2019). https://doi.org/10.1109/ACCESS.2019.2958605
Češka, M., Matyaš, 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–423 (2017). https://doi.org/10.1109/ICCAD.2017.8203807
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–6 (2018). https://doi.org/10.1109/DAC.2018.8465702
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–801 (2012). https://doi.org/10.1145/2228360.2228504
Fröhlich, S., Große, 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–892 (2018)
YOSYS tool. http://www.clifford.at/yosys/
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Venkatesh, A., Jha, C.K., Vinod, G.U., Fujita, M., Singh, V. (2022). Scalable Construction of Formal Error Guaranteed LUT-Based Approximate Multipliers with Analytical Worst-Case Error Bound. In: Shah, A.P., Dasgupta, S., Darji, A., Tudu, J. (eds) VLSI Design and Test. VDAT 2022. Communications in Computer and Information Science, vol 1687. Springer, Cham. https://doi.org/10.1007/978-3-031-21514-8_33
Download citation
DOI: https://doi.org/10.1007/978-3-031-21514-8_33
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-21513-1
Online ISBN: 978-3-031-21514-8
eBook Packages: Computer ScienceComputer Science (R0)