Nonlinearizad of Fast Fourier Transform

Abstract

A unified mathematical form of reversible nonlinear transformations based on a nonlinear tensor product is presented in the form of fast algorithms. The main goal of this article is to show that almost all Fourier transforms (FFTs) can be both generalized and non-linear. Nonlinearity and generalization of the FFT are based on two recursive rules, which generate nonlinear transformations using a fast algorithm. For each rule, simple relations indicate the number of elementary nonlinear operations required by the fast algorithm. The resulting scheme is formed in three stages. The first step involves the so-called 2×2 Basic Non-Linear Transforms (BNLT). The second step is based on sparse nonlinear transformations (SNLTs), which are direct sums of BNLTs. The third step is Fast Nonlinear Transform (FNLT) as an SNLTS overlay product.

Keywords

• nonlinear transforms
• nonlinear fourier transforms
• fast algorithms