Olivier Peyran

Learn More
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(More)
CAD tools for special purpose architecture usually use conventional radix 2 number system to represent integers. However, DSP designer expertise shows that redundant number systems improve the delay of arithmetic operations. In this paper, we come to the conclusion that arithmetic operator outputs have to be redundant whereas inputs have not. Therefore, an(More)
Our goal is to design tools for high-level synthesis of special-purpose arithmetic circuits. After a presentation of what we call \mixed arithmetics" (that is, the use of diierent number systems on a same circuit), we propose a design strategy that could be used to automatically allocate a number system to each variable in a circuit. R esum e Notre objectif(More)
The increasing complexity of digital circuitry makes global design optimization no longer possible a designer will only consider the critical parts of his circuit This paper dis cusses timing optimization problems when these critical parts can be represented by Direct Acyclic Graphs DAGs We deal with di erent though related clock period problems under(More)