Abstract
An all–optical soliton method for calculating the FFT (Fast Fourier Transform) algorithm is presented. The method comes as an extension of the calculation methods (Soliton Gates) as they become possible in the Cubic Nonlinear Schrödinger Equation (3NLSE) domain, and provides a further proof of the computational abilities of the scheme. The method involves collisions entirely between first order solitons in optical fibers whose propagation evolution is described by the 3NLSE.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Jakubowski, M.H., Steiglitz, K., Squier, R.K.: Computing with Solitons Multi-Valued Logic (Special Issue on Collision Based Computing) (2001)
Jakubowski, M.H., Steiglitz, K., Squier, R.K.: When Can Solitons Compute? Complex Systems 10(1) (1996)
Bakaoukas, A.G., Edwards, J.: Computing in the 3NLS Domain using First Order Solitons. International Journal of Unconventional Computing (IJUC) 5(6) (2009) ISSN: 15487199
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bakaoukas, A.G. (2013). Towards an All-Optical Soliton FFT in the 3NLS-Domain. In: Mauri, G., Dennunzio, A., Manzoni, L., Porreca, A.E. (eds) Unconventional Computation and Natural Computation. UCNC 2013. Lecture Notes in Computer Science, vol 7956. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39074-6_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-39074-6_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39073-9
Online ISBN: 978-3-642-39074-6
eBook Packages: Computer ScienceComputer Science (R0)