Share Email Print

Proceedings Paper

Coherent optical implementations of the fast Fourier transform and their comparison to the optical implementation of the quantum Fourier transform
Author(s): Rupert C. D. Young; Philip M. Birch; Chris R. Chatwin
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Optical structures to implement the discrete Fourier transform (DFT) and fast Fourier transform (FFT) algorithms for discretely sampled data sets are considered. In particular, the decomposition of the FFT algorithm into the basic Butterfly operations is described, as this allows the algorithm to be fully implemented by the successive coherent addition and subtraction of two wavefronts (the subtraction being performed after one has been appropriately phase shifted), so facilitating a simple and robust hardware implementation based on waveguided hybrid devices as employed in coherent optical detection modules. Further, a comparison is made to the optical structures proposed for the optical implementation of the quantum Fourier transform and they are shown to be very similar.

Paper Details

Date Published: 29 April 2013
PDF: 11 pages
Proc. SPIE 8748, Optical Pattern Recognition XXIV, 874806 (29 April 2013); doi: 10.1117/12.2014042
Show Author Affiliations
Rupert C. D. Young, Univ. of Sussex (United Kingdom)
Philip M. Birch, Univ. of Sussex (United Kingdom)
Chris R. Chatwin, Univ. of Sussex (United Kingdom)

Published in SPIE Proceedings Vol. 8748:
Optical Pattern Recognition XXIV
David Casasent; Tien-Hsin Chao, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?