Dr. B. R.

Ambedkar National Institute of Technology,

Jalandhar, Punjab

Branch : - CSE

Computer Organization & Architecture (CSMI-202)

Lecture – 1

Introduction

Presenter – Dr. D. K. Meena

Register Transfer Language
 Register Transfer Language
A digital system Is an interconnection of digital hardware module that accomplish a specific
information-processing task.

These modules are constructed using digital components such as register, decoders,
arithmetic elements, and control logic.

These modules are interconnected with common data and control paths to form a digital
computer system.

The operations executed on data stored in registers are called microoperations.

The result of the operation may replace the previous binary information of a register or may
be transfer to another register. Examples of microoperations are shift, count, clear, and load.

For example, a counter with parallel load is capable of performing the micro- operations
increment and load. A bidirectional shift register is capable of performing the shift right and
shift left microoperations.
 Register Transfer Language
The internal hardware organization of a digital computer is best

defined by specifying:

1. The set of registers it contains and their function.

2. The sequence of microoperations performed on the binary information

stored in the registers.

3. The control that initiates the sequence of microoperations.

“The symbolic notation used to describe the microoperation transfers among

registers is called a Register Transfer Language”.

 Register Transfer Language
Computer registers are designated by capital letters (sometimes followed by numerals)
to denote the function of the register.

For example, the register that holds an address for the memory unit is usually called a
memory address register and is designated by the name MAR. Other designations for
registers are PC (for program counter), IR (for instruction register, and R1 (for
processor register).

The individual flip-flops in an n-bit register are numbered in sequence from 0 through
n - 1, starting from 0 in the rightmost position and increasing the numbers toward the
left.
Information transfer from one register to another is designated in symbolic form
by means of a replacement operator.
R2
The statement denotes a <--R1
transfer of
the content of register R1 into register R2. It
designates a replacement of the content of R2 by the content of R1 .
Normally, we want the transfer to occur only under a predetermined control
condition. This can be shown by means of an if-then statement.
If (P = 1) then (R2 <--R1)
where P is a control signal generated in the control section.
It is sometimes convenient to separate the control variables from the register
transfer operation by specifying a control function. A control function is a Boolean
variable that is equal to 1 or 0.
The control function is included in the statement as follows:
P: R2 <--R1
The control condition is terminated with a colon. It symbolizes the requirement
that the transfer operation be executed by the hardware only if P = 1 .
The basic symbols of the register transfer notation are
listed in Table 4-1 .
• Registers are denoted by capital letters, and numerals
may follow the letters.
• Parentheses are used to denote a part of a register by
specifying the range of bits or by giving a symbol
name to a portion of a register.
• The arrow denotes a transfer of information and the
direction of transfer. T: R2 R1, R1 R2
• A comma is used to separate two or more operations
that are executed at the same time.
• The statement denotes an operation that exchanges
the contents of two registers during one common
clock pulse provided that T = 1.
 Bus and Memory Transfers
A more efficient scheme for transferring information between registers in a multiple-register
configuration is a common bus system.
A bus structure consists of a set of common lines, one for each bit of a register, through which
binary information is transferred one at a time.
In general, a bus system will multiplex k registers of n bits each to produce an n-line
common bus.
The number of multiplexers needed to construct the bus is equal to n , the number of bits
in each register. The size of each multiplexer must be k x 1 since it multiplexes k data
lines.
For example, a common bus for eight registers of 16 bits each requires 16 multiplexers,
one for each line in the bus.
The transfer of information from a bus into one of many destination registers can be
accomplished by connecting the bus lines to the inputs of all destination registers and
activating the load control of the particular destination register selected.
When the bus is includes in the statement, the register transfer is symbolized as follows:
BUS C, R1 BUS
If the bus is known to exist in the system, it may be convenient just to show the direct
transfer. R1 C
From this statement the designer knows which control signals must be activated to
produce the transfer through the bus.
Three-State Bus Buffers
Three-State Bus Buffers
 Memory Transfer
The transfer of information from a memory word to the outside environment is called a read operation.
The transfer of new information to be stored into the memory is called a write operation.
A memory word will be symbolized by the letter M .
The particular memory word among the many available is selected by the memory address during the
transfer.
It is necessary to specify the address of M when writing memory transfer operations.
This will be done by enclosing the address in square brackets following the letter M.
• Consider a memory unit that receives the address from a register, called the address register,
symbolized by AR . The data are transferred to another register, called the data register, symbolized by
DR .
• The read operation can be stated as follows:
Read: DR M [AR]
• This causes a transfer of information into DR from the memory word M selected by the address in AR .
• The write operation can be stated as follows:
Write: M [AR] R1
 Basic Microoperation
The microoperations most often encountered in digital computers are
classified into four categories:

1. Register transfer (Transfer binary information from one register to another)

2. Arithmetic microoperations (Perform arithmetic operation on numeric data

stored in the registers)
3. Logic microoperations (Perform bit manipulations on non-numeric data
store in registeres)
4. Shift microoperations (Perform shift operations on data stored in registers)
 Arithmetic Microoperations
• The basic arithmetic microoperations are: addition, subtraction,
increment, decrement, and shift
• R3 R1+R2, Specifies add microoperation
• R3 R1-R2, or R3 R1+R2’ +1, Specifies subtraction microoperation
Binary Adder
4 - Bit Binary Adder
Binary Adder-Subtracter
Binary Incrementer
Binary Decrementeder
 Arithmetic Circuit

• The output of the binary adder is calculated from

the following arithmetic sum:
D = A + Y + Cin
• where A is the 4-bit binary number at the X inputs
and Y is the 4-bit binary number at the Y inputs of
the binary adder.
• Cin is the input carry, which can be equal to 0 or 1.
 Logic Microoperations
Logic microoperations specify binary operations for strings of bits stored in registers.
These operations consider each bit of the register separately and treat them as binary
variables.
For example, the exclusive-OR microoperation with the contents of two registers R 1 and
R2 is symbolized by the statement
P: R1 R1 ⊕ R2
It specifies a logic microoperation to be executed on the individual bits of the registers
provided that the control variable P = 1.
List of Logic Microoperations
Logic Microoperations
Application of Logic Microoperations
Application of Logic Microoperations
Application of Logic Microoperations

1010
 Shift Microoperations
Shift microoperations are used for serial transfer of data.

The contents of a register can be shifted to the left or the right.

At the same time that the bits are shifted, the first flip-flop
receives its binary information from the serial input.

Three types of shift: Logical, Circular, and Arithmetic

 Logical Shift Microoperations
A logical shift is one that transfers 0 through the serial input.
 The circular shift Microoperations
The circular shift (also known as a rotate operation) circulates the bits of the

register around the two ends without loss of information.

This is accomplished by connecting the serial output of the shift register to its

serial input.
 An arithmetic Shift Microoperations
An arithmetic shift is a microoperations that shifts a signed binary number to
the left or right.
An arithmetic shift-left multiplies a signed binary number by 2.
An arithmetic shift-right divides the number by 2.
Arithmetic shifts must leave the sign bit unchanged because the sign of the
number remains the same when it is multiplied or divided by 2.
Arithmetic Logic Shift Unit