Advertisement

Methods of Digital Filtering

  • Leonid Yaroslavsky
Chapter

Abstract

As it was stated in Sect. 4.2, basic formula of digital filtering a signal defined by its samples { a k , k = 0,1 N a − 1} by a filter defined by its discrete PSF { h n n = 0,1..., N h − 1} is
$$ {b_k} = \sum\limits_{n = 0}^{{N_h} - 1} {{h_n}{a_{k - n}}} $$
(5.1.1)

Keywords

Fast Fourier Transform Discrete Cosine Transform Digital Filter Digital Holography Fast Fourier Transform Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    C. de Boor, A Practical Guide to Splines, Springer Verlag, N.Y., 1978Google Scholar
  2. 2.
    M. Unser, A. Aldroubi, “Polynomial Splines and Wavelets–A Signal Processing Perspective, In: Wavelets–A Tutorial in Theory and Applications, C. K. Chui, Ed., San Diego, CA, Academic, 1992, pp. 91–122Google Scholar
  3. 3.
    R. Y. Vitkus and L.P. Yaroslaysky, “Recursive Algorithms for Local Adaptive Linear Filtration”, in Mathematical Research., L.P. Yaroslayskii, A. Rosenfeld and W. Wilhelmi, Ed., Berlin: Academy Verlag, pp. 34–39, 1987.Google Scholar
  4. 4.
    Jiangtao Xi, J. F. Chicharo, Computing Running DCT’s and DST’s based on Their Second Order Shift Properties, IEEE Trans. On Circuits and Systems —1: Fundamental Theory and Applications, vol. 47, No. 5, May 2000, pp. 779–783Google Scholar
  5. 5.
    Z. Wang, “Fast algorithms for the discrete W transform and for the Discrete Fourier Transform”, IEEE Trans. ASSP, vol. ASSP-32, pp. 803–816, Aug. 1984Google Scholar
  6. 6.
    H.S. Hou, “A fast recursive algorithm for computing the Discrete Cosine Transform”, IEEE Trans. on ASSP, vol. ASSP-35, No. 10, Oct. 1987, p. 1455–1461Google Scholar
  7. 7.
    Z. Wang, “A simple structured algorithm for the DCT, in Proc 3rd Ann. Conf. Signal Process. Xi’an, China, Nov 1988, pp. 28–31 (in Chinese).Google Scholar
  8. 8.
    A. Gupta, K. R. Rao, “A fast recursive algorithm for the discrete sine transform”, IEEE Trans. on ASSP, vol. ASSP-38, No. 3, March 1990, pp. 553–557.CrossRefGoogle Scholar
  9. 9.
    Z. Wang, “Pruning the Fast Discrete Cosine Transform”, IEEE Transactions on communications, Vol. 39, No. 5, May 1991.Google Scholar
  10. 10.
    Z. Cvetkovic, M. V. Popovic, “New fast recursive algorithms for the computation of Discrete Cosine and Sine Transforms”, IEEE Trans. Signal Processing, vol. 40, No. 8, August 1992, pp. 2083–2086.ADSzbMATHCrossRefGoogle Scholar
  11. 11.
    J. Ch. Yao, Ch-Y. Hsu, “Further results on ” New fast recursive algorithms for the discrete cosine and sine transforms“, IEEE Trans. on Signal Processing, vol. 42, No. 11, Nov. 1994, pp. 3254–3255ADSCrossRefGoogle Scholar
  12. 12.
    L. Yaroslaysky, A. Happonen, Y. Katyi, “Signal discrete sinc-interpolation in DCT domain: fast algorithms”, SMMSP 2002, Second International Workshop on Spectral Methods and Multirate Signal Processing, Toulouse (France), 07.09. 2002–08. 09. 2002.Google Scholar

Copyright information

© Springer Science+Business Media New York 2004

Authors and Affiliations

  • Leonid Yaroslavsky
    • 1
  1. 1.Tel Aviv UniversityIsrael

Personalised recommendations