Representation and Symbolic Manipulation of Linearly Inductive Boolean Functions (1993)
| Venue: | In Proceedings of the IEEE International Conference on Computer-Aided Design. IEEE Computer |
| Citations: | 8 - 1 self |
BibTeX
@INPROCEEDINGS{Gupta93representationand,
author = {Aarti Gupta and Allan L. Fisher},
title = {Representation and Symbolic Manipulation of Linearly Inductive Boolean Functions},
booktitle = {In Proceedings of the IEEE International Conference on Computer-Aided Design. IEEE Computer},
year = {1993},
pages = {192--199},
publisher = {Society Press}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We consider a class of practically useful Boolean functions, called Linearly Inductive Functions (LIFs), and present a canonical representation as well as algorithms for their automatic symbolic manipulation. LIFs can be used to capture structural induction in parameterized circuit descriptions, whereby our LIF representation provides a fixed-sized representation for all size instances of a circuit. Furthermore, since LIFs can naturally capture the temporal induction inherent in sequential system descriptions, our representation also provides a canonical form for sequential functions. This allows for a wide range of applications of symbolic LIF manipulation in the verification and synthesis of digital systems. We also present practical results from a preliminary implementation of a general purpose LIF package. 1 Introduction Symbolic manipulation of Boolean functions has found numerous applications in the area of VLSI design automation [5]. These applications are greatly facilitated ...
