Show simple item record

dc.contributor.authorDaBell, Steve
dc.date.accessioned2016-06-02T23:25:06Z
dc.date.available2016-06-02T23:25:06Z
dc.date.issued1994-10
dc.identifier.issn0884-5123
dc.identifier.issn0074-9079
dc.identifier.urihttp://hdl.handle.net/10150/611675
dc.descriptionInternational Telemetering Conference Proceedings / October 17-20, 1994 / Town & Country Hotel and Conference Center, San Diego, Californiaen_US
dc.description.abstractIn many signal processing and telemetry applications only a portion of the Discrete Fourier Transform (DFT) of a data sequence is of interest. This paper develops an algorithm which enables computation of the FFT only over the frequency values of interest, reducing the computational complexity. As will be shown, the algorithm is also very modular which lends to efficient parallel processing implementation. This paper will begin by developing the frequency selective FFT algorithm, and conclude with a comparative analysis of the computational complexity of the algorithm with respect to the traditional FFT.
dc.description.sponsorshipInternational Foundation for Telemeteringen
dc.language.isoen_USen
dc.publisherInternational Foundation for Telemeteringen
dc.relation.urlhttp://www.telemetry.org/en
dc.rightsCopyright © International Foundation for Telemeteringen
dc.subjectFast Fourier Transformen
dc.subjectEfficient Computationen
dc.subjectArbitrary Frequency Intervalsen
dc.titleAn Algorithm for Efficient Computation of the Fast Fourier Transform Over Arbitrary Frequency Intervalsen_US
dc.typetexten
dc.typeProceedingsen
dc.contributor.departmentMotorola GSTGen
dc.identifier.journalInternational Telemetering Conference Proceedingsen
dc.description.collectioninformationProceedings from the International Telemetering Conference are made available by the International Foundation for Telemetering and the University of Arizona Libraries. Visit http://www.telemetry.org/index.php/contact-us if you have questions about items in this collection.en
refterms.dateFOA2018-06-22T22:02:54Z
html.description.abstractIn many signal processing and telemetry applications only a portion of the Discrete Fourier Transform (DFT) of a data sequence is of interest. This paper develops an algorithm which enables computation of the FFT only over the frequency values of interest, reducing the computational complexity. As will be shown, the algorithm is also very modular which lends to efficient parallel processing implementation. This paper will begin by developing the frequency selective FFT algorithm, and conclude with a comparative analysis of the computational complexity of the algorithm with respect to the traditional FFT.


Files in this item

Thumbnail
Name:
ITC_1994_94-707.pdf
Size:
261.7Kb
Format:
PDF

This item appears in the following Collection(s)

Show simple item record