zoukankan
html css js c++ java
【原创】等效采样状态机控制工程(测试通过,待完善说明书)
工程文件:/Files/lwpo2008/SampleLogic.rar
module
SampleLogic(
input
rst_n,
input
iclk,
input
trig,
output
reg
oclk
);
parameter
IDLE
=
4
'
b0001,
WAIT_RISE
=
4
'
b0010,
WAIT_FALL
=
4
'
b0100,
WAIT_END
=
4
'
b1000;
parameter
PULSE_WIDTH
=
9
'
d50;
parameter
LENGTH
=
9
'
d306;
reg
[
3
:
0
] current_state,
//
state
next_state;
reg
r_data_in0,
//
detect the risingedge reg
r_data_in1,
o_rising_edge;
reg
[
8
:
0
] count,
//
count for delay
delay;
reg
[
7
:
0
] n_delta_t;
reg
count_rst_n;
reg
delay_rst_n;
reg
count_delta_t;
//
sequential circuit
always
@(
posedge
iclk,
negedge
rst_n)
begin
if
(
!
rst_n)
begin
current_state
<=
IDLE;
end
else
begin
current_state
<=
next_state;
end
end
//
combinational circuit for state logic
always
@(current_state,count,n_delta_t,o_rising_edge,delay)
begin
next_state
=
IDLE;
case
(current_state)
IDLE : next_state
=
o_rising_edge
?
WAIT_RISE : IDLE;
WAIT_RISE : next_state
=
(count
==
n_delta_t)
?
WAIT_FALL : WAIT_RISE;
WAIT_FALL : next_state
=
(delay
==
PULSE_WIDTH)
?
WAIT_END : WAIT_FALL;
WAIT_END : next_state
=
(count
>=
LENGTH)
?
IDLE : WAIT_END;
endcase
end
//
combinational circuit for output logic
always
@(
posedge
iclk,
negedge
rst_n)
begin
if
(
~
rst_n)
oclk
<=
1
'
b0;
else
begin
oclk
<=
1
'
b0;
case
(current_state)
IDLE :
begin
oclk
<=
1
'
b0;
count_rst_n
<=
1
'
b0;
delay_rst_n
<=
1
'
b0;
count_delta_t
<=
1
'
b0;
end
WAIT_RISE :
begin
oclk
<=
1
'
b0;
count_rst_n
<=
1
'
b1;
delay_rst_n
<=
1
'
b0;
count_delta_t
<=
1
'
b1;
end
WAIT_FALL :
begin
oclk
<=
1
'
b1;
count_rst_n
<=
1
'
b1;
delay_rst_n
<=
1
'
b1;
end
WAIT_END :
begin
oclk
<=
1
'
b0;
count_rst_n
<=
1
'
b1;
delay_rst_n
<=
1
'
b0;
end
endcase
end
end
//
detect the rising edge
always
@(
posedge
iclk,
negedge
rst_n)
begin
if
(
!
rst_n)
begin
r_data_in0
<=
0
;
r_data_in1
<=
0
;
end
else
begin
r_data_in0
<=
r_data_in1;
r_data_in1
<=
trig;
end
end
always
@(r_data_in0,r_data_in1)
begin
o_rising_edge
=
~
r_data_in0
&
r_data_in1;
//
o_rising_edge output
end
//
counter
always
@(
posedge
iclk)
begin
if
(
~
count_rst_n)
count
<=
9
'
b0_0000_0000;
else
count
<=
count
+
1
'
b1;
if
(
~
delay_rst_n)
delay
<=
9
'
b0_0000_0000;
else
delay
<=
delay
+
1
'
b1;
end
always
@(
posedge
count_delta_t,
negedge
rst_n)
begin
if
(
~
rst_n)
n_delta_t
<=
8
'
d0;
else
n_delta_t
<=
n_delta_t
+
1
'
b1;
end
endmodule
综合后RTL图:
高调做事,低调做人
查看全文
相关阅读:
Preliminaries for Benelux Algorithm Programming Contest 2019: I. Inquiry I
Preliminaries for Benelux Algorithm Programming Contest 2019:A:Architecture
pta刷题:L1-008 求整数段和 (10分)记录总结
关系代数复习ing
操作系统学习笔记:银行家算法浅谈
mysql学习笔记:复习ing
mysql学习笔记:集合运算并交差,其他
JZOJ1900. 【2010集训队出题】矩阵
【2019暑假】08.14比赛总结
【2019暑假集训】08.13比赛总结
原文地址:https://www.cnblogs.com/oneseven/p/1551744.html
最新文章
ASI中POST请求和文件下载
ASI的其他使用方法
Chrome插件
luogu_1631【题解】
luogu_2107【题解】
luogu_1168【题解】
luogu_2420【题解】
[题解](折半搜索)luogu_P4799_BZOJ_4800世界冰球锦标赛
[题解](双向bfs)hdu_3085_Nightmare Ⅱ
[题解](折半搜索/高斯消元枚举自由元)BZOJ_1770_Lights
热门文章
[题解](gcd/lcm)luogu_P1072_Hankson的趣味题(NOIP2009)
[题解](数学)BZOJ_1257_余数求和
[题解](约数)BZOJ_1053_反素数
[题解](区间质数筛)POJ_2689 Prime Distance
[不务正业]2019-5-9光光老师的阅读推荐
[题解](树的计数)luogu_P4430猴子打架_/_luogu_P4981父子
[题解]luogu_P2613有理数取余
sql语言复习:讨论在学生-学习-课程表上
2019-ICPC沈阳重现:7-1 A-Leftbest
Preliminaries for Benelux Algorithm Programming Contest 2019:K. Knapsack Packing
Copyright © 2011-2022 走看看