How is de'morgans principle applied in karnaugh mapping?

AI Thread Summary
De Morgan's Law is essential in Boolean algebra for rearranging expressions, particularly when solving for products of sums. It facilitates the conversion of a Boolean expression into a NAND implementation by allowing for the double-complementing of the expression. When using a Karnaugh map (K-map) to group 1's, applying De Morgan's Law helps in deriving the resulting function efficiently. This understanding clarifies its practical application in simplifying Boolean expressions and designing digital circuits.
ForgottenPain
Messages
4
Reaction score
0
i been trying to understand this and basically the answer i got was it makes it easier to solve for product of sums...is this close to being correct? could you explain how it is applied. thank you.
 
Technology news on Phys.org
De Morgan's Law is used in Boolean algebra for rearranging Boolean expressions. If you group 1's in a K-map and write the resulting function, double-complementing the expression and applying De Morgan's gives you a NAND implementation of the function.
 
kbaumen said:
De Morgan's Law is used in Boolean algebra for rearranging Boolean expressions. If you group 1's in a K-map and write the resulting function, double-complementing the expression and applying De Morgan's gives you a NAND implementation of the function.

Thank you for answering the question, i think i get it now.
 
Thread 'Is this public key encryption?'
I've tried to intuit public key encryption but never quite managed. But this seems to wrap it up in a bow. This seems to be a very elegant way of transmitting a message publicly that only the sender and receiver can decipher. Is this how PKE works? No, it cant be. In the above case, the requester knows the target's "secret" key - because they have his ID, and therefore knows his birthdate.

Similar threads

Back
Top