A Method for Generating Prime Implicants of a Boolean Expression

@article{Hwa1974AMF,
  title={A Method for Generating Prime Implicants of a Boolean Expression},
  author={H. R. Hwa},
  journal={IEEE Transactions on Computers},
  year={1974},
  volume={C-23},
  pages={637-641}
}
  • H. R. Hwa
  • Published 1974
  • Mathematics, Computer Science
  • IEEE Transactions on Computers
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. 
21 Citations
On Simplification of Boolean Functions
  • 4
An algorithm for identifying and selecting the primed implicants of a multiple-output Boolean function
  • S. Perkins, T. Rhyne
  • Mathematics, Computer Science
  • IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.
  • 1988
  • 6
Consequence Finding Algorithms
  • 124
An Incremental Method for Generating Prime Implicants/Impicates
  • 165
  • PDF
A Local Selection Algorithm for Switching Function Minimization
  • G. Caruso
  • Mathematics, Computer Science
  • IEEE Transactions on Computers
  • 1984
  • 15
Switching-algebraic algorithmic derivation of candidate keys in relational databases
  • A. Rushdi, M. Rushdi
  • Mathematics
  • 2016 International Conference on Emerging Trends in Communication Technologies (ETCT)
  • 2016
  • 3
On implicate discovery and query optimization
  • 6
...
1
2
3
...

References

SHOWING 1-7 OF 7 REFERENCES
Minimization of Boolean functions
  • 875
Minimization Over Boolean Graphs
  • 278
The map method for synthesis of combinational logic circuits
  • M. Karnaugh
  • Mathematics
  • Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics
  • 1953
  • 581
  • PDF
On Cores and Prime Implicants of Truth Functions
  • 197
A chart method for simplifying truth functions
  • 117
A Way to Simplify Truth Functions
  • 576