Introduction to Sequential Logic; Latches

Tom Kelliher, CS 220

Mar. 27, 2006

Administrivia

Announcements

Assignment

Read 6-3.

Assignment due in one week. The Xilinx problems aren't that easy and there's not enough of me to go around if you all wait until the last minute.

From Last Time

Finished Xilinx introduction lab.

Outline

  1. Sequential logic.

  2. SR latch.

  3. D latch.

Coming Up

Flip-flops

Sequential Logic

  1. Combinational logic is nice but...

  2. Sequential logic: introduces notion of memory.

  3. Synchronous vs. asynchronous circuits.

    There will always be some asynchronous elements in a circuit which interfaces to the real world environment.

  4. Clock: frequency, period, edges, duty-cycle.

    Non-overlapping clocks.

  5. How can we achieve memory?

    \begin{figure}\centering\includegraphics[]{Figures/inverterChain.eps}\end{figure}

    This is the basic idea, to be modified for actual use.

  6. General model of a sequential circuit:

    \begin{figure}\centering\includegraphics[]{Figures/stateMachine.eps}\end{figure}

SR Latch

  1. Active low inputs.

  2. Schematic:

    \begin{figure}\centering\includegraphics[]{Figures/sr.eps}\end{figure}

  3. Operation: three valid, one invalid input.

  4. Asynchronous.

Clocked SR Latch

  1. Schematic:

    \begin{figure}\centering\includegraphics[]{Figures/srClocked.eps}\end{figure}

    Behavior.

  2. Transparent when clock is high.

    Latched when clock is low.

  3. Problem with use in circuits: double clocking.

    A solution: non-overlapping clocks. (Achieved with master-slave flip-flops.)

D Latch

  1. SR latches inconvenient when storing data from, say, an ALU.

  2. D latch stores data directly:

    \begin{figure}\centering\includegraphics[]{Figures/dClocked.eps}\end{figure}

    (Think of this as a logic primitive.)


Thomas P. Kelliher 2006-03-17
Tom Kelliher