Boolean Algebra Simplification

In summary, Rossy tried to simplify the homework statement but was not able to get to the correct result. He found that if he took two of the terms and simplified them, it resulted in the correct answer.
  • #1
Rossy
8
1

Homework Statement


[/B]
How to simplife it? I would like to see a process of simplification.

Y = A'B'C'D + A'B'CD + A'BC'D + A'BCD' + A'BCD + AB'C'D + AB'CD + ABC'D'

The ' denotes a bar over the previous letter.My second question is:

Y = BC + AB'D = (uploaded picture)

Y = A'D + B'D + A'BC + ABC'D' = ??

Homework Equations



Simplification Rules

The Attempt at a Solution



I tried it but can't get to the correct result.

The correct result should be (made through Karnaugh map):

Y = A'D + B'D + A'BC + ABC'D'Thank you for any advices and I'm sorry for my english.
 
Physics news on Phys.org
  • #2
uploaded pic
 

Attachments

  • asd.PNG
    asd.PNG
    2.6 KB · Views: 447
  • #3
Rossy said:
How to simplife it? I would like to see a process of simplification.

Y = A'B'C'D + A'B'CD + A'BC'D + A'BCD' + A'BCD + AB'C'D + AB'CD + ABC'D'
Hi Rossy. :welcome:

Break it down into manageable parts, e.g., look at "taking out a common factor"

A'B'C'D + A'B'CD = A'B'D(C' + C) = ?

Can you complete this simplification?
 
  • #4
Hi NascantOxygen,

it's A'B'D

Could you look at the image I uploaded, it's my attempt.. as you can see I can't get to the right solution.
 

Attachments

  • 17821204_1861158663910241_608032167_n.jpg
    17821204_1861158663910241_608032167_n.jpg
    41.8 KB · Views: 541
  • #5
The most obvious mistake is that you have ignored one term in the given expression, viz.,

+ A'BC'D +
 
  • #6
In Boolean algebra you may encounter an expression such as (C + C' D) and wish to simplify it. One way is to AND the C term with something having the value TRUE, and I'll choose (1 + D) which has the value 1 because anything ORed with TRUE is TRUE.

C(1 + D) + C' D

= C.1 + CD + C'D

= C + D(C + C')

= C + D
 
  • #7
So if I take this expression A'BC'D + ABC'D' I can simplyfy it like this BC'(A + D)(A' + D') but how do I continue?
 
  • #8
Rossy said:
So if I take this expression A'BC'D + ABC'D' I can simplyfy it like this BC'(A + D)(A' + D') but how do I continue?
You can't go further with that. You have extracted the factor BC' and that's it.
 
  • #9
So you can't get from this expression

Y = A'B'C'D + A'B'CD + A'BC'D + A'BCD' + A'BCD + AB'C'D + AB'CD + ABC'D'

to this expression by Boolean Algebra

Y = A'D + B'D + A'BC + ABC'D'
 
  • #10
Rossy said:
So you can't get from this expression

Y = A'B'C'D + A'B'CD + A'BC'D + A'BCD' + A'BCD + AB'C'D + AB'CD + ABC'D'

to this expression by Boolean Algebra

Y = A'D + B'D + A'BC + ABC'D'
Yes, it can be simplified to that.
 
  • #11
Can't get further...
 

Attachments

  • 17909202_1864590843567023_391484843_n.jpg
    17909202_1864590843567023_391484843_n.jpg
    11.7 KB · Views: 562
  • #12
Take two of these terms (shown in green) and simplify them using the help shown in post #6

A'BC + B'D + A'BC'D + ABC'D'
 
  • #13
Is it right?
 

Attachments

  • 17918817_1865639636795477_1111429185_n.jpg
    17918817_1865639636795477_1111429185_n.jpg
    36.2 KB · Views: 1,060
  • #14
That is right.
 
  • #15
Thank you for your time and patience with me! :) The problem is solved.
 
  • Like
Likes NascentOxygen

What is Boolean Algebra Simplification?

Boolean Algebra Simplification is a process of simplifying logical expressions using the rules and properties of Boolean algebra. It involves reducing complicated expressions into simpler forms, making them easier to understand and analyze.

Why is Boolean Algebra Simplification important?

Boolean Algebra Simplification is important because it allows for the reduction of complex logical expressions, making them more manageable and easier to work with. This simplification process is essential in circuit design, computer programming, and other fields that heavily rely on logical operations.

What are the basic rules of Boolean Algebra Simplification?

The basic rules of Boolean Algebra Simplification include the commutative law, associative law, distributive law, identity law, complement law, and De Morgan's law. These rules are used to manipulate logical expressions and simplify them into a more concise form.

How do I simplify a logical expression using Boolean Algebra?

To simplify a logical expression using Boolean Algebra, you can follow these steps: 1) Use the commutative and associative laws to rearrange the terms in the expression. 2) Apply the distributive law to expand any parentheses. 3) Use the identity and complement laws to eliminate any redundant terms. 4) Use De Morgan's law to simplify expressions with negated terms. By following these steps, you can simplify the expression into its most reduced form.

Are there any limitations to Boolean Algebra Simplification?

Yes, there are limitations to Boolean Algebra Simplification. This method works best for simplifying expressions with a small number of variables. As the number of variables increases, the simplification process becomes more complicated and can result in lengthy expressions. Additionally, Boolean Algebra Simplification cannot be used to solve all logical problems. It is only applicable to expressions that can be represented using Boolean logic.

Similar threads

  • Engineering and Comp Sci Homework Help
Replies
2
Views
1K
  • Engineering and Comp Sci Homework Help
Replies
1
Views
1K
  • Engineering and Comp Sci Homework Help
Replies
2
Views
1K
  • Engineering and Comp Sci Homework Help
Replies
5
Views
1K
  • Engineering and Comp Sci Homework Help
Replies
6
Views
4K
  • Engineering and Comp Sci Homework Help
Replies
2
Views
4K
  • Precalculus Mathematics Homework Help
Replies
1
Views
1K
  • Engineering and Comp Sci Homework Help
Replies
9
Views
4K
  • Engineering and Comp Sci Homework Help
Replies
4
Views
2K
  • Engineering and Comp Sci Homework Help
Replies
4
Views
4K
Back
Top