Fast algorithms for DFT and convolution

dc.contributor.advisorParks, Thomas W.
dc.creatorMerchant, Gulamabbas A.
dc.date.accessioned2018-12-18T21:22:22Z
dc.date.available2018-12-18T21:22:22Z
dc.date.issued1978
dc.descriptionText includes handwritten formulas
dc.description.abstractIn this thesis, a detailed analysis of sufficient conditions for existence of unique multidimensional linear and multidimensional non-linear Index map has been presented, along with a new Index representation. The recent Ideas of converting Discrete Fourier Transform to convolution and Implementing convolution efficiently, have been combined to give two algorithms viz. Nested Fourier Algorithm (NFA -- using linear multidimensional map) and Index Fourier Algorithm (IFA using a non-linear Index map). The two algorithms have been compared for the amount of arithmetic computations required. The algorithms have been Implemented In FORTRAN on IBM 37/155 and their execution timings have been compared.
dc.format.digitalOriginreformatted digital
dc.format.extent132 pp
dc.identifier.callnoTHESIS E.E. 1978 MERCHANT
dc.identifier.citationMerchant, Gulamabbas A.. "Fast algorithms for DFT and convolution." (1978) Master’s Thesis, Rice University. <a href="https://hdl.handle.net/1911/104397">https://hdl.handle.net/1911/104397</a>.
dc.identifier.digitalRICE2032
dc.identifier.urihttps://hdl.handle.net/1911/104397
dc.language.isoeng
dc.rightsCopyright is held by the author, unless otherwise indicated. Permission to reuse, publish, or reproduce the work beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder.
dc.titleFast algorithms for DFT and convolution
dc.typeThesis
dc.type.materialText
thesis.degree.departmentElectrical Engineering
thesis.degree.disciplineEngineering
thesis.degree.grantorRice University
thesis.degree.levelMasters
thesis.degree.nameMaster of Science
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
RICE2032.pdf
Size:
4.05 MB
Format:
Adobe Portable Document Format