In implementing a decimation-in-time FFT algorithm, the basic butterfly computation is
In using fixed-point arithmetic to implement the computations, it is commonly assumed that all numbers are scaled to be less than unity. Therefore, to avoid overflow, it is necessary to ensure that the real numbers that result from the butterfly computations do not exceed unity.
(a) Show that if we require
then overflow cannot occur in the butterfly computation; i.e.,
(b) In practice, it is easier and most convenient to require
Are these conditions sufficient to guarantee that overflow cannot occur in the decimation- in-time butterfly computation? Explain.
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.