Speedup of Minimization Programs
Original Publication Date: 1982-Aug-01
Included in the Prior Art Database: 2005-Feb-10
The problem of finding economical covers for PLAs (Programmable Logic Arrays) is important for LSI and VLSI (J. Paul Roth, Computer Logic, Testing and Verification, Computer Science Press, Rockville, Maryland, 1980.). Minimization procedures and their approximations are hampered by long running time and enormous storage requirements. A novel method of adaptation of the D-algorithm (J. Paul Roth, Computer Logic, Testing and Verification, Computer Science Press, Rockville, Maryland, 1980.) to this two-level minimization problem is described herein. An essential step in one of the best of the extant approximations, SHRINK, is that of COFACE, that of changing the coordinate of a cube in the extant cover from a 1 or 0 to an x.