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
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started
Intelligent Information And Database Systems 12th Asian Conference ACIIDS 2020 Phuket Thailand March 23 26 2020 Proceedings
Authors: Pawel Sitek ,Marcin Pietranik ,Marek Krotkiewicz ,Chutimet Srinilta
1st Edition
9811533792, 978-9811533792
