📄 t_ifft_ua.m
字号:
% t_ifft_ua: Adjoint of Unbiased Fast Fourier Transform% y=t_ifft_ua(x)% Inputs% x dyadic row vector% Outputs% y dyadic column vector% Description% View the entries of x as containing% x'(-n/2), ... , x'(n/2-1)% This routine makes an array y containing% the values% y'(-n/2), ... , y'(n/2-1)% where% y'(k) = n^-1 * Sum( x'(j) exp( 2*pi*i*k*j/n) : -n/2 <= j < n/2)% %%% Part of BeamLab Version:200% Built:Friday,23-Aug-2002 00:00:00% This is Copyrighted Material% For Copying permissions see COPYING.m% Comments? e-mail beamlab@stat.stanford.edu%%% Part of BeamLab Version:200% Built:Saturday,14-Sep-2002 00:00:00% This is Copyrighted Material% For Copying permissions see COPYING.m% Comments? e-mail beamlab@stat.stanford.edu%
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -