Scribd
Upload
18 views

DlD 04

Uploaded by

Omlan Marufa
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
18 views

DlD 04

Uploaded by

Omlan Marufa
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

United International

University
Computer Science & Engineering

Course Code: CSE1326 Group: 04


Course Title: Digital Logic Design Laboratory

Experiment N0: 04
Name of the Experiment: Full Adder Implementation.

Students’ Name: Marufa Akter (0112230230)


Rajkonna Al Farabi (0112230596)
Abir Reza (0112230599)
Shamsiya Nasrin (0112230616)
Ahmed Tanzim (0112230753)

Date of Performance: .06.2023


Date of Submission: 17.06.2023
Object:
The Full Adder is an adder that has three inputs and two outputs. The first two
inputs are A and B, and the third input is a carry as C-IN. S stands for the typical
output, which is SUM, and C-OUT is for the output carry. If eight inputs are
combined to create a byte-wide adder, the whole adder logic can cascade the
carry bit from one adder to the next.

Components Used:
 X – OR Gate (ICs 74LS86)
 Trainee Board
 4 1- bit full adder
 2 2- bit full adder
 1 4- bit full adder
 Logisim

Theory:
The theory of a 1-bit full adder is a fundamental concept in digital electronics and
computer architecture. A full adder is a digital circuit that performs addition on
three inputs: two binary digits (bits) and a carry-in bit. It outputs the sum of the
two input bits and generates a carry-out bit.
In the context of your report, it seems you are referring to the theory or analysis
of a 1-bit full adder. This typically involves studying the logic gates and circuitry
required to implement a 1-bit full adder, as well as analyzing its behavior and
performance characteristics.
A 1-bit full adder can be represented using truth tables, Boolean expressions, or
logic gate diagrams. It consists of two input bits (A and B), a carry-in bit (Cin), and
produces two outputs: the sum bit (S) and the carry-out bit (Cout).

The truth table for a 1-bit full adder is as follows :


The theory of a 1-bit full adder can be extended to construct n-bit adders and
carry chains, which are essential building blocks in the design of arithmetic circuits
and processors.
If you provide more specific information about your report or any particular
aspects you would like to know or discuss, I can provide more detailed
information or assistance.

Problem/Design solve Procedure:


1 bit full adder using X-OR gate: In Logisim, we took 2 bit XOR and AND gate and
pass the input A and B in it. Then pass output of XOR into another 2 bit XOR with
carry in as input. Also use 2 bit AND gate and as a input pass the first XOR and
carry in as input. With a two bit OR gate we pass the outputs of AND gates as
input and the result of it is our final output (AB+(A^B) Cin).
Also we used 4 1 bit full adder which we add 9(1001) + 7(0111) as an input, 2 2 bit
adders, 1 4 bit full adders for adding two digits in Logisim and also in trainee
board using full adder.
We use Logisim Software to create
1. Four 1-bit full adders,
2. Two 2-bit full adders,
3. One 4-bit full adder.
And then we build a full adder’s sum and carry equations circuit in DLD trainer
board/Bread board.
Discussion:
The complete adder is a fundamental digital circuit used in the construction of
digital logic and computer architecture. It is designed to add binary values and
produce both a sum and a carry as the result. The benefits of using a full adder are
as follows:
Combining binary numbers The main task of a complete adder is to add binary
numbers. You can add two single-nit inputs and a carry output. The functionality is
a requirement for arithmetic operations to be performed by computer systems.
Carry propagation: The carry that is transmitted to the following bit during
addition is represented by the whole adder's carry output. For multi-bit additions
to be accurately performed, carry propagation is essential. The addition of
numbers with more than one bit would not be possible without the carry output.
Full adders are the essential building blocks of more complex arithmetic circuit
designs. These serve as the cornerstone upon which adders, subtractors,
multipliers, and other arithmetic logic units found in computer processors are
constructed. These circuits are extremely necessary for the logical and
mathematical operations that computer systems perform.
Full adders are an illustration of a combinational logic circuit, where the outputs
are solely dependent on the current inputs. Digital systems frequently use
combinational logic, and complete adders are good examples of how it works.
Different technologies, including transistors, logic gates, and even programmable
logic devices, can be used to implement them.
Versatility: To produce larger multi-bit adders, whole adders can be cascaded
together. It is possible to conduct addition of several bits, such as 4-bit, 8-bit, or
even bigger binary integers, by connecting the carry output of one complete
adder to the carry input of the next. Due to their ability to handle arithmetic
operations of various sizes, complete adders are extremely flexible.
Full adders may also be utilized in specific situations for error detection. By
contrasting the input carry and the generated carry
The complete adder is an important part of digital systems and computer
architecture due to its versatility in generating larger adders, carry propagation,
ability to do binary addition, and function in arithmetic circuit design.

You might also like