摘要: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.