CS 140 Lecture 19 Professor CK Cheng 12/05/02. Sequential Machine Standard Modules Combinational Sequential System Designs.

Slides:

Advertisements

Similar presentations

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

Advertisements

Verilog Descriptions of Digital Systems

CS 140 Lecture 10 Sequential Networks: Implementation Professor CK Cheng CSE Dept. UC San Diego 1.

Review and Overview. Review  Combinational logic circuit – Decoder, Encoder, Multiplexer, De-multiplexer, Full Adder, Multiplier  Sequential logic circuit.

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 7 Professor CK Cheng 4/23/02. Part II. Sequential Network (Ch ) 1.Flip-flops SR, D, T, JK, 2.SpecificationState Table 3.Implementation.

CS 140 Lecture 9 Professor CK Cheng 4/30/02. Part II. Sequential Network 1.Memory 2.Specification 3.Implementation S XY s i t+1 = g i (S t, x t )

CS 140 Lecture 11 Professor CK Cheng 5/09/02. Part III - Standard Modules Decoder, Encoder, Mux, DeMux, Shifter, Adder, Multiplexer Interconnect: Decoder,

CS 140 Lecture 8 Professor CK Cheng 4/26/02. Part II. Sequential Network 1.Memory SR, D, T, JK, 2.Specification S XY s i t+1 = g i (S t, X t )

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 140 Lecture 8 Sequential Networks Professor CK Cheng CSE Dept. UC San Diego.

CS 140 Lecture 13 Combinational Standard Modules Professor CK Cheng CSE Dept. UC San Diego 1.

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

1 Chapter 4 Combinational and Sequential Circuit.

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 6 Professor CK Cheng Tuesday 10/15/02.

CS 140 Lecture 14 Professor CK Cheng 11/14/02. Part II. Standard Modules A.Interconnect B.Operators. Adders Multiplier Adders1. Representation of numbers.

CS 140 Lecture 10 Professor CK Cheng 5/02/02. Given the state table, implement with 2 JK flip flops id Q 1 (t) 0 1 Q 0 (t) X(t)

CK Cheng Tuesday 10/2/02 CS 140 Lecture 2. Part I. Combinational Logic I) Specification –a. Language –b. Truth Table –c. Boolean Algebra –d. Incompletely.

Lecture 1: Introduction to Digital Logic Design CK Cheng Thursday 9/26/02.

CS 140L Lecture 7 Professor CK Cheng 11/12/02. Transformation between Mealy and Moore Machines Algorithm: 1) For each NS, z = S i, j create a state S.

CS 140L Lecture 9 Professor CK Cheng 6/03/02. transistors modules sequential machine system 1.Adders, Muxes 2.F-Fs and counters 3.Finite State Machine.

1 CS 140 Lecture 18 Sequential Modules: Serial Adders, Multipliers Professor CK Cheng CSE Dept. UC San Diego.

Lecture 1: Introduction to Digital Logic Design CK Cheng Tuesday 4/1/02.

CS 140 Lecture 11 Professor CK Cheng 5/31/02. C1C2 CLK x(t) y(t) Sequential Network Implementation Mealy & Moore machine State Table  Netlist s(t) D(t)

Homework Reading Machine Projects Labs

CS 140 Lecture 6 Professor CK Cheng UC San Diego.

CS 140 Lecture 10 Professor CK Cheng 10/29/02. Part II. Sequential NetworkReminder 1.Flip flops 2.Specification 3.Implement Netlist  State Table  State.

CS 140 Lecture 8 Professor CK Cheng 10/22/02. Part II. Sequential Network 1.Flip-flops SR, D, T, JK, State Table Characteristic Eq. Q(t+1) = f(x(t), Q(t)).

CS 140L Lecture 7 Transformation between Mealy and Moore Machines Professor CK Cheng CSE Dept. UC San Diego.

CSE 140 Lecture 15 System Designs Professor CK Cheng CSE Dept. UC San Diego 1.

1 CSE 140 Lecture 12 Standard Combinational Modules Professor CK Cheng CSE Dept. UC San Diego.

EECS 370 Discussion 1 xkcd.com. EECS 370 Discussion Topics Today: – Floating Point – Finite State Machines – Combinational Logic – Sequential Logic 2.

Instructors: Fu-Chiung Cheng ( 鄭福炯 ) Associate Professor Computer Science & Engineering Tatung University Computer Aided Circuit Design.

Dr. Ahmed El-Bialy, Dr. Sahar Fawzy Combinational Circuits Dr. Ahmed El-Bialy Dr. Sahar Fawzy.

