book

FSM-based Digital Design using Verilog HDL

Name: FSM-based Digital Design using Verilog HDL
ISBN: 9780470060704

by Peter Minns, Ian Elliott

May 2008

Intermediate to advanced

408 pages

11h 8m

English

Wiley

Read now

Unlock full access

Cover Page
Title Page
Copyright
Contents
Preface
Acknowledgements
1: Introduction to Finite-State Machines and State Diagrams for the Design of Electronic Circuits and Systems
1.1 INTRODUCTION1.2 LEARNING MATERIAL1.3 SUMMARY
2: Using State Diagrams to Control External Hardware Subsystems
2.1 INTRODUCTION2.2 LEARNING MATERIAL2.3 SUMMARY
3: Synthesizing Hardware from a State Diagram
3.1 INTRODUCTION TO FINITE-STATE MACHINE SYNTHESIS3.2 LEARNING MATERIAL3.3 SUMMARY
4: Synchronous Finite-State Machine Designs
4.1 TRADITIONAL STATE DIAGRAM SYNTHESIS METHOD4.2 DEALING WITH UNUSED STATES4.3 DEVELOPMENT OF A HIGH/LOW ALARM INDICATOR SYSTEM4.4 SIMPLE WAVEFORM GENERATOR4.5 THE DICE GAME4.6 BINARY DATA SERIAL TRANSMITTER4.7 DEVELOPMENT OF A SERIAL ASYNCHRONOUS RECEIVER4.8 ADDING PARITY DETECTION TO THE SERIAL RECEIVER SYSTEM4.9 AN ASYNCHRONOUS SERIAL TRANSMITTER SYSTEM4.10 CLOCKED WATCHDOG TIMER4.11 SUMMARY

5: The One Hot Technique in Finite-State Machine Design
5.1 THE ONE HOT TECHNIQUE5.2 A DATA ACQUISITION SYSTEM5.3 A SHARED MEMORY SYSTEM5.4 FAST WAVEFORM SYNTHESIZER5.5 CONTROLLING THE FINITE-STATE MACHINE FROM A MICROPROCESSOR/MICROCONTROLLER5.6 A MEMORY-CHIP TESTER5.7 COMPARING ONE HOT WITH THE MORE CONVENTIONAL DESIGN METHOD OF CHAPTER 45.8 A DYNAMIC MEMORY ACCESS CONTROLLER5.9 HOW TO CONTROL THE DYNAMIC MEMORY ACCESS FROM A MICROPROCESSOR5.10 DETECTING SEQUENTIAL BINARY SEQUENCES USING A FINITE-STATE MACHINE5.11 SUMMARY
6: Introduction to Verilog HDL
6.1 A BRIEF BACKGROUND TO HARDWARE DESCRIPTION LANGUAGES6.2 HARDWARE MODELLING WITH VERILOG HDL: THE MODULE6.3 MODULES WITHIN MODULES: CREATING HIERARCHY6.4 VERILOG HDL SIMULATION: A COMPLETE EXAMPLEREFERENCES
7: Elements of Verilog HDL
7.1 BUILT-IN PRIMITIVES AND TYPES7.2 OPERATORS AND EXPRESSIONS7.3 EXAMPLE ILLUSTRATING THE USE OF VERILOG HDL OPERATORS: HAMMING CODE ENCODERREFERENCES
8: Describing Combinational and Sequential Logic using Verilog HDL
8.1 THE DATA-FLOW STYLE OF DESCRIPTION: REVIEW OF THE CONTINUOUS ASSIGNMENT8.2 THE BEHAVIOURAL STYLE OF DESCRIPTION: THE SEQUENTIAL BLOCK8.3 ASSIGNMENTS WITHIN SEQUENTIAL BLOCKS: BLOCKING AND NONBLOCKING8.4 DESCRIBING COMBINATIONAL LOGIC USING A SEQUENTIAL BLOCK8.5 DESCRIBING SEQUENTIAL LOGIC USING A SEQUENTIAL BLOCK8.6 DESCRIBING MEMORIES8.7 DESCRIBING FINITE-STATE MACHINESREFERENCES
9: Asynchronous Finite-State Machines
9.1 INTRODUCTION9.2 DEVELOPMENT OF EVENT-DRIVEN LOGIC9.3 USING THE SEQUENTIAL EQUATION TO SYNTHESIZE AN EVENT FINITE-STATE MACHINE9.4 IMPLEMENTING THE DESIGN USING SUM OF PRODUCT AS USED IN A PROGRAMMABLE LOGIC DEVICE9.5 DEVELOPMENT OF AN EVENT VERSION OF THE SINGLE-PULSE GENERATOR WITH MEMORY FINITE-STATE MACHINE9.6 ANOTHER EVENT FINITE-STATE MACHINE DESIGN FROM SPECIFICATION THROUGH TO SIMULATION9.7 THE HOVER MOWER FINITE-STATE MACHINE9.8 AN EXAMPLE WITH A TRANSITION WITHOUT ANY INPUT9.9 UNUSUAL EXAMPLE: RESPONDING TO A MICROPROCESSOR-ADDRESSED LOCATION9.10 AN EXAMPLE THAT USES A MEALY OUTPUT9.11 AN EXAMPLE USING A RELAY CIRCUIT9.12 RACE CONDITIONS IN AN EVENT FINITE-STATE MACHINE9.13 WAIT-STATE GENERATOR FOR A MICROPROCESSOR SYSTEM9.14 DEVELOPMENT OF AN ASYNCHRONOUS FINITE-STATE MACHINE FOR A CLOTHES SPINNER SYSTEM9.15 CAUTION WHEN USING TWO-WAY BRANCHES9.16 SUMMARYREFERENCES
10: Introduction to Petri Nets
10.1 INTRODUCTION TO SIMPLE PETRI NETS10.2 SIMPLE SEQUENTIAL EXAMPLE USING A PETRI NET10.3 PARALLEL PETRI NETS10.4 SYNCHRONIZING FLOW IN A PARALLEL PETRI NET10.5 SYNCHRONIZATION OF TWO PETRI NETS USING ENABLING AND DISABLING ARCS10.6 CONTROL OF A SHARED RESOURCE10.7 A SERIAL RECEIVER OF BINARY DATA10.8 SUMMARYREFERENCE
Appendix A: Logic Gates and Boolean Algebra Used in the Book
A.1 BASIC GATE SYMBOLS USED IN THE BOOK WITH BOOLEAN EQUATIONSA.2 THE EXCLUSIVE OR AND EXCLUSIVE NORA.3 LAWS OF BOOLEAN ALGEBRAA.4 EXAMPLES OF APPLYING THE LAWS OF BOOLEAN ALGEBRAA.5 SUMMARY
Appendix B: Counting and Shifting Circuit Techniques
B.1 BASIC UP AND DOWN SYNCHRONOUS BINARY COUNTER DEVELOPMENTB.2 EXAMPLE FOR A 4-BIT SYNCHRONOUS UP-COUNTER USING T-TYPE FLIP-FLOPSB.3 PARALLEL-LOADING COUNTERS: USING T FLIP-FLOPSB.4 USING D FLIP-FLOPS TO BUILD PARALLEL-LOADING COUNTERS WITH CHEAP PROGRAMMABLE LOGIC DEVICESB.5 SIMPLE BINARY UP-COUNTER: WITH PARALLEL INPUTSB.6 CLOCK CIRCUIT TO DRIVE THE COUNTER (AND FINITE-STATE MACHINES)B.7 COUNTER DESIGN USING DON'T CARE STATESB.8 SHIFT REGISTERSB.9 ASYNCHRONOUS RECEIVER DETAILS OF CHAPTER 4B.10 SUMMARY
Appendix C: Tutorial on the Use of Verilog HDL to Simulate a Finite-State Machine Design
C.1 INTRODUCTIONC.2 THE SINGLE PULSE WITH MEMORY SYNCHRONOUS FINITE-STATE MACHINE DESIGN: USING VERILOG HDL TO SIMULATEC.3 TEST-BENCH MODULE AND ITS PURPOSEC.4 USING SYNAPTICAD'S VERILOGGER EXTREME SIMULATORC.5 SUMMARY
Appendix D: Implementing State Machines using Verilog Behavioural Mode
D.1 INTRODUCTIOND.2 THE SINGLE-PULSE/MULTIPLE-PULSE GENERATOR WITH MEMORY FINITE-STATE MACHINE REVISITEDD.3 THE MEMORY TESTER FINITE-STATE MACHINE IN SECTION 5.6D.4 SUMMARY
Index

