Presentation is loading. Please wait.

Presentation is loading. Please wait.

Lecture 15 Finite State Machine Implementation

Similar presentations


Presentation on theme: "Lecture 15 Finite State Machine Implementation"— Presentation transcript:

1 Lecture 15 Finite State Machine Implementation
Prith Banerjee ECE C03 Advanced Digital Design Spring 1998 ECE C03 Lecture 15

2 Outline Mapping FSM to random logic Mapping FSM to ROMS
Mapping FSM to PLAs Mapping FSM to Programmable Logic Devices (Xilinx) READING: Katz , , 10.3, Dewey 9.5 ECE C03 Lecture 15

3 FSM Implementation Strategies
• Discrete Gate Logic Emphasis so far • MSI Logic (e.g., Counters) • Structured Logic (e.g., PLA/PAL, ROM) • Field Programmable Gate Arrays (FPGAs) Function can be configured "on the fly" or in the field Flipflops/Registers plus discrete gates on the same chip ECE C03 Lecture 15

4 FSM Design with Structured Logic
Block Diagram for Synchronous Mealy Machine ROM-based Realization • Inputs & Current State form the address • ROM data bits form the Outputs & Next State ECE C03 Lecture 15

5 ROM-Based Implementation
Example: BCD to Excess 3 Serial Converter BCD Excess 3 Code Conversion Process Bits are presented in bit serial fashion starting with the least significant bit Single input X, single output Z ECE C03 Lecture 15

6 BCD to Excess-3 Converter
State Transition Table Reset S0 0/1 1/0 S1 S2 1/0 Derived State Diagram 0/1 0/0, 1/1 S3 S4 0/0, 0/1 1/0 1/1 S5 S6 0/0, ECE C03 Lecture 15 0/1 1/1

7 ROM-Based Implementation
BCD to Excess 3 Converter 1 CLK 9 15 CLK QD 14 Z 175 QD 1 X converter ROM D 10 X Z 13 QC 12 C 11 Q2 D2 5 QC Q1 D1 B 7 4 QB Q0 D0 A 6 QB 2 QA 1 1 CLR 3 QA \Reset Circuit Level Realization 74175 = 4 x positive edge triggered D FFs Truth Table/ROM I/Os In ROM-based designs, no need to consider state assignment ECE C03 Lecture 15

8 ROM Based Implementation
BCD to Excess-3 Converter LSB MSB Timing Behavior for input strings (0) and (7) 1 1 1 1 1 1 1 LSB LSB ECE C03 Lecture 15

9 PLA Based Design BCD to Excess 3 Converter State Assignment with NOVA
NOVA derived state assignment 9 product term implementation NOVA input file ECE C03 Lecture 15

10 PLA Implementation BCD to Excess 3 Converter .i 4 .o 4 .ilb x q2 q1 q0
.ob d2 d1 d0 z .p 16 .e Espresso Inputs .i 4 .o 4 .ilb x q2 q1 q0 .ob d2 d1 d0 z .p 9 .e Espresso Outputs ECE C03 Lecture 15

11 PLA Implementation BCD to Excess 3 Converter D2 = Q2 • Q0 + Q2 • Q0
D1 = X • Q2 • Q1 • Q0 + X • Q2 • Q0 + X • Q2 • Q0 + Q1 • Q0 D0 = Q0 Z = X• Q1 + X • Q1 ECE C03 Lecture 15

12 PAL Implementation BCD to Excess 3 Serial Converter
10H8 PAL: 10 inputs, 8 outputs, 2 product terms per OR gate D1 = D11 + D12 D11 = X • Q2 • Q1 • Q0 + X • Q2 • Q0 D12 = X • Q2 • Q0 + Q1 • Q0 0. Q2 • Q0 1. Q2 • Q0 8. X • Q2 • Q1 • Q0 9. X • Q2 • Q0 16. X • Q2 • Q0 17. Q1 • Q0 24. D11 25. D12 32. Q0 33. not used 40. X • Q1 41. X • Q1 ECE C03 Lecture 15

13 PAL Implementation BCD to Excess 3 Serial Converter ECE C03 Lecture 15

14 More Advanced PAL Architectures
Registered PAL Architecture Buffered Input or product term Negative Logic Feedback D2 = Q2 • Q0 + Q2 • Q0 D1 = X • Q2 • Q1 • Q0 + X • Q2 + X • Q0 + Q2 • Q0 + Q1 • Q0 D0 = Q0 Z = X • Q1 + X • Q1 ECE C03 Lecture 15

