Generation of Prime Implicants from Subfunctions and a Unifying Approach to the Covering Problem

@article{Reusch1975GenerationOP,
  title={Generation of Prime Implicants from Subfunctions and a Unifying Approach to the Covering Problem},
  author={B. Reusch},
  journal={IEEE Transactions on Computers},
  year={1975},
  volume={C-24},
  pages={924-930}
}
  • B. Reusch
  • Published 1975
  • Mathematics, Computer Science
  • IEEE Transactions on Computers
A new method for computing the prime implicants of a Boolean function from an arbitrary sum-of-products form is given. It depends on the observation that the prime implicants of a Boolean function can be obtained from the prime implicants of its subfunctions with respect to a fixed but arbitrary variable. The problem of obtaining all irredundant sums from the list of all prime implicants and an arbitrary list of implicants representing the function is solved. The irredundant sums are in one-to… Expand
40 Citations
Polynomial-time algorithms for generation of prime implicants
  • 55
A Method to Simplify a Boolean Function into a Near Minimal Sum-of-Products for Programmable Logic Arrays
  • 28
Worst and Best Irredundant Sum-of-Products Expressions
  • 29
  • PDF
Anatomy of Boolean-function simplification
  • 2
McBOOLE: A New Procedure for Exact Logic Minimization
  • 85
On the Walsh-Hadamard Transform and Prime Implicant Extraction
  • P. Besslich
  • Mathematics
  • IEEE Transactions on Electromagnetic Compatibility
  • 1978
  • 9
Irredundant Normal Forms and Minimal Dependence Sets of a Boolean Function
  • 48
...
1
2
3
4
...

References

SHOWING 1-10 OF 14 REFERENCES
Generalization of Consensus Theory and Application to the Minimization of Boolean Functions
  • P. Tison
  • Computer Science
  • IEEE Trans. Electron. Comput.
  • 1967
  • 148
A New Algorithm for Generating Prime Implicants
  • 162
Minimization of Boolean Functions
  • N. Biswas
  • Mathematics, Computer Science
  • IEEE Transactions on Computers
  • 1971
  • 311
Determination of the Irredundant Normal Forms of a Truth Function by Iterated Consensus of the Prime Implicants
  • T. H. Mott
  • Mathematics, Computer Science
  • IRE Trans. Electron. Comput.
  • 1960
  • 41
Computing Irredundant Normal Forms from Abbreviated Presence Functions
  • 14
  • Highly Influential
Generation of Prime Implicants by Direct Multiplication
  • 7
Irredundant Disjunctive and Conjunctive Forms of a Boolean Function
  • 61
  • Highly Influential
Generation of prime' li cants by direct multiplication,
  • IEEE Trans. Comput. (Corresp.),
  • 1971
A direct determination of the irredundant forms of a Boolean function from the set of prime implicants
  • Air Force Cambridge Res. Center
  • 1956
...
1
2
...