skip to main content

Title: Minimal covering problem and PLA minimization

Solving the minimal covering problem by an implicit enumeration method is discussed. The implicit enumeration method in this paper is a modification of the Quine-McCluskey method tailored to computer processing and also its extension, utilizing some new properties of the minimal covering problem for speedup. A heuristic algorithm is also presented to solve large-scale problems. Its application to the minimization of programmable logic arrays (i.e., PLAs) is shown as an example. Computational experiences are presented to confirm the improvements by the implicit enumeration method discussed.
Authors:
;
Publication Date:
OSTI Identifier:
7231312
Resource Type:
Journal Article
Resource Relation:
Journal Name: Int. J. Comput. Inf. Sci.; (United States); Journal Volume: 14:6
Research Org:
Univ. of Illinois, Urbana, IL
Country of Publication:
United States
Language:
English
Subject:
99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; PARALLEL PROCESSING; ALGORITHMS; EFFICIENCY; ARRAY PROCESSORS; ITERATIVE METHODS; LOGIC CIRCUITS; MATHEMATICAL LOGIC; ELECTRONIC CIRCUITS; PROGRAMMING 990200* -- Mathematics & Computers