Skip to main content

Discrete Time Filters

  • Chapter
  • First Online:
  • 3409 Accesses

Abstract

In Sect. 1.5 we defined filters as operations in continuous time which preserved frequencies. Such operations are important since they can change the frequency content in many ways. They are difficult to use computationally, however, since they are defined for all instances in time. This will now be addressed by changing focus to discrete-time. Filters will now be required to operate on a possibly infinite vector \(\mathbf {x}=(x_n)_{n=-\infty }^{\infty }\) of values, corresponding to concrete instances in time. Such filters will be called discrete time filters, and they too will be required to be frequency preserving. We will see that discrete time filters make analog filters computable, similarly to how the DFT made Fourier series computable in Chap. 2. The DFT will be a central ingredient also now.

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   59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   79.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

Notes

  1. 1.

    Recall that the orthogonal diagonalization of S takes the form S = PDP T, where P contains as columns an orthonormal set of eigenvectors, and D is diagonal with the eigenvectors listed on the diagonal (see Section 7.1 in [32]).

References

  1. A. Ambardar, Digital Signal Processing: A Modern Introduction (Cengage Learning, Belmont, 2006)

    Google Scholar 

  2. S. Foucart, H. Rauhut, A Mathematical Introduction to Compressive Sensing (Birkhauser, Basel, 2013)

    Book  MATH  Google Scholar 

  3. M.W. Frazier, An Introduction to Wavelets Through Linear Algebra (Springer, New York, 1999)

    MATH  Google Scholar 

  4. T.W. Gamelin, Complex Analysis (Springer, New York, 2001)

    Book  MATH  Google Scholar 

  5. F.J. Harris, On the use of windows for harmonic analysis with the discrete Fourier transform. Proc. IEEE 66(1), 51–83 (1978)

    Article  Google Scholar 

  6. ISO/IEC, Information technology - coding of moving pictures and associated audio for digital storage media at up to about 1.5 mbit/s. Technical report, ISO/IEC, 1993

    Google Scholar 

  7. D.C. Lay, Linear Algebra and Its Applications, 4th edn. (Addison-Wesley, Boston, 2011)

    Google Scholar 

  8. S. Martucci, Symmetric convolution and the discrete sine and cosine transforms. IEEE Trans. Signal Process. 42, 1038–1051 (1994)

    Article  Google Scholar 

  9. A.V. Oppenheim, R.W. Schafer, Discrete-Time Signal Processing (Prentice Hall, Upper Saddler River, 1989)

    Google Scholar 

  10. J.G. Proakis, D.G. Manolakis, Digital Signal Processing. Principles, Algorithms, and Applications, 4th edn. (Pearson, Upper Saddle River, 2007)

    Google Scholar 

  11. P. Stoica, R. Moses, Spectral Analysis of Signals (Prentice Hall, Upper Saddler River, 2005)

    Google Scholar 

  12. M. Vetterli, E. Kovasevic, V.K. Goyal, Foundations of Signal Processing (Cambridge University Press, Cambridge, 2014)

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Ryan, Ø. (2019). Discrete Time Filters. In: Linear Algebra, Signal Processing, and Wavelets - A Unified Approach. Springer Undergraduate Texts in Mathematics and Technology. Springer, Cham. https://doi.org/10.1007/978-3-030-02940-1_3

Download citation

Publish with us

Policies and ethics