Skip to content Skip to navigation

Connexions

You are here: Home » Content » Downsampling as a Matrix Operation

Navigation

Content Actions

  • Download module PDF
  • Add to ...
    Add the module to:
    • My Favorites
    • A lens
    • An external social bookmarking service
    • My Favorites (What is 'My Favorites'?)
      'My Favorites' is a special kind of lens which you can use to bookmark modules and collections directly in Connexions. 'My Favorites' can only be seen by you, and collections saved in 'My Favorites' can remember the last module you were on. You need a Connexions account to use 'My Favorites'.
    • A lens (What is a lens?)

      Definition of a lens

      Lenses

      A lens is a custom view of Connexions content. You can think of it as a fancy kind of list that will let you see Connexions through the eyes of organizations and people you trust.

      What is in a lens?

      Lens makers point to Connexions materials (modules and collections), creating a guide that includes their own comments and descriptive tags about the content.

      Who can create a lens?

      Any individual Connexions member, a community, or a respected organization.

    • External bookmarks
  • E-mail the author

Recently Viewed

Downsampling as a Matrix Operation

Module by: Ivan Selesnick

The downsampler is a linear system, but it is not time-invariant. (Figure 1)

Figure 1
Figure 1 (sec3fig1.jpg)

yn=x 2 n y n x 2 n The downsampler can also be represented in matrix form. y0y1y2y3=1000000001000000001000000001x0x1x2x3x4x5x6 y0 y1 y2 y3 1 0000 00 0 0100 00 0 0001 00 0 0000 01 x0 x1 x2 x3 x4 x5 x6 where D=1000000001000000001000000001 D 1 0000 00 0 0100 00 0 0001 00 0 0000 01 .

We can write y=Dx y D x where DD is the infinite matrix having the form shown. Note that the matrix DD that represents downsampling is not a Toeplitz matrix -- it is not constant along the diagonals. As we know, the downsampling operation can not be represented as a convolution.

Let's see what the transpose of the downsampler is. We can do this by observing the form of the transpose of the matrix DD, which has the following form: DT=1000000001000000001000000001 D 1 000 0 0 00 0 1 00 0 0 00 0 0 10 0 0 00 0 0 01 The matrix DTD represents upsampling: z=DTyzn=[2]yn z D y z n [2] y n Note that DTDI D D I so therefore upsampling is not an orthogonal transformation. Indeed, when the matrix product DTD D D is computed, we find that DTD=100000000000001000000000000010000000000001 D D 1 0000 0 0 0000 0 0 0100 0 0 0000 0 0 0001 0 0 0000 0 0 0000 1 So z=DTDxzn=[2][2]xn=xnifn is even 0 ifn is odd z D D x z n [2] [2] x n x n n is even 0 n is odd Equivalently, Zz=0.5Xz+X-z Z z 0.5 X z X z

Comments, questions, feedback, criticisms?

Send feedback