论文信息 - A Method for Generating Prime Implicants of a Boolean Expression

A Method for Generating Prime Implicants of a Boolean Expression

This correspondence gives a method which generates prime implicants in a simple one-pass procedure. Starting from the lowest (or highest) points in the function lattice, it generates successive subcubes in a unique sequence. Each subcube is formed only once.

H. R. Hwa | H. R. Hwa

[1] M. Karnaugh. The map method for synthesis of combinational logic circuits , 1953, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[2] E. W. Veitch,et al. A chart method for simplifying truth functions , 1952, ACM '52.

[3] W. Quine. On Cores and Prime Implicants of Truth Functions , 1959 .

[4] E. McCluskey. Minimization of Boolean functions , 1956 .

[5] Willard Van Orman Quine,et al. A Way to Simplify Truth Functions , 1955 .

[6] Alan B. Marcovitz,et al. An Improved Algorithm for the Simplification of Switching Functions Using Unique Identifiers on a Karnaugh Map , 1969, IEEE Transactions on Computers.

[7] Richard M. Karp,et al. Minimization Over Boolean Graphs , 1962, IBM J. Res. Dev..