Skip to main content
Conference Proceedings

Computation of discrete fourier transform (FFT): A review article

Lecture Notes in Electrical Engineering (2019) 476 381-390
DOI: 10.1007/978-981-10-8234-4_33
0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This article reviews the computation of discrete Fourier transform which is termed as fast Fourier transform (FFT). It starts with discussion on a few terms used in this transform with one of its classifications followed by the presentation of the computer algorithm. Finally, its implementation on Matlab with few applications is covered.

Author supplied keywords

Cite

CITATION STYLE

APA

Qadeer, S., Zafar Ali Khan, M., & Yousuf khan, M. (2019). Computation of discrete fourier transform (FFT): A review article. In Lecture Notes in Electrical Engineering (Vol. 476, pp. 381–390). Springer Verlag. https://doi.org/10.1007/978-981-10-8234-4_33

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free