580 California St., Suite 400
San Francisco, CA, 94104
Academia.edu no longer supports Internet Explorer.
To browse Academia.edu and the wider internet faster and more securely, please take a few seconds to upgrade your browser.
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:
Discover breakthrough research and expand your academic network
Join for free