Fast computation algorithm for the discrete Fourier transform of a real-valued sequence
Mamoru Tsuchiya · Electronics and Communications in Japan (Part III Fundamental Electronic Science) · 1997
This paper describes a new fast computation algorithm for the discrete Fourier transform (DFT) of a real-valued sequence. The algorithm derived in this paper can compute by in-place processing using real arithmetic computation alone, in the same way as the method which uses the discrete Hartley transform (DHT). Structurally, the algorithm requires fewer computation operations than in the case with the DHT. An N-point DFT of a real-valued sequence can be computed by breaking it up into a single length-(N/2) DFT over the even-indexed part of the input sequence and two length-(N/4) DCTs over the odd-indexed part of the input sequence. © 1997 Scripta Technica, Inc. Electron Comm Jpn Pt 3, 80(9): 11–20, 1997