Bit-width Optimization for Configurable DSP's by Multi-interval Analysis
- Creators
- Benedetti, A.
- Perona, P.
- Other:
- Matthews, M. B.
Abstract
A new algorithm for bounding the bit-widths of the data registers of an acyclic data-flow graph is presented. The method, based on the propagation of two's complement fixed-point numerical ranges, can be applied to both linear and nonlinear time invariant flow graphs and is well suited to be implemented in Field Programmable Gate Arrays (FPGA's). Numerical values are represented by unions of intervals, allowing automatic monitoring of the growth of the number of bits needed to represent the integer and the fractional part of intermediate variables. Central to this method is the definition of a new interval arithmetic on fixed point multi-intervals. An application of the proposed algorithm to the problem of detecting two dimensional visual features in video images is presented.
Additional Information
© 2000 IEEE. Date of Current Version: 06 August 2002.Additional details
- Eprint ID
- 27936
- Resolver ID
- CaltechAUTHORS:20111123-082518994
- Created
-
2011-11-23Created from EPrint's datestamp field
- Updated
-
2021-11-09Created from EPrint's last_modified field
- Series Name
- Conference Record of the Asilomar Conference on Signals, Systems and Computers
- Other Numbering System Name
- INSPEC Accession Number
- Other Numbering System Identifier
- 7028160