Synthesis for mixed arithmetic.

Abstract : This article presents a methodology to use a powerful arithmetic (redundant arithmetic) in some parts of designs in order to fasten them without a large increase in area, thanks to the use of both conventional and redundant number systems. This implies specific constraints in the scheduling process. An integer linear programming (ILP) formulation is proposed which finds an optimal solution for reasonable examples. In order to solve the problem of possibly huge ILP computational time, a general solution, based on a constraint graph partitioning, is proposed.
Document type :
Reports
Complete list of metadatas

Cited literature [38 references]  Display  Hide  Download

https://hal-lara.archives-ouvertes.fr/hal-02101886
Contributor : Colette Orange <>
Submitted on : Wednesday, April 17, 2019 - 9:08:59 AM
Last modification on : Friday, May 17, 2019 - 1:39:21 AM

File

RR1997-41.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02101886, version 1

Collections

Citation

Anne Mignotte, Jean-Michel Muller, Olivier Peyran. Synthesis for mixed arithmetic.. [Research Report] LIP RR-1997-11, Laboratoire de l'informatique du parallélisme. 1997, 2+24p. ⟨hal-02101886⟩

Share

Metrics

Record views

7

Files downloads

6