Tuesday, August 18, 2009

One of best examples of implementing a circuit design using Karnaugh map (K-Map) simplification is a full adder.

Full adder is just a combination of two half adders where the second half adder has an input variable that serves as the carry in of the lowest significant carry bit. This can be derived by the use of truth tables. Further simplification can be done by apply boolean algebra theorems.

Special emphasis was given to Exclusive OR gate (XOR)to simplify the logic operation and plotting of the circuit in the experiment below.

Share it

About

Select Category

Followers

Subscribe To Site

Disclaimer

The posts on this blog are provided "as is" with no warranties, and confer no rights. The opinions expressed are my own and do not represent my employers' view in any way. Nothing posted here should be considered official or sanctioned by my employer or any other organization I'm affiliated with.