|
dan@0
|
1 function [A_sys,b_sys] = ddm_lin_sys_fft_frq_hop(R, Q, frq_hop, win, win_der, mf_ders, sig, N, N_fft, fs)
|
|
dan@0
|
2
|
|
dan@0
|
3 assert(size(mf_ders,1) == N );
|
|
dan@0
|
4 assert(size(mf_ders, 2) == Q);
|
|
dan@0
|
5 assert(size(win,1) == N );
|
|
dan@0
|
6 assert(size(win,2) == 1 );
|
|
dan@0
|
7 assert(size(win_der,1) == N );
|
|
dan@0
|
8 assert(size(win_der,2) == 1 );
|
|
dan@0
|
9 assert(size(sig,1) == N );
|
|
dan@0
|
10 assert(size(sig,2) == 1 );
|
|
dan@0
|
11 assert(N <= N_fft);
|
|
dan@0
|
12
|
|
dan@0
|
13 win_mat = repmat(win, 1, Q);
|
|
dan@0
|
14 frqs_fft = [0:N_fft-1]'*fs*2*pi/N_fft;
|
|
dan@0
|
15 [str_idx end_idx] = zpzh_idxs(N);
|
|
dan@0
|
16 sig_mat = repmat(sig, 1, Q);
|
|
dan@0
|
17 fft_sig_mat_bffr = win_mat .* sig_mat .* mf_ders;
|
|
dan@0
|
18 fft_sig_win_der_bffr = win_der .* sig;
|
|
dan@0
|
19 fft_sig_win_der = fft([fft_sig_win_der_bffr(str_idx,:);zeros(N_fft-N,1);fft_sig_win_der_bffr(end_idx,:)],N_fft,1);
|
|
dan@0
|
20 A = fft([fft_sig_mat_bffr(str_idx,:);zeros(N_fft-N,Q);fft_sig_mat_bffr(end_idx,:)], N_fft, 1); %zero padded sheeza
|
|
dan@0
|
21 b = -(fft_sig_win_der - 1j*frqs_fft.* A(:,1));
|
|
dan@0
|
22 % create the actual matrixes
|
|
dan@0
|
23
|
|
dan@0
|
24 frq_bins = [1:frq_hop:N_fft-R+1];
|
|
dan@0
|
25 frq_lims = [frq_bins;frq_bins+R];
|
|
dan@0
|
26 nr_frqs = length(frq_bins);
|
|
dan@0
|
27 A_sys = zeros(R,Q,nr_frqs);
|
|
dan@0
|
28 b_sys = zeros(R,1,nr_frqs);
|
|
dan@0
|
29
|
|
dan@0
|
30 for k=1:frq_hop:R
|
|
dan@0
|
31 A_sys(k,:,:) = shiftdim(A(k:N_fft-R+k,:).',-1);
|
|
dan@0
|
32 b_sys(k,:,:) = shiftdim(b(k:N_fft-R+k).',-1);
|
|
dan@0
|
33 end
|
|
dan@0
|
34
|
|
dan@0
|
35 end
|
