Memory Reference instruction

Basic Computer Organization and Design 1
CSE 211
Overview
Instruction Codes
 Computer Registers
 Computer Instructions
 Timing and Control
 Instruction Cycle
 Memory Reference Instructions
 Input-Output and Interrupt
 Complete Computer Description

CSE 211
Basic Computer Instructions
Basic Computer Instruction Format
15 14 12 11 0
I Opcode Address
1. Memory-Reference Instructions (OP-code = 000 ~ 110)
2. Register-Reference Instructions (OP-code = 111, I = 0)
3. Input-Output Instructions (OP-code =111, I = 1)
15 12 11 0
Register operation0 1 1 1
15 12 11 0
I/O operation1 1 1 1

CSE 211
 Only 3 bits are used for operation code
 It may seem computer is restricted to eight different
operations
 however register reference and input output instructions use
remaining 12 bit as part of operation code
 so total number of instruction can exceed 8
Infact total no. of instructions chosen for basic computer is 25

CSE 211
AND 0xxx 8xxx AND memory word to AC
ADD 1xxx 9xxx Add memory word to AC
LDA 2xxx Axxx Load AC from memory
STA 3xxx Bxxx Store content of AC into memory
BUN 4xxx Cxxx Branch unconditionally
BSA 5xxx Dxxx Branch and save return address
ISZ 6xxx Exxx Increment and skip if zero
CLA 7800 Clear AC
CLE 7400 Clear E
CMA 7200 Complement AC
CME 7100 Complement E
CIR 7080 Circulate right AC and E
CIL 7040 Circulate left AC and E
INC 7020 Increment AC
SPA 7010 Skip next instr. if AC is positive
SNA 7008 Skip next instr. if AC is negative
SZA 7004 Skip next instr. if AC is zero
SZE 7002 Skip next instr. if E is zero
HLT 7001 Halt computer
INP F800 Input character to AC
OUT F400 Output character from AC
SKI F200 Skip on input flag
SKO F100 Skip on output flag
ION F080 Interrupt on
IOF F040 Interrupt off
Hex Code
Symbol I = 0 I = 1 Description

CSE 211
Instruction Set Completeness
The set of instructions are said to be complete if computer includes a
sufficient number of instruction in each of the following categories :
A computer should have a set of instructions so that the user can
construct machine language programs to evaluate any function that is
known to be computable.
 Functional Instructions
- Arithmetic, logic, and shift instructions
- ADD, CMA, INC, CIR, CIL, AND, CMA, CLA
Transfer Instructions
- Data transfers between the main memory and the processor registers
- LDA, STA
Control Instructions
- Program sequencing and control
- BUN, BSA, ISZ
Input/output Instructions
- Input and output
- INP, OUT

CSE 211
Control Unit
 Control unit (CU) of a processor translates from machine
instructions to the control signals for the microoperations
that implement them
 Control units are implemented in one of two ways
Hardwired Control
CU is made up of sequential and combinational circuits to generate
the control signals
Advantage : optimized to provide fast mode of operations
Disadvantage : requires changes in wiring if design has been modified
Microprogrammed Control
A control memory on the processor contains microprograms that
activate the necessary control signals
 We will consider a hardwired implementation of the control
unit for the Basic Computer

Basic Computer Orgsnization and Design 7
CSE 211
Timing and Control
Control unit of Basic Computer
Instruction register (IR)
15 14 13 12 11 - 0
3 x 8
decoder
7 6 5 4 3 2 1 0
I
D 0
15 14 . . . . 2 1 0
4 x 16
decoder
4-bit
sequence
counter
(SC)
Increment (INR)
Clear (CLR)
Clock
Other inputs
Control
signals
D
T
T
7
15
0
Combinational
Control
logic

CSE 211
Timing Signals
Clock
T0 T1 T2 T3 T4 T0
T0
T1
T2
T3
T4
D3
CLR
SC
- Generated by 4-bit sequence counter and 416 decoder
- The SC can be incremented or cleared.
- Example: T0, T1, T2, T3, T4, T0, T1, . . .
Assume: At time T4, SC is cleared to 0 if decoder output D3 is active.
D3T4: SC  0

