-The implementation of a numerical algorithm for computing a NFT is however not as simple as for the conventional Fourier transform. While quite a few algorithms have been presented in the literature, *there is not a single publically available software library that implements numerical NFTs.* We believe that the lack of a reliable and efficient software library for computing NFTs is currently hindering progress in the field. For this reason, we have published *FNFT* on [GitHub](https://github.com/FastNFT/FNFT). FNFT, which is short for "Fast Nonlinear Fourier Transforms", is a software library that provides implementations of the fast NFT algorithms that were developed by some of the authors in [@Wahls2013], [@Wahls2015] and [@Prins2018]. Our goal was to develop an efficient, easy to use and reliable library. Therefore, FNFT was written in C and ships with a MATLAB interface as well as currently more than 60 unit and integration tests. To simplify the build process as much as possible, FNFT uses [CMake](http://www.cmake.org). FNFT has no external dependencies, but ships with some 3rd party code from the open source projects [EISCOR](https://github.com/eiscor/eiscor) (also see [@Aurentz2017]) and [KissFFT](http://kissfft.sourceforge.net/).
0 commit comments