Skip to main content

Methods of Digital Filtering

  • 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)

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   89.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. de Boor, A Practical Guide to Splines, Springer Verlag, N.Y., 1978

    Google Scholar 

  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–122

    Google Scholar 

  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. 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–783

    Google Scholar 

  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. 1984

    Google Scholar 

  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–1461

    Google Scholar 

  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. 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.

    Article  Google Scholar 

  9. Z. Wang, “Pruning the Fast Discrete Cosine Transform”, IEEE Transactions on communications, Vol. 39, No. 5, May 1991.

    Google Scholar 

  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.

    Article  ADS  MATH  Google Scholar 

  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–3255

    Article  ADS  Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer Science+Business Media New York

About this chapter

Cite this chapter

Yaroslavsky, L. (2004). Methods of Digital Filtering. In: Digital Holography and Digital Image Processing. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-4988-5_5

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-4988-5_5

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-5397-1

  • Online ISBN: 978-1-4757-4988-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics