Paper
29 April 2013 Coherent optical implementations of the fast Fourier transform and their comparison to the optical implementation of the quantum Fourier transform
Author Affiliations +
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.
© (2013) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Rupert C. D. Young, Philip M. Birch, and Chris R. Chatwin "Coherent optical implementations of the fast Fourier transform and their comparison to the optical implementation of the quantum Fourier transform", Proc. SPIE 8748, Optical Pattern Recognition XXIV, 874806 (29 April 2013); https://doi.org/10.1117/12.2014042
Lens.org Logo
CITATIONS
Cited by 5 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Fourier transforms

Superposition

Waveguides

Spatial light modulators

Wavefronts

Quantum communications

Detection and tracking algorithms

RELATED CONTENT


Back to Top