# Thread: help with simplifying boolean expression

1. ## help with simplifying boolean expression

I want to simplify this boolean expression
Code:
(!D^!C^!B^A)v(!D^!C^B^!A)v(!D^!C^B^A)v(!D^C^!B^A)v(!D^C^B^A)v(D^!C^B^A)v(D^C^!B^A)
and I get
Code:
( A^!D^!B ) v ( A^!D^C )  v (!B^A^C)   v   (!C^B^!D)  v (!C^B^A)
I am pretty sure it can be further simplified, does anyone see a way?

And the order of the variables has to be D, C, B, A, where A is the least significant bit.

2. ## Re: help with simplifying boolean expression

Judging from the Karnaugh map, you can't get fewer than 5 conjunctions of literals. It seems that the only way to make the formula shorter is to consider not only DNFs.