An all-optical soliton FFT computational arrangement in the 3NLSE-domain

Bakaoukas, A. G. (2017) An all-optical soliton FFT computational arrangement in the 3NLSE-domain. Natural Computing. 17(2), pp. 231-248. 1567-7818.

Item Type:	Article
Abstract:	In this paper an all-optical soliton method for calculating the Fast Fourier Transform (FFT) algorithm is presented. The method comes as an extension of the calculation methods (soliton gates) as they become possible in the cubic non-linear 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. The main building block of the arrangement is the half-adder processor. Expanding around the half-adder processor, the “butterfly” calculation process is demonstrated using first order solitons, leading eventually to the realisation of an equivalent to a full Radix-2 FFT calculation algorithm.
Uncontrolled Keywords:	3NLSE domain, All-optical FFT, Cubic non-linear Schrödinger equation, Soliton collisions, Soliton computational schemes, Solitons
Creators:	Bakaoukas, Anastasios G.
Faculties, Divisions and Institutes:	Faculties > Faculty of Arts, Science & Technology > Computing
Date:	4 April 2017
Date Type:	Acceptance
Page Range:	pp. 231-248
Journal or Publication Title:	Natural Computing
Volume:	17
Number:	2
Number of Pages:	18
Language:	English
DOI:	https://doi.org/10.1007/s11047-017-9642-1
ISSN:	1567-7818
Status:	Published / Disseminated
Refereed:	Yes
Related URLs:	https://pure.northampton.ac.uk/en/public...
URI:	http://nectar.northampton.ac.uk/id/eprint/12801

Edit Item

Altmetric