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
|
function h=ref_pfilt(f,g,a)
%-*- texinfo -*-
%@deftypefn {Function} ref_pfilt
%@verbatim
%REF_PFILT Reference pfilt handling structs
% Usage: h=pfilt(f,g);
% h=pfilt(f,g,a,dim);
%
% pfilt(f,g) applies the filter g to the input f. If f is a
% matrix, the filter is applied along each column.
%
% pfilt(f,g,a) does the same, but downsamples the output keeping only
% every a'th sample (starting with the first one).
%
% pfilt(f,g,a,dim) filters along dimension dim. The default value of
% [] means to filter along the first non-singleton dimension.
%
% The filter g can be a vector, in which case the vector is treated
% as a zero-delay FIR filter.
%
% The filter g can be a cell array. The following options are
% possible:
%
% If the first element of the cell array is the name of one of the
% windows from FIRWIN, the whole cell array is passed onto
% FIRFILTER.
%
% If the first element of the cell array is 'bl', the rest of the
% cell array is passed onto BLFILTER.
%
% If the first element of the cell array is 'pgauss', 'psech',
% the rest of the parameters is passed onto the respective
% function. Note that you do not need to specify the length L.
%
% The coefficients obtained from filtering a signal f by a filter g are
% defined by
%
% L-1
% c(n+1) = sum f(l+1) * g(an-l+1)
% l=0
%
% where an-l is computed modulo L.
%
%@end verbatim
%@strong{Url}: @url{http://ltfat.github.io/doc/reference/ref_pfilt.html}
%@seealso{pconv}
%@end deftypefn
% Copyright (C) 2005-2016 Peter L. Soendergaard <peter@sonderport.dk>.
% This file is part of LTFAT version 2.2.0
%
% 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/>.
if nargin<3
a=1;
end;
[L,W]=size(f);
l=(0:L-1).'/L;
if isstruct(g)
if isfield(g,'h')
g_time=circshift(postpad(g.h,L),g.offset).*exp(2*pi*1i*(round(g.fc*L/2))*l);
G=fft(g_time);
elseif isfield(g,'H')
G=circshift(postpad(g.H(L),L),g.foff(L)).*exp(-2*pi*1i*round(g.delay)*l);
else
error('%s: Unknown filter definition.',upper(mfilename));
end;
else
G=fft(fir2long(g,L));
end;
if numel(a) > 1
% This is possibly a fractional subsampling
afrac = a(1)/a(2);
if a(1) ~= L
error('%s: The length in a(1) is not equal to L.',upper(mfilename));
end
N = L/afrac;
if abs(N-round(N))>1e-5
error('%s: Output length is not integer.',upper(mfilename));
else
N = round(N);
end
foff = g.foff(L);
h=zeros(N,W,assert_classname(f));
for w=1:W
h(:,w) = blfilt(f(:,w),G,N,foff,afrac);
if isstruct(g) && isfield(g,'realonly') && g.realonly
G2 = involute(G);
supp = numel(g.H(L));
foff2 = -L+mod(L-foff-supp,L)+1;
h(:,w) = (h(:,w) + blfilt(f(:,w),G2,N,foff2,afrac))/2;
end;
end;
else
% This is regular subsampling case
if isstruct(g) && isfield(g,'realonly') && g.realonly
G=(G+involute(G))/2;
end;
N=L/a;
h=zeros(N,W,assert_classname(f));
for w=1:W
F=fft(f(:,w));
h(:,w)=ifft(sum(reshape(F.*G,N,a),2))/a;
end;
end
function h = blfilt(f,G,N,foff,afrac)
L = size(f,1);
align = foff - floor(foff/N)*N;
F = circshift(fft(f).*G,-foff);
F = postpad(F,ceil(L/N)*N);
F = circshift(F,align);
F = sum(reshape(F,N,numel(F)/N),2);
h = ifft(F)/afrac;
|