Register transfer language

Sanjeev Patel
Sanjeev PatelCo Founder at Campus Guide : my college buddy em Campus Guide : my college buddy
Register Transfer language,[object Object],And Micro-operation,[object Object]
Register transfer language		,[object Object],The symbolic notation used to describe the micro operation transfers among register is called a register transfer language.,[object Object],A programming language is a procedure for writing symbols to specify a given computational process.,[object Object],A register transfer language is a system for expressing in symbolic form the micro operation sequences among the register of a digital module,[object Object]
The internal hardware organization of a digital computer is best defined byspecifying,[object Object],The set of register it contains and their function.,[object Object],The sequence of micro operations performed on the binary information stored in the registers.,[object Object],The control that initiates the sequence of micro operations. ,[object Object]
Register,[object Object],A register is a group of flip-flops. Each flip–flop is capable of storing one bit of information. An n-bit register consists of a group of n flip-flops capable of storing n bits of binary information. In addition to the flip-flops, a register may have combinational gates that perform certain data processing tasks. The flip-flops hold the binary information and the gates determine how the information is transferred into the register. Various types of registers are available commercially.,[object Object],The simplest register is one that consists of only flip-flops without any gates.,[object Object]
register,[object Object],The register that holds an address for the memory unit is called a memory address register and is designated by the name MAR or AR. As for registers are PC (for program counter), IR (for instruction register) and R1 (for processor register).,[object Object],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.,[object Object],The most common way to represent a register is by a rectangular box with the name of the register inside, as in Fig. 1-12 (a). The individual bits can be distinguished as in (b). The numbering of bits in a 16-bit register can be marked on top of the box as shown in (c). A 16-bit register is partitioned into two parts in (d). Bits 0 through 7 are assigned the symbol L (for low byte) and bits 8 through 15 are assigned the symbol H (for high byte). The name of the 16-bit register is PC. The symbol PC(O—7) or PC(L) refers to the low-order byte and PC(8—15) or PC(H) to the high-order byte.,[object Object]
register,[object Object],Information transfer from one register to another is designated in symbolic form by means of a replacement operator. The statement,[object Object],			R2 ← R1,[object Object],denotes a transfer of the content of register R1 into register R2. It designates a replacement of the content of R2 by the content of R1. By definition, the content of the source register R1 does not change after the transfer. Normally, we want the transfer to occur only under a predetermined control condition. This can be shown by means of an if-then statement.,[object Object],		If (P = 1) then (R2  ← R1),[object Object],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.,[object Object]
register,[object Object],A control function is a Boolean variable that is equal to I or 0. The control function is included in the statement as follows:,[object Object],		P: R2  ←  R1,[object Object],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.,[object Object],Every statement written in a register transfer notation implies a hardware construction for implementing the transfer. Figure 1-13 shows the block diagram that depicts the transfer from R1 to R2.,[object Object],The n outputs of register R1 are connected to the n inputs of register R2. The letter n will be used to indicate any number of bits for the register. Register R2 has a load input that is activated by the control variable P.,[object Object]
Representation of register,[object Object], The clock is not included as a variable in the register transfer statements.,[object Object],It is assumed that the control variable is synchronized with the same clock    as the one applied to the register.,[object Object],It is assumed that all transfers occur during a clock edge transition.,[object Object]
register,[object Object],Even though the control condition such as P becomes active just after time t, the actual transfer does not occur until the register is triggered by the next positive transition of the clock at time t + 1.this is shown in figure 1-13.,[object Object],Transfer from R1 to R2 when K1=1,[object Object]
Register transfer,[object Object]
Register transfer,[object Object],Example:,[object Object],	T: R2   ←  R1, R1 ←  R2,[object Object],This statement denotes an operation that exchanges the contents of two registers during one common Clock pulse provided that T = 1. This simultaneous operation is possible with registers that have edge-triggered flip-flops.,[object Object]
Bus organization and transfer,[object Object],The CPU communicates with the other components via a bus. A bus is a set of Wires (multiplexers) that acts as a shared but common data path to connect multiple subsystems within the system. It consists of multiple lines, allowing the parallel movement of bits.,[object Object],Buses are low cost but very versatile, and they make it easy to connect new devices to each other and to the system. At any one time, only one device (be it a register, the ALU, memory, or some other component) may use the bus. However, this sharing often results in a communications bottleneck. The speed of the bus is affected by its length as well as by the number of devices sharing it.,[object Object]
Common Bus system configuration,[object Object],A more efficient scheme for transferring information between common bus 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. Control signals determine which register is selected by the bus during each particular register transfer.,[object Object],Constructing a common bus system,[object Object],a. Using multiplexers,[object Object],b. Using three state buffers.,[object Object]
 Using multiplexers,[object Object],The multiplexers select the source register whose binary information is then placed on the bus.,[object Object],Each register has four bits, numbered 0 through 3. The bus consists of four 4 x 1 multiplexers each having four data inputs, 0 through 3, and two selection inputs, S1 and S0. In order not to complicate the diagram with 16 lines crossing each other, we use labels to show the connections from the outputs of the registers to the inputs of the multiplexers. For example, output 1 of register A is connected to input 0 of MUX 1 because this input is labeled A1.,[object Object],The two selection lines S0and S1 are connected to the selection inputs of all four multiplexers. Table 1-2 shows the register that is selected by the bus for each of the four possible binary values of the selection lines.,[object Object]
