Search the World's Largest Database of Information Science & Technology Terms & Definitions
InfInfoScipedia LogoScipedia
A Free Service of IGI Global Publishing House
Below please find a list of definitions for the term that
you selected from multiple scholarly research resources.

What is Fast Fourier Transform

Optimization of Design for Better Structural Capacity
( FFT): Is an algorithm that samples a signal over a period of time and divides it into its frequency components used to improve the computational efficiency.
Published in Chapter:
Wind Loads on Structures, and Energy Dissipation Systems Optimization
Aboubaker Gherbi (Constantine 1 University, Algeria) and Mourad Belgasmia (Setif 1 University, Algeria)
Copyright: © 2019 |Pages: 22
DOI: 10.4018/978-1-5225-7059-2.ch005
Abstract
Wind has a great impact on civil structures. It is considered a dynamic and random phenomena and it plays an important role in the design of tall structures. Existing buildings with certain height must resist wind effect. Many researchers have developed theories and schemes that consider more thoroughly wind components and the influence of its turbulence on buildings. It is known that any structure inherently dissipates and absorbs energy due to external loads thanks to its inherent damping. In order to improve this capacity and limit structural damage, fluid viscous dampers are commonly used for structural protection; they have confirmed their efficiency and reliability. Many researchers have investigated their effect by inserting them in the structure; some of the optimization methods for the design of these dampers previously used will be discussed. Finally, an effective method for optimal design of additional dampers will be illustrated by an example and discussion.
Full Text Chapter Download: US $37.50 Add to Cart
More Results
Sustainability of Public Key Cryptosystem in Quantum Computing Paradigm
The fast Fourier transform (FFT), proposed by Cooley and Tukey (1965) AU73: The in-text citation "Cooley and Tukey (1965)" is not in the reference list. Please correct the citation, add the reference to the list, or delete the citation. , is a discrete Fourier transform algorithm which reduces the number of computations needed for N points from 2 N 2 to .
Full Text Chapter Download: US $37.50 Add to Cart
Cell Processing for Two Scientific Computing Kernels
Fast Fourier Transform (FFT) is an efficient algorithm to compute the DFT and its inverse. Instead of O(N2) arithmetical operations in a direct way to compute a DFT of N points, FFT can compute the same result in only O(N logN) operations.
Full Text Chapter Download: US $37.50 Add to Cart
eContent Pro Discount Banner
InfoSci OnDemandECP Editorial ServicesAGOSR