Minimal covering problem and PLA minimization

Journal Article · Sun Dec 01 00:00:00 EST 1985 · Int. J. Comput. Inf. Sci.; (United States)

DOI:https://doi.org/10.1007/BF00991179· OSTI ID:7231312

Young, M H; Muroga, S

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.

• Research Organization: Univ. of Illinois, Urbana, IL
• OSTI ID: 7231312
• Journal Information: Int. J. Comput. Inf. Sci.; (United States), Vol. 14:6
• Country of Publication: United States
• Language: English

Related Subjects

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