Title :
Minimization of symbolic relations
Author :
Lin, B. ; Somenzi, F.
Author_Institution :
California Univ., Berkeley, CA, USA
Abstract :
The problem of minimizing symbolic relations is addressed. The relevance of this problem in the field of optimal encoding is shown by examples. A binate covering formulation of the optimization problems involved is given, for which several algorithms are available. A novel method is proposed which is based on binary decision diagrams (BDDs) and the authors show how the covering problem can be solved in linear time in that case.<>
Keywords :
logic design; minimisation of switching nets; symbol manipulation; binary decision diagrams; binate covering formulation; covering problem; minimisation; optimal encoding; symbolic relations; Automata; Boolean functions; Contracts; Data structures; Encoding; Equations; Minimization; Network synthesis; Programmable logic arrays; Time factors;
Conference_Titel :
Computer-Aided Design, 1990. ICCAD-90. Digest of Technical Papers., 1990 IEEE International Conference on
Conference_Location :
Santa Clara, CA, USA
Print_ISBN :
0-8186-2055-2
DOI :
10.1109/ICCAD.1990.129848
