Skip to main content
Article thumbnail
Location of Repository

Sequential Optimisation without State Space Exploration

By et al. A Mehrotra

Abstract

We propose an algorithm for area optimisation of sequentialcircuits through redundancy removal. The algorithm finds compatible redundancies by implying values over nets in thecircuit. The potentially exponential cost of state space traversal is avoided and the redundancies found can all be removedat once. The optimised circuit is a safe delayed replacement of the original circuit. The algorithm computes a set of compati-ble sequential redundancies and simplifies the circuit by propagating them through the circuit. We demonstrate the efficacyof the algorithm even for large circuits through experimental results on benchmark circuits

Year: 1997
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.7727
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://research.microsoft.com/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.