简体   繁体   中英

implement boolean function using half adders and not gates

I received this question from my lecturer and i am stuck.

F=ca+b'a'

implement this function using no more than 3 HA (half adder) and 3 NOT gates.

i succeed to get a'b' and ac and still had 1 HA and 1 NOT gate.

I have difficulties creating the OR gate for those two.

Use De Morgan's law and convert the expression in the following form :- ((ca)'(b'a')')' . Assuming that complements of the Literals are available. The actual implementation of the circuit.

The technical post webpages of this site follow the CC BY-SA 4.0 protocol. If you need to reprint, please indicate the site URL or the original address.Any question please contact:yoyou2525@163.com.

 
粤ICP备18138465号  © 2020-2024 STACKOOM.COM