## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

Henry HenryHexmoor Hexmoor

1

1

**REGISTER TRANSFER AND MICROOPERATIONS
**

• Register Transfer Language • Register Transfer • Bus and Memory Transfers • Arithmetic Microoperations • Logic Microoperations • Shift Microoperations • Arithmetic Logic Shift Unit

Henry Hexmoor

2

**SIMPLE DIGITAL SYSTEMS
**

• Combinational and sequential circuits can be used to create simple digital systems.

• These are the low-level building blocks of a digital computer. • Simple digital systems are frequently characterized in terms of

– the registers they contain, and – the operations that they perform.

• Typically,

– What operations are performed on the data in the registers – What information is passed between registers

Henry Hexmoor

3

Register Transfer Language

MICROOPERATIONS (1)

• The operations on the data in registers are called microoperations. • The functions built into registers are examples of microoperations

– – – – – Shift Load Clear Increment …

Henry Hexmoor

4

subtract. load. increment. on the information stored in one or more registers Registers (R) ALU (f) 1 clock cycle R f(R. or. complement. add. clear. R) f: shift. and. xor.Register Transfer Language MICROOPERATION (2) An elementary operation performed (during one clock pulse). … 5 Henry Hexmoor .

Register Transfer Language ORGANIZATION OF A DIGITAL SYSTEM • Definition of the (internal) organization of a computer .Microoperations set Set of allowable microoperations provided by the organization of the computer .Set of registers and their functions .Control signals that initiate the sequence of microoperations (to perform the functions) Henry Hexmoor 6 .

Henry Hexmoor 7 . and – The data transfers between them. in this way is called the register transfer level • This is because we’re focusing on – The system’s registers – The data transformations in them.Register Transfer Language REGISTER TRANSFER LEVEL • Viewing a computer. or any digital system.

Henry Hexmoor 8 . a specific notation is used. register transfer language • For any function of the computer. the register transfer language can be used to describe the (sequence of) microoperations • Register transfer language – A symbolic language – A convenient tool for describing the internal organization of digital computers – Can also be used to facilitate the design process of digital systems.Register Transfer Language REGISTER TRANSFER LANGUAGE • Rather than specifying a digital system in words.

