Lemmings1

exams/ece241_2013_q4Previous

Nextlemmings2

The game Lemmings involves critters with fairly simple brains. So simple that we are going to model it using a finite state machine.

In the Lemmings' 2D world, Lemmings can be in one of two states: walking left or walking right. It will switch directions if it hits an obstacle. In particular, if a Lemming is bumped on the left, it will walk right. If it's bumped on the right, it will walk left. If it's bumped on both sides at the same time, it will still switch directions.

Implement a Moore state machine with two states, two inputs, and one output that models this behaviour.

See also: Lemmings2, Lemmings3, and Lemmings4.

Module Declaration

module top_module(
    input clk,
    input areset,    // Freshly brainwashed Lemmings walk left.
    input bump_left,
    input bump_right,
    output walk_left,
    output walk_right); 

//  

    // parameter LEFT=0, RIGHT=1, ...
    reg state, next_state;

    always @(*) begin
        // State transition logic
    end

    always @(posedge clk, posedge areset) begin
        // State flip-flops with asynchronous reset
    end

    // Output logic
    // assign walk_left = (state == ...);
    // assign walk_right = (state == ...);

Hint...

Write your solution here

[Load a previous submission]Load

module top_module( ); endmodule

Upload a source file...

Or upload a file

Verilog source:

Show solution

Solution

Loading...

• fsm1s
• fsm2
• fsm2s
• fsm3comb
• fsm3onehot
• fsm3
• fsm3s
• exams/ece241_2013_q4 ·

lemmings1

• · lemmings2
• lemmings3
• lemmings4
• fsm_onehot
• fsm_ps2
• fsm_ps2data
• fsm_serial
• fsm_serialdata

exams/ece241_2013_q4Previous

Nextlemmings2