11/10/2007 11:53:59 AMweek12-3.ppt1 Intelligent Traffic Controller We want to use a finite state machine to control the traffic lights at an intersection.

Slides:



Advertisements
Similar presentations
Finite State Machine Continued
Advertisements

Lecture 13: Sequential Circuits
FSM Word Problems Today:
Traffic light contoller using FSM
Counters. In class excercise How to implement a “counter”, which will count as 0,3,1,4,5,7,0,3,1,…… Q2Q1Q0D2D1D
Lecture 22: Sequential Circuits Today’s topic –Clocks and sequential circuits –Finite state machines 1.
FSMs 1 Computer Organization I September 2009 © McQuain, Feng & Ribbens Motivation Combinational logic functions can be represented, and defined,
Our First Real System.
Modern VLSI Design 2e: Chapter 5 Copyright  1998 Prentice Hall PTR Topics n Sequential machine implementation: –clocking. n Sequential machine design.
ECE C03 Lecture 101 Lecture 10 Finite State Machine Design Hai Zhou ECE 303 Advanced Digital Design Spring 2002.
Fall 2007 L15: Combinational Circuits Lecture 15: Combinational Circuits Complete logic functions Some combinational logic functions –Half adders –Adders.
Contemporary Logic Design Finite State Machine Design © R.H. Katz Transparency No Chapter #8: Finite State Machine Design 8.5 Finite State Machine.
Give qualifications of instructors: DAP
1 Lecture 14: FSM and Basic CPU Design Today’s topics:  Finite state machines  Single-cycle CPU Reminder: midterm on Tue 10/24  will cover Chapters.
FPGA-Based System Design: Chapter 5 Copyright  2004 Prentice Hall PTR Verilog for sequential machines.
ELEC 1041 Digital Electronics Tutorial: Word Problems

1 COMP541 State Machines Montek Singh Feb 8, 2012.
FPGA-Based System Design: Chapter 5 Copyright  2004 Prentice Hall PTR Topics n Verilog styles for sequential machines. n Flip-flops and latches.
EE434 ASIC & Digital Systems
The Simulation of Traffic Patterns and Optimizing Traffic Lights by Gregg Tabot.
Chapter 10 State Machine Design. 2 State Machine Definitions State Machine: A synchronous sequential circuit consisting of a sequential logic section.
Counters. In class excercise How to implement a “counter”, which will count as 0,3,1,4,5,7,0,3,1,…… Q2Q1Q0D2D1D
Highway Maps of Connecticut Interstate Highways: Connect between two or more states Auxiliary Highways: Connect between one or more Interstates Though.
Modern VLSI Design 4e: Chapter 8 Copyright  2008 Wayne Wolf Topics VHDL register-transfer modeling: –basics using traffic light controller; –synthesis.
DLD Lecture 26 Finite State Machine Design Procedure.
Modern VLSI Design 4e: Chapter 5 Copyright  2008 Wayne Wolf Topics n Sequential machine implementation: –clocking. n Sequential machine design.
1 EE121 John Wakerly Lecture #12 PLD-based state machine structures WITH statements Finite-memory state-machine design PLD-based state-machine design.
Copied with Permission from prof. Mark PSU ECE
1 ENGG 1015 Tutorial Three Examples of Finite State Machines Supplementary notes Learning Objectives  Learn about Design of Finite State Machines Ack.:
Digital System Design using VHDL
Traffic Light Simulation Lynn Jepsen. Introduction and Background Try and find the most efficient way to move cars through an intersection at different.
Computer Organization CS345 David Monismith Based upon notes by Dr. Bill Siever and notes from the Patterson and Hennessy Text.
Computer Architecture Lecture 5 Sequential Circuits Ralph Grishman September 2015 NYU.
Finite State Machine. Clock Clock cycle Sequential circuit Digital logic systems can be classified as combinational or sequential. – Combinational circuits.
1 CS/COE0447 Computer Organization & Assembly Language Chapter 5 Part 3.
Guide Signs Pavement Markings.  Guide signs provide information about intersecting roads, help direct you to cities and towns and show points of interest.
Digital Logic Structures: Chapter 3 COMP 2610 Dr. James Money COMP
Appendix B The Basics of Logic Design
1 Lecture 13: Sequential Circuits, FSM Today’s topics:  Sequential circuits  Finite state machines  Single-cycle CPU Reminder: midterm on Tue 10/20.
Finite State Machines Mealy machine inputs Outputs next state function
Digital Electronics Multiplexer
The Simulation of Traffic Patterns and Optimizing Traffic Lights
Motivation Combinational logic functions can be represented, and defined, by truth tables. Sequential logic function cannot, because their behavior depends.
ECEN 248 Lab 9: Design of a Traffic Light Controller
Appendix B The Basics of Logic Design
EECE 5117C/6017C Lab 2 Traffic Light Controller using FSM
ELEC 1041 Digital Electronics Tutorial: Word Problems
Digital Electronics Multiplexer
Lecture 13: Sequential Circuits, FSM
Chapter Five The Processor: Datapath and Control
CSE 140L Discussion Finite State Machines.
Lecture 13: Sequential Circuits, FSM
ECE 171 Digital Circuits Chapter 13 Finite State Automata
Analysis of Synchronous Sequential Circuits
Chapter Five The Processor: Datapath and Control
EE 319K Introduction to Embedded Systems
Introduction to Sequential Circuits
Analysis of Synchronous Sequential Circuits
Multiplexor A multiplexor is a device that takes a number of data inputs and selects one of them to pass through as its output. The interface of a multiplexor.
22 October 3 classes before 2nd exam! Control 1/16/2019
April 3 Fun with MUXes Implementing arbitrary logical functions
Finite State Machines.
Topics Verilog styles for sequential machines. Flip-flops and latches.
Sequential logic implementation
Traffic Light Simulation
Lecture 24 Logistics Last lecture Today HW7 back today
Counters.
Finite State Machine Continued
Digital System Design ASMD based Design
Presentation transcript:

11/10/ :53:59 AMweek12-3.ppt1 Intelligent Traffic Controller We want to use a finite state machine to control the traffic lights at an intersection of a north-south route and an east- west route – We consider only the green and red lights – We want the lights to change no faster than 30 seconds in each direction So we use a Hz clock

11/10/ :54:14 AMweek12-3.ppt2 Intelligent Traffic Controller There are two output signals – NSlite: When the signal is asserted, the light on the north-south route is green; otherwise, it should be red – EWlite: When the signal is asserted, the light on the east-west route is green; otherwise, it should be red

11/10/ :54:22 AMweek12-3.ppt3 Intelligent Traffic Controller There are two inputs – NScar: Indicates that there is at least one car that is over the detectors placed in the roadbed in the north-south road – EWcar: Indicates that there is at least one car that is over the detectors placed in the roadbed in the east-west road

11/10/ :54:32 AMweek12-3.ppt4 Intelligent Traffic Controller The traffic lights should only change from one direction to the other only if there is a car waiting in the other direction – Otherwise, the light should continue to show green in the same direction

11/10/ :54:40 AMweek12-3.ppt5 Intelligent Traffic Controller Here we need two states – NSgreen: The traffic light is green in the north- south direction – EWgreen: The traffic light is green in the east-west direction

11/10/ :55:01 AMweek12-3.ppt6 Graphical Representation

11/10/ :54:47 AMweek12-3.ppt7 Next State Function and Output Function

11/10/ :55:05 AMweek12-3.ppt8 State Assignment We need to assign state numbers to the states – In this case, we can assign NSgreen to state 0 and EWgreen to state 1 – Therefore we only need 1 bit in the state register

11/10/ :55:12 AMweek12-3.ppt9 Combinational Logic for Next State Function

11/15/2007 2:38:31 PMweek12-5.ppt10 Implementing Intelligent Traffic Controller