Bus system for four register using four mux,[object Object]
Using multiplexer,[object Object],The number of multiplexers needed to construct the bus is equal to n.,[object Object],The size of each multiplexer must be k x 1 since it multiplexes k data lines.,[object Object],For example,[object Object], A common bus for  eight  registers of,[object Object], 16 bits each requires 16 multiplexers,[object Object],, one for each line in the bus. So,[object Object],Each multiplexer must have eight data input lines and three selection lines to multiplex one significant bit in the eight registers.,[object Object]
Using three state buffers,[object Object],A three-state gate:,[object Object],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.,[object Object],The high-impedance state behaves like an open circuit, which means that the output is disconnected and does not have logic significance.,[object Object],Three-state gates may perform any conventional logic, such as AND or NAND. However, the one most commonly used in the design of a bus system is the buffer gate.,[object Object]
Three state buffer,[object Object],It is distinguished from a normal buffer by having both a normal input and a control input.,[object Object]
The control input determines the output state,[object Object],When the control input is equal to 1, the output is enabled and the gate behaves like any conventional buffer, with the output equal to the normal input.,[object Object], When the control input is 0, the output is disabled and the gate goes to a high-impedance state(Hi-Z), regardless of the value in the normal input.,[object Object],The high-impedance state of a three-state gate provides a special feature not available in other gates. Because of this feature, a large number of three-state gate outputs can be connected with wires to form a common bus line without endangering loading effects.,[object Object]
Construction with three state buffer,[object Object],The outputs of four buffers are connected together to form a single bus line. (It must be realized that this type of connection cannot be done with gates that do not have three-state outputs.) The control inputs to the buffers determine which of the four normal inputs will communicate with the bus line.,[object Object],No more than one buffer may be in the active state at any given time. The connected buffers must be controlled so that only one three-state buffer has access to the bus line while all other buffers are maintained in a high- impedance state.,[object Object],One way to ensure that no more than one control input is active at any given time is to use a decoder, as shown in the diagram.,[object Object]
Bus line with three state buffer,[object Object]
Three state buffer,[object Object],To construct a common bus for four registers of n bits each using thee state buffer, we need n circuit with four buffer receives one significant bit from the four registers.,[object Object],Each common output produces one of the lines for the common bus for a total of n lines . Only one decoder is necessary to select between the four registers.,[object Object]
Three-state Bus versus Multiplexer bus,[object Object]
Memory transfer,[object Object],A memory word will be symbolized by the letter M.,[object Object],The particular memory word among the many available is selected by the memory address during the transfer. 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 ,[object Object],Then:,[object Object]
Read operation,[object Object],A read operation: the transfer of information from a memory word to the outside environment.,[object Object],		Read: DR ←  M[AR],[object Object],This causes a transfer of information into DR from the memory word M selected by the address in AR. The write operation transfers the content of a data register to a memory word M selected by the address. Assume that the input data are in register R1 and the address is in AR.,[object Object]
Write operation,[object Object],A write operation: the transfer of new information to be stored into the memory.,[object Object],		Write: M[AR]  ←  R1,[object Object],This causes a transfer of information from R1 into the memory word M selected by the address in AR.,[object Object]
Thanks for watching,[object Object],by: Sanjeev Patel,[object Object]
1 de 27

