The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.08 - August (1977 vol.26)
pp: 757-764
V.T. Rhyne , Department of Electrical Engineering, Texas A&M University
ABSTRACT
The minimization of switching functions involving many variables is a difficult task. This paper presents a new minimization procedure that allows this process to be implemented with reduced computational effort. This procedure, designated as the directed-search algorithm, is applicable to both manual and computer-programmed minimization. The details of the algorithm are presented and illustrated by example. Comparative run-times between another minimization program and the directed-search algorithm, as implemented in Fortran, are also given.
INDEX TERMS
Minimization of Boolean functions, prime implicants, row dominance, search tree, switching algebra.
CITATION
V.T. Rhyne, P.S. Noe, M.H. Mckinney, U.W. Pooch, "A New Technique for the Fast Minimization of Switching Functions", IEEE Transactions on Computers, vol.26, no. 8, pp. 757-764, August 1977, doi:10.1109/TC.1977.1674913
32 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool