0

Here is expression that we have to minimize with boolean algebra:

y = /A/B/C/D + /A/B/CD + /AB/CD + A/B/C/D + A/B/CD + A/BC/D + A/BCD.

I know little bit about that, please help!!!

The answer is /A/CD + /B/C + A/B

troelskn
  • 115,121
  • 27
  • 131
  • 155
user1090944
  • 445
  • 1
  • 8
  • 16

1 Answers1

0

You need to put those minterms on a Karnaugh Map and find the minimized form after grouping.

Mig
  • 768
  • 5
  • 11
  • There's an online Karnaugh Map tool [here](http://www.ee.calpoly.edu/media/uploads/resources/KarnaughExplorer_1.html). – Mig Mar 20 '12 at 04:01