Recomendados

Memory OrganizationMemory Organization
Memory OrganizationKamal Acharya
31.4K visualizações53 slides
Input Output OrganizationInput Output Organization
Input Output OrganizationKamal Acharya
43.3K visualizações41 slides
Stack organizationStack organization
Stack organizationchauhankapil
14.8K visualizações9 slides
instruction cycle pptinstruction cycle ppt
instruction cycle pptsheetal singh
19.5K visualizações9 slides

Mais conteúdo relacionado

Mais procurados

Parallel processingParallel processing
Parallel processingrajshreemuthiah
8.3K visualizações18 slides
Cache memoryCache memory
Cache memoryAnuj Modi
55K visualizações18 slides
Input output organizationInput output organization
Input output organizationabdulugc
49K visualizações65 slides
Instruction formatInstruction format
Instruction formatSanjeev Patel
76.9K visualizações20 slides

Mais procurados(20)

Computer architecture input output organizationComputer architecture input output organization
Computer architecture input output organization
Mazin Alwaaly15.6K visualizações
Memory organization (Computer architecture)Memory organization (Computer architecture)
Memory organization (Computer architecture)
Sandesh Jonchhe13K visualizações
Parallel processingParallel processing
Parallel processing
rajshreemuthiah8.3K visualizações
Cache memoryCache memory
Cache memory
Anuj Modi55K visualizações
Input output organizationInput output organization
Input output organization
abdulugc49K visualizações
Instruction formatInstruction format
Instruction format
Sanjeev Patel76.9K visualizações
Microprogrammed Control UnitMicroprogrammed Control Unit
Microprogrammed Control Unit
PreethiSureshkumar119.3K visualizações
Asynchronous data transferAsynchronous data transfer
Asynchronous data transfer
priya Nithya7.4K visualizações
MicrooperationsMicrooperations
Microoperations
Rakesh Pillai3.6K visualizações
InterruptsInterrupts
Interrupts
Urwa Shanza14.8K visualizações
Input output interfaceInput output interface
Input output interface
Christ University19.4K visualizações
Computer registersComputer registers
Computer registers
DeepikaT137.4K visualizações
Memory HierarchyMemory Hierarchy
Memory Hierarchy
chauhankapil17.2K visualizações
Instruction Set Architecture (ISA)Instruction Set Architecture (ISA)
Instruction Set Architecture (ISA)
Gaditek6.1K visualizações
instruction format and addressing modesinstruction format and addressing modes
instruction format and addressing modes
RamaPrabha24785 visualizações
InterruptsInterrupts
Interrupts
Albin Panakkal5.9K visualizações
Memory organization in computer architectureMemory organization in computer architecture
Memory organization in computer architecture
Faisal Hussain4.7K visualizações
MultiprocessorMultiprocessor
Multiprocessor
Neel Patel5.9K visualizações
Arithmetic logic shift unitArithmetic logic shift unit
Arithmetic logic shift unit
rishi ram khanal1.4K visualizações
Microprogram Control Microprogram Control
Microprogram Control
Anuj Modi54.2K visualizações

Similar a Register transfer language

Ch4Ch4
Ch4Sanjeev Patel
9.9K visualizações52 slides
COA (Unit_1.pptx)COA (Unit_1.pptx)
COA (Unit_1.pptx)Thapar Institute
28 visualizações253 slides
COA pptx.pptxCOA pptx.pptx
COA pptx.pptxAviPatel398803
15 visualizações54 slides
CO By Rakesh RoshanCO By Rakesh Roshan
CO By Rakesh RoshanRakesh Roshan
9.3K visualizações55 slides
Computer organizationComputer organization
Computer organizationRavikumar843329
76 visualizações20 slides

Similar a Register transfer language(20)