.memory address register . A. R13. IR) • Often the names indicate function: – MAR – PC – IR .program counter .g.Register Transfer Language DESIGNATION OF REGISTERS • Registers are designated by capital letters. sometimes followed by numbers (e.instruction register • Registers and their contents can be viewed and represented in various ways – A register can be viewed as a single entity: MAR – Registers may also be represented showing the bits of data they contain Henry Hexmoor 9 .

portion of a register .Register Transfer Language DESIGNATION OF REGISTERS • Designation of a register .a bit of a register • Common ways of drawing the block diagram of a register Register Showing individual bits R1 15 0 15 7 6 5 4 8 7 3 2 1 0 0 R2 Numbering of bits PC(H) Subfields PC(L) Henry Hexmoor 10 .a register .

i. during one clock pulse – Note that this is a non-destructive.e.Register Transfer REGISTER TRANSFER • Copying the contents of one register to another is a register transfer • A register transfer is indicated as R2 R1 – In this case the contents of register R1 are copied (loaded) into register R2 – A simultaneous transfer of all bits from the source R1 to the destination register R2. the contents of R1 are not altered by copying (loading) them to R2 Henry Hexmoor 11 .

Register Transfer REGISTER TRANSFER • A register transfer such as R3 R5 Implies that the digital system has – the data lines from the source register (R5) to the destination register (R3) – Parallel load in the destination register (R3) – Control lines to perform the action Henry Hexmoor 12 .

. i. this is often done via a control signal.Register Transfer CONTROL FUNCTIONS • Often actions need to only occur if a certain condition is true • This is similar to an “if” statement in a programming language • In digital systems. called a control function – If the signal is 1. then load the contents of register R1 into register R2”. if (P = 1) then (R2 R1) Henry Hexmoor 13 . the action takes place • This is represented as: P: R2 R1 Which means “if P = 1.e.

Register Transfer HARDWARE IMPLEMENTATION OF CONTROLLED TRANSFERS Implementation of controlled transfer P: R2 R1 Block diagram Control Circuit P Load R2 n Clock R1 Timing diagram Clock Load t t+1 Transfer occurs here • The same clock controls the circuits that generate the control function and the destination register • Registers are assumed to use positive-edge-triggered flip-flops Henry Hexmoor 14 .

MAR IR • Here. they are separated with commas P: R3 R5. if the control function P = 1. and at the same time (clock).Register Transfer SIMULTANEOUS OPERATIONS • If two or more operations are to occur simultaneously. load the contents of register IR into register MAR Henry Hexmoor 15 . load the contents of R5 into R3.

B A Henry Hexmoor 16 . Separates two micro-operations A B. R2(L) Arrow Denotes transfer of information R2 R1 Colon : Denotes termination of control function P: Comma .Register Transfer BASIC SYMBOLS FOR REGISTER TRANSFERS Symbols Description Examples Capital letters Denotes a register MAR. R2 & numerals Parentheses () Denotes a part of a register R2(0-7).

take a different approach • Have one centralized set of circuits for data transfer – the bus • Have control circuits to select which register is the source.Register Transfer CONNECTING REGISTRS • In a digital system with many registers. and which is the destination Henry Hexmoor 17 . it is impractical to have data and control lines to directly allow each register to be loaded with the contents of every possible other registers • To completely connect n registers n(n-1) lines • O(n2) cost – This is not a realistic approach to use in a large digital system • Instead.

From a register to bus: BUS R Register A Register B Register C Register D Bus lines Register A 1 2 3 4 Register B 1 2 3 4 Register C 1 2 3 4 Register D 1 2 3 4 B1 C1 D 1 0 4 x1 MUX 0 B2 C2 D 2 4 x1 MUX 0 B3 C3 D 3 4 x1 MUX 0 B4 C4 D 4 4 x1 MUX x select y Henry Hexmoor 4-line bus 18 .Bus and Memory Transfers BUS AND BUS TRANSFER Bus is a path(of a group of wires) over which information is transferred. from any of several sources to any of several destinations.

R0 Reg. R1 Reg.Bus and Memory Transfers TRANSFER FROM BUS TO A DESTINATION REGISTER Bus lines Load Reg. R2 Reg. R3 z Select w D 0 D1 D2 D 3 2x4 Decoder E (enable) Three-State Bus Buffers Normal input A Control input C Output Y=A if C=1 High-impedence if C=0 Bus line with three-state buffers A0 B0 C0 D0 Select Enable Henry Hexmoor Bus line for bit 0 S0 S1 19 0 1 2 3 .

but in the latter. it is explicitly indicated Henry Hexmoor 20 .Bus and Memory Transfers BUS TRANSFER IN RTL • Depending on whether the bus is to be mentioned explicitly or not. R2 BUS • In the former case the bus is implicit. register transfer can be indicated as either R2 R1 or BUS R1.

Bus and Memory Transfers MEMORY (RAM) • Memory (RAM) can be thought as a sequential circuits containing some number of registers • These registers hold the words of memory • Each of the r registers is indicated by an address • These addresses range from 0 to r-1 • Each register (word) can hold n bits of data • Assume the RAM contains r = 2k words. It needs the following – – – – – n data input lines n data output lines k address lines A Read control line A Write control line data input lines n address lines k Read Write n Henry Hexmoor RAM unit data output lines 21 .

we must specify which address in memory we will be using • This is done by indexing memory references • Memory is usually accessed in computer systems by putting the desired address in a special register. M. the memory is viewed at the register level as a device. or AR) • When memory is accessed.Bus and Memory Transfers MEMORY TRANSFER • Collectively. the contents of the MAR get sent to the memory unit’s address lines M AR Memory unit Read Write Data in Data out Henry Hexmoor 22 . the Memory Address Register (MAR. • Since it contains multiple locations.

the register transfer language notation looks like this: R1 M[MAR] • This causes the following to occur – The contents of the MAR get sent to the memory address lines – A Read (= 1) gets sent to the memory unit – The contents of the specified address are put on the memory’s output data lines – These get sent over the bus to be loaded into register R1 Henry Hexmoor 23 .Bus and Memory Transfers MEMORY READ • To read a value from a location in memory and load it into a register.

Bus and Memory Transfers MEMORY WRITE • To write a value from a register to a location in memory looks like this in register transfer language: M[MAR] R1 • This causes the following to occur – The contents of the MAR get sent to the memory address lines – A Write (= 1) gets sent to the memory unit – The values in register R1 get sent over the bus to the data input lines of the memory – The values get loaded into the specified address in the memory Henry Hexmoor 24 .

transfer content of bus A into R2 Address register Data register Memory word specified by reg. B into reg. TRANSFER MICROOPERATIONS A B Transfer content of reg. R2 ABUS AR AR DR M[R] M DR M M DR Transfer content of AD portion of reg. AR Transfer a binary constant into reg. DR into reg. at the same time.Bus and Memory Transfers SUMMARY OF R. A DR(AD) A constant ABUS R1. R Equivalent to M[AR] Memory read operation: transfers content of memory word specified by AR into DR Memory write operation: transfers content of DR into memory word specified by AR Henry Hexmoor 25 . A Transfer content of R1 into bus A and.

Arithmetic microoperations .Logic microoperations .Arithmetic Microoperations MICROOPERATIONS • Computer system microoperations are of four types: .Register transfer microoperations .Shift microoperations Henry Hexmoor 26 .

Arithmetic Microoperations ARITHMETIC MICROOPERATIONS • The basic arithmetic microoperations are – – – – Addition Subtraction Increment Decrement • The additional arithmetic microoperations are – – – – Add with carry Subtract with borrow Transfer/Load etc.1 Contents of R1 plus R2 transferred to R3 Contents of R1 minus R2 transferred to R3 Complement the contents of R2 2's complement the contents of R2 (negate) subtraction Increment Decrement 27 Henry Hexmoor .R2 R2 R2’ R2 R2’+ 1 R3 R1 + R2’+ 1 R1 R1 + 1 R1 R1 . … Summary of Typical Arithmetic Micro-Operations R3 R1 + R2 R3 R1 .

Arithmetic Microoperations BINARY ADDER / SUBTRACTOR / INCREMENTER B3 A3 FA C3 B2 FA A2 C2 B1 FA A1 C1 B0 FA A0 C0 Binary Adder C4 S3 B3 A3 B2 S2 A2 B1 S1 A1 B0 S0 A0 Binary Adder-Subtractor M FA C3 FA C2 FA C1 FA C0 C4 S3 A3 S2 A2 S1 A1 S0 A0 1 Binary Incrementer x y S x y S x y S x y S HA C HA C HA C HA C Henry Hexmoor C4 S3 S2 S1 S0 28 .

Arithmetic Microoperations ARITHMETIC CIRCUIT Cin S1 S0 A0 B0 S1 S0 0 4x1 1 MUX 2 3 S1 S0 0 4x1 1 MUX 2 3 S1 S0 0 4x1 1 MUX 2 3 S1 S0 0 4x1 1 MUX 2 3 0 1 X0 C0 D0 C1 FA Y0 A1 B1 X1 C1 FA Y1 C2 D1 A2 B2 X2 C2 FA Y2 C3 D2 A3 B3 X3 C3 FA Y3 C4 D3 Cout S1 S0 0 0 0 0 0 1 0 1 1 0 1 0 1 1 Henry Hexmoor 1 1 Cin 0 1 0 1 0 1 0 1 Y B B B’ B’ 0 0 1 1 Output D=A+B D=A+B+1 D = A + B’ D = A + B’+ 1 D=A D=A+1 D=A-1 D=A 29 Microoperation Add Add with carry Subtract with borrow Subtract Transfer A Increment A Decrement A Transfer A .

OR (). XOR (). i. 16 different logic functions that can be defined over two binary input variables A 0 0 1 1 B F0 0 0 1 0 0 0 1 0 F1 0 0 0 1 F2 … F13 0 … 1 0 … 1 1 … 0 0 … 1 F14 1 1 1 0 F15 1 1 1 1 • However.Logic Microoperations LOGIC MICROOPERATIONS • Specify binary operations on the strings of bits in registers – Logic microoperations are bit-wise operations. in principle. most systems only implement four of these – AND ().. they work on the individual bits of data – useful for bit manipulations on binary data – useful for making logical decisions based on the bit value • There are. Complement/NOT • The others can be created from combination of these Henry Hexmoor 30 .e.

n binary vars → 2 2 functions • Truth tables for 16 functions of 2 variables and the corresponding 16 logic micro-operations x 0011 y 0101 0000 0001 0010 0011 0100 0101 0110 0111 1000 1001 1010 1011 1100 1101 1110 1111 Boolean Function F0 = 0 F1 = xy F2 = xy' F3 = x F4 = x'y F5 = y F6 = x y F7 = x + y F8 = (x + y)' F9 = (x y)' F10 = y' F11 = x + y' F12 = x' F13 = x' + y F14 = (xy)' F15 = 1 MicroName Operations F0 Clear FAB AND F A B’ FA Transfer A F A’ B FB Transfer B FAB Exclusive-OR FAB OR F A B)’ NOR F (A B)’ Exclusive-NOR F B’ Complement B FAB F A’ Complement A F A’ B F (A B)’ NAND F all 1's Set to all 1's 31 Henry Hexmoor . n .Logic Microoperations LIST OF LOGIC MICROOPERATIONS • List of Logic Microoperations .16 different logic operations with 2 binary vars.

Logic Microoperations HARDWARE IMPLEMENTATION OF LOGIC MICROOPERATIONS Ai Bi 0 1 2 3 Select S1 S0 4X1 MUX Fi Function table S1 0 0 1 1 S0 0 1 0 1 Output F=AB F = AB F=AB F = A’ -operation AND OR XOR Complement Henry Hexmoor 32 .

B.. In another register.. is bit data that will be used to modify the contents of A – – – – – – – – Selective-set Selective-complement Selective-clear Mask (Delete) Clear Insert Compare .Logic Microoperations APPLICATIONS OF LOGIC MICROOPERATIONS • Logic microoperations can be used to manipulate individual bits or a portions of a word in a register • Consider the data in a register A. AA+B AAB A A • B’ AA•B AAB A (A • B) + C AAB Henry Hexmoor 33 .

the bit pattern in B is used to set certain bits in A 1100 1010 1110 At B At+1 (A A + B) • If a bit in B is set to 1. otherwise that bit in A keeps its previous value Henry Hexmoor 34 . that same position in A gets set to 1.Logic Microoperations SELECTIVE SET • In a selective set operation.

Logic Microoperations SELECTIVE COMPLEMENT • In a selective complement operation. the bit pattern in B is used to complement certain bits in A 1100 1010 0110 At B At+1 (A A B) • If a bit in B is set to 1. otherwise it is unchanged Henry Hexmoor 35 . that same position in A gets complemented from its original value.

Logic Microoperations SELECTIVE CLEAR • In a selective clear operation. that same position in A gets set to 0. otherwise it is unchanged Henry Hexmoor 36 . the bit pattern in B is used to clear certain bits in A 1100 1010 0100 At B At+1 (A A B’) • If a bit in B is set to 1.

Logic Microoperations MASK OPERATION • In a mask operation. that same position in A gets set to 0. otherwise it is unchanged Henry Hexmoor 37 . the bit pattern in B is used to clear certain bits in A 1100 1010 1000 At B At+1 (A A B) • If a bit in B is set to 0.

if the bits in the same position in A and B are the same. otherwise they are set in A 1100 1010 0110 At B At+1 (A A B) Henry Hexmoor 38 . they are cleared in A.Logic Microoperations CLEAR OPERATION • In a clear operation.

leaving the other bit positions unchanged • This is done as – A mask operation to clear the desired bit positions. followed by – An OR operation to introduce the new bits into the desired positions – Example » Suppose you wanted to introduce 1010 into the low order four bits of A: 1101 1000 1011 0001 A (Original) 1101 1000 1011 1010 A (Desired) » 1101 1111 1101 0000 1101 Henry Hexmoor 1000 1111 1000 0000 1000 1011 1111 1011 0000 1011 0001 0000 0000 1010 1010 A (Original) Mask A (Intermediate) Added bits A (Desired) 39 .Logic Microoperations INSERT OPERATION • An insert operation is used to introduce a specific bit pattern into A register.

the following notation is used – shl for a logical shift left – shr for a logical shift right – Examples: » R2 shr R2 » R3 shl R3 Henry Hexmoor 40 . • A right logical shift operation: 0 • A left logical shift operation: 0 • In a Register Transfer Language.Shift Microoperations LOGICAL SHIFT • In a logical shift the serial input to the shift is a 0.

Shift Microoperations CIRCULAR SHIFT • In a circular shift the serial input is the bit that is shifted out of the other end of the register. • A right circular shift operation: • A left circular shift operation: • In a RTL. the following notation is used – cil for a circular shift left – cir for a circular shift right – Examples: » R2 cir R2 » R3 cil R3 Henry Hexmoor 41 .

Logical versus Arithmetic Shift • A logical shift fills the newly created bit position with zero: 0 CF • An arithmetic shift fills the newly created bit position with a copy of the number’s sign bit: CF Henry Hexmoor 42 .

the following notation is used – ashl for an arithmetic shift left – ashr for an arithmetic shift right – Examples: » R2 ashr R2 » R3 ashl R3 Henry Hexmoor 43 . the shift will result in an overflow • In a RTL.Shift Microoperations ARITHMETIC SHIFT • An left arithmetic shift operation must be checked for the overflow 0 sign bit V Before the shift. if the leftmost two bits differ.

Shift Microoperations HARDWARE IMPLEMENTATION OF SHIFT MICROOPERATIONS Serial input (IR) 0 for shift right (down) Select 1 for shift left (up) S 0 1 A0 A1 A2 A3 S 0 1 MUX MUX H0 H1 S 0 1 MUX H2 S 0 1 Serial input (IL) Henry Hexmoor MUX H3 44 .

Shift Microoperations ARITHMETIC LOGIC SHIFT UNIT S3 S2 S1 S0 Ci Arithmetic D i Circuit Select Ci+1 0 1 2 3 Ei shr shl 4x1 MUX Fi Bi Ai Ai-1 Ai+1 Logic Circuit S3 S2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 1 0 1 1 0 1 1 Henry Hexmoor S1 S0 0 0 0 0 0 1 0 1 1 0 1 0 1 1 1 1 0 0 0 1 1 0 1 1 X X X X Cin 0 1 0 1 0 1 0 1 X X X X X X Operation F=A F=A+1 F=A+B F=A+B+1 F = A + B’ F = A + B’+ 1 F=A-1 F=A F=AB F = A B F=AB F = A’ F = shr A F = shl A Function Transfer A Increment A Addition Add with carry Subtract with borrow Subtraction Decrement A TransferA AND OR XOR Complement A Shift right A into F Shift left A into F 45 .

2. A Switch-tail ring counter (John counter) uses the complement of the serial output of a right shift register as its serial input. 6. (Q7-9a) 2. (Q7-18) Henry Hexmoor 46 . list the sequence of states after each shift until the register returns to 0000. Use D-type flip flops and gates to design a counter with the following repeated binary sequence: 0. 3. 1. Starting from an initial state 0000. 4.HW 7 1.

- E560_BCU01_CS
- tygas b inggris
- Ch7 Sequential
- Flip flops
- Low Power FF
- 14-Testbenches
- Transition Count Testing of Com Bi National Logic Circuits-IEEE
- 141302-Digital Principles and System Design Notes
- Lab6 Circuite One Shot Sincronizare
- CM305.51E
- lect.43
- 9A15502 Digital System Design
- hh
- VL7301
- VHDL Coding Rules
- 74LS90.pdf
- AM29BL162C
- Flip Flops D
- Computer Science 37 Hw 5
- EE M16 - Logic Design of Digital Systems
- Verilog HDL
- Setup
- Fire Wire
- Ecad Lab Manual MLWEC
- DLC- Unit 2
- Lab Guidelines for BFM2313 Digital Electronics
- Logik Gate
- Top 10 Hpasmcli Commands
- DigDesignCh07L2
- Batch 13

- UT Dallas Syllabus for cs4341.0u1.11u taught by Miguel Razo Razo (mrazora)
- UT Dallas Syllabus for ee2310.001 05f taught by Nathan Dodge (dodge)
- UT Dallas Syllabus for ce3320.002.11s taught by Mehrdad Nourani (nourani)
- UT Dallas Syllabus for ee2310.002 05s taught by William Pervin (pervin)
- UT Dallas Syllabus for ce3320.002.10s taught by Mehrdad Nourani (nourani)
- UT Dallas Syllabus for cs4341.002.10f taught by Miguel Razo Razo (mrazora)
- Global digital video news distribution system (US patent 5991801)
- Faults in Digital VLSI Circuits
- UT Dallas Syllabus for cs4341.001.09s taught by (moldovan)
- UT Dallas Syllabus for ee3320.002.07s taught by Dian Zhou (zhoud)
- UT Dallas Syllabus for ee3320.001 05f taught by Poras Balsara (poras)
- Digital Technology Services Group Memo
- UT Dallas Syllabus for eedg6301.001.11s taught by Mehrdad Nourani (nourani)
- UT Dallas Syllabus for ee3320.002 06f taught by Poras Balsara (poras)
- UT Dallas Syllabus for ee3120.501 05f taught by Andrew Cilia (axc018100)
- UT Dallas Syllabus for ee3320.002.08s taught by Mehrdad Nourani (nourani)
- UT Dallas Syllabus for ee3320.001.09f taught by (mxa086100)
- An Efficient Concurrent BIST for Rom Module
- UT Dallas Syllabus for ee3320.002.09f taught by Poras Balsara (poras)
- Implementation and Performance Analysis of a Vedic Multiplier Using Tanner EDA Tool
- UT Dallas Syllabus for ee6303.501 05s taught by Mehrdad Nourani (nourani)
- UT Dallas Syllabus for ee3320.001.08s taught by Dinesh Bhatia (dinesh)
- UT Dallas Syllabus for cs2110.521 05u taught by Herman Harrison (hxh017200)
- UT Dallas Syllabus for cs4341.001.11s taught by Miguel Razo Razo (mrazora)
- UT Dallas Syllabus for ee6301.001.10s taught by Mehrdad Nourani (nourani)
- UT Dallas Syllabus for ee6301.001.08s taught by Mehrdad Nourani (nourani)
- UT Dallas Syllabus for ee3320.001.07s taught by Dinesh Bhatia (dinesh)
- UT Dallas Syllabus for ee3320.001.10f taught by Dinesh Bhatia (dinesh)

- Bca Edited FINAL
- Nepal Budget 2070
- BIT 2nd Sem (11-01-2069)
- Intelligent Web Mining
- BIT Course Proposed-Structure Final
- What is Pipelining
- BCA-IV Updated Syllabus
- Binary and Decimal Numbers
- BIT Course Proposed-Structure Final1
- Unit 02 - Microoperations
- BCA Syllabus
- Bca_3 - Web Design and Client Side Scripting
- BCA Proposed Course Structure Final
- Basic Computer Architecture
- newsyllabus_3_4.docx123
- 5. Project III
- Management System
- BCA 2nd Sem (11-01-2069)
- List of Questions for BE Comp
- 0. Course Outline
- What is Pipelining
- 2. Microprocessor & Assembly Language
- Fixed-Point and Floating-point Numbers
- 3. Data Structure & Algorithm
- 1. System Analysis & Design
- 4. User Interface Design
- 6. Numerical Methods
- Error Detection - Correction
- Digital Design
- Decimal Floating-Point Arithmetic

Sign up to vote on this title

UsefulNot usefulClose Dialog## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

Close Dialog## This title now requires a credit

Use one of your book credits to continue reading from where you left off, or restart the preview.

Loading