Counters 91509 L 27 Counters Copyright 2009 Joanne

  • Slides: 12
Download presentation
Counters 9/15/09 - L 27 Counters Copyright 2009 - Joanne De. Groat, ECE, OSU

Counters 9/15/09 - L 27 Counters Copyright 2009 - Joanne De. Groat, ECE, OSU 1

Class 27 – Counters o A counter we have seen A ripple counter Other

Class 27 – Counters o A counter we have seen A ripple counter Other counters o Material from section 7 -6 of text o o 9/15/09 - L 27 Counters Copyright 2009 - Joanne De. Groat, ECE, OSU 2

Ripple Counter o o o “A register that goes through a prescribed sequence of

Ripple Counter o o o “A register that goes through a prescribed sequence of distinct states upon the application of a sequence of input pulses is called a counter. ” The input pulses could be the clock or some other input that occurs when the next step in the count should occur. A counter that follows the binary number sequence is called a binary counter. 9/15/09 - L 27 Counters Copyright 2009 - Joanne De. Groat, ECE, OSU 3

A ripple counter o Made out of T type FFs Using D FFs o

A ripple counter o Made out of T type FFs Using D FFs o n Here the D FFs are configured to be T FFs 9/15/09 - L 27 Counters Copyright 2009 - Joanne De. Groat, ECE, OSU 4

Synchronous counters o Desire to move through the sequence of binary numbers, either counting

Synchronous counters o Desire to move through the sequence of binary numbers, either counting up or down, such that all the outputs achieve their new value at about the same time on either the rising or falling edge of the clock signal. 9/15/09 - L 27 Counters Copyright 2009 - Joanne De. Groat, ECE, OSU 5

up binary counter with ENable o o Synchronous Up counter with count enable Symbol

up binary counter with ENable o o Synchronous Up counter with count enable Symbol Serial gating Parallel gating 9/15/09 - L 27 Counters Copyright 2009 - Joanne De. Groat, ECE, OSU 6

Binary counter with || load o Now add parallel load capability 9/15/09 - L

Binary counter with || load o Now add parallel load capability 9/15/09 - L 27 Counters Copyright 2009 - Joanne De. Groat, ECE, OSU 7

Up/Down counters o o o To count up the input to the next state

Up/Down counters o o o To count up the input to the next state is obtained by adding 1 to the current state. The count down the input to the next state is obtained by subtracting 1 from the current state. An up/down counter with enable has the following feedback equations: 9/15/09 - L 27 Counters Copyright 2009 - Joanne De. Groat, ECE, OSU 8

BCD counter o Not how it goes back to 0 after 9 (1001) is

BCD counter o Not how it goes back to 0 after 9 (1001) is reached. (Note this is only an up counter) 9/15/09 - L 27 Counters Copyright 2009 - Joanne De. Groat, ECE, OSU 9

Arbitrary count sequences o A counter can be designed to count in any sequence.

Arbitrary count sequences o A counter can be designed to count in any sequence. Use general state machine design methodology. 9/15/09 - L 27 Counters Copyright 2009 - Joanne De. Groat, ECE, OSU 10

One last topic o o ONE HOT – what summer days sometimes are But

One last topic o o ONE HOT – what summer days sometimes are But in state machines it is a design style where 1 F/F is used for each state. A ‘ 1’ will progress from FF to FF with all others being ‘ 0’. 9/15/09 - L 27 Counters Copyright 2009 - Joanne De. Groat, ECE, OSU 11

Class 27 assignment o o Covered counters from section 7 -6 Problems for hand

Class 27 assignment o o Covered counters from section 7 -6 Problems for hand in n o Problems for practice n o Nothing new Reading for next class: 7 -6 9/15/09 - L 27 Counters Copyright 2009 - Joanne De. Groat, ECE, OSU 12