CS 140 Lecture 17 System Designs III Professor CK Cheng CSE Dept. UC San Diego 1.

Slides:



Advertisements
Similar presentations
CS 140 Lecture 16 System Designs Professor CK Cheng CSE Dept. UC San Diego 1.
Advertisements

Chapter 4 Register Transfer and Microoperations
Princess Sumaya University
1 CS 140L Lecture 8 System Design Professor CK Cheng CSE Dept. UC San Diego.
Princess Sumaya Univ. Computer Engineering Dept. Chapter 2: IT Students.
CS 140 Lecture 10 Sequential Networks: Implementation Professor CK Cheng CSE Dept. UC San Diego 1.
1 Register Transfer &  -operations Computer Organization Computer Architectures Lab REGISTER TRANSFER AND MICROOPERATIONS Register Transfer Language Register.
CS 140L Lecture 5 Professor CK Cheng CSE Dept. UC San Diego.
1 CS 140 Lecture 12 Standard Combinational Modules Professor CK Cheng CSE Dept. UC San Diego.
CS 140 Lecture 17 Professor CK Cheng 11/26/02. System Designs 1.Intro 2.Spec 3.Implementation.
CS 140 Lecture 11 Professor CK Cheng 5/09/02. Part III - Standard Modules Decoder, Encoder, Mux, DeMux, Shifter, Adder, Multiplexer Interconnect: Decoder,
1 CS 140 Lecture 19 Sequential Modules Professor CK Cheng CSE Dept. UC San Diego.
CSE 140 Lecture 8 Sequential Networks Professor CK Cheng CSE Dept. UC San Diego 1.
CS 140 Lecture 16 System Designs Professor CK Cheng CSE Dept. UC San Diego 1.
CS 140L Lecture 5: Counters Professor CK Cheng CSE Dept. UC San Diego 1.
CS 140 Lecture 8 Sequential Networks Professor CK Cheng CSE Dept. UC San Diego.
CSE 140L Lecture 4 Flip-Flops, Shifters and Counters Professor CK Cheng CSE Dept. UC San Diego.
CS 140 Lecture 13 Combinational Standard Modules Professor CK Cheng CSE Dept. UC San Diego 1.
1 Lecture 1: Introduction to Digital Logic Design CK Cheng CSE Dept. UC San Diego.
1 Lecture 1: Introduction to Digital Logic Design CK Cheng CSE Dept. UC San Diego.
Midterm Wednesday Chapter 1-3: Number /character representation and conversion Number arithmetic Combinational logic elements and design (DeMorgan’s Law)
CS 140 Lecture 17 System Designs III Professor CK Cheng CSE Dept. UC San Diego 1.
CS 140 Lecture 18 Professor CK Cheng 6/04/02. Part IV. System Designs Algorithm: { Input X, Y type bit-vector, start type boolean; Local-Object A, B type.
CS 140 Lecture 12 Professor CK Cheng 11/07/02. Part III - Standard Modules Decoder, Encoder, Mux, DeMux, Shifter, Adder, Multiplexer Interconnect: Decoder,
CS 140 Lecture 4 Combinational Logic: K-Map Professor CK Cheng CSE Dept. UC San Diego 1.
1 CSE20 Lecture 16 Boolean Algebra: Applications Professor CK Cheng CSE Dept. UC San Diego 1.
1 CS 140 Lecture 18 Sequential Modules: Serial Adders, Multipliers Professor CK Cheng CSE Dept. UC San Diego.
CS 140 Lecture 5 Professor CK Cheng CSE Dept. UC San Diego.
CS 140L Lecture 7 Transformation between Mealy and Moore Machines Professor CK Cheng CSE Dept. UC San Diego.
CS 140 Lecture 5 Professor CK Cheng CSE Dept. UC San Diego 1.
CS 140 Lecture 19 Professor CK Cheng 12/05/02. Sequential Machine Standard Modules Combinational Sequential System Designs.
CSE 140 Lecture 15 System Designs Professor CK Cheng CSE Dept. UC San Diego 1.
CS 140L Lecture 4 Professor CK Cheng 10/22/02. 1)F-F 2)Shift register 3)Counter (Asynchronous) 4)Counter (Synchronous)
1 CSE 140 Lecture 12 Standard Combinational Modules Professor CK Cheng CSE Dept. UC San Diego.
Computer System Configuration and Function Computer Architecture and Design Lecture 6.
1 Lecture 1: Introduction to Digital Logic Design CK Cheng CSE Dept. UC San Diego.
CSE 140 Lecture 12 Combinational Standard Modules CK Cheng CSE Dept. UC San Diego 1.
Chapter 4 Register Transfer and Microoperations Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2010.
1 CSE 140 Lecture 11 Standard Combinational Modules CK Cheng CSE Dept. UC San Diego.
CSE 140 Lecture 13 Combinational Standard Modules Professor CK Cheng CSE Dept. UC San Diego 1.
CSE 140 Lecture 12 Combinational Standard Modules CK Cheng CSE Dept. UC San Diego 1.
CSE 140 Lecture 15 System Design II CK Cheng CSE Dept. UC San Diego 1.
Exercise 4.1 Different instructions utilize different hardware blocks in the basic single-cycle implementation. The next three problems in this exercise.
CSE 140 Lecture 13 System Designs
CSE 140 Lecture 14 System Designs
CSE 140 Lecture 14 System Designs
Chapter 4 Register Transfer and Microoperations
CSE 140 Lecture 12 Combinational Standard Modules
Computer Organization and Design
Overview Instruction Codes Computer Registers Computer Instructions
CSE 140 Lecture 16 System Designs
CSE 140 Lecture 12 Combinational Standard Modules
CSE 140 Lecture 11 Standard Combinational Modules
CSE 140 Lecture 15 System Designs
ECEG-3202 Computer Architecture and Organization
CSE 140 Lecture 17 System Design II
CS 140 Lecture 16 Professor CK Cheng 11/21/02.
ECEG-3202 Computer Architecture and Organization
CSE 140 Lecture 14 System Design
CS 140 Lecture 19 Standard Modules
CS 140 Lecture 15 Sequential Modules
CSE 140 Lecture 16 System Designs II
Professor CK Cheng CSE Dept. UC San Diego
Control Unit for Multiple Cycle Implementation
Course Outline for Computer Architecture
CS 140L Lecture 7 Transformation between Mealy and Moore Machines
CS 140L Lecture 8 Professor CK Cheng 11/19/02.
CSE140: System Design Xinyuan Wang 05/31/2019.
CSE 140 Lecture 11 Standard Combinational Modules
CSE 140 Lecture 16 System Designs
Presentation transcript:

CS 140 Lecture 17 System Designs III Professor CK Cheng CSE Dept. UC San Diego 1

System Designs 1.Methodology 2.Hierarchy 3.Flow and Process 4.Technology-Oriented Construction 2

Digital Designs vs Computer Architectures Instruction Set (H.Chapter 6, CSE141) –Bottleneck: Silicon Area, Power Data Path (H.Chapter ) Control Subsystem (H.Chapter ) Memory Management (Chapter 8, CSE141) –Bottleneck: IO, Memory Latency 3

Design Process Program of Hardware Description List of Data Operations Data Path –Read control signals. Output conditions Control Subsystem –Read conditions. Output control signals 4

Example: Multiplication Arithmetic Z=X x Y M<=0 For i=n-1 to 0 –If Y i =1, M<=M+X 2 i Z<=M 5 Input X, Y Output Z Variable M, i M<=0 For i=n-1 to 0 –If Y n-1 =1, M<=M+X –Shift Y left by one bit –If i != 0, shift M left by one bit Z<=M

Implementation: Example { Input X, Y type bit-vector, start type boolean; Local-Object A, B,M, i type bit-vector; Output Z type bit-vector, done type boolean; S0: If start’ goto S0; S1: A <= X || B <= Y || i<=0 || M<=0 || done <= 0; S2: If B 15 = 0 goto S4 || i<=i+1; S3: M <= M+A; S4: if i>= 16, goto S6 S5: M<=Shift(M,L,1) || B<=Shift(B,L,1) || goto S2; S6: Z<= M || done<= 1|| goto S0; } 6

Implementation: Example { Input X, Y type bit-vector, start type boolean; Local-Object A, B,M, i type bit-vector; Output Z type bit-vector, done type boolean; S0: If start’ goto S0; S1: A <= X || B <= Y || i<=0 || M<=0 || done <= 0; S2: If B 15 = 0 goto S4 || i<=i+1; S3: M <= M+A; S4: if i>= 16, goto S6 S5: M<=Shift(M,L,1) || B<=Shift(B,L,1) || goto S2; S6: Z<= M || done<= 1|| goto S0; } 7

Z=XY Data Subsystem Control Subsystem C 0-7 B 15 i 4 X Y start Z done

A <= X B <=Y M<=0 i<=0 i<=i+ 1 M<=M+A M<=Shift(M,L,1) B<=Shift(B,L,1) Z<=M operation A  Load (X) B  Load (Y) M  Clear(M) i  Clear(i) i  INC(i) M  Add(M,A) M  SHL(M) B  SHL(B) Wires control C 0 C 2 C 4 C 6 C 7 C 5 C 1 C 3 9 Data Path Subsystem

10 Control Unit B C 0-7 start done i Data Path Subsystem A C0C0 C1C1 Add M C4C4 C5C5 X Z LD CLR LD i C6C6 C7C7 CLR Inc B C2C2 C3C3 Y LD SHL B i 16 SHL

Control Subsystem 11 C0C1C2C3C4C5C6C7done S S S S S S S A C0C0 C1C1 Add M C4C4 C5C5 X Z LD CLR LD i C6C6 C7C7 CLR Inc B C2C2 C3C3 Y LD SHL B i 16 SHL

Control Subsystem 12 S0 S1 S2 S3 S5 S4 B start’ start i B ’ i ’ S6

13 Exercises: 1.Implement the control subsystem with one-hot state machine design. 2.Try to reduce the latency of the whole system.