1 Bit Full Adder using Multiplexer
Last Updated :
10 Sep, 2021
Prerequisite : Multiplexer, Full adder
Introduction :
Multiplexer and Full adder are two different Digital Logic circuits. The Multiplexer is a digital switch. It allows digital information from several sources to be routed onto a single output line. On the other hand, the Full adder circuit performs the addition of three bits and produces the Sum and Carry as an output. Our aim is to build the Full Adder circuit using Multiplexers rather than the usual basic logic gates.
Step 1 - To implement a full adder using MUX, we need to first create the truth table of the full adder.
- Truth Table for Full Adder -
Inputs | Outputs |
A | B | C-In | Sum | C-Out |
0 | 0 | 0 | 0 | 0 |
0 | 0 | 1 | 1 | 0 |
0 | 1 | 0 | 1 | 0 |
0 | 1 | 1 | 0 | 1 |
1 | 0 | 0 | 1 | 0 |
1 | 0 | 1 | 0 | 1 |
1 | 1 | 0 | 0 | 1 |
1 | 1 | 1 | 1 | 1 |
Step 2 - We need to find out the minterms for the Sum and Carry output from the truth table.
For Sum - f ( A, B, C-In) = Σ ( 1,2,4,7 )
For Carry: - f ( A, B, C-In) = Σ ( 3,5,6,7 )
Step 3 - Now we need the equations for Sum and Carry. To find that we will create the Design Table for Sum and Carry output.
NOTE : To understand the next parts it is recommended to go through with Implementation of SOP function using multiplexer
Design Table for Sum Output :
Design Table for Sum
For Sum the minterms (1,2,4,7 ), outputs are HIGH so they are circled in the design table.
- For D0 only 4 is HIGH which corresponds to A in table, So the D0 input for the MUX(M0) will be A.
- The same rule follows for the other inputs - D1=A', D2=A', D3=A.
Design Table for Carry Output :
Design Table for Carry
For Carry ( 3, 5, 6, 7 ), outputs are HIGH, so they are circled in the design table, just like the design table for sum.
- Here for the D0 input 0 and 4, both are LOW, so input to the MUX will be 0
- For D3 both 3 and 7 are HIGH, so the input to MUX will be 1.
- D1 and D2 will follow the previous rule and will be D1=A and D2=A
Now we have all the input information to the MUX, so we can design the logic circuit.
Logic Circuit :
Explanation :
Inputs -
The input to the M0 MUX is as per the design table of SUM i.e. D0 = A, D1 = A', D2 = A', D3 = A
The input to the M1 MUX is as per the design table of CARRY i.e. D0 = 0, D1 = A, D2 = A, D3 = 1
The selection line of both M0 and M1 are connected with the B & Cin input.
Outputs -
The output of M0 MUX will have the SUM as output and M1 MUX will have CARRY as output.
Applications:
This circuit is a Full adder circuit, so will have all the applications that of a full adder circuit. Lists below -
- The basic building block of on-chip libraries.
- In processors and other kinds of computing devices adders are used in the arithmetic logic unit.
Similar Reads
Full Adder Using Demultiplexer
Full Adder is a combinatorial circuit that computes the sum and carries out two input bits and an input carry. So it has three inputs - the two bits A and B, and the input carry Cin, and two outputs - sum S and output carry Cout. Demultiplexer is a combinational circuit which has 1 input, n selectio
2 min read
Solving multiplexer circuit
The procedure for solving and finding the output function of the given multiplexer is quite simple. Firstly we will discuss the procedure and then illustrate it with examples. Procedure: Firstly truth table is constructed for the given multiplexer. Select lines in multiplexer are considered as input
2 min read
Multiplexer Design using Verilog HDL
The Verilog Hardware Description Language is an important language in the world of digital design where electronic systems are modeled using it. It provides a way of describing and simulating both the behavior and structure of digital circuits; hence, it is an important tool for engineers in hardwar
7 min read
Implementation of Full Adder using NOR Gates
In Digital Logic Circuit, Full Adder is a Digital Logic Circuit that can add three inputs and give two outputs. The three inputs A, B, and input carry as Cin. Cout is represented as output carry and Sum is represented as output. We can say Cout is called the majority 1âs detector, when more than one
8 min read
Implementation of Full Adder Using Half Adders
Implementation of full adder from half adders is possible because the half adders add two 1-bit inputs in full adder we add three 1-bit inputs. To obtain a full adder from a half adder we take the first two inputs and add them and use the sum and carry outputs and the third input to get the final su
5 min read
Implementation of Full Adder using NAND Gates
In Digital Logic Circuit, Full Adder is a Digital Logic Circuit that can add three inputs and give two outputs. The three inputs such as A, B, and input carry as Cin. The output carry is represented as Cout and the normal output is represented as S, Sum. The Cout is also known as the majority 1âs de
9 min read
Full Adder using Verilog HDL
A full adder is a digital circuit in Verilog HDL that adds three binary numbers. It has two inputs for the numbers to be added, A and B, and one Carry-In input, Cin. The outputs are Sum, S, and Carry-Out, Cout. A full adder has been implemented using Verilog as shown in the previously shared code sn
5 min read
Multiplexers in Digital Logic
In this article we will go through the multiplexer, we will first define what is a multiplexer then we will go through its types which are 2x1 and 4x1, then we will go through the Implementation of the 2x1 mux and higher mux with lower order mux, at last we will conclude our article with some applic
10 min read
Full Adder in Digital Logic
Full Adder is a combinational circuit that adds three inputs and produces two outputs. The first two inputs are A and B and the third input is an input carry as C-IN. The output carry is designated as C-OUT and the normal output is designated as S which is SUM. The C-OUT is also known as the majorit
5 min read
Python program to implement Full Adder
Prerequisite : Full Adder in Digital LogicGiven three inputs of Full Adder A, B,C-IN. The task is to implement the Full Adder circuit and Print output i.e sum and C-Out of three inputs.Full Adder : A Full Adder is a logical circuit that performs an addition operation on three one-bit binary numbers.
2 min read