Chapter 4 Register Transfer and Microoperations

Slides:



Advertisements
Similar presentations
CPEN Digital System Design
Advertisements

Combinational Circuits
Control path Recall that the control path is the physical entity in a processor which: fetches instructions, fetches operands, decodes instructions, schedules.
Chapter 4 Register Transfer and Microoperations
Princess Sumaya Univ. Computer Engineering Dept. د. بســام كحـالــه Dr. Bassam Kahhaleh.
Chapter 7 Henry Hexmoor Registers and RTL
Princess Sumaya University
1 Register Transfer &  -operations Computer Organization Computer Architectures Lab REGISTER TRANSFER AND MICROOPERATIONS Register Transfer Language Register.
8085 processor. Bus system in microprocessor.
Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use Chapter 7 – Registers.
Chapter 7. Register Transfer and Computer Operations
Cpe 252: Computer Organization1 Lo’ai Tawalbeh Lecture #4 Register Transfer and Microoperations 23/2/2006 Chapter 4:
Combinational Logic1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.
Logic and Computer Design Dr. Sanjay P. Ahuja, Ph.D. FIS Distinguished Professor of CIS ( ) School of Computing, UNF.
Chapter2 Digital Components Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2009.
Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F F = x + y’z x y z F Truth Table Boolean Function.
Chapter 8 CPU Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2009.
CS 105 Digital Logic Design
Dr. Bernard Chen Ph.D. University of Central Arkansas
Combinational Logic Chapter 4.
Computer System Configuration and Function Computer Architecture and Design Lecture 6.
Review We have introduced registers previously.
Outline Analysis of Combinational Circuits Signed Number Arithmetic
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
Unit I Digital computer: functional units and their interconnections Mr. Mukul Varshney.
MSI Devices M. Mano & C. Kime: Logic and Computer Design Fundamentals (Chapter 5) Dr. Costas Kyriacou and Dr. Konstantinos Tatas ACOE161 - Digital Logic.
CSC321 Where We’ve Been Binary representations Boolean logic Logic gates – combinational circuits Flip-flops – sequential circuits Complex gates – modules.
Chapter 4 Register Transfer and Micro -operations
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
REGISTER TRANSFER AND MICROOPERATIONS
Digital Logic Structures: Chapter 3 COMP 2610 Dr. James Money COMP
Lecture 9 Topics: –Combinational circuits Basic concepts Examples of typical combinational circuits –Half-adder –Full-adder –Ripple-Carry adder –Decoder.
Computer System Architecture © Korea Univ. of Tech. & Edu. Dept. of Info. & Comm. Chap. 4 Register Transfer and Microoperations 4-1 Chap. 4 Register Transfer.
Exam2 Review Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2009.
Chap 7. Register Transfers and Datapaths. 7.1 Datapaths and Operations Two types of modules of digital systems –Datapath perform data-processing operations.
7-6 단일 레지스터에서 Microoperation Multiplexer-Based Transfer  Register 가 서로 다른 시간에 둘 이상의 source 에서 data 를 받을 경우 If (K1=1) then (R0 ←R1) else if (K2=1) then.
REGISTER TRANSFER & MICROOPERATIONS By Sohaib. Digital System Overview  Each module is built from digital components  Registers  Decoders  Arithmetic.
1 Chapter Four Register Transfer and Micro operations.
Micro Operation. MICROOPERATIONS Computer system microoperations are of four types: - Register transfer microoperations - Arithmetic microoperations -
4. Computer Maths and Logic 4.2 Boolean Logic Logic Circuits.
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 7 – Registers and Register Transfers Part.
ARITHMETIC MICRO OPERATIONS
CS 105 DIGITAL LOGIC DESIGN Chapter 4 Combinational Logic 1.
Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use ECE/CS 352: Digital Systems.
1 Outline Bus Transfer Memory Transfer Microoperations.
1 Chapter 7 Henry Hexmoor Registers and RTL. REGISTER TRANSFER AND MICROOPERATIONS Register Transfer Language Register Transfer Bus and Memory Transfers.
Magnitude Comparator A magnitude comparator is a combinational circuit that compares two numbers, A and B, and then determines their relative magnitudes.
Register Transfer Languages (RTL)
COMBINATIONAL LOGIC.
Chapter 4 Register Transfer and Microoperations Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2010.
ECEG-3202: Computer Architecture and Organization, Dept of ECE, AAU 1 Register Transfer & Microoperations.
ECE 3110: Introduction to Digital Systems Chapter 5 Combinational Logic Design Practices Adders,subtractors, ALUs.
Logic Design (CE1111 ) Lecture 4 (Chapter 4) Combinational Logic Prepared by Dr. Lamiaa Elshenawy 1.
1 Register Transfer and Microoperations Acknowledgment: Most of the slides are adapted from Prof. Hyunsoo Yoon’s slides.
1 REGISTER TRANSFER & MICROOPERATIONS. 2 OUTLINES Register Transfer Language Register Transfer Bus and Memory Transfers Arithmetic Microoperations Logic.
ACOE161 (Spring2007)MSI Devices1 Revision on MSI Devices M. Mano & C. Kime: Logic and Computer Design Fundamentals (Chapter 5)
REGISTER TRANSFER AND MICROOPERATIONS
REGISTER TRANSFER AND MICROOPERATIONS
Chapter 4 Register Transfer and Microoperations
Chap 7. Register Transfers and Datapaths
KU College of Engineering Elec 204: Digital Systems Design
Register Transfer and Microoperations
Combinational Circuits
REGISTER TRANSFER LANGUAGE AND DESIGN OF CONTROL UNIT
HALF ADDER FULL ADDER Half Subtractor.
By: A. H. Abdul Hafez CAO, by Dr. A.H. Abdul Hafez, CE Dept. HKU
XOR Function Logic Symbol  Description  Truth Table 
CHAPTER-3 REGISTER TRANSFER LANGUAGE AND MICROOPERATIONS
Instruction execution and ALU
Computer Architecture
Presentation transcript:

