Fast algorithms for DFT and convolution

In 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.

Name thesis:degree_name

Master of Science

Level thesis:degree_level

Masters

Discipline thesis:degree_discipline

Engineering

Grantor

Rice University

Year dc:date.issued

1978

Author dc:creator

• Merchant, Gulamabbas A.

Advisor dc:contributor.advisor

• Parks, Thomas W.

Statement dc:rights

• Copyright 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.

Language dc:language.iso

eng

Handle dc:identifier.uri

https://hdl.handle.net/1911/104397

OAI identifier oai:identifier

oai:repository.rice.edu:1911/104397