第一階段上機實作測試

`define NUM_STATE_BITS 2
`define IDLE 2'b00
`define COMPUTE1 2'b01
`define COMPUTE2 2'b10
module cl(clk);
parameter TIME_LIMIT = 110000; //1250;
output clk;
reg clk;
initialclk = 0;
always#50 clk = ~clk;
always @(posedge clk)
if ($time > TIME_LIMIT) #70 $stop;
endmodule
module slow_div_system(pb,ready,x,y,r3,sysclk);
input pb,x,y,sysclk;
output ready,r3;
wire pb;
wire [11:0] x,y;
reg ready;
reg [11:0] r1,r2,r3;
reg [`NUM_STATE_BITS-1:0] present_state;
alwaysbegin @(posedge sysclk)
enter_new_state(`IDLE);
r1 <= @(posedge sysclk) x; r2 <= @(posedge sysclk) y; r3 <= @(posedge sysclk) 0; ready = 1; if (pb) begin if (r1 >0)
while (r1 >0)
begin
@(posedge sysclk) enter_new_state(`COMPUTE1);
r1 <= @(posedge sysclk) r1 - 1;
@(posedge sysclk) enter_new_state(`COMPUTE2);
r3 <= @(posedge sysclk) r2+r3;
end
end
end
task enter_new_state;
input [`NUM_STATE_BITS-1:0] this_state;
beginpresent_state = this_state;
#1 ready=0;
end
endtask
always @(posedge sysclk) #20
$display("%d r1=%d r2=%d r3=%d pb=%b ready=%b", $time, r1,r2,r3,pb,ready);
endmodule
module top;
reg pb;
reg [11:0] x,y;
wire [11:0] quotient;
wire ready;
integer s;
wire sysclk;
cl #20000 clock(sysclk);
slow_div_system slow_div_machine(pb,ready,x,y,quotient,sysclk);
initial
begin
pb= 0;
x = 9;
y = 9;
#250;
@(posedge sysclk);
begin@(posedge sysclk);
pb = 1;
@(posedge sysclk);
pb = 0;
@(posedge sysclk);
wait(ready);
@(posedge sysclk);
if (x*y === quotient)$display("ok");
else$display("error x=%d y=%d x/y=%d quotient=d",x,y,x/y,quotient);
end
$stop;
end
endmodule

乘法器之ASM圖

紅綠燈程式碼

module top;
reg clk,reset;
wire [1:0]state,speed;
wire [2:0]count;
wire stop;
GYR G1(clk,reset,state,stop,speed,count);
initial
begin
#0 begin reset=1;clk=0;
end
#10 reset=0;
#10 clk=1;
repeat(30) #5 clk=~clk;
end
initial
#400 $finish;
endmodule
module GYR(clk,reset,state,stop,speed,count);
parameter GREEN=2'b00,YELLOW=2'b01,RED=2'b10;
input clk,reset;
output [1:0]state,speed;
output [2:0]count;
output stop;
reg [1:0]state,speed,states;
reg [2:0]count;
reg stop;
always@(posedge clk or reset)
begin
if(reset)
begin
states=GREEN;
count=3'b000;
state=0;
stop=0;
speed=2'b11;
end
else
begin
if(states==GREEN && count==3'b000)
begin
state=GREEN;
stop=0;
speed=2'b11;
count=3'b000;
states=YELLOW;
end
else if(states==YELLOW && count==3'b000)
begin
state=YELLOW;
stop=1;
speed=2'b01;
count=3'b000;
states=RED;
end
else if(states==RED && count==3'b000)
beginstate=RED;
stop=1;
speed=2'b00;
count=3'b001;
states=GREEN;
end
else if(states==GREEN && count==3'b001)
begin
state=GREEN;
stop=0;
speed=2'b11;
count=3'b011;states=YELLOW;
endelse if(states==YELLOW && count==3'b011)
begin
state=YELLOW;
stop=1;
speed=2'b01;
count=3'b011;
states=RED;
end
else if(states==RED && count==3'b011)
begin
state=RED;
stop=1;
speed=2'b00;
count=3'b100;
states=GREEN;
endelse if(states==GREEN && count==3'b100)
begin
state=GREEN;
stop=0;
speed=2'b11;
count=3'b000;
states=YELLOW;
end
end
end
endmodule

除法器

一開始跑ㄆ出結果.把最上面ㄉ標示刪除.便可以跑出結果ㄌ!!

除法器ㄉ流程圖

須先了解除法器ㄉ流程圖.才能加以修改成乘法器.以通過第一階段ㄉ測試!!

除法器簡介

最初除法器的原理是：
假 如Ａ是被除數，Ｂ是除數，Ａ為八位元，Ｂ為四位元；則我們一開始便以Ａ之最高四位元去減Ｂ，如果結果是正，那表示運算正確，除數 ＳＨＩＦＴ一位，即剛剛結果的 最高五位元，減去Ｂ，且商數最高位設為１，表示減去了１６Ｂ。 如果說剛剛所做的運算結果是負的，表示Ａ比１６Ｂ還小，所以我 們剛剛所做的運算是錯的，必須加回去，然後除數ＳＨＩＦＴ一位 ，即原先的Ａ最高五位元減去Ｂ，即Ａ－８Ｂ，商數最高位元設為 ０，如此類推下去即可求出所有的商，這種方法稱為 ＲＥＳＴＯＲＩＮＧ。 下圖就是這種類型除法器的流程圖!!

3/26 上課心得

PB(Push Button) : 按鈕
IDLE : 待機