CSE 211
Instruction Cycle
 In Basic Computer, a machine instruction is executed in the
following cycle:
1. Fetch an instruction from memory
2. Decode the instruction
3. Read the effective address from memory if the instruction has an indirect
address
4. Execute the instruction
 After an instruction is executed, the cycle starts again at step
1, for the next instruction
Note: Every different processor has its own (different) instruction cycle

CSE 211
Fetch and Decode
T0: AR PC
T1: IR  M [AR], PC  PC + 1
T2: D0, . . . , D7  Decode IR(12-14), AR  IR(0-11), I  IR(15)
Initially PC loaded with address of first instruction and Sequence
counter cleared to 0, giving timing signal T0

CSE 211
Fetch and Decode
Fetch and Decode T0: AR  PC (S0S1S2=010, T0=1)
T1: IR  M [AR], PC  PC + 1 (S0S1S2=111, T1=1)
T2: D0, . . . , D7  Decode IR(12-14), AR  IR(0-11), I  IR(15)
S2
S1
S0
Bus
7
Memory
unit
Address
Read
AR
LD
PC
INR
IR
LD Clock
1
2
5
Common bus
T1
T0

CSE 211
Fetch and Decode
 Figure shows how first two statements are implemented in bus system
 At T0 :
 1. Place the content of PC into bus by making S2S1S0=010
 Transfer the content of bus to AR by enabling the LD input of
AR
 At T1 :
 1. Enable read input of memory
 2. Place content of bus by making S2S1S0=111
 3. Transfer content of bus to IR by enabling the LD input of IR
 4. Increment PC by enabling the INR input of PC

CSE 211
Determine the Type of Instructions
= 0 (direct)
Start
SC <-- 0
AR <-- PC
T0
IR <-- M[AR], PC <-- PC + 1
T1
AR <-- IR(0-11), I <-- IR(15)
Decode Opcode in IR(12-14),
T2
D7
= 0 (Memory-reference)(Register or I/O) = 1
II
Execute
register-reference
instruction
SC <-- 0
Execute
input-output
instruction
SC <-- 0
M[AR]<--AR Nothing
= 0 (register)(I/O) = 1 (indirect) = 1
T3 T3 T3 T3
Execute
memory-reference
instruction
SC <-- 0
T4
Fig : Flow chart for Instruction Cycle

CSE 211
Determining Type of Instruction
D'7IT3: AR M[AR]
D'7I'T3:Nothing
D7I'T3: Execute a register-reference instr.
D7IT3: Execute an input-output instr.

CSE 211
Register Reference Instruction
r = D7 IT3 => Register Reference Instruction
Bi = IR(i) , i=0,1,2,...,11
- D7 = 1, I = 0
- Register Ref. Instr. is specified in b0 ~ b11 of IR
- Execution starts with timing signal T3
Register Reference Instructions are identified when
r: SC  0
CLA rB11: AC  0
CLE rB10: E  0
CMA rB9: AC  AC’
CME rB8: E  E’
CIR rB7: AC  shr AC, AC(15)  E, E  AC(0)
CIL rB6: AC  shl AC, AC(0)  E, E  AC(15)
INC rB5: AC  AC + 1
SPA rB4: if (AC(15) = 0) then (PC  PC+1)
SNA rB3: if (AC(15) = 1) then (PC  PC+1)
SZA rB2: if (AC = 0) then (PC  PC+1)
SZE rB1: if (E = 0) then (PC  PC+1)
HLT rB0: S  0 (S is a start-stop flip-flop)
e.g. rB11=CLA