Ch4Ch4
Ch4
Sanjeev Patel9.9K visualizações
REGISTER TRANSFER AND MICRO OPERATIONSREGISTER TRANSFER AND MICRO OPERATIONS
REGISTER TRANSFER AND MICRO OPERATIONS
Anonymous Red581 visualizações
COA (Unit_1.pptx)COA (Unit_1.pptx)
COA (Unit_1.pptx)
Thapar Institute 28 visualizações
COA pptx.pptxCOA pptx.pptx
COA pptx.pptx
AviPatel39880315 visualizações
CO By Rakesh RoshanCO By Rakesh Roshan
CO By Rakesh Roshan
Rakesh Roshan9.3K visualizações
Computer organizationComputer organization
Computer organization
Ravikumar84332976 visualizações
Computer Organization & Architecture.pptComputer Organization & Architecture.ppt
Computer Organization & Architecture.ppt
GauravSharmaIAHAP6 visualizações
Register transfer and micro operationRegister transfer and micro operation
Register transfer and micro operation
Kamal Acharya20.5K visualizações
Register transfer and microoperations part 1Register transfer and microoperations part 1
Register transfer and microoperations part 1
Prasenjit Dey174 visualizações
coacoa
coa
AeshaMehta104 visualizações
Bus and Memory transferBus and Memory transfer
Bus and Memory transfer
mahesh kumar prajapat249 visualizações
Top schools in noidaTop schools in noida
Top schools in noida
Edhole.com227 visualizações
Register referenceRegister reference
Register reference
Nitesh Singh1.3K visualizações
RTLRTL
RTL
Madhusudan Kulkarni523 visualizações
Register Transfer Language & Microoperations.pptRegister Transfer Language & Microoperations.ppt
Register Transfer Language & Microoperations.ppt
AldrianSisican10 visualizações
CO UNIT I PART I NOTES (1).pptCO UNIT I PART I NOTES (1).ppt
CO UNIT I PART I NOTES (1).ppt
AyushiBhatlaITA0015 visualizações
COA LESSON.pptCOA LESSON.ppt
COA LESSON.ppt
FranzLawrenzDeTorres117 visualizações
Chapter 4Chapter 4
Chapter 4
Soumyajit Dutta250 visualizações

Mais de Sanjeev Patel

Unit v export incentivesUnit v export incentives
Unit v export incentivesSanjeev Patel
4.7K visualizações37 slides
Risks involved in importsRisks involved in imports
Risks involved in importsSanjeev Patel
10.3K visualizações64 slides
North america pptNorth america ppt
North america pptSanjeev Patel
34.2K visualizações29 slides
Mib 3.6 unit ii  on 10 09 12Mib 3.6 unit ii  on 10 09 12
Mib 3.6 unit ii on 10 09 12Sanjeev Patel
824 visualizações110 slides

Mais de Sanjeev Patel(20)

Unit v export incentivesUnit v export incentives
Unit v export incentives
Sanjeev Patel4.7K visualizações
Types of letter of credits  on 11 09 2012Types of letter of credits  on 11 09 2012
Types of letter of credits on 11 09 2012
Sanjeev Patel4.6K visualizações
Risks involved in importsRisks involved in imports
Risks involved in imports
Sanjeev Patel10.3K visualizações
Processing of export order on 4 09 12Processing of export order on 4 09 12
Processing of export order on 4 09 12
Sanjeev Patel2K visualizações
North america pptNorth america ppt
North america ppt
Sanjeev Patel34.2K visualizações
Mib 3.6 unit ii  on 10 09 12Mib 3.6 unit ii  on 10 09 12
Mib 3.6 unit ii on 10 09 12
Sanjeev Patel824 visualizações
Mib 3.6 unit 2 on 17 09 2012Mib 3.6 unit 2 on 17 09 2012
Mib 3.6 unit 2 on 17 09 2012
Sanjeev Patel644 visualizações
Mib 3.6 on august 6 th 2012Mib 3.6 on august 6 th 2012
Mib 3.6 on august 6 th 2012
Sanjeev Patel627 visualizações
Mib 3.6 marine insurance  on 09 10 12   copyMib 3.6 marine insurance  on 09 10 12   copy
Mib 3.6 marine insurance on 09 10 12 copy
Sanjeev Patel2.5K visualizações
Mib 3.6 export financing on 1 10 12Mib 3.6 export financing on 1 10 12
Mib 3.6 export financing on 1 10 12
Sanjeev Patel1.1K visualizações
Incoterms on 27th august 2012Incoterms on 27th august 2012
Incoterms on 27th august 2012
Sanjeev Patel1.9K visualizações
Export import control   mainExport import control   main
Export import control main
Sanjeev Patel2.1K visualizações
Mib 3.6  on 14th aug 2012Mib 3.6  on 14th aug 2012
Mib 3.6 on 14th aug 2012
Sanjeev Patel663 visualizações
Teachers day  _Sanjeev_PatelTeachers day  _Sanjeev_Patel
Teachers day _Sanjeev_Patel
Sanjeev Patel1.4K visualizações
Memory reference instructionMemory reference instruction
Memory reference instruction
Sanjeev Patel16.1K visualizações
Logical and shift micro operationsLogical and shift micro operations
Logical and shift micro operations
Sanjeev Patel39.5K visualizações
IntroductionIntroduction
Introduction
Sanjeev Patel2.6K visualizações
Instruction codes and computer registersInstruction codes and computer registers
Instruction codes and computer registers
Sanjeev Patel21.6K visualizações

