Share Email Print

Proceedings Paper

Improved arithmetic Fourier transform algorithm
Author(s): Palacharla Paparao; Anjan K. Ghosh
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 27 December 1990
PDF: 11 pages
Proc. SPIE 1347, Optical Information Processing Systems and Architectures II, (27 December 1990); doi: 10.1117/12.23442
Show Author Affiliations
Palacharla Paparao, Univ. of Iowa (United States)
Anjan K. Ghosh, Univ. of Iowa (United States)

Published in SPIE Proceedings Vol. 1347:
Optical Information Processing Systems and Architectures II
Bahram Javidi, Editor(s)

© SPIE. Terms of Use
Back to Top