/
filter_fast.m
190 lines (174 loc) · 5.79 KB
/
filter_fast.m
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
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
function [X,Zf] = filter_fast(B,A,X,Zi,dim)
% Like filter(), but faster when both the filter and the signal are long.
% [Y,Zf] = filter_fast(B,A,X,Zi,Dim)
%
% Uses FFT convolution. The function is faster than filter when approx. length(B)>256 and
% size(X,Dim)>1024, otherwise slower (due size-testing overhead).
%
% See also:
% filter, fftfilt
%
% Christian Kothe, Swartz Center for Computational Neuroscience, UCSD
% 2010-07-09
%
% contains fftfilt.m from Octave:
% Copyright (C) 1996-1997 John W. Eaton
% Copyright (C) Christian Kothe, SCCN, 2010, ckothe@ucsd.edu
%
% 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 2 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,
% write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
% USA
if nargin <= 4
dim = find(size(X)~=1,1); end
if nargin <= 3
Zi = []; end
lenx = size(X,dim);
lenb = length(B);
if lenx == 0
% empty X
Zf = Zi;
elseif lenb < 256 || lenx<1024 || lenx <= lenb || lenx*lenb < 4000000 || ~isequal(A,1)
% use the regular filter
if nargout > 1
[X,Zf] = filter(B,A,X,Zi,dim);
else
X = filter(B,A,X,Zi,dim);
end
else
was_single = strcmp(class(X),'single');
% fftfilt can be used
if isempty(Zi)
% no initial conditions to take care of
if nargout < 2
% and no final ones
X = unflip(oct_fftfilt(B,flip(double(X),dim)),dim);
else
% final conditions needed
X = flip(X,dim);
[dummy,Zf] = filter(B,1,X(end-length(B)+1:end,:),Zi,1); %#ok<ASGLU>
X = oct_fftfilt(B,double(X));
X = unflip(X,dim);
end
else
% initial conditions available
X = flip(X,dim);
% get a Zi-informed piece
tmp = filter(B,1,X(1:length(B),:),Zi,1);
if nargout > 1
% also need final conditions
[dummy,Zf] = filter(B,1,X(end-length(B)+1:end,:),Zi,1); %#ok<ASGLU>
end
X = oct_fftfilt(B,double(X));
% incorporate the piece
X(1:length(B),:) = tmp;
X = unflip(X,dim);
end
if was_single
X = single(X); end
end
function X = flip(X,dim)
if dim ~= 1
order = 1:ndims(X);
order = order([dim 1]);
X = permute(X,order);
end
function X = unflip(X,dim)
if dim ~= 1
order = 1:ndims(X);
order = order([dim 1]);
X = ipermute(X,order);
end
function y = oct_fftfilt(b, x, N)
% Copyright (C) 1996, 1997 John W. Eaton
%
% This file is part of Octave.
%
% Octave 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 2, or (at your option)
% any later version.
%
% Octave 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 Octave; see the file COPYING. If not, write to the Free
% Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
% 02110-1301, USA.
%
% -*- texinfo -*-
% @deftypefn {Function File} {} fftfilt (@var{b}, @var{x}, @var{n})
%
% With two arguments, @code{fftfilt} filters @var{x} with the FIR filter
% @var{b} using the FFT.
%
% Given the optional third argument, @var{n}, @code{fftfilt} uses the
% overlap-add method to filter @var{x} with @var{b} using an N-point FFT.
%
% If @var{x} is a matrix, filter each column of the matrix.
% @end deftypefn
%
% Author: Kurt Hornik <Kurt.Hornik@wu-wien.ac.at>
% Created: 3 September 1994
% Adapted-By: jwe
% If N is not specified explicitly, we do not use the overlap-add
% method at all because loops are really slow. Otherwise, we only
% ensure that the number of points in the FFT is the smallest power
% of two larger than N and length(b). This could result in length
% one blocks, but if the user knows better ...
transpose = (size(x,1) == 1);
if transpose
x = x.'; end
[r_x,c_x] = size(x);
[r_b,c_b] = size(b);
if min([r_b, c_b]) ~= 1
error('octave:fftfilt','fftfilt: b should be a vector'); end
l_b = r_b*c_b;
b = reshape(b,l_b,1);
if nargin == 2
% Use FFT with the smallest power of 2 which is >= length (x) +
% length (b) - 1 as number of points ...
N = 2^(ceil(log(r_x+l_b-1)/log(2)));
B = fft(b,N);
y = ifft(fft(x,N).*B(:,ones(1,c_x)));
else
% Use overlap-add method ...
if ~isscalar(N)
error ('octave:fftfilt','fftfilt: N has to be a scalar'); end
N = 2^(ceil(log(max([N,l_b]))/log(2)));
L = N - l_b + 1;
B = fft(b, N);
B = B(:,ones(c_x,1));
R = ceil(r_x / L);
y = zeros(r_x, c_x);
for r = 1:R
lo = (r - 1) * L + 1;
hi = min(r * L, r_x);
tmp = zeros(N, c_x);
tmp(1:(hi-lo+1),:) = x(lo:hi,:);
tmp = ifft(fft(tmp).*B);
hi = min(lo+N-1, r_x);
y(lo:hi,:) = y(lo:hi,:) + tmp(1:(hi-lo+1),:);
end
end
y = y(1:r_x,:);
if transpose
y = y.'; end
% Final cleanups: if both x and b are real respectively integer, y
% should also be
if isreal(b) && isreal(x)
y = real(y); end
if ~any(b - round(b))
idx = ~any(x - round(x));
y(:,idx) = round(y(:,idx));
end