Sciweavers

Share
ISSS
1999
IEEE

Bit-Width Selection for Data-Path Implementations

12 years 2 months ago
Bit-Width Selection for Data-Path Implementations
Specifications of data computations may not necessarily describe the ranges of the intermediate results that can be generated. However, such information is critical to determine the bit-widths of the resources required for a datapath implementation. In this paper, we present a novel approach based on interval computations that provides, not only guaranteed range estimates that take into account dependencies between variables, but estimates of their probability density functions that can be used when some truncation must be performed due to constraints in the specification. Results show that interval-based estimates are obtained in reasonable times and are more accurate than those provided by independent range computation, thus leading to substantial reductions in area and latency of the corresponding data-path implementation.
Carlos Carreras, Juan A. López, Octavio Nie
Added 04 Aug 2010
Updated 04 Aug 2010
Type Conference
Year 1999
Where ISSS
Authors Carlos Carreras, Juan A. López, Octavio Nieto-Taladriz
Comments (0)
books