Abstract
Range analysis is used to optimize circuits and to allocate the bit-width. In this paper we introduce a new and efficient static method to analyze the datapath represented by a polynomial, and compute the range for the datapath, then yield the smallest output bit-width. The method is based on Arithmetic Transform which can guarantee accuracy, and can explore polynomials with single or multiple word-level variables. The experiments show the tighter bounds than other recent static methods and significantly faster executions than simulation.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.