Content preview from FSM-based Digital Design using Verilog HDL

10 Introduction to Petri Nets

10.1 INTRODUCTION TO SIMPLE PETRI NETS

The Petri net is a state diagram that can be used to describe the behaviour of both sequential and parallel systems. It was initially conceived by Karl Petri in the 1960s and has had a good following of academics ever since. There is a website devoted to all things Petri at http://www.informatik.unihamburg.de/TGI/PetriNets/.

Petri nets are often used as a tool to study the behaviour of parallel and concurrent systems (not necessarily electrical). They have also been used to study parallel and concurrent programming methods. In recent years, researchers have shown [1] how the Petri net can be used to develop and synthesize electronic FSM systems, in a similar way to how synchronous and asynchronous systems can be developed and synthesized. The main reason for employing Petri nets is the ability to create parallel systems. The following method makes use of material with permission from [1].

Figure 10.1 illustrates a two-state diagram and its Petri net equivalent. In a Petri net, the ‘state’ is represented by a ‘placeholder’ and the ‘transitional lines’ between states are represented by ‘arcs’ that connect the placeholder (P1 and P2) to transition points (T1 and T2). The inputs along the transitional lines of a state diagram are placed against the transition points along the connecting arcs that link one placeholder to another in a Petri net.

The Petri net uses a memory element to represent each placeholder (rather ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.

Read now

Unlock full access

More than 5,000 organizations count on O’Reilly

O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.

Julian F.

Head of Cybersecurity

I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.

Addison B.

Field Engineer

I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.

Amir M.

Data Platform Tech Lead

I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.

Mark W.

Embedded Software Engineer

Publisher Resources

ISBN: 9780470060704Purchase book

Cloud Computing

Data Engineering

Data Science

AI & ML

Programming Languages

Software Architecture

IT/Ops

Security

Design

Business

Soft Skills

FSM-based Digital Design using Verilog HDL

by Peter Minns, Ian Elliott

10

Introduction to Petri Nets

10.1 INTRODUCTION TO SIMPLE PETRI NETS

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.