Abstract
A previously proposed algorithm for the FFT (fast Fourier transform) computation of real symmetric and antisymmetric sequences reduced the N-point symmetric FFT computation to a N/4-point complex FFT computation, but the postprocessing involved division by sin(2 pi k/N). For large size N, this may cause stability problems. An algorithm is presented which overcomes the problem for real symmetric and antisymmetric data sequences. A similar algorithm is given for the translational complex conjugate symmetric data sequence. >
Sign-in/Register to access full text options 
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.
