SOLUTION: 1. Let X(k) denote the N-point DFT of the N-point sequence x(n) a) If x(n) = – x(N – 1 – n), find X(0) for N even and N odd. b) If N is even and x(n) = x(N – 1

Algebra ->  Coordinate Systems and Linear Equations  -> Lessons -> SOLUTION: 1. Let X(k) denote the N-point DFT of the N-point sequence x(n) a) If x(n) = – x(N – 1 – n), find X(0) for N even and N odd. b) If N is even and x(n) = x(N – 1       Log On


   

Question 356669:
1. Let X(k) denote the N-point DFT of the N-point sequence x(n)
a) If x(n) = – x(N – 1 – n), find X(0) for N even and N odd.
b) If N is even and x(n) = x(N – 1 – n), find X(N/2).
Answer by Fombitz(32388) About Me  (Show Source):
You can put this solution on YOUR website!
Discrete Fourier transforms are not algebra problems either.
Please search on "Discrete Fourier transforms".
Here's a wiki page with DFT solutions.
http://en.wikipedia.org/wiki/Discrete-time_Fourier_transform