Add to ORKGInternational audienceIn this paper, we address the following problem: given a synchronous digital circuit, is it possible to construct a new circuit computing the same function as the original one but using a minimal number of registers? The construction of such a circuit can be done in polynomial time and is based on a result of Orlin for one periodic bi-infinite graphs showing that the cardinality maximum flow is equal to the size of a minimum cut. The idea is to view such a graph as the unfolding of the dependences in a digital circuit
Abstract In this paper we present a polynomial-time algorithm for retiming synchronous circuits with...
In this paper, we propose an approach for minimizing path length from primary inputs to primary outp...
The topic of this thesis are methods for power reduction in digital circuits by reducing average swi...
International audienceIn this paper, we address the following problem: given a synchronous digital c...
International audienceIn this paper, we address the following problem: given a synchronous digital c...
International audienceIn this paper, we address the following problem: given a synchronous digital c...
Abstract: This paper presents a retiming and resynthesis technique for cycle-time minimization of se...
Given a Boolean circuit C, we wish to convert it to a circuit C′ that computes the same function as ...
In this report, we study more deeply the retiming techniques that are useful both for automatic para...
(eng) In this report, we study more deeply the retiming techniques that are useful both for automati...
Redundant operators such as adders and multipliers increase performance (timing and area) of high co...
We consider a system of uniform recurrence equations of dimension one. We show how the computation c...
Abstract — This paper is devoted to a low-complexity algorithm for retiming circuits without cycles,...
The paper presents an application of a constructive learning algorithm to optimization of circuits. ...
In this paper we present a polynomial-time algorithm for retiming synchronous circuits with edge-tri...
Abstract In this paper we present a polynomial-time algorithm for retiming synchronous circuits with...
In this paper, we propose an approach for minimizing path length from primary inputs to primary outp...
The topic of this thesis are methods for power reduction in digital circuits by reducing average swi...
International audienceIn this paper, we address the following problem: given a synchronous digital c...
International audienceIn this paper, we address the following problem: given a synchronous digital c...
International audienceIn this paper, we address the following problem: given a synchronous digital c...
Abstract: This paper presents a retiming and resynthesis technique for cycle-time minimization of se...
Given a Boolean circuit C, we wish to convert it to a circuit C′ that computes the same function as ...
In this report, we study more deeply the retiming techniques that are useful both for automatic para...
(eng) In this report, we study more deeply the retiming techniques that are useful both for automati...
Redundant operators such as adders and multipliers increase performance (timing and area) of high co...
We consider a system of uniform recurrence equations of dimension one. We show how the computation c...
Abstract — This paper is devoted to a low-complexity algorithm for retiming circuits without cycles,...
The paper presents an application of a constructive learning algorithm to optimization of circuits. ...
In this paper we present a polynomial-time algorithm for retiming synchronous circuits with edge-tri...
Abstract In this paper we present a polynomial-time algorithm for retiming synchronous circuits with...
In this paper, we propose an approach for minimizing path length from primary inputs to primary outp...
The topic of this thesis are methods for power reduction in digital circuits by reducing average swi...