Here, we deal with the realizations of DSP’s DFT, FFT, application of FFT to compute convolution and correlation, and application of FFT to find the spectrum of a continuous signal.
Source: S. C. Dutta Roy, “The ABCDs of Digital Signal Processing (Part 2),” Students’ Journal of the IETE, vol. 21, pp. 60–70, April 1980.
Revised version of the text of a seminar series.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
J.W. Cooley, J.W. Tukey An algorithm for the machine calculation of complex fourier series. Math. Comput. 19, 297–301 (April 1965)
W.M. Gentleman, G. Sande, Fast Fourier Transforms-for Fun and Profit. in 1966 Fall Joint Computer Conference of AFIPS Proceedings, pp. 563–578
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2018 Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
Dutta Roy, S.C. (2018). The ABCDs of Digital Signal Processing–PART 2. In: Circuits, Systems and Signal Processing. Springer, Singapore. https://doi.org/10.1007/978-981-10-6919-2_32
Download citation
DOI: https://doi.org/10.1007/978-981-10-6919-2_32
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-6918-5
Online ISBN: 978-981-10-6919-2
eBook Packages: EngineeringEngineering (R0)