Hz=∑k=0m−1hkz-k
H
z
k
0
m
1
h
k
z
k
∀n,n∈0…N−1:xn=∑k=0m−1hkun−k+wn
n
n
0
…
N
1
x
n
k
0
m
1
h
k
u
n
k
w
n
Where
wn∼0σ2
w
n
0
σ
2
idd. Given xx and
uu, estimate
hh.
In matrix form
x=u00…0u1u0…0⋮⋮⋱⋮uN−1uN−2…uN−mh0⋮⋮hN−m+w
x
u
0
0
…
0
u
1
u
0
…
0
⋮
⋮
⋱
⋮
u
N
1
u
N
2
…
u
N
m
h
0
⋮
⋮
h
N
m
w
where
u00…0u1u0…0⋮⋮⋱⋮uN−1uN−2…uN−m=H
u
0
0
…
0
u
1
u
0
…
0
⋮
⋮
⋱
⋮
u
N
1
u
N
2
…
u
N
m
H
and
h0⋮⋮hN−m=θ
h
0
⋮
⋮
h
N
m
θ
θ
̂=HTH-1HTx
θ
H
H
H
x
(3)
〈
θ
̂2〉=σ2HTH-1=
C
θ
^
2
θ
σ
2
H
H
C
θ
^
An important question in system identification is
how to choose the input
un
u
n
to "probe" the system most efficiently.
First note that
σθ̂i2=eiT
C
θ
^
ei
θ
i
e
i
C
θ
^
e
i
where
ei=0…010…0T
e
i
0
…
0
1
0
…
0
. Also, since
C
θ
^
-1
C
θ
^
is symmetric positive definite, we can factor it by
C
θ
^
-1=DTD
C
θ
^
D
D
where DD is invertible. Note that
eiTDTDT-1ei2=1
e
i
D
D
e
i
2
1
(4)
The Schwarz inequality shows that
Equation 4 can become
1≤eiTDTDeieiTD-1DT-1ei
1
e
i
D
D
e
i
e
i
D
D
e
i
(5)
1=eiT
C
θ
^
-1eieiT
C
θ
^
ei
1
e
i
C
θ
^
e
i
e
i
C
θ
^
e
i
which leads to
σθ̂i2≥1eiT
C
θ
^
-1ei=σ2HTHii
θ
i
1
e
i
C
θ
^
e
i
σ
2
H
H
i
i
The minimum variance is achieved when equality is
attained in
Equation 5. This happens only if
η1=Dei
η
1
D
e
i
is proportional to
η2=DTei
η
2
D
e
i
. That is,
η1=Cη2
η
1
C
η
2
for some constant
CC. Equivalently,
∀i,i∈12…m:DTDei=
c
i
eu
i
i
1
2
…
m
D
D
e
i
c
i
e
u
DTD=
C
θ
^
-1=HTHσ2
D
D
C
θ
^
H
H
σ
2
which leads to
HTHσ2ei=
c
i
ei
H
H
σ
2
e
i
c
i
e
i
Combining these equations in matrix form
HTH=σ2
c
1
0…00
c
2
…000…
c
m
H
H
σ
2
c
1
0
…
0
0
c
2
…
0
0
0
…
c
m
Therefore, in order to minimize the variance of
the MVUB estimator,
un
u
n
should be chosen to make
HTH
H
H
diagonal.
∀i∧j,i∧j∈1…m:HTHij=∑n=1Nun−iun−j
i
j
i
j
1
…
m
H
H
i
j
n
1
N
u
n
i
u
n
j
For large NN, this can be
approximated to
HTHij≈∑n=0N−1−|i−j|unun+|i−j|
H
H
i
j
n
0
N
1
i
j
u
n
u
n
i
j
using the autocorrelation of seq.
un
u
n
.
un=0
u
n
0
for
n<0
n
0
and
n>N−1
n
N
1
, letting limit of sum
-∞
, ∞ gives approx.
These steps lead to
HTH≈N
r
uu
0
r
uu
1…
r
uu
m−1
r
uu
1
r
uu
0…⋮⋮⋮⋱⋮
r
uu
m−1
r
uu
m−2…
r
uu
0
H
H
N
r
uu
0
r
uu
1
…
r
uu
m
1
r
uu
1
r
uu
0
…
⋮
⋮
⋮
⋱
⋮
r
uu
m
1
r
uu
m
2
…
r
uu
0
where
r
uu
0
r
uu
1…
r
uu
m−1
r
uu
1
r
uu
0…⋮⋮⋮⋱⋮
r
uu
m−1
r
uu
m−2…
r
uu
0
r
uu
0
r
uu
1
…
r
uu
m
1
r
uu
1
r
uu
0
…
⋮
⋮
⋮
⋱
⋮
r
uu
m
1
r
uu
m
2
…
r
uu
0
is the Toeplitz autocorrelation matrix and
r
uu
n=1N∑n=0N−1−kunun+k
r
uu
n
1
N
n
0
N
1
k
u
n
u
n
k
For
HTH
H
H
to be diagonal, we require
rk=0
r
k
0
,
k≠0
k
0
. This condition is approximately realized if we
take
un
u
n
to be a
pseudorandom noise sequence
(PRN).
Furthermore, the PRN sequence simplifies the estimator
computation:
θ
̂=HTH-1HTx
θ
H
H
H
x
θ
̂≈IN
r
uu
0HTx
θ
I
N
r
uu
0
H
x
which leads to
hi
̂≈1N
r
uu
0∑n=0N−1−iun−ixn
h
i
1
N
r
uu
0
n
0
N
1
i
u
n
i
x
n
where
∑n=0N−1−iun−ixn=N
r
ux
i
n
0
N
1
i
u
n
i
x
n
N
r
ux
i
.
r
ux
i
r
ux
i
is the cross-correlation between input and output
sequences.
Hence, the approximate MVUB estimator for large N with a PRN
input is
∀i,i∈01…m−1:
hi
̂=
r
ux
i
r
uu
0
i
i
0
1
…
m
1
h
i
r
ux
i
r
uu
0
r
ux
i=1N∑n=0N−1−iunxn+i
r
ux
i
1
N
n
0
N
1
i
u
n
x
n
i
r
uu
0=1N∑n=0N−1u2n
r
uu
0
1
N
n
0
N
1
u
n
2