Question: Assembly Language Program Help. I need help with completing the rest of the code for the 0000111 detector. CECS 225 Fall 2017 igital Logic and

Assembly Language Program Help.

I need help with completing the rest of the code for the 0000111 detector.

Assembly Language Program Help. I need help with

CECS 225 Fall 2017 igital Logic and Assembly Programming LAB 6 Moore Finite State Machine Due: Friday, November 3rd, 2017 10 Points OBJECTIVE: Model a "0000111" detector Moore Finite State Machine PROCEDURE: First reference and understand the implementation of the "110" detector discussed in class. The Verilog implementation can be found at https://www.cdaplayground.com/x/3a2C 1. Use the given state diagram below as a reference for modeling this detector S4 "Encode" each state by using a 3-bit binary equivalent of its index i.e. s4 is encoded as 100 Create a state table for this system Use K-Maps to find next state equations for the DFFs and derive the output equation Convert the equations to logic gates and create a Verilog module using gate level primitives to model your design. (Use the DFF module named dffr.v which can be found in the project link at the beginning of this lab description.) Use the given Verilog skelcton module 2. 3. 4. 5. design.sv 1 timescale 1ns/1ps 2: " include "dffry" 3 module moore0000111 (input clk, x, reset, output [2:0] q, output z; wire notx; 5 wire [2:0] notq, d; 6 wire [11:0] w; 7 8 not 9 no (notx, x), 10 n1(notq[O], qo]), 11n2 (notq 1], q[1]), 12 n3 (notq[2], q[2]); 13 14 //fill rest of module with gate level primitives from K-Map 15 16 17 endmodule Lab 1 Page 1 of3

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!