15 Advanced PAL Architectures
Programmable Output Polarity/XOR PALs Buried Registers: decouple FF from the output pin Advantage of XOR PALs: Parity and Arithmetic Operations ECE C03 Lecture 15

16 Examples of XOR and Registered PALs
Example of XOR PAL Example of Registered PAL ECE C03 Lecture 15

17 FSM Design With Counters
Synchronous Counters: CLR, LD, CNT Four kinds of transitions for each state: (1) to State 0 (CLR) (2) to next state in sequence (CNT) (3) to arbitrary next state (LD) (4) loop in current state Careful state assignment is needed to reflect basic sequencing of the counter ECE C03 Lecture 15

18 Implementation Strategies
FSM Design with Counters Excess 3 Converter Revisited Note the sequential nature of the state assignments ECE C03 Lecture 15

19 Implementation Strategies
FSM Design with Counters Excess 3 Converter CLR signal dominates LD which dominates Count ECE C03 Lecture 15

20 Implementation FSM With Counters
Excess 3 Converter .i 5 .o 7 .ilb res x q2 q1 q0 .ob z clr ld en c b a .p 17 .e Espresso Input File .i 5 .o 7 .ilb res x q2 q1 q0 .ob z clr ld en c b a .p 10 .e Espresso Output File ECE C03 Lecture 15

21 Implementing FSM with Counters
Excess 3 Converter Schematic Synchronous Output Register ECE C03 Lecture 15

22 FSM Design with FPGAs Programmable Logic Devices = PLD
PALs, PLAs = Gate Equivalents Field Programmable Gate Arrays = FPGAs • Altera MAX Family • Actel Programmable Gate Array • Xilinx Logical Cell Array (s) of Gate Equivalents! ECE C03 Lecture 15

23 Xilinx Logic Cell Arrays
CMOS Static RAM Technology: programmable on the fly! All personality elements connected into serial shift register Shift in string of 1's and 0's on power up General Chip Architecture: • Logic Blocks (CLBs) • IO Blocks (IOBs) • Wiring Channels ECE C03 Lecture 15

24 Xilinx LCA Architecture
Inputs: Tri-state enable bit to output input, output clocks Outputs: input bit Internal FFs for input & output paths Fast/Slow outputs 5 ns vs. 30 ns rise Pull-up used with unused IOBs ECE C03 Lecture 15

25 Xilinx LCA Architecture
Configurable Logic Block: CLB 2 FFs Any function of 5 Variables Global Reset Clock, Clock Enb Independent DIN ECE C03 Lecture 15

26 Xilinx CLB Function Generator
Any function of 5 variables Two Independent Functions of 4 variables each ECE C03 Lecture 15

27 Xilinx CLB Function Generator
Certain Limited Functions of 6 Variables ECE C03 Lecture 15

28 Xilinx Interconnect Architecture
Direct Connections Global Long Line Horizontal/Vertical Long Lines Switching Matrix Connections ECE C03 Lecture 15

29 Implementing FSM with Xilinx LCA
Implementing the BCD to Excess 3 FSM Q2+ = Q2 • Q0 + Q2 • Q0 Q1+ = X • Q2 • Q1 • Q0 + X • Q2 • Q0 + X • Q2 • Q0 + Q1 • Q0 Q0+ = Q0 Z = Z • Q1 + X • Q1 No function more complex than 4 variables 4 FFs implies 2 CLBs Synchronous Mealy Machine Global Reset to be used Place Q2+, Q0+ in once CLB Q1, Z in second CLB maximize use of direct & general purpose interconnections ECE C03 Lecture 15

30 Implementing FSM with Xilinx LCA
Implementing the BCD to Excess 3 FSM ECE C03 Lecture 15

31 Summary Mapping FSM to random logic Mapping FSM to ROMS
Mapping FSM to PLAs Mapping FSM to Programmable Logic Devices (Xilinx) NEXT LECTURE: VHDL Language READING: Dewey 11.2, 11.3, 11.4, 11.5, 11.6, 12.2, 12.2 ECE C03 Lecture 15


Download ppt "Lecture 15 Finite State Machine Implementation"

Similar presentations


Ads by Google