• Support PF! Buy your school textbooks, materials and every day products Here!

Boolean Algebra simplification question

  • Thread starter delta59
  • Start date
  • #1
16
0

Homework Statement



Lets say I have 4 inputs x1 x0 y1 y0

if I have a sum-of-products say: x1x0'y1y0'+x0y1'y0

can I simplify it to x0y1'y0 by pulling out x0y1'y0 giving x0y1'y0(y0'+1) knowing that 1+y0 is 1 and 1*signalz is signalz.

Am I right in thinking this, I really dont want to do the truth table for this bad boy

thanks
 

Answers and Replies

  • #2
43
0
Hi delta59,

It's pretty straightforward to simplify short Boolean expressions having 2 or 3 variables using Boolean algebra (aka the switching algebra theorems). But when you get into 4 variables or higher, or when you're evaluating lengthy expressions, it's easier to use a Karnaugh Map.

Here are some googled examples of K-maps for expressions of 4 variables.

Try doing the K-map for your expression: [itex]x_1 \cdot x_0^' \cdot y_1 \cdot y_0^' + x_0 \cdot y_1^' \cdot y_0[/itex]. Does it simplify any further?
 
Last edited:

Related Threads for: Boolean Algebra simplification question

Replies
3
Views
1K
  • Last Post
Replies
2
Views
5K
Replies
15
Views
27K
Replies
9
Views
29K
Replies
7
Views
3K
  • Last Post
Replies
4
Views
2K
  • Last Post
Replies
2
Views
933
  • Last Post
Replies
13
Views
3K
Top