MINIMIZATION OF BOOLEAN FUNCTIONS CONTAINING ARBITRARY PARAMETERS.
TEXAS UNIV AUSTIN LABS FOR ELECTRONICS AND RELATED SCIENCE RESEARCH
Pagination or Media Count:
Design of flip-flop input networks, realization of incompletely specified state tables, design of asynchronous sequential networks, state assignment, and other logic design problems can lead to Boolean functions which contain arbitrary parameters. These parameters are a generalization of dont care conditions and may be assigned arbitrary values so as to minimize the cost of realizing the functions. A modification of the Quine-McCluskey procedure permits minimization of arbitrary parameter functions. A prime implicant list is developed in terms of the parameters and is used to derive a conditional prime implicant chart. Minimum solutions are obtained from this chart by a modified Petrick method or by branching. A second method for minimizing arbitrary-parameter functions treats a function of m parameters and n variables as an mn-variable function. The prime implicants of this function are derived by iterated consensus and then modified to obtain the conditional prime implicant chart. Both methods have been generalized to the multiple-output case. Author
- Numerical Mathematics