28 December 1982 High Speed Programmable Filtering Using Fast Fourier Transform (FFT) Processing
Author Affiliations +
Proceedings Volume 0341, Real-Time Signal Processing V; (1982) https://doi.org/10.1117/12.933705
Event: 1982 Technical Symposium East, 1982, Arlington, United States
Abstract
Fast Fourier transform methods are attractive techniques for implementing high speed programmable filters, especially when flexibility, accuracy, and sharp filter transition regions are important considerations. In this paper are some design considerations in the implementation of such filters. A new high capacity, high speed FFT architecture is presented which is being incorporated in a nearly completed development model for a flexible series of FFT processors. It is shown how this processor may be efficiently embedded in an overall programmable filtering structure.
© (1982) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Norman F. Krasner, Norman F. Krasner, } "High Speed Programmable Filtering Using Fast Fourier Transform (FFT) Processing", Proc. SPIE 0341, Real-Time Signal Processing V, (28 December 1982); doi: 10.1117/12.933705; https://doi.org/10.1117/12.933705
PROCEEDINGS
4 PAGES


SHARE
RELATED CONTENT

Simple configurable systolic array
Proceedings of SPIE (June 14 1996)
Denoising using time-frequency and image processing methods
Proceedings of SPIE (November 02 1999)
Real-Time Signal Processing With Two-Dimensional Filters
Proceedings of SPIE (December 12 1978)
Recursion In Wigner Distribution
Proceedings of SPIE (February 23 1988)
Dual Chirp-Z Transform
Proceedings of SPIE (September 21 1979)
Optical Hartley-transform-based adaptive filter
Proceedings of SPIE (November 01 1991)

Back to Top