Loading...
Please wait, while we are loading the content...
Similar Documents
Recurrence Equations and the Optimization of Synchronous Logic Circuits. (1992)
| Content Provider | CiteSeerX |
|---|---|
| Author | Damiani, Maurizio Micheli, Giovanni De |
| Description | In this paper we present a formulation for the problem of optimizing synchronous logic across register boundaries. We describe the degrees of freedom (i.e. the don't care conditions) of an embedded subnetwork by means of sets of execution traces, described implicitly by Synchronous Recurrence Equations. The optimization problem reduces to that of finding minimum-cost solutions to such equations. An exact solution algorithm for this problem is presented, along with approximations that improve its computational efficiency. Eventually, we demonstrate the feasibility and effectiveness of the approach on synchronous benchmark circuits. |
| File Format | |
| Language | English |
| Publisher Date | 1992-01-01 |
| Publisher Institution | In Proc. of the IEEE/ACM Design Automation Conf |
| Access Restriction | Open |
| Subject Keyword | Execution Trace Synchronous Benchmark Circuit Recurrence Equation Optimization Problem Computational Efficiency Synchronous Logic Circuit Minimum-cost Solution Exact Solution Algorithm Register Boundary Synchronous Recurrence Equation Care Condition |
| Content Type | Text |
| Resource Type | Article |
