Introduction to Digital Design 55:032

1
Introduction to Digital Design55032

• Exam 2 Review

2
General Information

• 1 hour exam - open book, open notes
• Six problems
• Covers material in chapters 5 - 7 of text
• Main focus is on sequential circuit design
• State diagrams
• State tables
• FF input equations
• No VHDL on exam

3
Chapter 5 Arithmetic Functions

• Iterative Circuits composed of a series of
  (usually) identical function cells with
  information passed from cell to cell
• Binary Full Adder carry out to carry in
• Useful for implementing large multi-bit vector
  functions
• Binary Adders half and full
• Multi-bit Adders ripple carry, carry lookahead

4
Chapter 5 (cont.)

• Binary Subtraction
• Subtraction by complements ( A -B)
• Half and Full Subtractor cells
• Adder/Subtractor Circuits
• Overflow
• Result is outside of range of represented values
• MSB carry in not equal to carry out
• Binary Multiplication
• Lots of combinational logic

5
Chapter 5 (cont.)

• Other Arithmetic Functions
• Comparison
• Increment
• Decrement

6
Chapter 6 (cont.)

• Sequential Circuits
• Block Diagram

7
Chapter 6

• Binary Storage Elements
• Cross-coupled NOR and NAND latches
• Gated Latch
• Master-Slave Flip-flop
• Edge-Triggered FF
• Input configurations
• SR, JK, D, T
• Characteristic tables
• Direct set/reset inputs
• Table 6-7, Page 283 in the text!!

8
Chapter 6 (cont.)

• Sequential Circuit Analysis
• Start with schematic of circuit
• A) Determine FF input and circuit output
  equations
• B) Generate FF transition table
• C) Reorganize as state table
• D) Draw state diagram
• Two basic Seq. circuit forms
• MOORE outputs function of present state only
• MEALY outputs function of both P.S. and inputs

9
Chapter 6 (cont.)

• Sequential Circuit Design
• Reverse of Analysis process except we start with
  statement of what circuit is to do
• A) Generate state diagram
• B) Translate to state table (encode inputs,
  states)
• C) Pick FFs to use for state variables
• D) Using FF excitation tables, generate trans.
  table
• E) Generate FF input and circuit output equations

10
Chapter 7 Registers and Reg. Transfers

• Registers
• Registers are groups of flip-flops with some
  common characteristic(s)
• common clock and/or controls
• common data function (counters, storage reg.)
• There are two ways to control when a register
  changes state
• Synchronous enable controls the FF inputs
• Clock gating enable is ANDed with clock

11
Chapter 7 (cont.)

• Register transfers and RTL
• More formalized method of describing information
  processing and flow in a system
• General form is
• condition destination ? source expression
• Source expression operations classified as
  transfer, arithmetic, logical, and shift
• A transfer is expected to complete at the next
  clock transition where the condition is true

12
Chapter 7 (cont.)

• Register Transfers and RTL
• Elementary register transfer operation are
  microoperations
• Define data sources and function
• Define transfer destination
• Generally assumed to complete in one clock cycle

13
Chapter 7 (cont.)

• Micro-operations are combinational logic
  functions
• Transfer, Arithmetic, Logical, Shift
• Many datapaths have a multifunction ALSU to
  perform these operations
• Some datapaths have only enough logic to perform
  a specific set of u-ops

14
Chapter 7 (cont.)

• Data Transfer
• Registers may have multiple data sources we must
  select
• Multiplexers
• Dedicated or shared
• Data busses
• Memory transfers need both address and data
  information
• Both source (READ) and destination (WRITE)

15
Chapter 7 (cont.)

• Data Transfer may be parallel or serial
• Parallel all data bits moved from register to
  register at the same time (one clock period)
• Faster
• more wiring needed
• Serial data bits move from source register to
  destination register one bit at a time (n clocks)
• need P. to S. and S. to P. shift registers
• only one signal needed

16
Chapter 7 (cont.)

• Bidirectional Data Transfer
• Single signal used to send and receive data
• Solves distributed multiplexing problem
• Cuts total number of data lines in half
• Three-State Output Buffers
• Needed to implement bidirectional signals
• Three states are high (1), low (0) and off (hi-z)
• Output Enable signal controls output on or off

17
Chapter 7 (cont.)

• Counter is a sequential circuit that cycles
  through a defined set of states
• Synchronous
• Ripple
• Many different variations
• binary, decimal, other sequence
• up, down, or both
• parallel load, clear, enable, ripple carry out
• A counter with no inputs is an Autonomous
  sequential circuit

18
Chapter 7 (cont.)

• Arbitrary count sequences
• Classic sequential circuit design
• Define state diagram go from there
• Must ensure unused states have path to normal
  count sequence
• Controlled standard counter
• Detect max value clear counter
• Use carry out signal to load initial count value

19
Chapter 7 (cont.)

• Ring and twisted ring counters
• Both use shift register as basic element
• Ring feeds back SR true output to input
• For n FFs there are n states
• Must initialize counter to 00001
• Must handle unused states
• Twisted ring feeds back SR false output to input
• For n FFs there are 2n states
• Counter can be initialized to all zeros (cleared)