COA LabReport
COA LabReport
Submitted by,
Name :
Branch :
Roll No :
CS 2103 COMPUTER ORGANIZATION AND ARCHITECTURE LAB
LIST OF EXPERIMENTS
Cycle 1
1. a) DESIGN OF FULL ADDER USING LOGISIM
b) REALIZATION OF FOUR BIT RIPPLE CARRY ADDER USING FULL ADDER CIRCUIT
b) REALIZATION OF SINGLE STAGE LOGIC UNIT AND FOUR BIT LOGIC UNIT
Logisim is an educational and user friendly tool. It mainly consists of an interactive graphical
schematic editor and logic simulator. Logisim has a layout similar to most available software
tools. Fig. 1 portrays the basic layout of Logisim
1. Canvas:
The canvas is the area for the user to create and simulate digital circuits. Whenever a new
circuit
is added, a new canvas will be created.
2. Explorer Pane:
CS 2103 COMPUTER ORGANIZATION AND ARCHITECTURE LAB
This pane contains the list of wiring (for input or output connections), gates, multiplexers,
arithmetic circuits, memory and other components that are available for digital design in
Logisim software. They are the built-in modules of Logisim to support the realization of
complex circuits.
3. Attribute Table:
Gives detailed attributes (parameters) of digital design components of any circuit. The
attribute table allows the user to alter certain features (I/O bits, label, orientation etc) of a
digital component
4. Toolbar:
o Design tool: It helps to drop down any block from toolbar, explorer pane and to make
interconnections between different components
o Input pin: green circle surrounded by a square box, is used to send a signal through a
wire. When placing the input on the canvas it initializes the input to logic 1 or 0. The number
of bits can be increased in the Attribute Table. The input value can be altered using the
simulation tool
o Output pin: green circle surrounded by a circular shape, is used to observe the output
from a digital circuit. The output pin toggles upon subsequent use of simulation tool.
Error Checking
During the design of any digital circuit, error can occur mainly in the interconnection of
different components and can be identified by the colour change in the wiring. The details are
given in Table 1
THEORY
Full Adder:
It is one among the simplest combinational circuit and is the basic building block of arithmetic circuit of
processors. It is a combinational circuit used to perform bitwise addition of numbers considering the carry
generated during previous arithmetic operations. A full adder can be obtained by combining two half
adders and hence the name full adder. Full adder circuit has three input states and two output states. Two
inputs correspond to the bits of the binary numbers taken and the third input corresponds to previous
carry. There are two outputs-sum and the new carry. Similar to half adder, full adder can also be designed
using basic gates. In practice, a set of full adders are implemented on chip using universal gates to
perform arithmetic operations.
INPUT OUTPUT
X Y Cin S Cout
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
Multiple full adder circuits can be cascaded in parallel to add two N-bit numbers. For an N-
bit parallel adder, there must be N number of full adder circuits. A ripple carry adder is a logic circuit in
which the carry-out of each full adder is the carry in of the succeeding next most significant full adder. It
is called a ripple carry adder because each carry bit gets rippled into the next stage. In a ripple carry adder
the sum and carry out bits of any half adder stage is not valid until the carry in of that stage occurs. In
simple words, the final result of the ripple carry adder is valid only after the joint propagation delays of
all full adder circuits inside it.
CS 2103 COMPUTER ORGANIZATION AND ARCHITECTURE LAB
CIRCUIT DIAGRAMS
Full Adder
PROCEDURE
OUTPUT
Full Adder
RESULT
Full adder and ripple carry adder circuits are realized using Logisim software and their corresponding
outputs are verified
CS 2103 COMPUTER ORGANIZATION AND ARCHITECTURE LAB