Improved arithmetic Fourier transform algorithm

Palacharla Paparao; Anjan K. Ghosh

doi:10.1117/12.23442

27 December 1990 Improved arithmetic Fourier transform algorithm

Palacharla Paparao, Anjan K. Ghosh

Author Affiliations +

Proceedings Volume 1347, Optical Information Processing Systems and Architectures II; (1990) https://doi.org/10.1117/12.23442
Event: 34th Annual International Technical Symposium on Optical and Optoelectronic Applied Science and Engineering, 1990, San Diego, CA, United States

Abstract

A new improved version of the arithmetic Fourier transform algorithm is presented. This algorithm computes the Fourier coefficients of continuous -time signals using the number-theoretic technique ofMobius inversion. The major advantage of this algorithm is that it needs mostly addition operations, except for a few real multiplications. The improved version can be realized efficiently on integrated circuit chips and optical parallel processors using tapped delay lines.

Citation Download Citation

Palacharla Paparao and Anjan K. Ghosh "Improved arithmetic Fourier transform algorithm", Proc. SPIE 1347, Optical Information Processing Systems and Architectures II, (27 December 1990); https://doi.org/10.1117/12.23442

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