Show that the IDFT of a sequence {Xk , 0 ≤ k ≤ N − 1} can be computed by passing the sequence {Xk } through a bank of N linear discrete-time filters with system functions
and sampling the filter outputs at n = N.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.