CSE 211
Memory Reference Instructions
AND to AC //performs AND logic with AC and memory word specified by EA
D0T4: DR  M[AR] Read operand
D0T5: AC  AC  DR, SC  0 AND with AC
- The effective address of the instruction is in AR and was placed there during
timing signal T2 when I = 0, or during timing signal T3 when I = 1
- Memory cycle is assumed to be short enough to complete in a CPU cycle
- The execution of MR instruction starts with T4
Symbol
Operation
Decoder
Symbolic Description
AND D0 AC  AC  M[AR]
ADD D1 AC  AC + M[AR], E  Cout
LDA D2 AC  M[AR]
STA D3 M[AR]  AC
BUN D4 PC  AR
BSA D5 M[AR]  PC, PC  AR + 1
ISZ D6 M[AR]  M[AR] + 1, if M[AR] + 1 = 0 then PC  PC+1

CSE 211
ADD to AC // add content of memory word specified by EA to value of AC
sum is transferred to AC and Carry to E (Extended Accumulator)
D1T4: DR  M[AR] Read operand
D1T5: AC  AC + DR, E  Cout, SC  0 Add to AC and store carry in E
LDA: Load to AC // Transfers memory word specified by memory address to AC
D2T4: DR  M[AR]
D2T5: AC  DR, SC  0
STA: Store AC // Stores the content of AC into memory specified by EA
D3T4: M[AR]  AC, SC  0
BUN: Branch Unconditionally // Transfer program to instruction specified by EA
D4T4: PC  AR, SC  0

CSE 211
Memory, PC after execution
21
0 BSA 135
Next instruction
Subroutine
20
PC = 21
AR = 135
136
1 BUN 135
Memory, PC, AR at time T4
0 BSA 135
Next instruction
Subroutine
20
21
135
PC = 136
1 BUN 135
BSA: Branch and Save Return Address // 1. stores address of next instruction in
sequence (PC) into address specified by EA 2. EA+1 transfer to PC serve as 1st inst. In
subroutine
M[AR]  PC, PC  AR + 1
BSA:
D5T4: M[AR]  PC, AR  AR + 1
D5T5: PC  AR, SC  0
BSA: Example
M[135]  21, PC  135 + 1=136

CSE 211
ISZ: Increment and Skip-if-Zero
// increments the word specified by effective address,
and if incremented value=0 , PC incremented by 1
D6T4: DR  M[AR]
D6T5: DR  DR + 1
D6T4: M[AR]  DR, if (DR = 0) then (PC  PC + 1), SC  0

CSE 211
Flow Chart - Memory Reference Instructions
Memory-reference instruction
DR  M[AR] DR  M[AR] DR  M[AR] M[AR]  AC
SC  0
AND ADD LDA STA
AC  AC DR
SC  0
AC  AC + DR
E  Cout
SC  0
AC  DR
SC  0
D T0 4 D T1 4 D T2 4 D T3 4
D T0 5 D T1 5 D T2 5
PC  AR
SC  0
M[AR]  PC
AR  AR + 1
DR  M[AR]
BUN BSA ISZ
D T4 4 D T5 4 D T6 4
DR  DR + 1
D T5 5 D T6 5
PC  AR
SC  0
M[AR]  DR
If (DR = 0)
then (PC  PC + 1)
SC  0
D T6 6

CSE 211
Input/Output and Interrupt
Input-Output Configuration
INPR Input register - 8 bits
OUTR Output register - 8 bits
FGI Input flag - 1 bit
FGO Output flag - 1 bit
IEN Interrupt enable - 1 bit
- The terminal sends and receives serial information
- The serial info. from the keyboard is shifted into INPR
- The serial info. for the printer is stored in the OUTR
- INPR and OUTR communicate with the communication interface serially
and with the AC in parallel.
- The flags are needed to synchronize the timing difference between I/O
device and the computer
A Terminal with a keyboard and a Printer
Input-output
terminal
Serial
communication
interface
Computer
registers and
flip-flops
Printer
Keyboard
Receiver
interface
Transmitter
interface
FGOOUTR
AC
INPR FGI
Serial Communications Path
Parallel Communications Path

CSE 211
Determining Type of Instruction
 FGI =1 when new information available at input device,
and cleared to 0 when information accepted by
computer
 Initially FGI=0, new key pressed , 8 bit alphanumeric
