Angelidis P A
BIOTRAST S.A., Thessaloniki, Greece.
Comput Methods Programs Biomed. 1998 Nov;57(3):155-60. doi: 10.1016/s0169-2607(98)00034-0.
The ultra fast Fourier transform (UFFT) provides the means for a very fast computation of a magnetic resonance (MR) image, because it is implemented using only additions and no multiplications at all. It achieves this by approximating the complex exponential functions involved in the Fourier transform (FT) sum with computationally simpler periodic functions. This approximation introduces erroneous spectrum peaks of small magnitude. We examine the performance of this transform in some typical MRI signals. The results show that this transform can very quickly provide an MR image. It is proposed to be used as a replacement of the classically used FFT whenever a fast general overview of an image is required.
超快速傅里叶变换（UFFT）为磁共振（MR）图像的快速计算提供了一种方法，因为它仅通过加法实现，完全不涉及乘法。它通过用计算更简单的周期函数逼近傅里叶变换（FT）求和中涉及的复指数函数来实现这一点。这种逼近会引入幅度较小的错误频谱峰值。我们研究了这种变换在一些典型MRI信号中的性能。结果表明，这种变换能够非常快速地提供一幅MR图像。建议在需要对图像进行快速总体概览时，将其用作经典使用的FFT的替代方法。