Chapter 4 Register Transfer and Microoperations Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2009

Outline Bus Transfer Memory Transfer Microoperations

This Chapter contains A basic computer: 1. The set of registers and their functions; 2. The sequence of microoperations; 3. The control that initiates the sequence of microoperations

Register Transfer Data can move from register to register. Digital logic used to process data for example: C  A + B Register A Register B Register C Digital Logic Circuits

Building a Computer Needs: processing storage communication 5

Multiplexer-Based Transfer for TWO 4-bit registers 1 Use of Multiplexers to Select between Two Registers 6

Bus Transfer For register R0 to R3 in a 4 bit system 4-line common bus S1 S0 Register D Register C Register B Register A Used for lowest bit Used for highest bit from each register

Question For register R0 to R63 in a 16 bit system: What is the MUX size we use? How many MUX we need? How many select bit?

Three-State Bus Buffers A bus system can be constructed with three-state gates instead of multiplexers Tri-State : 0, 1, High-impedance(Open circuit) Buffer A device designed to be inserted between other devices to match impedance, to prevent mixed interactions, and to supply additional drive or relay capability

Tri-state buffer gate Tri-state buffer gate : Fig. 4-4 When control input =1 : The output is enabled(output Y = input A) When control input =0 : The output is disabled(output Y = high-impedance) Normal input A If C=1, Output Y = A If C=0, Output = High-impedance Control input C

The construction of a bus system with tri-state buffer D0 Select input Enable input

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

Memory Read and Write AR: address register DR: data register Read: DR  M[AR] Write: M[AR]  R1

Arithmetic Microoperations Symbolic designation Description R3 ← R1 + R2 Contents of R1 plus R2 transferred to R3 R3 ← R1 – R2 Contents of R1 minus R2 transferred to R3 R2 ← R2 Complement the contents of R2 (1’s complement) R2 ← R2 + 1 2’s Complement the contents of R2 (negate) R3 ← R1 + R2 + 1 R1 plus the 2’s complement of R2 (subtract) R1 ← R1 + 1 Increment the contents of R1 by one R1 ← R1 – 1 Decrement the contents of R1 by one Multiplication and division are not basic arithmetic operations Multiplication : R0 = R1 * R2 Division : R0 = R1 / R2

Arithmetic Microoperations A single circuit does both arithmetic addition and subtraction depending on control signals. • Arithmetic addition: R3  R1 + R2 (Here + is not logical OR. It denotes addition)

Arithmetic Microoperations Arithmetic subtraction: R3 R1 + R2 + 1 where R2 is the 1’s complement of R2. Adding 1 to the one’s complement is equivalent to taking the 2’s complement of R2 and adding it to R1.

BINARY ADDER Binary adder is constructed with full-adder circuits connected in cascade.

BINARY ADDER-SUBTRACTOR • The addition and subtraction operations cane be combined into one common circuit by including an exclusive-OR gate with each full-adder. XOR M b 0 0 0 0 1 1 1 0 1 1 1 0

BINARY ADDER-SUBTRACTOR  • M = 0: Note that B XOR 0 = B. This is exactly the same as the binary adder with carry in C0 = 0. M = 1: Note that B XOR 1 = B (flip all B bits). The outputs of the XOR gates are thus the 1’s complement of B. M = 1 also provides a carry in 1. The entire operation is: A + B + 1.

BINARY ADDER-SUBTRACTOR

4-bit Binary Incrementer Adds one to a number in a register Sequential circuit implementation using binary counter Combinational circuit implementation using Half Adder The least significant HA bit is connected to logic-1 The output carry from one HA is connected to the input of the next-higher-order HA

4-bit Binary Incrementer B3 B2 B1 B0 1 Always added to 1 C4 S3 S2 S1 S0