Design of a one-bit full-adder: 1). Draw the truth table (ABCin=000~111) of a one-bit full adder. 2). Based on truth table, draw the Karnaugh maps for Cout and Sum separately, find the simplified Boolean equations for Cout and Sum. 3). Sketch the gate level design of the circuit based on the Boolean equations you obtained. 4). Using Shannon’s expansion theorem, expand both Cout and Sum with respect to Cin. List your equations of Shannon expansion for Cout and Sum. Based on Shannon’s expansion, implement the full adder (Both Cout and Sum) with 2-to-1 MUX (using Cin as selection bit). Sketch your MUX-based design.

Design of a one-bit full-adder: 1). Draw the truth table (ABCin=000~111) of a one-bit full adder. 2). Based on truth table, draw the Karnaugh maps for Cout and Sum separately, find the simplified Boolean equations for Cout and Sum. 3). Sketch the gate level design of the circuit based on the Boolean equations you obtained. 4). Using Shannon’s expansion theorem, expand both Cout and Sum with respect to Cin. List your equations of Shannon expansion for Cout and Sum. Based on Shannon’s expansion, implement the full adder (Both Cout and Sum) with 2-to-1 MUX (using Cin as selection bit). Sketch your MUX-based design.