Optimization for synchronous systems is an important problem in logic synthesis. However,, the full utilization of don't care information for sequential synthesis is far from being solved. Synchronous boolean relations can represent sequential don't care information up to in synchronous systems. This allows greater flexibility in expressing don't care information than ordinary boolean relations relating input and output space. Synchronous relations can be used to specify sequential designs both at the finite state machine level as well as at the level of combinational elements and latches In this report we also show that the synchronous relation formulation can also be used to find a minimal sum-of-products form which implements a function compatible with an arbitrary set of boolean relations. The main objective of this report is to present a heuristic approach to find a minimal implementation for a given synchronous relation.
Title
Heuristic Minimization for Synchronous Relations
Published
1993-01-01
Full Collection Name
Electrical Engineering & Computer Sciences Technical Reports
Other Identifiers
ERL-93-30
Type
Text
Extent
28 p
Archive
The Engineering Library
Usage Statement
Researchers may make free and open use of the UC Berkeley Library’s digitized public domain materials. However, some materials in our online collections may be protected by U.S. copyright law (Title 17, U.S.C.). Use or reproduction of materials protected by copyright beyond that allowed by fair use (Title 17, U.S.C. § 107) requires permission from the copyright owners. The use or reproduction of some materials may also be restricted by terms of University of California gift or purchase agreements, privacy and publicity rights, or trademark law. Responsibility for determining rights status and permissibility of any use or reproduction rests exclusively with the researcher. To learn more or make inquiries, please see our permissions policies (https://www.lib.berkeley.edu/about/permissions-policies).
