For classic Fourier transform in the eventual fields there are fast algorithms, among which select the Cooley-Tukey and Good-Thomas algorithms, allowing it is considerably to reduce calculable complication due to indexation points of vectors. It is shown that for the truncated Fourier transformation in remaining classes we will apply the Cooley-Tukey algorithm only, be- cause property of lengths evenness of vectors for the truncated Fourier transformation and requirement of mutual simplicity of Good-Thomas multipliers does not allow to use his algorithmic decision.
Fourier transform, fast Fourier transform, algorithm
"Alhorytm bыstroho preobrazovanyia Fure Huda-Tomasa v konechnыkh poliakh dlia usechennoho vektora" ,
Information Processing Systems,