Abstract
The computation of the Discrete Fourier Transform (DFT) of large two-dimensional sequences requires extraordinary memory commitment. If such memory is not available, the data are stored in peripheral devices and blocks of the records are retrieved sequentially for the calculation of various stages of the DFT. This approach requires a great many input-output operations. The present paper proposes three new algorithms for the reduction of the input-output (I-O) operations. It is proven that the reduction achieved is of a logarithmic order of magnitude.
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.
