You are on page 1of 4

TLT-5606 Spread spectrum techniques Spring 2007

Solutions of calculus exercise task 2.1 and 2.2.


1. Assume that the rectangular chip waveform,
p
Tc
(t) =
_
1 , if 0 t < T
c
0 , otherwise
, (1)
is used to generate the signature waveform,
c(t) =

l=
c
l
p
Tc
(t lT
c
). (2)
Show that continuous-time and discrete-time autocorrelations dened as
R
c
() =
1
T
_
T
c(t)c(t + )dt (3)
and
R
c
(k) =
1
N
N1

i=0
c
i
c
i+k
, (4)
respectively, are related as
R
c
() = (1

T
c
)R
c
(k) +

T
c
R
c
(k + 1), (5)
where = kT
c
+ , k is an integer and 0 < T
c
.
Solution: In a pretty straightforward manner we have with T = NT
c
:
R
c
() =
1
T
_
T
0
c(t)c(t + )dt
=
1
T
_
T
0

i=
c
i
p
Tc
(t iT
c
)

j=
c
j
p
Tc
(t + jT
c
)dt
=
1
T
N1

i=0
i+k+1

j=i+k
c
i
c
j
_
T
0
p
Tc
(t iT
c
)p
Tc
(t + jT
c
)dt (6)
Above we have used that (i) the rectangular chip waveform p
Tc
(t iT
c
)
overlaps the integration interval only if i {0, . . . , N 1}, and (ii) the
integrand in (6) is non-zero only if the both rectangular chip waveforms
overlap in time. The latter equals the condition, that
|iT
c
( jT
c
)| < T
c
|(i + k j) T
c
+ | < T
c
i + k j = 0 or i + k j = 1,
where = kT
c
+ with [0, T
c
].
1
Case j = i + k: The integrand in (6) reduces to
p
Tc
(t iT
c
)p
Tc
(t iT
c
+ ), (7)
or shortly to
p
Tc
()p
Tc
( + ). (8)
In this case the pulses overlap in time interval [0, T
c
].
Case j = i + k + 1: The integrand reduces to
p
Tc
(t iT
c
)p
Tc
(t iT
c
T
c
+ ), (9)
or shortly to
p
Tc
()p
Tc
( T
c
+ ). (10)
In this case the pulses overlap in time interval [T
c
, T
c
].
Consequently,
R
c
() = R
c
(k, )
=
1
T
N1

i=0
c
i
c
i+k
_
Tc
0
p
Tc
()p
Tc
( + )d
+
1
T
N1

i=0
c
i
c
i+k+1
_
Tc
Tc
p
Tc
()p
Tc
( T
c
+ )d
=
T
c

T
c
_
1
N
N1

i=0
c
i
c
i+k
_
+

T
c
_
1
N
N1

i=0
c
i
c
i+k+1
_
= (1

T
c
)R
c
(k) +

T
c
R
c
(k + 1).

2. We had in lecture (Chapter 3) that the overall mean acquisition time is


dened as
T
acq
=
N

n=1

j=0
K

k=0
T
acq
(n, j, k)P(n, j, k). (11)
(You can nd denitions for the symbols from the lecture notes.) Show
that this simplies to
T
acq
= (N 1)
2 P
d
2P
d
(T
d
+ P
fa
T
fa
) +
T
d
P
d
. (12)
Solution: Recall from lectures, that acquisition time of event (n, j, k) is
given as
T
acq
(n, j, k) = nT
d
+ jNT
d
+ kT
fa
. (13)
In addition, using conditional probabilities we can rewrite
P(n, j, k) = Prob(correct phase position = n, j misses, k fas)
= P(n)P(j|n)P(k|n, j) (14)
2
Each of the probabilities can be expressed in terms of N, K, P
d
and P
fa
:
P(n) = Prob(correct phase position = n)
=
1
N
(15)
P(j|n) = P(j)
= Prob(j misses)
= (1 P
d
)
j
P
d
(16)
P(k|n, j) = Prob(k fas | correct phase position = n, j misses)
= Prob(k fas out of K possibilities)
=
_
K
k
_
P
k
fa
(1 P
fa
)
Kk
(17)
Putting Eqs. (13) (17) all together we have
T
acq
=
N

n=1

j=0
K

k=0
1
N
(1 P
d
)
j
P
d
_
K
k
_
P
k
fa
(1 P
fa
)
Kk

(nT
d
+ jNT
d
+ kT
fa
)
=
N

n=1

j=0
1
N
(1 P
d
)
j
P
d
K

k=0
_
K
k
_
P
k
fa
(1 P
fa
)
Kk

(nT
d
+ jNT
d
+ kT
fa
)
Now, we use two properties of a binomial distribution:
K

k=0
_
K
k
_
P
k
fa
(1 P
fa
)
Kk
= 1 (18)
K

k=0
k
_
K
k
_
P
k
fa
(1 P
fa
)
Kk
= KP
fa
(19)
Hence, we may rewrite T
acq
as
T
acq
=
N

n=1

j=0
1
N
(1 P
d
)
j
P
d
(nT
d
+ jNT
d
+ KP
fa
T
fa
) (20)
Further, remembering that K = n + jN j 1 we have
T
acq
=
N

n=1
1
N

j=0
(1 P
d
)
j
P
d
_
n(T
d
+ P
fa
T
fa
) +
+ j(NT
d
+ (N 1)P
fa
T
fa
) P
fa
T
fa

(21)
Next, we can use the known properties of geometric distribution:

j=0
(1 P
d
)
j
P
d
= 1 (22)

j=0
j(1 P
d
)
j
P
d
=
1 P
d
P
d
(23)
3
Substituting these into (21) we get
T
acq
=
N

n=1
1
N
_
n(T
d
+ P
fa
T
fa
) + (24)
+
1 P
d
P
d
_
NT
d
+ (N 1)P
fa
T
fa

P
fa
T
fa
_
(25)
Now, the line (24) gives
N

n=1
1
N
n(T
d
+ P
fa
T
fa
) =
1
N
(T
d
+ P
fa
T
fa
)
N

n=1
n (26)
=
1
N
(T
d
+ P
fa
T
fa
)N
N + 1
2
(27)
=
N + 1
2
(T
d
+ P
fa
T
fa
) (28)
The line (25) gives itself, since
1
N

N
n=1
1 = 1
Finally,
T
acq
=
N + 1
2
(T
d
+ P
fa
T
fa
) +
1 P
d
P
d
_
=(N1)(T
d
+P
fa
T
fa
)+T
d
..
NT
d
+ (N 1)P
fa
T
fa
_
P
fa
T
fa
= (T
d
+ P
fa
T
fa
)
_
N + 1
2
+
(N 1)(1 P
d
)
P
d
_
+
=
T
d
P
d
T
d
..
1 P
d
P
d
T
d
P
fa
T
fa
= (T
d
+ P
fa
T
fa
)
_
N + 1
2
+
(N 1)(1 P
d
)
P
d
1
_
+
T
d
P
d
= (N 1)
2 P
d
2P
d
(T
d
+ P
fa
T
fa
) +
T
d
P
d
. (29)

You might also like