This semester you will realize a Moore finite state machine for implementing a remote keyless entry system for a vehicle using Discrete logic using NAND gat and D-type flip-flops es An embedded microcontroller programmed using the C programming language The myDAQ using the LabVIEW programming environment A complex programmable logic device using hardware descriptive language This problem provides design specifications and requires you to represent the finite state machine using a state diagram and state table. In Problem Set 3 you will realize the finite state machine using NAND gates and D-type flip-flops A remote keyless entry system consists of two main parts: a transmitter unit, called a key fob, with buttons and a receiver that decodes signals from the transmitter and uses them to control things like locking and unlocking doors and opening and closing powered doors. We will consider a simplified system for a mini-van with a powered side door. The key fob has three input buttons lock (L), unlock (U) and side-door (S). The receiver has three output control signals: driver door unlocked (DD), all doors unlocked (AD) and side-door open (SD) In normal operation: 1. When the lock button is pressed, all doors lock. If the side door is currently open, if first closes then locks Other doors may be physically open but will still lock. A lock signal will override all other button functions. 2. Pressing the unlock button with all doors locked will first unlock the driver\'s door. If the button is held, the remaining doors will unlock. After all doors are unlocked additional hold time will not cause further change. 3. Once the driver\'s door is unlocked, a second press of the unlock button will also unlock the remaining doors Subsequent presses will not cause further change. 4. If all the doors are unlocked, each side-door button press will the side-door button will toggle the side door from closed to open or open to closed 5. An asynchronous reset (R) signal returns the system to the condition that all doors are locked
Moore Machine
Moore machine is an FSM whose outputs depend on only the present state.
A Moore machine can be described by a 6 tuple (Q, , O, , X, q0) where
Q is a finite set of states.
is a finite set of symbols called the input alphabet.
O is a finite set of symbols called the output alphabet.
is the input transition function where : Q × Q
X is the output transition function where X: Q × O
q0 is the initial state from where any input is processed (q0 Q).
Moore Machine to Mealy Machine
Input:
Moore Machine
Output:
Mealy Machine
Step 1
Take a blank Mealy Machine transition table format.
Step 2
Copy all the Moore Machine transition states into this table format..
Step 3
Check the present states and their corresponding outputs in the Moore Machine state table; if for a state Qi output is m, copy it into the output
Homework Sourse
