Abstract
A relationship between bit-reverse and matrix transpose, in the context of 2-D fast Fourier transforms (FFTs), is explained. This relationship is shown to be useful for hardware and software implementation of 2-D FFTs based on the row-column algorithm: the bit-reverse operations involved in the row and column 1-D transforms of length N can merge with the matrix transpose in-between, to form a single bit-reverse of length N/sup 2/, which is more efficient than considering these operations separately. The relationship is also the basis of a new bit-reverse algorithm. >
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.
