Advances in Bit Width Selection Methodology

David Cachera 1 Tanguy Risset 1
1 COSI - Codesign of Silicon Systems
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes
Abstract : We describe a method for the formal determination of signal bit width in fixed points VLSI implementations of signal processing algorithms containin- g loop nests. The main advance of this paper lies in the fact that we use results of the (max,+) algebraic theory to find the integral bit width of algorithms containing loop nests whose bound parameters are not statically known. Combined with recent results on fractional bit width determination, the results of this paper can be used for 1-dimensional systolic-like arrays implementing linear signal processing algorithms. Although they are presented in the context of a specific high level design methodology (based on systems of affine recurrence equations), the results of this work can be used in many high level design environments.
Document type :
Reports
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download

https://hal.inria.fr/inria-00072136
Contributor : Rapport de Recherche Inria <>
Submitted on : Tuesday, May 23, 2006 - 7:53:07 PM
Last modification on : Friday, November 16, 2018 - 1:30:39 AM
Long-term archiving on : Sunday, April 4, 2010 - 10:54:53 PM

Identifiers

  • HAL Id : inria-00072136, version 1

Citation

David Cachera, Tanguy Risset. Advances in Bit Width Selection Methodology. [Research Report] RR-4452, INRIA. 2002. ⟨inria-00072136⟩

Share

Metrics

Record views

172

Files downloads

475