Ripple Counters

# Ripple Counters - Ripple Counters Password Copyright 2009...

This preview shows pages 1–5. Sign up to view the full content.

Ripple Counters Password_________________ © Copyright 2009 Daniel Tylavsky

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Now that we have flip-flops for memory, we can start to design more interesting circuits. The first circuit we’ll design is an asynchronous counter called a ripple counter. Defn: Counter - a sequential circuit that goes through a set of given states on successive clock cycles. Ripple Counters
Let’s assume we want a 2-bit ripple counter that counts up, i.e., 00, 01, 10, 11, 00. What should the timing diagram look like for the outputs of this counter? T 0 Count=(0,0) Clk T 1 , (0,1) T 2 , (1,0) T 3 , (1,1) T 4 , (0,0) Q 0 Q 1 Q 0 changes on every leading edge of clock pulse. Q 1 on every trailing edge of Q 0 ; Q 1 on every leading edge of Q 0 . Ripple Counters

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Clk (0,1) (1,0) (1,1) (0,0) Q 0 Q 1 Q 0 T Clk Q 0 Q 0 T Flip Flop 1 T Clk Q 1 Q 1 T Flip Flop 1 Clk This counter is also called a divide by 4 counter. Why?
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 10/21/2010 for the course CSE 120 taught by Professor Matar during the Spring '08 term at ASU.

### Page1 / 11

Ripple Counters - Ripple Counters Password Copyright 2009...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online