Heuristic Minimization for Synchronous Relations

V. Singhal, Y. Watanabe and Robert K. Brayton

EECS Department
University of California, Berkeley
Technical Report No. UCB/ERL M93/30
April 1993

http://www2.eecs.berkeley.edu/Pubs/TechRpts/1993/ERL-93-30.pdf

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.

BibTeX citation:

@techreport{Singhal:M93/30,
    Author = {Singhal, V. and Watanabe, Y. and Brayton, Robert K.},
    Title = {Heuristic Minimization for Synchronous Relations},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {1993},
    Month = {Apr},
    URL = {http://www2.eecs.berkeley.edu/Pubs/TechRpts/1993/2326.html},
    Number = {UCB/ERL M93/30},
    Abstract = {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.}
}

EndNote citation:

%0 Report
%A Singhal, V.
%A Watanabe, Y.
%A Brayton, Robert K.
%T Heuristic Minimization for Synchronous Relations
%I EECS Department, University of California, Berkeley
%D 1993
%@ UCB/ERL M93/30
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/1993/2326.html
%F Singhal:M93/30