Discrete Fourier Transform and Computation
S. Palani
Abstract
Open-access reader
S. Palani
Abstract
Open-access reader
After completing this chapter, you should be able to understand about Discrete Fourier Transform (DFT) and establish its relationship with other Transforms. You will also understand the important properties of DFT. As in the continuous time signal, where we study about linear convolution, here study about circular convolution. In circular convolution of two signals one should be periodic and both signals should have same number of samples. You should also be able understand about the Fast Fourier Transform (FFT) in this chapter.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
After completing this chapter, you should be able to understand about Discrete Fourier Transform (DFT) and establish its relationship with other Transforms. You will also understand the important properties of DFT. As in the continuous time signal, where we study about linear convolution, here study about circular convolution. In circular convolution of two signals one should be periodic and both signals should have same number of samples. You should also be able understand about the Fast Fourier Transform (FFT) in this chapter.
Key concepts: Discrete Fourier transform (general), Convolution (computer science), Discrete-time Fourier transform, Overlap–add method, Circular convolution, Fast Fourier transform, Convolution theorem, Cyclotomic fast Fourier transform