0
\$\begingroup\$

I have the Boolean expression

!B((!A.!C) + (!C.D) + (A.C.!D))

Can this be simplified using factorization or race hazard and redundancy, or is it in its simplest form?

\$\endgroup\$
2
\$\begingroup\$

With the basic gates it can not be simplified any further.

My solution was:

!B( (!CD) + !D(AC + !(A+C) )

When "exclusive or" is allowed:

!B( (!CD) + !D!(A xor C) )

Choose whatever suits you best.

By the way, race conditions are a problem of a logic circuits (glitch), but they can't be used for simplification.

\$\endgroup\$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.