Thanks to visit codestin.com
Credit goes to www.scribd.com

0% found this document useful (0 votes)
11 views25 pages

110 - Computer Architecture (Execution Unit)

Uploaded by

magnaff2
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
11 views25 pages

110 - Computer Architecture (Execution Unit)

Uploaded by

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

CSE

Computer Architecture
2105

Execution Unit

Moniruzzaman
Lecturer
North Western University, Khulna-9000
110

Moniruzzaman | Lecturer, CSE_NWU


Confession
✿ Most of the materials have been collected from Internet.
✿ Images are taken from Internet.
✿ Various books are used to make these slides.
✿ Various slides are also used.
✿ References & credit:
○ Atanu Shome, Assistant Professor, CSE, KU.
○ Computer Organization and Design: the Hardware/Software Interface - Textbook by David A Patterson and John
L. Hennessy.
○ Computer Organization and Architecture - Book by William Stallings

moniruzzaman
2
Moniruzzaman | Lecturer, CSE_NWU
Execution An execution unit (EU) is a component of a computer's
hardware that performs instructions, also known as functional
Unit units. EUs are separate blocks that perform arithmetic, logic,
branching, and other actions. They work in parallel and can work
on a different task at the same time as other parts.

3
Moniruzzaman | Lecturer, CSE_NWU
Multiplexer A multiplexer is a combinational circuit that has many data
inputs and a single output, depending on control or select
inputs.

For N input lines, log2(N) selection lines are required,


or equivalently, for 2n input lines, n selection lines are needed.

Multiplexers are also known as “N-to-1 selectors,”


parallel-to-serial converters, many-to-one circuits, and universal
logic circuits.

They are mainly used to increase the amount of data that can be
sent over a network within a certain amount of time and
bandwidth.

4
Moniruzzaman | Lecturer, CSE_NWU
Multiplexer

5
Moniruzzaman | Lecturer, CSE_NWU
Registers General-purpose registers (GPRs)- and dedicated registers are
two types of registers in a CPU.

GPRs are special memory cells that can be accessed quickly and
temporarily store data and control information.

They are not dedicated to specific tasks and can be used for a
wide range of instructions.

GPRs can store both data and addresses, and in some


architectures, they can also store floating-point numbers.

6
Moniruzzaman | Lecturer, CSE_NWU
Registers Dedicated registers- are reserved for a specific purpose or role
essential to the running of the processor.

Here are some examples of special-purpose registers:


⭓ Program Counter (PC): Keeps track of the next instruction
to be executed

⭓ Instruction Register (IR): Holds the current instruction


being executed

⭓ Stack pointer (SP): Keeps track of program flow and


manages the stack

⭓ Status register (SR/FLAGS): Stores flags indicating the


status of operations

7
Moniruzzaman | Lecturer, CSE_NWU
Shift
Operation

8
Moniruzzaman | Lecturer, CSE_NWU
General
Purpose
Registers

9
Moniruzzaman | Lecturer, CSE_NWU
4 Bit
General
Purpose
Register

s1 s0 Operation

0 0 No operation

0 1 Shift right

1 0 Parallel load

1 1 Shift left
10

Moniruzzaman | Lecturer, CSE_NWU


Adder

11
Moniruzzaman | Lecturer, CSE_NWU
One-bit
full
adder

Sum, S = A ′B ′C in +A ′BC ′in +AB ′C ′in +ABC in = A⊕B⊕C in

Carry,C = AB+AC in +BC in

12
Moniruzzaman | Lecturer, CSE_NWU
One-bit Sum, S = A ′B ′C in +A ′BC ′in +AB ′C ′in +ABC in = A⊕B⊕C in
full Carry,C = AB+AC in +BC in
adder
Or
Ripple
Carry
Adder

13
Moniruzzaman | Lecturer, CSE_NWU
One-bit
full
adder
Or
Ripple
Carry
Adder

14
Moniruzzaman | Lecturer, CSE_NWU
4-BIT
Ripple
Carry
Adder

15
Moniruzzaman | Lecturer, CSE_NWU
16-BIT
Ripple
Carry
Adder

16
Moniruzzaman | Lecturer, CSE_NWU
Carry Look-Ahead Adder

17
Moniruzzaman | Lecturer, CSE_NWU
Carry
Look
Ahead
Adder

18
Moniruzzaman | Lecturer, CSE_NWU
Carry Gi and Pi are called the carry generate and carry propagate terms,
respectively. Notice that the generate and propagate terms only depend on
Look the input bits and thus will be valid after one and two gate delay,
respectively. If one uses the above expression to calculate the carry signals,
Ahead one does not need to wait for the carry to ripple through all the previous
stages to find its proper value.
Adder Let’s i = 0, 1, 2, 3 apply this to a -bit adder to make it clear. Putting in
Equation 5, we get

19
Moniruzzaman | Lecturer, CSE_NWU
Carry
Look
Ahead
Adder

20
Moniruzzaman | Lecturer, CSE_NWU
ALU Design

21
Moniruzzaman | Lecturer, CSE_NWU
4 BIT
Arithmetic
Unit

22
Moniruzzaman | Lecturer, CSE_NWU
4 Bit
Logic
Unit

23
Moniruzzaman | Lecturer, CSE_NWU
4 BIT
Logic
Unit
Select lines Output

s1 s0

0 0 X+Y

0 1 X +Y+1

1 0 X And Y

1 1 X Ex-OR Y
24
Moniruzzaman | Lecturer, CSE_NWU
ありがとう Japanese

25
Moniruzzaman | Lecturer, CSE_NWU

You might also like