shifted to INPR and FGI=1, Computer checks flag if 1
then transfer content to AC and clear FGI to 0.
 Initially FGO=1,
- computer checks flag bit if 1, then OUTR  AC and
clears FGO=0
- O/P device accepts information prints character and
finally sets FGO=1.

Basic Computer Orgsnisation and Design 24
CSE 211
Input/Output Instructions
D7IT3 = p
IR(i) = Bi, i = 6, …, 11
p: SC  0 Clear SC
INP pB11: AC(0-7)  INPR, FGI  0 Input char. to AC
OUT pB10: OUTR  AC(0-7), FGO  0 Output char. from AC
SKI pB9: if(FGI = 1) then (PC  PC + 1) Skip on input flag
SKO pB8: if(FGO = 1) then (PC  PC + 1) Skip on output flag
ION pB7: IEN  1 Interrupt enable on
IOF pB6: IEN  0 Interrupt enable off
I/O instructions are needed for transferring info to and from AC
register, for checking the flag bits and for controlling interrupt facility

CSE 211
Program controlled Input/Output
• Program-controlled I/O
-Continuous CPU involvement
CPU keeps checking flag bit. If 1 then initiates transfer
I/O takes valuable CPU time
-Difference in information flow rate makes this type of
transfer inefficient
• Alternative approach is to let external device inform the computer when
it is ready for transfer, in meantime computer can be busy with other task
- Interrupt

CSE 211
Interrupt Initiated Input/Output
- Open communication only when some data has to be passed --> interrupt.
- The I/O interface, instead of the CPU, monitors the I/O device.
- When the interface founds that the I/O device is ready for data transfer,
it generates an interrupt request to the CPU
- Upon detecting an interrupt, the CPU stops momentarily the task
it is doing, branches to the service routine to process the data
transfer, and then returns to the task it was performing.
IEN (Interrupt-enable flip-flop)
- can be set and cleared by instructions
- When cleared (IEN=0) the computer cannot be interrupted
- When set (IEN=1) the computer can be interrupted

CSE 211
Flow Chart of Interrupt Cycle
R = Interrupt f/f
- The interrupt cycle is a HW implementation of a branch and save return address
operation.
- At the beginning of the next instruction cycle, the instruction that is read from
memory is in address 1.
- At memory address 1, the programmer must store a branch instruction that sends
the control to an interrupt service routine
- The instruction that returns the control to the original program is "indirect BUN 0"
Store return address
R
=1=0
in location 0
M[0]  PC
Branch to location 1
PC  1
IEN  0
R  0
Interrupt cycleInstruction cycle
Fetch and decode
instructions
IEN
FGI
FGO
Execute
instructions
R  1
=1
=1
=1
=0
=0
=0

CSE 211
Register Transfer Operations in Interrupt Cycle
Register Transfer Statements for Interrupt Cycle
- R F/F  1 if IEN (FGI + FGO)T0T1T2
 T0T1T2 (IEN)(FGI + FGO): R  1
- The fetch and decode phases of the instruction cycle
must be modified Replace T0, T1, T2 with R'T0, R'T1, R'T2
- The interrupt cycle :
RT0: AR  0, TR  PC
RT1: M[AR]  TR, PC  0
RT2: PC  PC + 1, IEN  0, R  0, SC  0
After interrupt cycle
0 BUN 1120
0
1
PC = 256
255
1 BUN 0
Before interrupt
Main
Program
1120
I/O
Program
0 BUN 1120
0
PC = 1
256
255
1 BUN 0
Memory
Main
Program
1120
I/O
Program
256

