CS 6810/7810: Wavelets and Wavelet Algorithms Assignment 1 Step Approximations and Basic HWT.ZIP

CS 6810/7810: Wavelets and Wavelet Algorithms Assignment 1 Step Approximations and Basic HWT

In this assignment, you will familiarize yoursleves closer with step approximations and the Basic Haar Wavelet Transform (HWT). It will lay a deeper conceptual foundation for your subsequent implementation of the 1D HWT.
This assignment has three problems. These are all conceptual problems.
Use your favorite math editor to type and edit your solutions. Use your favorite plotting package (my personal favorites are Octave and matplotlib) to plot your graph for Problem 1.

Problem 1 (1 pts)
Consider the signal in equation (1):
s = (t0; 10); (t1; 8); (t2; 9); (t3; 5); (t4; 3); (t5; 3); (t6; 4); (t7; 6) (1)

In equation (1), the rst element in each pair, i.e., ti; 0  i  7, is a time point and the second element is the value of the signal sampled at that time.
Write a formula for the step approximation function fe for this signal and plot it.

Problem 2 (2 pts)
This problem illustrates that the interval [0; 1[ is sucient to express steps (and, consequently, wavelets) over arbitrary intervals. Try to show that the two formulas in equations (2) and (3) are correct for every number r. If
you are not comfortable with formal proofs, you can use either algebraic manipulation or argue case by case.
[0;w[(r) = [0;1[(r=w) (2)
[u;w[(r) = [0;1[

r 􀀀 u
w 􀀀 u

(3)
Problem 3 (2 pts)
Compute the Basic HWT of the signal (8; 6; 7; 3; 1; 1; 2; 4).
Powered by