ADDERS Half Adders Recall that the basic rules of binary addition are as indicated below in Table 2-9. A circuit known as the half-adder carries out these.

Module 9.  Digital logic circuits can be categorized based on the nature of their inputs either: Combinational logic circuit It consists of logic gates.

Digital Electronics Lecture 6 Combinational Logic Circuit Design.

Instructors: Fu-Chiung Cheng ( 鄭福炯 ) Associate Professor Computer Science & Engineering Tatung University.

Computer Science 101 Circuit Design - Examples. Sum of Products Algorithm Identify each row of the output that has a 1. Identify each row of the output.

Computer Science 101 More Devices: Arithmetic. From 1-Bit Equality to N-Bit Equality = A B A = B Two bit strings.

Digital Logic Structures: Chapter 3 COMP 2610 Dr. James Money COMP

Computer Architecture

Computing Machinery Chapter 3: Combinational Circuits.

ECE 320 Homework #4 1. Using 8 data input selector logic (MUX), implement the following two functions: a) F(A,B,C)=S 0 S 2 S 3 S 5 b) F(A,B,C,D)=P 0 +P.

Mehmet Can Vuran, Instructor University of Nebraska-Lincoln Acknowledgement: Schematics adapted from those provided by the authors Hennessey and Patterson.

CSE 140 Lecture 13 Combinational Standard Modules Professor CK Cheng CSE Dept. UC San Diego 1.

Instructors: Fu-Chiung Cheng ( 鄭福炯 ) Associate Professor Computer Science & Engineering Tatung University.

How does a Computer Add ? Logic Gates within chips: AND Gate A B Output OR Gate A B Output A B A B

Modular sequential logic Use latches, flip-flops and combinational logic –Flip-flops usually grouped to form a register Shift registers –n bits {x n …x.

CSE 140 Lecture 15 System Design II CK Cheng CSE Dept. UC San Diego 1.

Digital Electronics Multiplexer

CSE 140 Lecture 14 System Designs

CSE 140 Lecture 14 System Designs

Homework Reading Machine Projects Labs

Digital Electronics Multiplexer

CSE 140 Lecture 16 System Designs

CSE 140 Lecture 15 System Designs

CS M51A/EE M16 Winter’05 Section 1 Logic Design of Digital Systems Lecture 15 March 9 W’05 Yutao He 4532B Boelter Hall

CS 140 Lecture 16 Professor CK Cheng 11/21/02.

Number Systems and Circuits for Addition

CSE 140 Lecture 14 System Design

Homework Reading Machine Projects Labs

CS 140 Lecture 13 Professor CK Cheng 11/12/02.

CSE 140 Lecture 16 System Designs

Presentation transcript:

CS 140 Lecture 19 Professor CK Cheng 12/05/02

Sequential Machine Standard Modules Combinational Sequential System Designs

Algorithm: { Input X, Y start Local-Object A, B Output W, Z done S1: If start’ goto S1; S2: done  0 || A  X || B  Y || W  0 S3: A  Add(A,B) || W  INC(W) S4: If A’ goto S3 S5: Z  A || done  1 || goto S1 }

A B C1C1 C2C2 C3C3 Y Add X A INC W C4C4 C5C5 C1, A  X C2, A  Add(A,B) C3, B  Y C4, W  0 C5, W  INC(W)

Control A Start C 1 -- C 5 done

S1 S2 S3 S4 S5 A A’ start’ start S1: done = 1 S2: C1 = C3 = C4 = 1 S3: C2 = C5 = 1 S4: S5: done = doneC1 C2 C3 C4 C5 S1 S2 S3 S4 S5

start start’ S5 S1 S2 S3 A A’ S4 C2 C5 C1 C3 C4 done

Adders Id a b c in carry sum Full Adder Design a FA with 2:1 Muxes FA a b Sum c out c in

a01a l 0 (b,c) l 1 (b,c) b c C out l001l001 c = 0 0 c = l 2 = 0 l 3 = c b l101l101 c = c = 1 1 l 4 = c l 5 = 1 b 0 1 a b C out 0 1 c 1 l1l1 b c l0l0 l2l2 l3l3 l4l4 l5l5

0 1 a b Sum 0 1 b 0 1 c c’ c abCin ab’c’ a’bc’ a’b’c

Adders Serial adder w/ SR FF aiai bibi sisi id a i 0 1 b i c i S R c i Q(t) Q(t+1) Use excitation table to find SR aiai bibi sisi SRSR Q c in