Professional Documents
Culture Documents
VISION
The department aims to develop highly skilled IT professionals
with moral ethics to fulfil the needs of IT industry, society and
nation.
MISSION
To attain excellence in teaching-learning process by providing
better infrastructure facilities.
To collaborate with IT industry to bridge the knowledge gap
between academics and industry needs.
To impart value-based IT education for building cutting edge and
innovative IT.
COURSE OUTCOME
CO1 Identify and explain the basic structure and functional units of a digital
computer.
CO2 Write assembly language programs and identify the role and
working of various functional units of a computer for executing
an instructions.
CO3 Design processing unit using the concepts of ALU and control
logic design.
CO4 Design circuits for interfacing memory and I/O with processor.
CO5 Comprehend the features and performance parameters of
different types of computer architectures.
INDEX
Theory: -
Booth's Multipliers:
Booth’s multiplication algorithm is an algorithm which
multiplies 2 signed integers in 2’s complement. The
algorithm is depicted in the following figure with a brief
description. This approach uses fewer additions and
subtractions than more straightforward algorithms.
Design Issues :
Booth’s algorithm can be implemented in many ways. This
experiment is designed using a controller and a datapath.
The operations on the data in the datapath is controlled by
the control signal received from the controller. The
datapath contains registers to hold multiplier,
multiplicand, intermediate results, data processing units
like ALU, adder/subtractor etc., counter and other
combinational units. Following is the schemetic diagram
of the Booth’s multiplier which multiplies two 4-bit
numbers in 2’s complement of this experiment. Here the
adder/subtractor unit is used as data processing unit.M,
Objective:-
Objective of 4 bit Booth's Multiplier:
1. Understanding behaviour of Booth's multiplication
algorithm from working module and the module
designed by the student as part of the experiment
2. Designing Booth's multiplier with a controller and a
datapath. This will also help in the learning of control
unit design as a finite state machine
3. Understanding the advantages of Booth's multiplier
o It can handle signed integers in 2's
complement notion
o It decreases the number of addition and
subtraction
o It requires less hardware than combinational
multiplier
o It is faster than straightforward sequential
multiplier
Examining behaviour of 4 bit Booth's multiplier for the
working module and module designed by the student as part
of the experiment (refer to the circuit diagram):
Set M as 0111 which is 7 and Q as 0101 which is 5. Now start the
multiplication operation and observe the results including the
intermediate results. The Booth's algorithm on those inputs
works as the following diagram, so the circuit must behave
according to it.
Procedure:-
Booth's Multipliers:
Procedure to perform the experiment on the given
working module which multiplies two 4-bit numbers
want to put the component (no drag and drop, simple click
will serve the purpose).
</sub<n<>
4. Instantiate the Booth's multiplier datapath from the
sequential ckt drawer in the palette (by clicking as
mentioned previously).
5. The pin configuration of the component is shown
whenever the mouse is hovered on any canned component
of the palette or pressing the show pin
configuration button on the toolbar will show it constantly
in the left pane. Pin numbering starts from 1 and from the
bottom left corner(indicating with the circle) and increases
anticlockwise.
6. Pin configuration of the datapath module:
o M : Multiplicand (4 bit), Q : Multiplier (4 bit)
o Initialization : Inl:1, preset:1, set M, Q, start clock
o Starting multiplication: Inl:0, preset:0, start clock
o Result: FQ0 to FA3, at end state (here it is S6). These
are the content of A(4bit) and Q(4bit) register, total 8
bit (FQ0 is LSB, FA3 is MSB)
o I/P:
Clk:32, Inl:31, preset:30
Control pins: load:29, add:28, sub:27, shift:26, dc:25
Multiplicand: M3 : 24, M2 : 23, M1 : 22, M0 : 21
Multiplier: Q3 : 20, Q2 : 19, Q1 : 18, Q0 : 17
Implementation :-
Conclusion :-
1)Booth's multiplication algorithm is a multiplication
algorithm that multiplies two signed binary numbers in
two's complement notation.booth algorithm requires
examination of the multiplier bits and shifting of the
partial product.It handles both positive and negative
multiplier uniformly.
2) It achieves efficiency in the number of additions
required when the multiplier has a few large blocks of
1's.
3) The speed gained by skipping 1's depends on the data.
Booth Multiplier performs fewer additions than a serial
multiplier. Two main drawbacks of Booth Algorithm are
the inefficiency of the circuit when isolated 1's are
encountered and difficulty in designing parallel
multipliers as number of shift-and-add operations vary
8085 ARCHITECTURE
8085 Microprocessor –
Functional Units
Accumulator:
It is an 8-bit register used to perform
arithmetic, logical, I/O & LOAD/STORE
operations. It is connected to internal data bus
& ALU.
Arithmetic and logic unit:
As the name suggests, it performs arithmetic
and logical operations like Addition,
Subtraction, AND, OR, etc. on 8-bit data.
General purpose register:
here are 6 general purpose registers in 8085
processor, i.e. B, C, D, E, H & L. Each register
can hold 8-bit data.
D7 D6 D5 D4 D3 D2 D1 D0
S Z AC P CY
Solution :
AIM :
Write an assembly language code in GNUsim8085 to
implement below mentioned arithmetic instructions:
a. ANA
b. LXI
c. ORA
a. ANA
b. LXI
c. ORA
1-bit ALU
A B RESULT
0 0 0
0 1 1
1 0 1
1 1 1
0 1 0 0 1
0 1 1 1 0
1 0 0 0 1
1 0 1 1 0
1 1 0 1 0
1 1 1 1 1
1 1 0
8-bit ALU
0 1 0
1 0 0
1 1 1
0 0 0
0 1 1
1 0 1
1 1 0
0 0 1
0 1 0
1 0 0
1 1 1
1 1 0