1 Problem Set 3.

3. Describe operators ( 3) and ( 3) and ( 3)( 3).

1 0 0 0 0
0 0 0 0 0

( 3) = 0 0 0 0 0
0 1 0 0 0
0 0 0 0 0

1 0 0 0 0 1 0 0 0 0
0 0 0 0 0 0 0 0 1 0

( 3) = ( 3) = 0 0 0 0 0 = 0 0 0 0 0
0 1 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0

1 0 0 0 0 1 0 0 0 0 1 0 0 0 0
0 0 0 0 0 0 0 0 1 0 0 0 0 0 0

( 3)( 3) = 0 0 0 0 0 0 0 0 0 0 = 0 0 0 0 0
0 1 0 0 0 0 0 0 0 0 0 0 0 1 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

(1) 1 0 0 0 0 (1) (1)
(0) 0 0 0 0 0 (0) 0

( 3)( 3) (1) = 0 0 0 0 0 (1) = 0
(2) 0 0 0 1 0 (2) (2)
(3) 0 0 0 0 0 (3) 0

1
4. What are the components of ( 3)( 2)x and ( 2)( 3)x.

1 0 0 0 0
0 0 1 0 0

( 2) = 0 0 0 0 1
0 0 0 0 0
0 0 0 0 0

1 0 0 0 0 1 0 0 0 0 (1)
0 0 0 0 0 0 0 1 0 0 (0)

( 3)( 2) = 0 0 0 0 0 0 0 0 0 1 (1)
0 1 0 0 0 0 0 0 0 0 (2)
0 0 0 0 0 0 0 0 0 0 (3)

1 0 0 0 0 (1) (1)
0 0 0 0 0 (0) 0

= 0 0 0 0 0 (1) = 0
0 0 1 0 0 (2) (2)
0 0 0 0 0 (3) 0

1 0 0 0 0 1 0 0 0 0 (1)
0 0 1 0 0 0 0 0 0 0 (0)

( 2)( 3) = 0 0 0 0 1 0 0 0 0 0 (1)
0 0 0 0 0 0 1 0 0 0 (2)
0 0 0 0 0 0 0 0 0 0 (3)

1 0 0 0 0 (1) (1)
0 0 0 0 0 (0) 0

= 0 0 0 0 0 (1) = 0
0 0 0 0 0 (2) 0
0 0 0 0 0 (3) 0

2
2 Problem Set 3.2

3. For downsampling by 3 instead of 2, write down the equations corresponding to (3.11) through (3.16). In equation (3.10), =
( 3) means (k) = (3k).

The fourier transform of is V() = () = (3) .

{
() if n is divisible by 3
() = = (...., (0), 0, 0, (3), 0, ...)
0 otherwise

1 1
() = () = () + ()(+)
3
3 3

In frequency, this says that () = 13 [() + [ + ]]

Now,
() = ( 3 )
() = 12 [( 3 ) + ( 3 + )]

3 Problem Set 3.3

1. Find U() from X() if u = ( )( )x. Use (3.25) for ( M). Similarly find V() if = ( )( )x. Show that
U() () if (and only if) L and M are relatively prime.