Main Idea When working with signals many times it is helpful to break up a signal into smaller, more manageable parts. Hopefully by now you have been exposed to the concept of eigenvectors and there use in decomposing a signal into one of its possible basis. By doing this we are able to simplify our calculations of signals and systems through eigenfunctions of LTI systems. Now we would like to look at an alternative way to represent signals, through the use of orthonormal basis. We can think of orthonormal basis as a set of building blocks we use to construct functions. We will build up the signal/vector as a weighted sum of basis elements. The complex sinusoids 1 T ω 0 n t for all n form an orthonormal basis for L 2 0 T . In our Fourier series equation, f t n c n ω 0 n t , the c n are just another representation of f t . For signals/vectors in a Hilbert Space, the expansion coefficients are easy to find.

Alternate Representation Recall our definition of a basis: A set of vectors b i in a vector space S is a basis if The b i are linearly independent. The b i span S . That is, we can find α i , where α i (scalars) such that x x S x i α i b i where x is a vector in S , α is a scalar in , and b is a vector in S . Condition 2 in the above definition says we can decompose any vector in terms of the b i . Condition 1 ensures that the decomposition is unique (think about this at home). The α i provide an alternate representation of x. Let us look at simple example in ℝ 2 , where we have the following vector: x 1 2 Standard Basis: e 0 e 1 1 0 0 1 x e 0 2 e 1 Alternate Basis: h 0 h 1 1 1 1 -1 x 3 2 h 0 -1 2 h 1 In general, given a basis b 0 b 1 and a vector x ℝ 2 , how do we find the α 0 and α 1 such that x α 0 b 0 α 1 b 1

Finding the Alphas Now let us address the question posed above about finding α i 's in general for ℝ 2 . We start by rewriting so that we can stack our b i 's as columns in a 2×2 matrix. x α 0 b 0 α 1 b 1 x ⋮ ⋮ b 0 b 1 ⋮ ⋮ α 0 α 1 Here is a simple example, which shows a little more detail about the above equations. x 0 x 1 α 0 b 0 0 b 0 1 α 1 b 1 0 b 1 1 α 0 b 0 0 α 1 b 1 0 α 0 b 0 1 α 1 b 1 1 x 0 x 1 b 0 0 b 1 0 b 0 1 b 1 1 α 0 α 1

Simplifying our Equation To make notation simpler, we define the following two items from the above equations: Basis Matrix: B ⋮ ⋮ b 0 b 1 ⋮ ⋮ Coefficient Vector: α α 0 α 1 This gives us the following, concise equation: x B α which is equivalent to x i 1 0 α i b i . Given a standard basis, 1 0 0 1 , then we have the following basis matrix: B 0 1 1 0 To get the α i 's, we solve for the coefficient vector in α B x Where B is the inverse matrix of B.

Examples Let us look at the standard basis first and try to calculate α from it. B 1 0 0 1 I Where I is the identity matrix. In order to solve for α let us find the inverse of B first (which is obviously very trivial in this case): B 1 0 0 1 Therefore we get, α B x x Let us look at a ever-so-slightly more complicated basis of 1 1 1 -1 h 0 h 1 Then our basis matrix and inverse basis matrix becomes: B 1 1 1 -1 B 1 2 1 2 1 2 -1 2 and for this example it is given that x 3 2 Now we solve for α α B x 1 2 1 2 1 2 -1 2 3 2 2.5 0.5 and we get x 2.5 h 0 0.5 h 1 Now we are given the following basis matrix and x: b 0 b 1 1 2 3 0 x 3 2 For this problem, make a sketch of the bases and then represent x in terms of b 0 and b 1 . In order to represent x in terms of b 0 and b 1 we will follow the same steps we used in the above example. B 1 2 3 0 B 0 1 2 1 3 -1 6 α B x 1 2 3 And now we can write x in terms of b 0 and b 1 . x b 0 2 3 b 1 And we can easily substitute in our known values of b 0 and b 1 to verify our results. A change of basis simply looks at x from a "different perspective." B transforms x from the standard basis to our new basis, b 0 b 1 . Notice that this is a totally mechanical procedure.

Extending the Dimension and Space We can also extend all these ideas past just ℝ 2 and look at them in ℝ n and ℂ n . This procedure extends naturally to higher (> 2) dimensions. Given a basis b 0 b 1 … b n − 1 for ℝ n , we want to find α 0 α 1 … α n − 1 such that x α 0 b 0 α 1 b 1 … α n − 1 b n − 1 Again, we will set up a basis matrix B b 0 b 1 b 2 … b n − 1 where the columns equal the basis vectors and it will always be an n×n matrix (although the above matrix does not appear to be square since we left terms in vector notation). We can then proceed to rewrite x b 0 b 1 … b n − 1 α 0 ⋮ α n − 1 B α and α B x