Abstract:
For the original paper see ibid., vol. 31, no. 11, p. 1751-61 (Nov. 1996). The commenter states that the fast Fourier transform (FFT) processor of the aforementioned pape...Show MoreMetadata
Abstract:
For the original paper see ibid., vol. 31, no. 11, p. 1751-61 (Nov. 1996). The commenter states that the fast Fourier transform (FFT) processor of the aforementioned paper by C.C. Hui et al., contains many interesting and novel features. However, it is pointed out that bit reversed input/output FFT algorithms, matrix transposers, and bit reversers have been noted in the literature. In addition, lower radix algorithms can be modified to be made computationally equivalent to higher radix algorithms. Many FFT ideas, including those of the above paper, can also be applied to other important algorithms and architectures.
Published in: IEEE Journal of Solid-State Circuits ( Volume: 33, Issue: 6, June 1998)