High Speed Programmable Filtering Using Fast Fourier Transform (FFT) Processing

Norman F. Krasner

doi:10.1117/12.933705

28 December 1982 High Speed Programmable Filtering Using Fast Fourier Transform (FFT) Processing

Norman F. Krasner

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.

Citation Download Citation

Norman F. Krasner "High Speed Programmable Filtering Using Fast Fourier Transform (FFT) Processing", Proc. SPIE 0341, Real-Time Signal Processing V, (28 December 1982); https://doi.org/10.1117/12.933705

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

;

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE