Documentos de Académico
Documentos de Profesional
Documentos de Cultura
z(t)
C(f )
−W W f
and
ν(t) = gR (t) ∗ z(t)
z(t)
Proof:
Since
∞
X
B(f ) = X(f + m/T )
m=−∞
B(f )
− 2T1 −W W 1 f
2T
2. T = 1/(2W )
If the symbol duration T is equal to 1/(2W ), we get
1
=W
2T
and B(f ) = T is achieved for
T, |f | ≤ W
X(f ) = .
0, |f | > W
This corresponds to
sin π Tt
x(t) =
π Tt
B(f )
− 2T1 1 f
2T
3. T > 1/(2W )
In this case, we have
1
<W
2T
and B(f ) consists of overlapping, shifted replica of X(f ). ISI–
free transmission is possible if X(f ) is chosen properly.
Example:
X(f )
T
T
2
− 2T1 1 f
2T
B(f )
T
T
2
− 2T1 1 f
2T
0.9
0.8
0.7
0.6
0.5
β=1
X(f )/T
0.4
0.3 β = 0.35
0.2
0.1
β=0
0
−1 −0.8 −0.6 −0.4 −0.2 0 0.2 0.4 0.6 0.8 1
fT
0.8
0.6
0.4
β = 0.35
0.2
x(t)
β=1
−0.2
β=0
−0.4
−4 −3 −2 −1 0 1 2 3 4
t/T
√
Nyquist–Filters
The spectrum of x(t) is given by
GT (f ) GR (f ) = X(f )
ISI–free transmission is of course possible for any choice of GT (f )
and GR (f ) as long as X(f ) fulfills the Nyquist criterion. However,
the SNR maximizing optimum choice is
GT (f ) = G(f )
GR (f ) = αG∗(f ),
i.e., gR (t) is matched to gT (t). α is a constant. In that case, X(f )
is given by
X(f ) = α|G(f )|2
and consequently, G(f ) can be expressed as
r
1
G(f ) = X(f ).
α
√
G(f ) is referred to as Nyquist–Filter. In practice, a delay τ0
may be added to GT (f ) and/or GR (f ) to make them causal filters
in order to ensure physical realizability of the filters.
z(t)
kT
I[k] rb(t) rb[k]
gT (t) c(t) gR(t)
√
gT (t) and gR (t) are Nyquist–Impulses that are matched to each
other.
Equivalent Discrete–Time Channel Model
z[k]
p
I[k] Eg rb[k]
Proof:
– Signal Component
The overall channel is given by
x[k] = gT (t) ∗ c(t) ∗ gR (t)
t=kT
= gT (t) ∗ gR (t) ,
t=kT
where we have used the fact that the channel acts as an ideal
lowpass filter. We assume
gR (t) = g(t)
1
gT (t) = p g ∗(−t),
Eg
√
where g(t) is a Nyquist–Impulse, and Eg is given by
Z∞
Eg = |g(t)|2 dt
−∞
– Noise Component
z(t) is a complex AWGN process with power spectral density
∗ Mean
∞
1 Z
∗
E{z[k]} = E p z(τ )g (kT + τ ) dτ
Eg
−∞
Z∞
1
= p E{z(τ )}g ∗(kT + τ ) dτ
Eg
−∞
= 0
∗ ACF
φZZ [λ] = E{z[k + λ]z ∗[k]}
Z∞ Z∞
1
= E{z(τ1)z ∗(τ2)} g ∗ ([k + λ]T + τ1)
Eg | {z }
−∞ −∞ N0 δ(τ1 −τ2 )
·g(kT + τ2) dτ1dτ2
Z∞
N0
= g ∗ ([k + λ]T + τ1)g(kT + τ1) dτ1
Eg
−∞
N0
= Eg δ[λ]
Eg
= N0 δ[λ]
This shows that z[k] is a discrete–time AWGN process with
variance σZ2 = N0 and the proof is complete.