Print Email Facebook Twitter Higher order convergent fast nonlinear Fourier transform Title Higher order convergent fast nonlinear Fourier transform Author Vaibhav, V.K. (TU Delft Team Raf Van de Plas) Date 2018 Abstract It is demonstrated in this letter that linear multistep methods for integrating ordinary differential equations can be used to develop a family of fast forward scattering algorithms with higher orders of convergence. Excluding the cost of computing the discrete eigenvalues, the nonlinear Fourier transform (NFT) algorithm thus obtained has a complexity of O(KN+CpNlog2N) such that the error vanishes as mathop O(N-p) where p ϵ {1,2,3,4} and K is the number of eigenvalues. Such an algorithm can be potentially useful for the recently proposed NFT-based modulation methodology for optical fiber communication. The exposition considers the particular case of the backward differentiation formula (Cp=p3) and the implicit Adams method (Cp=(p-13,p>1) of which the latter proves to be the most accurate family of methods for fast NFT. Subject Nonlinear Fourier transformZakharov-Shabat scattering problem To reference this document use: http://resolver.tudelft.nl/uuid:12a274a5-a857-467d-8074-d53ab70426a7 DOI https://doi.org/10.1109/LPT.2018.2812808 ISSN 1041-1135 Source IEEE Photonics Technology Letters, 30 (8), 700-703 Bibliographical note Accepted Author Manuscript Part of collection Institutional Repository Document type journal article Rights © 2018 V.K. Vaibhav Files PDF NFT_PTL.pdf 308.96 KB Close viewer /islandora/object/uuid:12a274a5-a857-467d-8074-d53ab70426a7/datastream/OBJ/view