Stochastic Bit-Width Approximation Using Extreme Value Theory for Customizable Processors

Application-specific logic can be generated with a balance and mix of functional units tailored to match an application’s computational requirements. The area and power consumption of application-specific functional units, registers and memory blocks is heavily dependent on the bit-widths of operands used in computations. The actual bit-width required to store the values assigned to a variable during execution of a program will not in general match the built-in C data types with fixed sizes of 8, 16, 32 and 64 bits. Thus, precious area is wasted if the built-in data type sizes are used to declare the size of operands. A novel stochastic bit-width approximation technique is introduced to estimate the required bit-width of integer variables using Extreme Value Theory. Results are presented to demonstrate reductions in bit-widths, area and power consumption when the probability of overflow/underflow occurring is varied from 0.1 to infinitesimal levels. Our experimental results show that the stochastic bit-width approximation results in overall 32% reduction in area and overall 21% reduction in the design power consumption on a FPGA chip for nine embedded benchmarks.

[1]  Bruce A. Draper,et al.  Compiling SA-C Programs to FPGAs: Performance Results , 2001, ICVS.

[2]  Michael D. Smith,et al.  A high-performance microarchitecture with hardware-programmable functional units , 1994, Proceedings of MICRO-27. The 27th Annual IEEE/ACM International Symposium on Microarchitecture.

[3]  Dominique Lavenier,et al.  Evaluation of the streams-C C-to-FPGA compiler: an applications perspective , 2001, FPGA '01.

[4]  Yun Cao,et al.  Quality-driven design by bitwidth optimization for video applications , 2003, ASP-DAC '03.

[5]  Heinrich Meyr,et al.  System level fixed-point design based on an interpolative approach , 1997, DAC.

[6]  Rajiv Gupta,et al.  A Representation for Bit Section Based Analysis and Optimization , 2002, CC.

[7]  Seehyun Kim,et al.  Fixed-point optimization utility for C and C++ based digital signal processing programs , 1998 .

[8]  Steven W. K. Tjiang,et al.  SUIF: an infrastructure for research on parallelizing and optimizing compilers , 1994, SIGP.

[9]  Seth Copen Goldstein,et al.  BitValue Inference: Detecting and Exploiting Narrow Bitwidth Computations , 2000, Euro-Par.

[10]  Charles Henry Brase,et al.  Understanding Basic Statistics , 2003 .

[11]  R. R. Kinnison,et al.  Applied extreme value statistics , 1984 .

[12]  Rob A. Rutenbar,et al.  Toward efficient static analysis of finite-precision effects in DSP applications via affine arithmetic modeling , 2003, Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451).

[13]  Carl Ebeling,et al.  Specifying and compiling applications for RaPiD , 1998, Proceedings. IEEE Symposium on FPGAs for Custom Computing Machines (Cat. No.98TB100251).

[14]  Margaret Martonosi,et al.  On Availability of Bit-Narrow Operations in General-Purpose Applications , 2000, FPL.

[15]  Wolfgang Karl,et al.  Euro-Par 2000 Parallel Processing , 2000, Lecture Notes in Computer Science.

[16]  Scott A. Mahlke,et al.  Bitwidth cognizant architecture synthesis of custom hardwareaccelerators , 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[17]  Mark Stephenson,et al.  Bidwidth analysis with application to silicon compilation , 2000, PLDI '00.

[18]  Allen R. Hanson,et al.  Computer Vision Systems , 1978 .