Scribd
Upload
23 views3 pages

COA Notes (Notepad)

RTL is a symbolic notation used to describe microoperation transfers among registers in a computer's logic circuits. A three-state bus allows multiple devices to share a bus line by implementing a high-impedance state that behaves like an open circuit. Memory transfer operations include reading data from memory to a register and writing data from a register to memory. A binary adder generates the sum of two binary numbers using cascaded full-adder circuits, and can be combined with an exclusive-OR gate to perform addition and subtraction. Common arithmetic and logic microoperations that can be implemented on an arithmetic circuit include addition, subtraction, increment, decrement, and, selective set, clear, complement, and mask operations. Shift microoperations include logical

Uploaded by

Utkarsh Pandey
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
23 views3 pages

COA Notes (Notepad)

RTL is a symbolic notation used to describe microoperation transfers among registers in a computer's logic circuits. A three-state bus allows multiple devices to share a bus line by implementing a high-impedance state that behaves like an open circuit. Memory transfer operations include reading data from memory to a register and writing data from a register to memory. A binary adder generates the sum of two binary numbers using cascaded full-adder circuits, and can be combined with an exclusive-OR gate to perform addition and subtraction. Common arithmetic and logic microoperations that can be implemented on an arithmetic circuit include addition, subtraction, increment, decrement, and, selective set, clear, complement, and mask operations. Shift microoperations include logical

Uploaded by

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

COA notes

>What is RTL(Register Tranfer Language) ----------


The symbolic notation used to describe the microoperation transfers among
registers is called a register transfer language. The term "register transfer"
implies the availability of hardware logic circuits that can perform a stated
microoperation and transfer the result of the operation to the same or another
register

>What is Three-State bus transfer ----------


A three-state gate is a digital circuit that exhibits three states. Two of the
states
are signals equivalent to logic 1 and 0 as in a conventional gate. The third state
is a high-impedance state. The high-impedance state behaves like an open circuit,
which means that the output is disconnected and does not have a logic significance.
OR
A bus system that can be constructed with three-state buffer gate is called
"Three state bus buffer".

>High-impendance state --------


High impendance state behaves like open circuit i.e. the output is dissconected
and does not have a logic signifinance.

>Memory Tranfer-------
1} Memory read-
The transfer of information from a memory word to the outside
environment is called a read operation.
Read: DR <----- M[AR]

2}Memory write-
The write operation transfers the content of a data register to a memory
word M selected by the address.
Write: M[AR] <----- R1
>Binary Adder------
The digital circuit that generates the arithmetic sum of two binary numbers
of any length is called a binary adder.
The binary adder is constructed with full-adder circuits connected in cascade,
with the output carry from one full-adder connected to the input carry of the
next full-adder.
Process-- An n-bit binary adder requires n full-adders. The output carry from
each
full-adder is connected to the input carry of the next-high-order full-adder. The
n data bits for the A inputs come from one register (such as R1), and the n data
bits for the B inputs come from another register (such as R2). The sum can be
transferred to a third register or to one of the source registers (R 1 or R2),
replacing its previous content.

>Binary Adder-Subtractor------
Addition and subtraction operations can be combined into one common circuit by
including an exclusive-OR gate with each full-adder. The mode input K controls the
operations. When k=1, the circuit is subtractractor and when K=0, The circuit is
adder.

>Arithmetic Circuit --------


The arithmetic microoperations can be implemented in one composite arithmetic
circuit. The basic component of an arithmetic circuit is the parallel adder. By
controlling the data inputs to the adder, it is possible to obtain different types
of arithmetic operations.
Microoperation
D = A +B :
Add
D = A + B+1 : Add with carry
D = A + B : Subtract with borrow
D = A + B +1 : Subtract
D = A : Transfer A
D = A + 1 : Increment A
D =A -1 : Decrement A
D = A : Transfer A

List of Logic Microoperations----------

1} Selective Set :- The selective-set operation sets to 1 the bits in register A


where there are corresponding 1's in register B.

1010 A before
1100 B (logic operand)
1110 A after

2} Selective Complement :- The selective-complement operation complements bits in A


where there are corresponding l's in B.
1010 A before
1100 B (logic operand)
0110 A after

3} Selective clear :- The selective-clear operation clears to 0 the bits in A only


where there are corresponding 1's in B.
1010 A before
1100 B (logic operand)
0010 A after

4} Selective Mask :- The mask operation is similar to the selective-clear operation


except that the bits of A are cleared only where there are corresponding 0' sin B.
1010 A before
1100 B (logic operand)
1000 A after

5} Insert :- The insert operation inserts a new value into a group of bits. This is
done
by first masking the bits and then ORing them with the required value.

Insert 1001 in the four lift most bits of A :

0110 1010 A before


0000 1111 B (mask)
0000 1010 A after masking

and then insert the new value:

0000 1010 A before


1001 0000 B (insert)
1001 1010 A after insertion

> List of Shift Mocrooperations--------

1} Logical Shift :- A logical shift is one that transfers 0 through the serial
input. We will adopt the symbols "shl" and "shr" for logical shift-left and shift-
right microoperations.
R1 <-- shl R1
R2 <-- shr R2

2} Circular Shift :- The circular shift (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.
R <-- cil R
R <-- cir R

3} Arithmatic shift :-

{A} Arithmatic Shift Right : An arithmetic right shift is a computer operation


that moves each bit to the right one by one. The least significant bit (LSB) is
discarded and the most significant bit (MSB) is filled with the value of
the previous MSB.

{B} Arithmatic Shift Left : An arithmetic shift left operation moves each bit in a
register one place to the left. The most significant bit (MSB) is moved outside the
register. The empty least significant bit (LSB) is filled with zero.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy