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

Clicks: 216
ID: 105354
2018
Article Quality & Performance Metrics
Overall Quality Improving Quality
0.0 /100
Combines engagement data with AI-assessed academic quality
AI Quality Assessment
Not analyzed
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.
Reference Key
bakaoukas2018annatural Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors Bakaoukas, Anastasios G;
Journal natural computing
Year 2018
DOI
10.1007/s11047-017-9642-1
URL
Keywords
3nlse domain all-optical fft cubic non-linear schrödinger equation soliton collisions soliton computational schemes solitons

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

Comments

No comments yet. Be the first to comment on this article.