A fast-Fourier-transform algorithm

An algorithm is found that minimizes the storage in quick Fourier transformation of real even (odd) vectors and requiring as few as $(log_2N-3)N/4$ multiplications. The accuracy is estimated and it is shown that the algorithm error is comparable with thai of conventional complex rapid Fourier transformation algorithm.