CSE 211
Complete Computer Description
=1 (I/O) =0 (Register) =1(Indir) =0(Dir)
start
SC  0, IEN  0, R  0
R
AR  PC
R’T0
IR  M[AR], PC  PC + 1
R’T1
AR  IR(0~11), I  IR(15)
D0...D7  Decode IR(12 ~ 14)
R’T2
AR  0, TR  PC
RT0
M[AR]  TR, PC  0
RT1
PC  PC + 1, IEN  0
R  0, SC  0
RT2
D7
I I
Execute
I/O
Instruction
Execute
RR
Instruction
AR <- M[AR] Idle
D7IT3 D7I’T3 D7’IT3 D7’I’T3
Execute MR
Instruction
=0(Instruction =1(Interrupt
Cycle) Cycle)
=1(Register or I/O) =0(Memory Ref)
D7’T4

CSE 211
Complete Computer Design
Fetch
Decode
Indirect
Interrupt
Memory-Reference
AND
ADD
LDA
STA
BUN
BSA
ISZ
RT0:
RT1:
RT2:
D7IT3:
RT0:
RT1:
RT2:
D0T4:
D0T5:
D1T4:
D1T5:
D2T4:
D2T5:
D3T4:
D4T4:
D5T4:
D5T5:
D6T4:
D6T5:
D6T6:
AR  PC
IR  M[AR], PC  PC + 1
D0, ..., D7  Decode IR(12 ~ 14),
AR  IR(0 ~ 11), I  IR(15)
AR  M[AR]
R  1
AR  0, TR  PC
M[AR]  TR, PC  0
PC  PC + 1, IEN  0, R  0, SC  0
DR  M[AR]
AC  AC  DR, SC  0
DR  M[AR]
AC  AC + DR, E  Cout, SC  0
DR  M[AR]
AC  DR, SC  0
M[AR]  AC, SC  0
PC  AR, SC  0
M[AR]  PC, AR  AR + 1
PC  AR, SC  0
DR  M[AR]
DR  DR + 1
M[AR]  DR, if(DR=0) then (PC  PC + 1),
SC  0

CSE 211
Complete Computer Design
Register-Reference
CLA
CLE
CMA
CME
CIR
CIL
INC
SPA
SNA
SZA
SZE
HLT
Input-Output
INP
OUT
SKI
SKO
ION
IOF
D7IT3 = r
IR(i) = Bi
r:
rB11:
rB10:
rB9:
rB8:
rB7:
rB6:
rB5:
rB4:
rB3:
rB2:
rB1:
rB0:
D7IT3 = p
IR(i) = Bi
p:
pB11:
pB10:
pB9:
pB8:
pB7:
pB6:
(Common to all register-reference instr)
(i = 0,1,2, ..., 11)
SC  0
AC  0
E  0
AC  AC
E  E
AC  shr AC, AC(15)  E, E  AC(0)
AC  shl AC, AC(0)  E, E  AC(15)
AC  AC + 1
If(AC(15) =0) then (PC  PC + 1)
If(AC(15) =1) then (PC  PC + 1)
If(AC = 0) then (PC  PC + 1)
If(E=0) then (PC  PC + 1)
S  0
(Common to all input-output instructions)
(i = 6,7,8,9,10,11)
SC  0
AC(0-7)  INPR, FGI  0
OUTR  AC(0-7), FGO  0
If(FGI=1) then (PC  PC + 1)
If(FGO=1) then (PC  PC + 1)
IEN  1
IEN  0

CSE 211
Design of a Basic Computer(BC)
Hardware Components of BC
A memory unit: 4096 x 16.
Registers:
AR, PC, DR, AC, IR, TR, OUTR, INPR, and SC
Flip-Flops(Status):
I, S, E, R, IEN, FGI, and FGO
Decoders: a 3x8 Opcode decoder
a 4x16 timing decoder
Common bus: 16 bits
Control logic gates:
Adder and Logic circuit: Connected to AC
Control Logic Gates
- Input Controls of the nine registers
- Read and Write Controls of memory
- Set, Clear, or Complement Controls of the flip-flops
- S2, S1, S0 Controls to select a register for the bus
- AC, and Adder and Logic circuit

CSE 211

Memory Reference instruction

More Related Content

What's hot (20)

Similar to Memory Reference instruction (20)

More from mahesh kumar prajapat (14)

Recently uploaded (20)

Memory Reference instruction