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
1Tⅇⅈ
ω
0
nt
1
T
ω
0
n
t
for all
-∞<n<∞
n
form an orthonormal basis for
L
2
0T
L
2
0
T
.
In our Fourier
series equation,
ft=∑n=-∞∞
c
n
ⅇⅈ
ω
0
nt
f
t
n
c
n
ω
0
n
t
, the
c
n
c
n
are just another representation of
ft
f
t
.
For signals/vectors in a
Hilbert Space, the expansion
coefficients are easy to find.
Recall our definition of a basis:
A set of vectors
b
i
b
i
in a vector space S
S is a basis if
-
The
b
i
b
i
are linearly independent.
-
The
b
i
b
i
span S
S. That is, we can find
α
i
α
i
, where
α
i
∈ℂ
α
i
(scalars) such that
∀x,x∈S:x=∑i
α
i
b
i
x
x
S
x
i
α
i
b
i
(1)
where xx is a
vector in S S,
αα is a scalar in
ℂ, and b b is a vector in
S S.
Condition 2 in the above definition says we can
decompose any vector in terms of the
b
i
b
i
. Condition 1 ensures that the decomposition is
unique (think about this at home).
The
α
i
α
i
provide an alternate representation of xx.
Let us look at simple example in
ℝ
2
ℝ
2
, where we have the following vector:
x=
12
x
1
2
Standard Basis:
e0e1
=
10T01T
e
0
e
1
1
0
0
1
x=e0+2e1
x
e
0
2
e
1
Alternate Basis:
h0h1
=
11T1-1T
h
0
h
1
1
1
1
-1
x=32h0+-12h1
x
3
2
h
0
-1
2
h
1
In general, given a basis
b0b1
b
0
b
1
and a vector
x∈
ℝ
2
x
ℝ
2
, how do we find the
α
0
α
0
and
α
1
α
1
such that
x=
α
0
b0+
α
1
b1
x
α
0
b
0
α
1
b
1
(2)
Now let us address the question posed above about finding
α
i
α
i
's in general for
ℝ
2
ℝ
2
. We start by rewriting Equation 2 so that we can stack our
bi
b
i
's as columns in a 2×2 matrix.
x=
α
0
b0+
α
1
b1
x
α
0
b
0
α
1
b
1
(3)
x=⋮⋮b0b1⋮⋮
α
0
α
1
x
⋮
⋮
b
0
b
1
⋮
⋮
α
0
α
1
(4)
Here is a simple example, which shows a little more detail
about the above equations.
x0x1=
α
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
α
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
(5)
x0x1=
b
0
0
b
1
0
b
0
1
b
1
1
α
0
α
1
x
0
x
1
b
0
0
b
1
0
b
0
1
b
1
1
α
0
α
1
(6)
To make notation simpler, we define the following two items
from the above equations:
-
Basis Matrix:
B=
⋮⋮b0b1⋮⋮
B
⋮
⋮
b
0
b
1
⋮
⋮
-
Coefficient Vector:
α=
α
0
α
1
α
α
0
α
1
This gives us the following, concise equation:
x=Bα
x
B
α
(7)
which is equivalent to
x=∑i=01
α
i
bi
x
i
1
0
α
i
b
i
.
Given a standard basis,
1001
1
0
0
1
, then we have the following basis matrix:
B=0110
B
0
1
1
0
To get the
α
i
α
i
's, we solve for the coefficient vector in Equation 7
α=B-1x
α
B
x
(8)
Where
B-1
B
is the
inverse
matrix of
BB.
Let us look at the standard basis first and try to
calculate α
α from it.
B=1001=I
B
1
0
0
1
I
Where II is the
identity matrix. In order to solve for
α α let
us find the inverse of BB
first (which is obviously very trivial in this case):
B-1=1001
B
1
0
0
1
Therefore we get,
α=B-1x=x
α
B
x
x
Let us look at a ever-so-slightly more complicated basis
of
111-1=h0h1
1
1
1
-1
h
0
h
1
Then our basis matrix and inverse basis matrix becomes:
B=111-1
B
1
1
1
-1
B-1=121212-12
B
1
2
1
2
1
2
-1
2
and for this example it is given that
x=32
x
3
2
Now we solve for α
α
α=B-1x=121212-1232=2.50.5
α
B
x
1
2
1
2
1
2
-1
2
3
2
2.5
0.5
and we get
x=2.5h0+0.5h1
x
2.5
h
0
0.5
h
1
Now we are given the following basis matrix and
xx:
b0b1=1230
b
0
b
1
1
2
3
0
x=32
x
3
2
For this problem, make a sketch of the bases and then
represent xx
in terms of
b0
b
0
and
b1
b
1
.
In order to represent xx in terms of
b0
b
0
and
b1
b
1
we will follow the same steps we used in the
above example.
B=1230
B
1
2
3
0
B-1=01213-16
B
0
1
2
1
3
-1
6
α=B-1x=123
α
B
x
1
2
3
And now we can write xx in terms of
b0
b
0
and
b1
b
1
.
x=b0+23b1
x
b
0
2
3
b
1
And we can easily substitute in our known values of
b0
b
0
and
b1
b
1
to verify our results.
A change of basis simply looks at xx from a "different
perspective."
B-1
B
transforms xx from the standard basis to
our new basis,
b0b1
b
0
b
1
. Notice that this is a totally mechanical
procedure.
We can also extend all these ideas past just
ℝ
2
ℝ
2
and look at them in
ℝ
n
ℝ
n
and
ℂ
n
ℂ
n
. This procedure extends naturally to higher (> 2)
dimensions. Given a basis
b0b1…b
n
−
1
b
0
b
1
…
b
n
−
1
for
ℝ
n
ℝ
n
, we want to find
α
0
α
1
…
α
n
−
1
α
0
α
1
…
α
n
−
1
such that
x=
α
0
b0+
α
1
b1+…+
α
n
−
1
b
n
−
1
x
α
0
b
0
α
1
b
1
…
α
n
−
1
b
n
−
1
(9)
Again, we will set up a basis matrix
B=
b0b1b2…b
n
−
1
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
Equation 7
x=b0b1…b
n
−
1
α
0
⋮
α
n
−
1
=Bα
x
b
0
b
1
…
b
n
−
1
α
0
⋮
α
n
−
1
B
α
and
α=B-1x
α
B
x
"My introduction to signal processing course at Rice University."