Directed search minimization of multiple-output networks
Date
1984
Authors
Serra, Micaela
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Given a switching function, a two-level sum-of-products expression is often a useful representation for it. A definition for a minimal cost of realization for a circuit can be agreed upon and techniques exist to produce a minimal or quasi-minimal expression.
Often several switching functions of the same input variables have to be realized in a network. Most of the time the· simultaneous synthesis of all the outputs yields more economical results than their separate designs, since the sharing of gates can reduce costs considerably. While there are numerous techniques to minimize single-output functions, few are feasible for extension to multiple-output problems of any size.
A new method for single functions was introduced by Rhyne, Noe, McKinney and Pooch in 1976,-called DSA, for Directed Search Algorithm. It has the considerable advantage of not needing to generate all possible prime implicants of a function before being able to choose the essential ones for the coverage.