习题笔记 Exams/review2015 fsmonehot

Given the following state machine with 3 inputs, 3 outputs, and 10 states:

Derive next-state logic equations and output logic equations by inspection assuming the following one-hot encoding is used: (S, S1, S11, S110, B0, B1, B2, B3, Count, Wait) = (10'b0000000001, 10'b0000000010, 10'b0000000100, ... , 10'b1000000000)

Derive state transition and output logic equations by inspection assuming a one-hot encoding. Implement only the state transition logic and output logic (the combinational logic portion) for this state machine. (The testbench will test with non-one hot inputs to make sure you're not trying to do something more complicated. See fsm3onehot for a description of what is meant by deriving logic equations "by inspection" for one-hot state machines.)

Write code that generates the following equations:

  • B3_next -- next-state logic for state B3
  • S_next
  • S1_next
  • Count_next
  • Wait_next
  • done -- output logic
  • counting
  • shift_ena
  • module top_module(
        input d,
        input done_counting,
        input ack,
        input [9:0] state,    // 10-bit one-hot current state
        output B3_next,
        output S_next,
        output S1_next,
        output Count_next,
        output Wait_next,
        output done,
        output counting,
        output shift_ena
    ); //
        wire S11_next,S110_next,B0_next,B1_next,B2_next;
        // You may use these parameters to access state bits using e.g., state[B2] instead of state[6].
        parameter S=0, S1=1, S11=2, S110=3, B0=4, B1=5, B2=6, B3=7, Count=8, Wait=9;
    
         assign S_next = (state[S] & ~d)|(state[S1] & ~d)|(state[S110] & ~d)|(state[Wait] & ack);
         assign S1_next= (state[S] & d);
         assign S11_next =(state[S1] & d)|(state[S11] & d);
         assign S110_next = (state[S11] & ~d);
         assign B0_next = state[S110] & d;
         assign B1_next = state[B0];
         assign B2_next = state[B1];
         assign B3_next = state[B2];
         assign Count_next = (state[B3])|(state[Count] & ~done_counting);
         assign Wait_next = (state[Count] & done_counting)|(state[Wait] & ~ack);
    
         assign shift_ena = state[B0]|state[B1]|state[B2]|state[B3];
         assign counting = state[Count];
         assign done = state[Wait];
    
    endmodule

  • 16
    点赞
  • 17
    收藏
    觉得还不错? 一键收藏
  • 1
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值