1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
|
//
// Copyright 2011 Ettus Research LLC
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program. If not, see <http://www.gnu.org/licenses/>.
//
//
// EMI mitigation.
// Process FULL flag from FIFO so that de-assertion
// (FIFO now not FULL) is delayed by a pseudo random
// value, but assertion is passed straight through.
//
module refill_randomizer
#(parameter BITS=7)
(
input clk,
input rst,
input full_in,
output full_out
);
wire feedback;
reg full_last;
wire full_deasserts;
reg [6:0] shift_reg;
reg [6:0] count;
reg delayed_fall;
always @(posedge clk)
full_last <= full_in;
assign full_deasserts = full_last & ~full_in;
// 7 bit LFSR
always @(posedge clk)
if (rst)
shift_reg <= 7'b1;
else
if (full_deasserts)
shift_reg <= {shift_reg[5:0],feedback};
assign feedback = ^(shift_reg & 7'h41);
always @(posedge clk)
if (rst)
begin
count <= 1;
delayed_fall <= 1;
end
else if (full_deasserts)
begin
count <= shift_reg;
delayed_fall <= 1;
end
else if (count == 1)
begin
count <= 1;
delayed_fall <= 0;
end
else
begin
count <= count - 1;
delayed_fall <= 1;
end
// Full_out goes instantly high if full_in does. However its fall is delayed.
assign full_out = (full_in == 1) || (full_last == 1) || delayed_fall;
endmodule
|
