Class of Fast Fourier Transform Algorithms for a Real Sequence

The authors propose a class of fast Fourier transform algorithms for a real sequence, whose structures display complete succession in relation to the structures of standard algorithms for a complex sequence. The use of these algorithms makes it possible to halve the required amount of main and readonly memory, and to more than halve the amount of computation as compared to algorithms for a complex sequence.