Abstract

High-Level Synthesis (HLS) of approximate computing circuits generates circuits based on functional units such as adders and multipliers. An approximate library containing approximate functional units is firstly built, and then an algorithm is employed to search in the library, solving the binding problem of HLS and finally generating an approximate circuit that meets design specifications. In this paper, we propose a discrete-input and multi-fidelity Bayesian optimization (BO) approach to solve this design space exploration problem. Since the input of the algorithm is discrete functional units in the approximate library, we modify the kernel function of Gaussian Process (GP) model in BO. In addition, we adopt a multi-fidelity strategy to speed up the optimization process, which is proved to be effective and efficient according to our experimental results.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.