An All-optical Soliton FFT Computational Arrangement In The 3NLSE-domain

Bakaoukas, A. (2017) An All-optical Soliton FFT Computational Arrangement In The 3NLSE-domain. In: Natural Computing : Special Issue: Unconventional Computing and Natural Computing 2016—Selected Papers from 2016 Conference. Springer. pp. 231-248.

Texts
Information

[A][B][+][-]

20251:61705

[A][B][+][-]

20251:61705

[thumbnail of Bakaoukas_2017_An All-optical Soliton FFT Computational Arrangement In The 3NLSE-domain]

Bakaoukas_2017_An All-optical Soliton FFT Computational Arrangement In The 3NLSE-domain
Bakaoukas_2017_An_All-optical_Soliton_FFT_Computational_Arrangement_In_The_3NLSE-domain.pdf - Published Version
Available under License Creative Commons Attribution.

Information

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:

Unconventional Computing, Solitons, Computing With Solitons

Creators:

Bakaoukas, A.

Publisher:

Springer

Date:

4 October 2017

Date Type:

Publication

Page Range:

pp. 231-248

Title of Book:

Natural Computing : Special Issue: Unconventional Computing and Natural Computing 2016—Selected Papers from 2016 Conference

Volume:

Number of Pages:

Language:

English

Status:

Published / Disseminated

Refereed:

Yes