Saved Bookmarks
| 1. |
Why The Computations In Fft Algorithm Is Said To Be In Place? |
|
Answer» Once the butterfly operation is performed on a pair of complex numbers (a,b) to PRODUCE (A,B), there is no need to save the input pair. We can store the RESULT (A,B) in the same locations as (a,b). Since the same STORAGE locations are used troughout the computation we say that the computations are done in PLACE. Once the butterfly operation is performed on a pair of complex numbers (a,b) to produce (A,B), there is no need to save the input pair. We can store the result (A,B) in the same locations as (a,b). Since the same storage locations are used troughout the computation we say that the computations are done in place. |
|