CS 140L Lecture 7 Professor CK Cheng 5/13/02. Announcements  State Assignment: Chapters 7.4.3, 7.7.3, 7.74 3 kinds of coding: 1) Binary – [ log 2 n ]

Slides:

Advertisements

Similar presentations

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

Advertisements

COUNTERS Counters with Inputs Kinds of Counters Asynchronous vs

State-machine structure (Mealy)

1. 1. Output depends uniquely on inputs:  Contains only logic gates, AND, OR,...  No feedback interconnects 2. Output depends on inputs and memory:

1 CS 140L Lecture 8 System Design Professor CK Cheng CSE Dept. UC San Diego.

Lecture #9 EGR 277 – Digital Logic

Registers and Counters. Register Register is built with gates, but has memory. The only type of flip-flop required in this class – the D flip-flop – Has.

EKT 124 / 3 DIGITAL ELEKTRONIC 1

Sequential Design Part II. Output A(t+1) =D A = AX + BX B(t+1) =D B = AX Y = AX + BX.

CS 151 Digital Systems Design Lecture 25 State Reduction and Assignment.

Kevin Walsh CS 3410, Spring 2010 Computer Science Cornell University Arithmetic See: P&H Chapter 3.1-3, C.5-6.

CS 140L Lecture 5 Professor CK Cheng 4/29/02. Asynchronous Counter D Q CLK D Q D Q There are n flip-flops. D FF is the delay of each flip-flop. When n.

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 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 2 Combinational Logic CK Cheng 4/04/02.

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 3 Combinational Logic Professor CK Cheng CSE Dept. UC San Diego.

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 )

CS 140 Lecture 3 Professor CK Cheng 10/3/02. 1.Specification 2.Implementation 3.K-maps Part I.

1 CS 20 Lecture 14 Karnaugh Maps Professor CK Cheng CSE Dept. UC San Diego.

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

Sequential Circuits and Finite State Machines Prof. Sin-Min Lee

CS 140 Lecture 6: Other Types of Gates Professor CK Cheng 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,

Sequential Logic Design

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.

Computer ArchitectureFall 2008 © August 25, CS 447 – Computer Architecture Lecture 3 Computer Arithmetic (1)

CSE 140L Lecture 6 Interface and State Assignment Professor CK Cheng CSE Dept. UC San Diego 1.

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 1 Professor CK Cheng 3/31/02. CMOS Logic (3.2 – 3.6) Complementary Metal-Oxide Semiconductor.

1 CS 140 Lecture 3 Combinational Logic Professor CK Cheng CSE Dept. 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)).

ENGIN112 L25: State Reduction and Assignment October 31, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 25 State Reduction and Assignment.

CS 140 Lecture 9 Professor CK Cheng 10/24/02. Sequential Network 1.Components F-Fs 2.Specification D Q Q’ CLK.

CS 140 Lecture 7 Professor CK Cheng 10/17/02. Combinational Logic  Complete set of gates  Other types of gates 1)XOR 2)NAND / NOR 3)Block Diagram Transfers.

CSE20 Lecture 3 Number Systems: Negative Numbers 1.Sign and Magnitude Representation 2.1’s Complement Representation 3.2’s Complement Representation 1.

Computer ArchitectureFall 2007 © August 29, 2007 Karem Sakallah CS 447 – Computer Architecture.

CS 140L Lecture 4 Professor CK Cheng 10/22/02. 1)F-F 2)Shift register 3)Counter (Asynchronous) 4)Counter (Synchronous)

1 CSE 20: Lecture 7 Boolean Algebra CK Cheng 4/21/2011.

ECE2030 Introduction to Computer Engineering Lecture 15: Registers, Toggle Cells, Counters Prof. Hsien-Hsin Sean Lee School of Electrical and Computer.

Lecture 8: Sequential Networks and Finite State Machines CSE 140: Components and Design Techniques for Digital Systems Fall 2014 CK Cheng Dept. of Computer.

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

Lecture 9: Sequential Networks: Implementation CSE 140: Components and Design Techniques for Digital Systems Fall 2014 CK Cheng Dept. of Computer Science.

© BYU 13 COUNTERS Page 1 ECEn 224 COUNTERS Counters Transition Tables Moore Outputs Counter Timing.

Counters and Registers Synchronous Counters. 7-7 Synchronous Down and Up/Down Counters  In the previous lecture, we’ve learned how synchronous counters.

Counters Transition Tables Moore Outputs Counter Timing

CEC 220 Digital Circuit Design

Chapter 8 Solving Larger Sequential Problems.

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

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

Shift Register Counters

Sequential Networks and Finite State Machines

Figure 8.1. The general form of a sequential circuit.

Dr. Clincy Professor of CS

Lecture 16 Arithmetic Circuits

CSE 140 Lecture 11 Standard Combinational Modules

CSE 140 Lecture 17 System Design II

Dr. Clincy Professor of CS

CSE 140 Lecture 14 System Design

CHAPTER 4 COUNTER.

CSE20 Lecture 3 Number Systems

CS 140 Lecture 6: Other Types of Gates

CSE 140 Lecture 9 Sequential Networks

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

CS 140L Lecture 8 Professor CK Cheng 11/19/02.

CSE 140 Lecture 11 Standard Combinational Modules

Presentation transcript:

CS 140L Lecture 7 Professor CK Cheng 5/13/02

Announcements  State Assignment: Chapters 7.4.3, 7.7.3, kinds of coding: 1) Binary – [ log 2 n ] bits 000,001,110, etc. 2) Gray – can change by only 1 bit i.e. 000-> 001->011->010. 3) Johnson - [ n/2 ] (bits) number of flip flops.

4) One hot: We use n F-Fs for n states. Q i = 1 iff present state = S i. S0 0 S1 0 1 S D Q Q’ X X’ D Q Q’ X X’ D Q Q’ X X’ (X not true -> back to 1 st FF, else to 2 nd ) Use OR gates to collect the inputs Use AND gates to branch out the transition

5) “Don’t Care State” coding S(n-1) S(n-2). S1 S0 Q n Q n Q Q State i  Q j = 0 V j  i Q i = 1 Q j = x V j  i

System Design Inst R1 R2R3 I2I2 I1I1 I0I0 D3D3 D2D2 D1D1 D0D0 I 2 I 1 I Init Move 1 Move 2 Store Add Shift Comp Mask

Wrap Around Shift Init: R1 = R2 = R3 = (0,0,0,0) Mov1: R1 = (a,b,c,d) Mov2: R2 = (a,b,c,d) Store: R2 = R3 Add: R3 = R1 + R2 Overflow flag Shift: R3 = (R2 Shift left by (a,b) bits) Comp: flag(R1, R2) = 1 iff R1 > R2 And: R3 = (R1)&(R2)