ECS371 - Lecture22 - handout.pdf - Digital Circuits ECS 371...

This preview shows page 1 - 8 out of 22 pages.

Dr. Prapun Suksompong [email protected] Lecture 22 1 Digital Circuits ECS 371 Office Hours: BKD 3601-7 Monday 9:00-10:30, 1:30-3:30 Tuesday 10:30-11:30
Announcement 2 Reading Assignment: Chapter 7: 7-1, 7-2, 7-4 Chapter 8: 8-1, 8-2, 8-4, 8-5 Chapter 9: 9-1 to 9-5 HW8 is posted on the web Due date: Next Wednesday (Sep 9)
Example: Arbitrary Counting Sequence 3 1 0 2 Method 1: Use D FFs Current State Next State FF 1 FF 0 Q 1 Q 0 Q 1 Q 0 D 1 D 0 0 0 1 0 1 0 0 1 0 0 0 0 1 0 0 1 0 1 1 1 X X X X 1 1 0 0 1 D Q Q D Q C D 1 Q 1 Q 1 C D 0 Q 0 Q 0 CLK Current State FF 1 FF 0 Next State Q 1 Q 0 1 1 0 D Q Q 0 1 D Q Q 1 Q 0 0 0 1 0 1 0 0 1 0 0 0 0 1 0 0 1 0 1 1 1 0 1 0 1 1 0 2 3 K-maps Check Answer
Example: Arbitrary Counting Sequence 4 1 0 2 C J 1 Q 1 K 1 Q 1 1 C J 0 Q 0 K 0 Q 0 CLK Current State Next State FF 1 FF 2 Q 1 Q 0 Q 1 Q 0 J 1 K 1 J 0 K 0 0 0 1 0 1 X 0 X 0 1 0 0 0 X X 1 1 0 0 1 X 1 1 X 1 1 X X X X X X 1 0 1 0 1 0 1 1 J Q K J Q K Method 2: Use J-K FFs K-maps
Example: Check Answer 5 Current State FF 1 FF 2 Next State Q 1 Q 0 1 0 J Q 1 1 K 0 1 J Q 0 1 K Q 1 Q 0 0 0 1 1 0 1 1 0 0 1 0 1 0 1 0 0 1 0 1 1 1 1 0 1 1 1 0 1 1 1 0 0 C J 1 Q 1 K 1 Q 1 1 C J 0 Q 0 K 0 Q 0 CLK 1 0 2 3
Example: Comparison 6 C D 1 Q 1 Q 1 C D 0 Q 0 Q 0 CLK 1 0 2 3 C J 1 Q 1 K 1 Q 1 1 C J 0 Q 0 K 0 Q 0 CLK Method 2: Use J-K FFs 1 0 2 3 Method 1: Use D FFs
Cascaded Counters 22 Cascading is a method of achieving higher-modulus counters. In essence, cascading means that the last-stage output of one counter drives the input of the next counter.

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture