Presentation is loading. Please wait.

Presentation is loading. Please wait.

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 ]

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "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 ]"— Presentation transcript:

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

2 Announcements  State Assignment: Chapters 7.4.3, 7.7.3, 7.74 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.

3 4) One hot: We use n F-Fs for n states. Q i = 1 iff present state = S i. S0 0 S1 0 1 S2 1 0 1 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

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

5 System Design Inst R1 R2R3 I2I2 I1I1 I0I0 D3D3 D2D2 D1D1 D0D0 I 2 I 1 I 0 0 0 1 0 0 1 2 0 1 0 3 0 1 1 4 1 0 0 5 1 0 1 6 1 1 0 7 1 1 1 Init Move 1 Move 2 Store Add Shift Comp Mask

6 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)

Download ppt "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 ]"

Similar presentations

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

CS 140 Lecture 16 System Designs Professor CK Cheng CSE Dept. UC San Diego 1.
COUNTERS Counters with Inputs Kinds of Counters Asynchronous vs

COUNTERS Counters with Inputs Kinds of Counters Asynchronous vs
State-machine structure (Mealy)

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. 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.

1 CS 140L Lecture 8 System Design Professor CK Cheng CSE Dept. UC San Diego.
Lecture #9 EGR 277 – Digital Logic

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.

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

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.

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.

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.

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.

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.

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 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 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 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,

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.

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 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.

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

Similar presentations

Ads by Google