Abstract
A method for the calculation of spectrum samples of discrete, aperiodic and finite signals based on the DTFT is proposed. This method is based on a flexible discretization of the frequency variable that could produce equidistant, sparse or unique spectrum samples. It is implemented in a GPU platform as a Matrix-Vector product, being able to be applied on modern HPC systems. As a result, a general use tool is developed for the frequency analysis that achieves execution times in a linear relation with the length of the vector to be processed and the number of samples required. Finally, it is shown that the required execution time for the computation of equally spaced spectrum samples is competitive to the achievements of other tools for frequency analysis based on sequential execution.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Oppenheim, A.V., Willsky, A.S.: Señales y Sistemas 2da. ed. Prentice Hall Hispanoamericana, México (1997)
Opepnheim, A.V., Shafer, R.W.: Tratamiento de señales en tiempo discreto. Pearson Educacion, Madrid (2011)
Proakis, J.G., Manolakis, D.G.: Digital Signal Processing. Principles, Algorithms, and Applications. Prentice Hall, Upper Saddle River (1996)
Cooley, J.W., Tukey, J.W.: An algorithm for the machine calculation of complex fourier series. Am. Math. Soc. 301, 297 (1965)
Alves, R.G., Osorio, P.L., Swamy, M.N.S.: General FFT pruning algorithm. In: Proceedings of 43rd IEEE MidWest Symposium on Circuits and Systems, Lansing (2000)
Angulo Rios, J., Castro Palazuelos, D., Medina Melendrez, M., Santiesteban Cos, R.: A GPU based implementation of input and output prunning of composite length FFT using DIF DIT transform decomposition. In: Congreso Internacional de Ingenieria Electromecanica y de Sistemas CIEES, Ciudad de Mexico (2016)
Melendrez, M.M., Estrada, M.A., Castro, A.: Input and/or output pruning of composite length FFTs using a DIF-DIT transform decomposition. IEEE Trans. Sig. Process. 57(10), 4124–4128 (2009)
Markel, J.D.: FFT prunning. IEEE Trans. Audio Electroacust. 4, 305–311 (1971)
Goertzel, G.: An algorithm for the evaluation of finite trigonometric series. Am. Math. Monthly 65(1), 34–35 (1958)
Stokfiszewski, K., Yatsymirskyy, M., Puchala, D.: Effectiveness of fast fourier transform implementations on GPU and CPU. In: International Conference on Computational Problems of Electric Engineerings (CPEE), pp. 162–164 (2015)
Shu, L.: Parallel implementation of arbitrary-sized discrete fourier transform on FPGA. In: 2016 3rd International Conference on Advanced Computing and Communication Systems (ICACCS), Coimbatore, India (2016)
Nvidia (2018). https://www.nvidia.com/en-us/high-performance-computing/. Accessed 17 Nov 2018
Oak Ridge National Laboratory (2018). https://www.ornl.gov/news/ornl-launches-summit-supercomputer. Accessed 17 Nov 2018
Evangelho, J.: AMD Claims Radeon Is #1 Gaming Platform – Here’s Their Proof, Forbes, 23 April 2018. https://www.forbes.com/sites/jasonevangelho/2018/04/23/radeon-vs-geforce-which-brand-is-truly-the-1-gaming-platform/#4cfb19276a95. Accessed 17 Dec 2018
Fang, J., Varbanescu, A.L., Sips, H.: A comprehensive performance comparison of CUDA and OpenCL. In: 2011 International Conference on Parallel Processing, Taipei (2011)
Karimi, K., Dickson, N.G., Hamze, F.: A performance comparison of CUDA and OpenCL, arXiv (2010)
Acknowledgment
The authors of this paper are grateful to the Tecnológico Nacional de México, Campus Culiacán, especially to the Division of Postgraduate Studies and Research for the facilities provided. I would also like to express my gratitude to the Consejo Nacional de Ciencia y Tecnología (Conacyt) for the support given during the course of the master’s degree studies.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Taboada-Echave, J.C., Medina-Melendrez, M., Gaxiola-Sánchez, L.N. (2019). Spectrum Sample Calculation of Discrete, Aperiodic and Finite Signals Using the Discrete Time Fourier Transform (DTFT). In: Torres, M., Klapp, J. (eds) Supercomputing. ISUM 2019. Communications in Computer and Information Science, vol 1151. Springer, Cham. https://doi.org/10.1007/978-3-030-38043-4_2
Download citation
DOI: https://doi.org/10.1007/978-3-030-38043-4_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-38042-7
Online ISBN: 978-3-030-38043-4
eBook Packages: Computer ScienceComputer Science (R0)