A prime factor FFT algorithm using high speed convolution

Simple item page
dc.contributor.advisorParks, Thomas W.
dc.creatorKolba, Dean Paul
dc.date.accessioned2018-12-18T21:23:22Z
dc.date.available2018-12-18T21:23:22Z
dc.date.issued1977
dc.description.abstractTwo 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.
dc.format.digitalOriginreformatted digital
dc.format.extent67 pp
dc.identifier.callnoTHESIS E.E. 1977 KOLBA
dc.identifier.citationKolba, 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>.
dc.identifier.digitalRICE2089
dc.identifier.urihttps://hdl.handle.net/1911/104454
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.titleA prime factor FFT algorithm using high speed 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
Thumbnail Image
Name:
RICE2089.pdf
Size:
2.18 MB
Format:
Adobe Portable Document Format
Download
Collections
Rice University Electronic Theses and Dissertations