1 / 30

FFT Accelerator Project

FFT Accelerator Project. Date: 14 th April, 2007. Rohit Prakash (2003CS10186) Anand Silodia (2003CS50210). Objectives. Validation Vtune Memory analysis. Validation : radix-16. CLAIM: Computations of radix-16 are more than that of radix-4. Radix-4 FFT algorithm.

maitland
Télécharger la présentation

FFT Accelerator Project

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. FFT Accelerator Project Date: 14th April, 2007 Rohit Prakash (2003CS10186) Anand Silodia (2003CS50210)

  2. Objectives • Validation • Vtune Memory analysis

  3. Validation : radix-16 CLAIM: Computations of radix-16 are more than that of radix-4 Radix-4 FFT algorithm

  4. Expanding it into 4 parts- Input points of radix-4 butterfly Output points of radix-4 butterfly

  5. Radix-4 Butterfly Trivial multiplications: No extra complex multiplications 3 Complex multiplications

  6. Radix-16 FFT Algorithm

  7. These are complex number multiplications (not trivial as in the case of radix-4)

  8. Evaluating 16 terms in the innermost loop Mostly complex number multiplications (very few trivial cases) Total 16 x 16 = 256 terms are involved (This forms the innermost loop of our program ) These terms also constitute the radix-16 butterfly

  9. Radix-16 Butterfly

  10. Radix-16 butterfly  complex complex complex j complex complex complex complex Conclusion: Number of complex computations in radix-16 are far greater than radix-4 -1 complex complex complex -j complex complex

  11. Radix-16 butterfly  complex j complex -1 complex -j complex

  12. But…

  13. Analysis (as compared to radix-4) • Radix 16 is computationally more expensive • Radix-16 is slightly slow for small input values (16,256,4096) but much faster for large input values (65536, 1048576,16777216) • This can be verified from the comparison graphs shown earlier • The results are completely different if we use g++ (instead of icpc)

  14. Radix-4 vs radix-16 (g++)

  15. Radix-4 vs. radix-16 (g++)

  16. Why does 16-radix run faster than 4-radix (with icpc) ? • According to a website – Higher radix FFT implementations make significant improvements in program speed due to implicit loop-unrolling or other compiler benefits than from the computational reduction itself • This might explain our results

  17. New Implementation (radix-8) • The number of complex multiplications in the inner loop less (as compared to radix-16 and radix-4) • It involves multiplying with special butterflies (e.g. ((1/2) - i(1/2)), etc.) • Multiplying with these complex numbers is trivial (takes less operations than the conventional complex multiplication)

  18. Validation (for radix-8) Number of complex additions can still be brought down by disregarding redundancy

  19. Radix-4 vs. radix-8 (icpc)

  20. VTune Profiling for Radix-16 • Input size = 16, runs = 100,000

  21. Input size = 256, runs = 1000

  22. Input size = 4096, runs = 500

  23. Input size = 65536, runs = 100

  24. Input size = 1048576, runs = 100

  25. Memory Usage (Task Manager) Radix-16

  26. Further Plan • Implement these on hardware • MPI version

  27. References • Jones, D. Radix-4 FFT Algorithms, Connexions Web Site: www.cnx.org • Rivest, Cormen, Introduction to Algorithms • Intel website

  28. Thank You

More Related