Continue to Site

Welcome to EDAboard.com

Welcome to our site! EDAboard.com is an international Electronics Discussion Forum focused on EDA software, circuits, schematics, books, theory, papers, asic, pld, 8051, DSP, Network, RF, Analog Design, PCB, Service Manuals... and a whole lot more! To participate you need to register. Registration is free. Click here to register now.

Finite state machine for introductory circuits class

Status
Not open for further replies.

catdaddy

Newbie level 1
Newbie level 1
Joined
Mar 15, 2012
Messages
1
Helped
0
Reputation
0
Reaction score
0
Trophy points
1,281
Activity points
1,293
Background: The Scoring in Screwball

There is a game called Screwball. Every time a ball is put in play, either player 1 scores a point or player 2 scores a point. A winner is declared when one player is ahead by 2 points. Starting with a score of 0:0 for P1 vs. P2, a game might progress as follows:
0:1 1:1 2:1 3:1 (P1 Wins!)

The Application: The Win Announcer

Your task is to develop a synchronous sequential machine that uses information about which player scores a point at each stage of a game to indicate BOTH when a player wins and which player wins. Your design should include one reset input to initialize your WIN ANNOUNCER (this may be a synchronous or asynchronous input as you desire). The outputs from your design should indicate BOTH when a win has occurred and which player is the winner.

You are to design two CONCEPTUALLY different finite-state synchronous machines by performing the tasks described in Hardware Lab 5 for the Win Announcer functional specification. (A design which differs by only the type of flip flop (e.g., J-K vs. D) or number of states (i.e., inserting more unnecessary states) is not considered conceptually different.


WHERE DO I START????
 

Status
Not open for further replies.

Part and Inventory Search

Welcome to EDABoard.com

Sponsor

Back
Top