Conference paper
YORKTOWN SILICON COMPILER.
R. Brayton, Norman Brenner, et al.
ISCAS 1984
Paper
Prime Implicants, Minimum Covers, and the Complexity of Logic Simplification
Abstract
We show that any Boolean function f which can be expressed in a sum-of-products form using m product terms can contain as many as 2m- 1 implicants but no more. Copyright © 1986 by The Institute of Electrical and Electronics Engineers, Inc.
Related
Conference paper
LAYOUT COMPILATION OF LINEAR TRANSISTOR ARRAYS.
Curt McMullen, Ralph H.J.M. Otten
ISCAS 1984
Conference paper
SYNTHESIS AND OPTIMIZATION OF MULTISTAGE LOGIC.
R. Brayton, Curt McMullen
ICCD 1983
Conference paper
MICROPROCESSOR DESIGN USING THE YORKTOWN SILICON COMPILER.
R. Brayton, Chih-Liang Chen, et al.
ICCD 1984