Último(20)

NS3 Unit 2 Life processes of animals.pptxNS3 Unit 2 Life processes of animals.pptx
NS3 Unit 2 Life processes of animals.pptx
manuelaromero201394 visualizações
Psychology KS4Psychology KS4
Psychology KS4
WestHatch54 visualizações
Structure and Functions of Cell.pdfStructure and Functions of Cell.pdf
Structure and Functions of Cell.pdf
Nithya Murugan256 visualizações
Gopal Chakraborty Memorial Quiz 2.0 Prelims.pptxGopal Chakraborty Memorial Quiz 2.0 Prelims.pptx
Gopal Chakraborty Memorial Quiz 2.0 Prelims.pptx
Debapriya Chakraborty479 visualizações
Sociology KS5Sociology KS5
Sociology KS5
WestHatch52 visualizações
Education and Diversity.pptxEducation and Diversity.pptx
Education and Diversity.pptx
DrHafizKosar87 visualizações
SIMPLE PRESENT TENSE_new.pptxSIMPLE PRESENT TENSE_new.pptx
SIMPLE PRESENT TENSE_new.pptx
nisrinamadani2159 visualizações
UWP OA Week Presentation (1).pptxUWP OA Week Presentation (1).pptx
UWP OA Week Presentation (1).pptx
Jisc65 visualizações
Classification of crude drugs.pptxClassification of crude drugs.pptx
Classification of crude drugs.pptx
GayatriPatra1460 visualizações
ANATOMY AND PHYSIOLOGY UNIT 1 { PART-1}ANATOMY AND PHYSIOLOGY UNIT 1 { PART-1}
ANATOMY AND PHYSIOLOGY UNIT 1 { PART-1}
DR .PALLAVI PATHANIA190 visualizações
Universe revised.pdfUniverse revised.pdf
Universe revised.pdf
DrHafizKosar88 visualizações
Ch. 7 Political Participation and Elections.pptxCh. 7 Political Participation and Elections.pptx
Ch. 7 Political Participation and Elections.pptx
Rommel Regala56 visualizações
Streaming Quiz 2023.pdfStreaming Quiz 2023.pdf
Streaming Quiz 2023.pdf
Quiz Club NITW97 visualizações
Lecture: Open InnovationLecture: Open Innovation
Lecture: Open Innovation
Michal Hron94 visualizações
CWP_23995_2013_17_11_2023_FINAL_ORDER.pdfCWP_23995_2013_17_11_2023_FINAL_ORDER.pdf
CWP_23995_2013_17_11_2023_FINAL_ORDER.pdf
SukhwinderSingh895865480 visualizações
STYP infopack.pdfSTYP infopack.pdf
STYP infopack.pdf
Fundacja Rozwoju Społeczeństwa Przedsiębiorczego159 visualizações

Register transfer language

  • 1.
  • 2.
  • 3.
  • 4.
  • 5.
  • 6.
  • 7.
  • 8.
  • 9.
  • 10.
  • 11.
  • 12.
  • 13.
  • 14.
  • 15.
  • 16.
  • 17.
  • 18.
  • 19.
  • 20.
  • 21.
  • 22.
  • 23.
  • 24.
  • 25.
  • 26.
  • 27.