27 December 1990 Improved arithmetic Fourier transform algorithm
Author Affiliations +
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.
© (1990) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Palacharla Paparao, Anjan K. Ghosh, "Improved arithmetic Fourier transform algorithm", Proc. SPIE 1347, Optical Information Processing Systems and Architectures II, (27 December 1990); doi: 10.1117/12.23442; https://doi.org/10.1117/12.23442
PROCEEDINGS
11 PAGES


SHARE
KEYWORDS
Fourier transforms

Integrated circuits

Integrated optics

Parallel computing

RELATED CONTENT

Quantum-inspired on-chip parallel processors
Proceedings of SPIE (May 25 2004)
Performance of a parallel bispectrum estimation code
Proceedings of SPIE (December 01 1991)
Properties And Applications Of Optical Disc Resonators
Proceedings of SPIE (September 22 1987)
Multiple Filter Storage
Proceedings of SPIE (August 02 1982)

Back to Top