t_fft_ua.m
来自「beamlet变化的工具箱」· M 代码 · 共 31 行
M
31 行
% t_fft_ua: Adjoint of Unbiased Fast Fourier Transform% x= t_fft_ua(y)% Inputs% y dyadic row vector% Outputs% x dyadic column vector% Description% Performs the adjoint of fft_ua.% View the entries of y as containing% y'(-n/2), ... , y'(n/2-1)% This routine places in the array x% the values% x'(-n/2), ... , x'(n/2-1)% where% x'(j) = Sum( y(k) exp(2*pi*i*k*j/n) : -n/2 <= k < 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 + =
减小字号Ctrl + -
显示快捷键?