Multimedia Tools and Applications

, Volume 76, Issue 4, pp 6015–6030 | Cite as

Fast Fourier transform benchmark on X86 Xeon system for multimedia data processing

  • Young-Soo Park
  • Koo-Rack Park
  • Jin-Mook Kim
  • Hwa-Young Jeong
Article
  • 144 Downloads

Abstract

I benchmarking the well-known Fast Fourier Transforms Library at X86 Xeon E5 2690 v3 system. Fourier transform image processing is an important tool that is used to decompose the image into sine and cosine components. If the input image represented by the equation in the spatial domain, output from the Fourier transform represents the image in the fourier or the frequency domain. Each point represents a particular frequency included in the spatial domain image in the Fourier domain image. Fourier transform is used widely for image analysis, image filtering, image compression and image reconstruction as a wide variety of applications. Fourier transform plays a important role in signal processing, image processing and speech recognition. It has been used in a wide range of sectors. For example, this is often a signal processing, is used in digital signal processing applications, such as voice recognition, image processing. The Discrete Fourier transform is a specific kind of Fourier transform. It maps the sequence over time to sequence over frequencies. If it implemented as a discrete Fourier transform, the time complexity is O (N2). It’s actually not a better way to use. Alternatively, the Fast Fourier Transform is possible to easily perform a Discrete Fourier Transform of parallelism with only O (n log n) algorithm. Fast Fourier Transform is widely used in a variety of scientific computing program. If you are using the correct library can improve the performance of the program, without any additional effort. I have a well-known fast Fourier transform library was going to perform a benchmarking on X86 based Intel Xeon E5 2690 systems. In the machine’s current Intel Xeon X86 Linux system. I have installed Intel IPP library, FFTW3 Library (West FFT), Kiss -FFT library and the numutils library on Intel X86 Xeon E5 based systems. The benchmark performed at C, and measuring the performance over a range of a transform size. It benchmarks both real and complex transforms in one dimension.

Keywords

Fourier transform Signal processing Image processing FFTW3 INTEL IPP Numutils Kiss-fft 

References

  1. 1.
    Blumofe RD, Frigo M, Joerg CF, Leiserson CE, Randall KH (1996) An analysis of dag-consistent distributed shared-memory algorithms. In Proceedings of the Eighth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), (Padua, Italy), pp. 297–308Google Scholar
  2. 2.
    Blumofe RD, Joerg CF, Kuszmaul BC, Leiserson CE, Randall KH, Zhou Y (1995) Cilk: an efficient multithreaded runtime system. In Proceedings of the Fifth ACMSIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), (Santa Barbara, California). pp. 207–216Google Scholar
  3. 3.
    Borgerding M (2006) KissFFT v1.2.5. http://sourceforge.net/projects/kisst/
  4. 4.
    Cooley JW, Lewis PAW, Welch PD (1967) The fast Fourier transform algorithm and its applications, IBM ResearchGoogle Scholar
  5. 5.
    Cooley JW, Tukey JW (1965) An algorithm for themachine computation of the complex Fourier series. Math Comput 19:297–301CrossRefMATHGoogle Scholar
  6. 6.
    Cormen TH, Leiserson CE, Rivest RL (1990) Introduction to Algorithms. The MIT Press, CambridgeMATHGoogle Scholar
  7. 7.
    Duhamel P, Vetterli M (1990) Fast Fourier transforms: a tutorial review and a state of the art. Signal Proc 19:259–299MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Good IJ (1958) The interaction algorithm and practical Fourier analysis. J Roy Stat Soc B 20:361–372MathSciNetMATHGoogle Scholar
  9. 9.
    Hong J-W, Kung HT (1981) I/O complexity: the red-blue pebbling game. In Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing, (Milwaukee), pp. 326–333Google Scholar
  10. 10.
  11. 11.
    Johnson HW, Burrus CS (1983) The design of optimal DFT algorithms using dynamic programming. IEEE Trans Acoust Speech Signal Proc 31:378–387CrossRefMATHGoogle Scholar
  12. 12.
    Leroy X (1996) The caml light system release 0.71. Institute National de Recherche en Informatique at Automatique (INRIA)Google Scholar
  13. 13.
    Loan CV (1992) Computational frameworks for the fast Fourier transform. SIAM, PhiladelphiaCrossRefMATHGoogle Scholar
  14. 14.
    Oppenheim AV, Schafer RW (1989) Discrete-time signal processing. Prentice-Hall, Englewood Cliffs, p 07632MATHGoogle Scholar
  15. 15.
    Perez F, Takaoka T (1987) A prime factor FFT algorithm implementation using a program generation technique. IEEE Trans Acoust Speech Signal Proc 35:1221–1223CrossRefGoogle Scholar
  16. 16.
    PRACE-1IP Whitepapers, Evaluations on Intel MIC, http://www.prace-ri.eu/Evaluation-Intel-MIC
  17. 17.
    Press WH, Flannery BP, Teukolsky SA, Vetterling WT (1992) Numerical recipes in C: the art of scientific computing, 2nd edn. Cambridge University Press, New YorkMATHGoogle Scholar
  18. 18.
    Savage JE (1993) Space-time tradeoffs in memory hierarchies, Tech. Rep. CS 93-08, Brown University, CS Dept., Providence, RI 02912Google Scholar
  19. 19.
    Selesnick I, Burrus CS (1996) Automatic generation of prime length FFT programs. IEEE Trans Signal Proc 14–24Google Scholar
  20. 20.
    Singleton RC (1969) An algorithm for computing the mixed radix fast Fourier transform. IEEE Trans Audio Electroacoust AU-17:93–103CrossRefGoogle Scholar
  21. 21.
    Swarztrauber PN (1982) Vectorizing the FFTs, parallel computations. pp. 51–83Google Scholar
  22. 22.
    Temperton C (1985) Implementation of a self-sorting in-place prime factor FFT algorithm. J Comput Phys 58:283–299MathSciNetCrossRefMATHGoogle Scholar
  23. 23.
    Temperton C (1988) A new set of minimum-add small-n rotated DFT modules. J Comput Phys 75:190–198MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  • Young-Soo Park
    • 1
  • Koo-Rack Park
    • 1
  • Jin-Mook Kim
    • 2
  • Hwa-Young Jeong
    • 3
  1. 1.Division of Computer Science & Engineering, College of EngineeringKongju National UniversityCheonan-siKorea
  2. 2.Division of IT EducationSunmoon UniversityAsan-siKorea
  3. 3.Humanitas CollegeKyung Hee UniversitySeoulKorea

Personalised recommendations