uft2fft.m

来自「beamlet变化的工具箱」· M 代码 · 共 38 行

function y=UFT2FFT(u)
% UFT2FFT: Convert Unbiased Fourier Transform to Fast Fourier Transform
% 	fhat = UFT2FFT(u)
% Inputs
%	u		dyadic row vector -- fft_ua(x)
% Outputs
%	fhat	dyadic row vector -- fft(x)
% Description
%	View the entries of u as containing
%	   y'(-n/2), ... , y'(n/2-1)
% where
%	   y'(k) = Sum( x(j+n/2) exp(-2*pi*i*k*j/n) : -n/2 <= j < n/2)
%	This routine places in the array fhat the
% values
%		y(0), ..., y(n-1)
% where
%	  y(k) = Sum( x(j) exp(-2*pi*i*k*j/n) : 0 <= j < n)
%
	x = ifft_ua(u);  % cop-out
	y = fft(x);	
%
%	Copyright (c) 1998 David L. Donoho
%

%
% 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 [e-mail]
%
%
% 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 [e-mail]
%