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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
