Constructing a circuit from a Boolean expression

  • Context: Engineering 
  • Thread starter Thread starter Jim01
  • Start date Start date
  • Tags Tags
    Circuit Expression
Click For Summary
SUMMARY

The discussion centers on constructing a circuit from the Boolean expression P v (~P ^ ~Q). The user correctly interprets the order of operations, starting from the outermost part of the expression, leading to the use of one OR gate, one AND gate, and two NOT gates. The user confirms their understanding by utilizing WolframAlpha to visualize the logic gates and truth table. Additionally, the identity a + a'b = a + b is mentioned as a simplification technique for Boolean expressions.

PREREQUISITES
  • Understanding of Boolean algebra concepts
  • Familiarity with logic gates (AND, OR, NOT)
  • Experience using WolframAlpha for logic circuit visualization
  • Knowledge of circuit diagram representation
NEXT STEPS
  • Research Boolean algebra simplification techniques
  • Learn how to construct logic circuits from complex Boolean expressions
  • Explore advanced features of WolframAlpha for circuit analysis
  • Study the practical applications of logic gates in digital electronics
USEFUL FOR

Students studying digital logic design, electronics enthusiasts, and anyone interested in understanding Boolean expressions and their circuit representations.

Jim01
Messages
36
Reaction score
0

Homework Statement



Construct a circuit from the Boolean equation:

Homework Equations



P v (~P ^ ~Q)


The Attempt at a Solution



According to the textbook, I am supposed to go from right to left, working on the outermost part of the expression to the innermost part. I read this as saying that even though the outermost part of the expression is on the far left, it is where I begin. Is this correct? I come up with one OR gate, one AND gate and two NOT gates. I tried to draw this out using the keyboard but it doesn't format properly and so is incomprehensible. Here is what I came up with:


P goes into a NOT and comes out ~P. ~P goes into AND and comes out ~P ^ Q.
P goes into OR and comes out P v (~P ^ ~Q)

Q goes into NOT and comes out ~Q. ~Q goes into AND and comes out ~P ^ Q.

~P ^ Q goes into OR and comes out P v (~P ^ ~Q)

Am I on the right track?
 
Physics news on Phys.org
Is there a way of adding gates to my thread? I attempted to cut and paste my Viso drawing but that didn't work. It is a lot easier to see the circuit rather than read and try to visualize it.
 
jegues said:
If you use the proper syntax, wolframalpha will provide with a picture of the logic gates as well as a truth table.

For example,

http://www.wolframalpha.com/input/?i=(x or y) and (x or !y)

Outstanding! Thank you for the information. After checking it I was right! I'm on the right track then. I was unsure whether or not I was interpreting the instructions correctly since most math has you doing everything inside the parenthesis first. It's counter-intuitive to do it last, so I was afraid I was misunderstanding.

Once again, thank you for your help.
 
Of course you can make it simpler using the identity

a + a'b = a + b
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
Replies
20
Views
4K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 3 ·
Replies
3
Views
4K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K