Efficient Algorithms
- By Leonid Yaroslavsky1
-
View Affiliations Hide Affiliations1 Dept. of Physical Electronics, School of Electrical Engineering, Tel Aviv University, Tel Aviv 69978, Israel.
- Source: Fast Transform Methods in Digital Signal Processing: Theory, Applications, Efficient Algorithms , pp 103-111
- Publication Date: September 2011
- Language: English
Preview this chapter:
Efficient Algorithms, Page 1 of 1
< Previous page | Next page > /docserver/preview/fulltext/9781608052301/chapter-11-1.gif
Transform domain signal processing might be very time consuming unless efficient computational algorithms are used. In this chapter, we describe application of Fast Fourier and Fast Cosine Transform to computing signal convolution and Scaled and Rotated Discrete Fourier Transforms and, in addition, recursive algorithms for computing local signal DFT and DCT spectra in sliding window.
Hardbound ISBN:
9781608050260
Ebook ISBN:
9781608052301
-
From This Site
/content/books/9781608052301.chapter-11dcterms_subject,pub_keyword-contentType:Journal -contentType:Figure -contentType:Table -contentType:SupplementaryData105
/content/books/9781608052301.chapter-11
dcterms_subject,pub_keyword
-contentType:Journal -contentType:Figure -contentType:Table -contentType:SupplementaryData
10
5
Chapter
content/books/9781608052301
Book
false
en
