Synthesis for mixed arithmetic

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 speci c constraints in the scheduling process. An integer linear programming (ILP) formulation is proposed which nds 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

Retiming DAGs

This paper is devoted to a low-complexity algorithm for retiming circuits without cycles, i.e. whose network graph is a Direct Acyclic Graph (DAG). On one hand DAGs have a great practical importance, as shown by the on-line arithmetic circuits used as a target application in this paper. On the other hand retiming is a costly design optimization technique, in particular when applied to large circuits. Hence the need to design a specialized retiming algorithm to handle DAGs more eciently than general-purpose retiming algorithms. Our algorithm dramatically improves on current solutions in the literature: we gain an order of magnitude in the worst-case complexity, and we show convincing experimental results at the end of the paper

Short Papers Retiming DAG’s

Abstract — This paper is devoted to a low-complexity algorithm for retiming circuits without cycles, i.e., those whose network graph is a direct acyclic graph (DAG). On one hand, DAG’s have a great practical importance, as shown by the on-line arithmetic circuits used as a target application in this paper. On the other hand, retiming is a costly design optimization technique, in particular when applied to large circuits. Hence the need to design a specialized retiming algorithm to handle DAG’s more efficiently than general-purpose retiming algorithms. Our algorithm dramatically improves on current solutions in the literature: we gain an order of magnitude in the worst case complexity, and we show convincing experimental results at the end of this paper. I