Question: Implement the boolean function f=(a+~b+c)*b using only NOT and 2-input NAND gates By using Demorgan's LAW I can get: f=(~a*~b)+(~c*~b) Just by looking at the

Implement the boolean function f=(a+~b+c)*b using only NOT and 2-input NAND gates

By using Demorgan's LAW I can get: f=(~a*~b)+(~c*~b)

Just by looking at the expresion and drawing out the cirucuit i know that I can simplify it to: f=(a+c)*b

but im not too sure how to do this with boolean algebra, also is f=(a+c)*b the best reduction

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!