The Fast Fourier Transform on a digital image processor --implementation and applications

Eugene V. Price

doi:10.1117/12.937014

9 January 1984 The Fast Fourier Transform on a digital image processor --implementation and applications

Eugene V. Price

Proceedings Volume 0435, Architectures and Algorithms for Digital Image Processing; (1984) https://doi.org/10.1117/12.937014
Event: 27th Annual Technical Symposium, 1983, San Diego, United States

Abstract

A two-dimensional FFT algorithm has been implemented on a pipelined image processor with parallel feedback image data paths. The transform of a 512x512 pixel image, or say 256 images 32x32 pixels in size, can be carried out in one minute (excluding the transpose of the image). The image-processor architecture lends itself very well to some portions of the FFT computation; other portions suggest directions for future hardware development.

Citation Download Citation

Eugene V. Price "The Fast Fourier Transform on a digital image processor --implementation and applications", Proc. SPIE 0435, Architectures and Algorithms for Digital Image Processing, (9 January 1984); https://doi.org/10.1117/12.937014

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

Includes PDF, HTML & Video, when available