No Access
Discrete Fourier Transform
https://doi.org/10.1142/9789814282208_0003Cited by:0 (Source: Crossref)
Abstract: 

where k = 0, 1, 2,…,N − 1. The discrete Fourier transform is linear…
Let N be a positive integer, N ≥ 2. The discrete one-dimensional Fourier transform for a given sequence
x(n), n = 0, 1, 2, …,N − 1
is defined by

