A prime factor FFT algorithm using high speed convolution
| dc.contributor.advisor | Parks, Thomas W. | en_US |
| dc.creator | Kolba, Dean Paul | en_US |
| dc.date.accessioned | 2018-12-18T21:23:22Z | en_US |
| dc.date.available | 2018-12-18T21:23:22Z | en_US |
| dc.date.issued | 1977 | en_US |
| dc.description.abstract | Two recently developed ideas, the conversion of a DFT to convolution and the implementation of short convolutions with a minimum of multiplications, are combined to give efficient algorithms for long transforms. Three transform algorithms are compared in terms of number of multiplications and additions. Timing for a prime factor FFT algorithm using high speed convolution, which was programmed for an IBM 37 and an 88 microprocessor, is presented. | en_US |
| dc.format.digitalOrigin | reformatted digital | en_US |
| dc.format.extent | 67 pp | en_US |
| dc.identifier.callno | THESIS E.E. 1977 KOLBA | en_US |
| dc.identifier.citation | Kolba, Dean Paul. "A prime factor FFT algorithm using high speed convolution." (1977) Master’s Thesis, Rice University. <a href="https://hdl.handle.net/1911/104454">https://hdl.handle.net/1911/104454</a>. | en_US |
| dc.identifier.digital | RICE2089 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1911/104454 | en_US |
| dc.language.iso | eng | en_US |
| 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. | en_US |
| dc.title | A prime factor FFT algorithm using high speed convolution | en_US |
| dc.type | Thesis | en_US |
| dc.type.material | Text | en_US |
| thesis.degree.department | Electrical Engineering | en_US |
| thesis.degree.discipline | Engineering | en_US |
| thesis.degree.grantor | Rice University | en_US |
| thesis.degree.level | Masters | en_US |
| thesis.degree.name | Master of Science | en_US |
Files
Original bundle
1 - 1 of 1