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

Research output: Contribution to JournalArticle

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.
Original languageEnglish
Pages (from-to)231-248
Number of pages18
JournalNatural Computing
Volume17
Issue number2
DOIs
Publication statusPublished - 4 Oct 2017

Fingerprint

Solitons
Fast Fourier transforms
Adders
Nonlinear equations
Optical fibers

Keywords

  • 3NLSE domain
  • All-optical FFT
  • Cubic non-linear Schrödinger equation
  • Soliton collisions
  • Soliton computational schemes
  • Solitons

Cite this

@article{17cd1c5547f24f2a8c4cfc580f2cf139,
title = "An all-optical soliton FFT computational arrangement in the 3NLSE-domain",
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{\"o}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.",
keywords = "3NLSE domain, All-optical FFT, Cubic non-linear Schr{\"o}dinger equation, Soliton collisions, Soliton computational schemes, Solitons",
author = "Bakaoukas, {Anastasios G.}",
year = "2017",
month = "10",
day = "4",
doi = "10.1007/s11047-017-9642-1",
language = "English",
volume = "17",
pages = "231--248",
journal = "Natural Computing",
issn = "1567-7818",
publisher = "Springer Netherlands",
number = "2",

}

An all-optical soliton FFT computational arrangement in the 3NLSE-domain. / Bakaoukas, Anastasios G.

In: Natural Computing, Vol. 17, No. 2, 04.10.2017, p. 231-248.

Research output: Contribution to JournalArticle

TY - JOUR

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

AU - Bakaoukas, Anastasios G.

PY - 2017/10/4

Y1 - 2017/10/4

N2 - 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.

AB - 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.

KW - 3NLSE domain

KW - All-optical FFT

KW - Cubic non-linear Schrödinger equation

KW - Soliton collisions

KW - Soliton computational schemes

KW - Solitons

U2 - 10.1007/s11047-017-9642-1

DO - 10.1007/s11047-017-9642-1

M3 - Article

VL - 17

SP - 231

EP - 248

JO - Natural Computing

JF - Natural Computing

SN - 1567-7818

IS - 2

ER -