The basic butterfly in the radix-2 decimation-in-time FFT algorithm is X n+1 (k) = X n (
Question:
The basic butterfly in the radix-2 decimation-in-time FFT algorithm is
Xn+1(k) = Xn(k) + WmNXn(l)
Xn+1(l) = Xn(k) + WmNXn(l)
(a) If we require that | Xn(k)| < ½ and | Xn(l)| < ½, show that
| Re[Xn+1(k)]| < 1, | Re[Xn+1(l)]| < 1
| lm[Xn+1(k)]| < 1 | lm[Xn+1(l)]| < 1
Thus overflow does not occur.
(b) Prove that
max[| Xn+1(k)|, | Xn+1(l)|] ≥ max[| Xn(k)|, |Xn(l)|]
max[| Xn+1(k)|, | Xn+1(l)|] ≤ 2 max[| Xn(k)|, |Xn(l)|]
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Digital Signal Processing
ISBN: ?978-0133737622
3rd Edition
Authors: Jonh G. Proakis, Dimitris G.Manolakis
Question Posted: