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.

中文翻译：

---

3NLSE域中的全光孤子FFT计算安排。

本文提出了一种用于计算快速傅立叶变换（FFT）算法的全光孤子方法。该方法是对计算方法（孤门）的扩展，因为它们在三次非线性Schrödinger方程（3NLSE）域中成为可能，并且为该方案的计算能力提供了进一步的证明。该方法涉及整个光纤中一阶孤子之间的碰撞，其传播演化由3NLSE描述。该安排的主要组成部分是半加法处理器。围绕半加法处理器扩展，使用一阶孤子演示了“蝴蝶”计算过程，最终导致了等效于完整Radix-2 FFT计算算法的实现。