A Student Network for Collaboration and Sharing

Signup on

What’s Next For Electronic Devices. Have you heard of FPGAs? Find out now here. And as a bonus get your free guide to writing a successful resume. Just Signup now and it’s all yours free.


Can someone please show me how to represent this simple circuit using Boolean algebra? I'm new to this.

Thanks in advance!

Views: 27

Reply to This

Replies to This Discussion

Here are some basic rules to follow for Boolean Algebra.

You can find these and more here.

Commutative Law
(a) A + B = B + A
(b) A B = B A
Associate Law
(a) (A + B) + C = A + (B + C)
(b) (A B) C = A (B C)
Distributive Law
(a) A (B + C) = A B + A C
(b) A + (B C) = (A + B) (A + C)
Identity Law
(a) A + A = A
(b) A A = A
Redundance Law
(a) A + A B = A
(b) A (A + B) = A
Zero Property
(a) 0 + A = A
(b) 0 A = 0
(a) 1 + A = 1
(b) 1 A = A

Now that you understand the concepts of Boolean Algebra, here is how it works for your circuit.  The OR gates add and the AND gate multiplies.  Look at the output of the gates in the diagram below.  The bar over the letter B means NOT or INVERTED.

Now here is the truth table from your circuit.  You can follow the circuit to figure out what the output should be for any given input or you can use the Boolean expression for the circuit and substitute in your given values for A, B and C.




© 2022   Created by Jerome Trent.   Powered by

Report an Issue  |  Terms of Service