International Telemetering Conference Proceedings / October 17-20, 1994 / Town & Country Hotel and Conference Center, San Diego, California / In 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.
| Identifer | oai:union.ndltd.org:arizona.edu/oai:arizona.openrepository.com:10150/611675 |
| Date | 10 1900 |
| Creators | DaBell, Steve |
| Contributors | Motorola GSTG |
| Publisher | International Foundation for Telemetering |
| Source Sets | University of Arizona |
| Language | en_US |
| Detected Language | English |
| Type | text, Proceedings |
| Rights | Copyright © International Foundation for Telemetering |
| Relation | http://www.telemetry.org/ |
Page generated in 0.0024 seconds