Application of FFT Fast Laplace Transform FLT

1 Principle and Algorithms of the Fast Fourier Transform (FFT) [42] The complex DPT is defined in the following form  

The following form of mafrix is included in fhe previous mafrices  

In the matrix [T], interchanging the second and third columns, then the following form of mafrix is found  

Expressing fhe subscripfs of each mafrix by fhe binary code, 

The inverse Fourier transform of Equation 2.62 can be calculated in the previous manner. The more general description is described in many publications. 

---