Slides for Lecture 25 ENEL 353: Digital Circuits Fall 2013 Term - - PowerPoint PPT Presentation

Slides for Lecture 25

ENEL 353: Digital Circuits — Fall 2013 Term Steve Norman, PhD, PEng

Electrical & Computer Engineering Schulich School of Engineering University of Calgary

6 November, 2013

ENEL 353 F13 Section 02 Slides for Lecture 25

slide 2/17

Previous Lecture

Building a D flip-flop out of two D latches in a “master-slave” configuration. The clock divider circuit—a simple application of a D flip-flop. Registers—storing multiple bits in collection of D flip-flops. Resettable flip-flops.

ENEL 353 F13 Section 02 Slides for Lecture 25

slide 3/17

Today’s Lecture

Enabled flip-flops. The concept of synchronous sequential circuits. Introduction to finite state machines. Related reading in Harris & Harris: Section 3.3; Section 3.4 to the end of Section 3.4.1.

ENEL 353 F13 Section 02 Slides for Lecture 25

slide 4/17

Enabled D flip-flops

EN D Q This kind of DFF is good for a circuit design in which it is useful to have a flip-flop sometimes hold its state for many clock cycles, rather than copy D on every single rising edge of the clock. Let’s write a precise description of the behaviour of an enabled DFF. Let’s show how an enabled DFF can be built using a “plain” DFF and a 2:1 multiplexer.

ENEL 353 F13 Section 02 Slides for Lecture 25

slide 5/17

Variations on enabled and resettable DFFs

Here is a pretty obvious variation on the resettable DFF . . . On each rising edge of CLK, Q = D if SET = 0 1 if SET = 1 s

SET

D Q Many textbooks use the names PRESET and CLEAR instead

• f SET and RESET. Also note that the above is a

synchronous SET—some DFFs have asynchronous SET and/or RESET. Some DFFs are designed to support two or all three of RESET, SET and EN inputs.

ENEL 353 F13 Section 02 Slides for Lecture 25

slide 6/17

The rest of Section 3.2 in Harris & Harris

Section 3.2.7 presents and explains the most common present-day transistor-level designs for D latches and DFFs. We will not cover this topic in ENEL 353. If you are curious about this material, you will have to go back and read Section 1.7 before reading Section 3.2.7. Section 3.2.8 has a good example illustrating the difference between a D latch and a DFF. Check it out carefully!

ENEL 353 F13 Section 02 Slides for Lecture 25

slide 7/17

Asynchronous sequential circuit examples

Section 3.3.1 in Harris & Harris presents two sequential circuits with problematic behaviour:

◮ A ring oscillator made from 3 inverters. ◮ A D latch design that fails if delays within its

components aren’t exactly right. In ENEL 353, we’re going to move on to synchronous sequential circuits, but it’s worth studying these examples to get an idea of the difficulties that can arise in sequential circuits that are not run by a clock signal.

ENEL 353 F13 Section 02 Slides for Lecture 25

slide 8/17

Synchronous sequential circuits

A synchronous sequential circuit is a sequential logic system that

◮ has one or more bits of state; and ◮ has its state updates controlled by a clock signal, so

that the state updates are synchronized by the clock. Making digital systems synchronous is a very powerful design technique—the vast majority of digital circuits, including just about all practical computer processors, are synchronous sequential systems.

ENEL 353 F13 Section 02 Slides for Lecture 25

slide 9/17

Synchronous sequential circuit composition rules

If a circuit satisfies these four rules, it is guaranteed to be a synchronous sequential circuit . . .

• 1. Every element in the circuit either is a register or is

combinational.

• 2. At least one element is a register.
• 3. All registers receive the same clock signal.
• 4. Every cyclic path in the circuit passes through at least
• ne register.

Remark: The above conditions are sufficient but not

• necessary. There are designs that break some of these rules

but still result in synchronous sequential circuits.

ENEL 353 F13 Section 02 Slides for Lecture 25

slide 10/17

Composition rules: Simplest possible example

Does a single D flip-flop, by itself, satisfy the synchronous sequential circuit composition rules? D Q

CLK

• 1. Every element in the circuit either is a register or is

combinational.

• 2. At least one element is a register.
• 3. All registers receive the same clock signal.
• 4. Every cyclic path in the circuit passes through at least
• ne register.

ENEL 353 F13 Section 02 Slides for Lecture 25

slide 11/17

Composition rules: Another simple example

Does the clock divider circuit satisfy the synchronous sequential circuit composition rules? D Q

CLK1 CLK2

• 1. Every element in the circuit either is a register or is

combinational.

• 2. At least one element is a register.
• 3. All registers receive the same clock signal.
• 4. Every cyclic path in the circuit passes through at least
• ne register.

ENEL 353 F13 Section 02 Slides for Lecture 25

slide 12/17

More general examples, part 1

Which of these circuits satisfies all four synchronous sequential circuit composition rules? C L C L C L C L C L (b) (a)

CLK CLK1 CLK2

ENEL 353 F13 Section 02 Slides for Lecture 25

slide 13/17

More general examples, part 2

Which of these circuits satisfies all four synchronous sequential circuit composition rules? C L C L C L C L (c) (d)

CLK CLK

ENEL 353 F13 Section 02 Slides for Lecture 25

slide 14/17

Finite state machines

A k-bit finite state machine (FSM) is a synchronous sequential circuit that has a k-bit register at its centre . . . . . . . . . Dk−1 = S′

k−1

Dk−2 = S′

k−2

Q1 = S1 D0 = S′ Q0 = S0 D1 = S′

1

Qk−1 = Sk−1 Qk−2 = Sk−2

CLK

How many different states can a k-bit FSM have?

ENEL 353 F13 Section 02 Slides for Lecture 25

slide 15/17

Important words on notation for FSM algebra

Harris and Harris use S′

i to mean “next state i”, the value

DFF i within the register of an FSM will get just after a rising clock edge. That is unfortunate, because A′ means NOT(A) in a large body of literature on digital systems. Many texts use something like Q*

i for the value DFF i within

the register of an FSM will get just after an active clock edge. For ENEL 353 in Fall 2013, it’s crucial to know that S′

i means

“the value state bit i will get just after a rising clock edge” and does not mean “the complement of Si”.

ENEL 353 F13 Section 02 Slides for Lecture 25

slide 16/17

Moore machines and Mealy machines: Two kinds

• f FSM

Let’s draw diagrams and make notes to distinguish these two types of finite state machine.

ENEL 353 F13 Section 02 Slides for Lecture 25

slide 17/17

Upcoming topics

Finite state machines. Related reading in Harris & Harris: Section 3.4