Academia.eduAcademia.edu

In Equation (24), the term inside the brackets corresponds to the fast Fourier transform algorithm; this allows computing time savings if N is equal to an integer power of two.  Finally, by implementing the odd sampling presented in (21) and including a window function Om, the Laplace transform in (20) can be numerically approximated by:

Figure 74 In Equation (24), the term inside the brackets corresponds to the fast Fourier transform algorithm; this allows computing time savings if N is equal to an integer power of two. Finally, by implementing the odd sampling presented in (21) and including a window function Om, the Laplace transform in (20) can be numerically approximated by: