Advanced Data Communications Topics: 8.1 Problem Solutions
Advanced Data Communications Topics: 8.1 Problem Solutions
Advanced Data Communications Topics: 8.1 Problem Solutions
Problem Solutions
Problem 8.1
Use the relationship
Rb = (log2 M ) Rs bps
where Rb is the data rate, Rs is the symbol rate, and M is the number of possible signals
per signaling interval. In this case, Rs = 2000 symbols per second. For M = 4, Rb =
2 2, 000 = 4, 000 bps, for M = 8, Rb = 6, 000 bps, and for M = 64, Rb = 12, 000 bps.
Problem 8.2
(a) 5,000 symbols per second. (b) Recall that
1 d2 (t)
y (t) = A [d1 (t) cos (c t) + d2 (t) sin (c t)] = 2A cos [ c t i (t)] , i (t) = tan
d1 (t)
Alternating every other bit given in the problem statement between d1 (t) and d2 (t) gives
d1 (t) = 1, 1, 1, 1, 1, 1, 1, 1 and d2 (t) = 1, 1, 1, 1, 1, 1, 1 which results in
i (t) = /4, 7/4, 5/4, 7/4, 7/4, 3/4, 7/4, . For QPSK the symbol switching
points occur each Ts seconds. (c) Now the switching instants are each Tb seconds. Start
with d1 (t) = 1. Then d2 (t) is staggered, or oset, by 1 bit time. So the first phase shift
is for d1 (t) = 1 and d2 (t) = 1 or 2 (t) = /4. After Ts = 2Tb seconds d1 (t) takes on the
second 1-value, but d2 (t) is still 1, so 1 (t) = /4. At 3Tb seconds, d2 (t) changes to 1,
so 2 (t) = 7/4. At 4Tb seconds, d1 (t) changes to 1, so 2 (t) = 7/4, etc.
1
Problem 8.3
For QPSK,
PE, symbol = 2Q
p
Es /N0 = 105
Trial and error using the asymptotic approximation for the Q-function gives [Es /N0 ]reqd
12.9 dB = 19.5. If the quadrature-carrier amplitudes are A, then the amplitude of the
2
2A T / (2N0 ) =
envelope-phase-modulated form of the carrier is 2A, and Es /N0 =
q
p
2
11
A /N0 R. Hence, Areqd = N0 R [Es /N0 ]reqd = (10 ) (19.5) R = 1.4 105 R. The
answers are as follows: (a) 0.0014 V; (b) 0.0031 V; (c) 0.0044 V; (d) 0.0099 V; (e) 0.014 V;
(f) 0.0442 V.
Problem 8.4
Take the expectation of the product after noting that the average values are 0 because
E[n (t)] = 0:
Z Ts
Z Ts
E [N1 N2 ] = E
n (t) cos ( c t) dt
n (t) sin ( c t) dt
=
Ts
=
=
Ts
Ts
Ts
N0
(t ) cos (c t) sin (c ) dtd
2
Z
N0 Ts
cos ( c t) sin ( c t) dt
2 0
Z
N0 Ts
sin (2 c t) dt = 0
4 0
Problem 8.5
(a) Use
1
i (t) = tan
d2 (t)
d1 (t)
(i) If i (t) = 45o , d1 (t) = 1 and d2 (t) = 1; (ii) If i (t) = 135o , d1 (t) = 1 and d2 (t) = 1;
(iii) If i (t) = 45o , d1 (t) = 1 and d2 (t) = 1; (iv) If i (t) = 135o ; d1 (t) = 1 and
d2 (t) = 1.
(b) Error in detecting d1 (t): (i) i (t) = 135o ; (ii) i (t) = 45o ; (iii) i (t) = 135o ; (iv)
i (t) = 45o .
(c) Error in detecting d2 (t); (i) i (t) = 45o ; (ii) i (t) = 135o ; (iii) i (t) = 45o ; (iv)
i (t) = 135o .
Problem 8.6
(a) Both are equivalent in terms of symbol error probabilities. (b) QPSK is 3 dB worse in
terms of symbol error probability for equal transmission bandwidths, but it handles twice
as many bits per second. (c) Choose QPSK over BPSK in terms of performance; however,
other factors might favor BPSK, such as simpler implementation.
Problem 8.7
The exact result is
Psymbol = 1 (1 PE1 )2
= 2PE1 PE2 1
PE2 1
" r
= Q
Es
N0
!#2
Figure 8.1:
Figure 8.2:
Figure 8.3:
Problem 8.9
For QPSK, the excess phase corresponds to a stepwise function that may change values
each Ts seconds. The phase deviation is given by
1 d2 (t)
i (t) = tan
d1 (t)
so the sequence of phases for QPSK computed from d1 (t) and d2 (t) given in Problem 8.8
is /4, /4, /4, 3/4, /4, 3/4, /4, 3/4, 3/4, /4 radians. For OQPSK,
the phase can change each Ts /2 = Tb seconds because d2 (t) is delayed by Ts /2 seconds
with respect to d1 (t). The maximum phase change is /2 radians. For MSK, the excess
phase trajectories are straight lines of slopes /2Tb radians/second.
Problem 8.10
Write the sinc-functions as sin(x) /x functions. Use appropriate trigonometric identities to
reduce the product of the sinc-functions to the given form.
Problem 8.11
If d (t) is a sequence of alternating 1s and 0s, the instantaneous frequency is 1/4Tb Hz above
the carrier (with the definition of i (t) given by (8.17) and (8.18)). If it is a sequence of
1s or 0s, the instantaneous frequency is 1/4Tb Hz below the carrier. (a) The instantaneous
frequency is 5, 000, 000 + 100, 000/4 = 1, 025, 000 Hz. (b) The instantaneous frequency is
5, 000, 000 100, 000/4 = 975, 000 Hz.
Problem 8.12
The signal points lie on a circle of radius Es centered at the origin equally spaced at
angular intervals of 22.5 degrees (360/16). The decision regions are pie wedges centered
over each signal point.
Problem 8.13
The bounds on symbol error probability are given by
P1 PE, symbol 2P1
where
P1 = Q
"r
#
2Es
sin (/M )
N0
For moderate signal-to-noise ratios and M 8, the actual error probability is very close to
the upper bound. Assuming Gray encoding, the bit error probability is given in terms of
symbol error probability as
PE, bit
PE, symbol
log2 (M )
"r
#
Eb
2 log2 (M )
sin (/M ) = 105
N0
or
"r
2 log2 (M )
Eb
105
sin (/M ) =
N0
2
1.5 105 , M = 8
2 105 , M = 16
log2 (M ) =
2.5 105 , M = 32
3 105 , M = 64
The argument of the Q-function to give these various probabilities are found, approximately,
by trial and error (either using MATLAB and a program for the Q-function or a calculator
and the asymptotic expansion of the Q-function):
4.17, M = 8
4.1, M = 16
Q-function argument =
4.06,
M = 32
4.02, M = 64
Eb
2 log2 (8)
sin (/8) = 4.17
N
r 0
Eb
6
0.3827 = 4.17
N0
Eb
N0
"
#
1
4.17 2
= 12.96 dB
= 10 log10
6 0.3827
Eb
2 log2 (16)
sin (/16) = 4.1
N0
r
Eb
8
0.1951 = 4.17
N0
Eb
N0
"
#
4.17 2
1
= 17.57 dB
= 10 log10
8 0.1951
Eb
2 log2 (32)
sin (/32) = 4.06
N0
r
Eb
10
0.098 = 4.06
N0
Eb
N0
= 10 log10
"
1
10
4.06
0.098
2 #
= 22.35 dB
Eb
2 log2 (64)
sin (/64) = 4.02
N0
r
Eb
12
0.049 = 4.02
N0
Eb
N0
Problem 8.14
The binary number representation
alents are given below:
Bin. No. Gray Bin. No.
0000
0000
0100
0001
0001
0101
0010
0011
0110
0011
0010
0111
= 10 log10
"
1
12
4.02
0.049
2 #
= 27.49 dB
Bin. No.
1000
1001
1010
1011
Gray
1100
1101
1111
1110
Bin. No.
1100
1101
1110
1111
Gray
1010
1011
1001
1000
Problem 8.15
Let the coordinates of the received data vector, given signal labeled 1111 was sent, be
(X, Y ) = (a + N1 , a + N2 )
where N1 and N2 are zero-mean, uncorrelated Gaussian random variables with variances
N0 /2. Since they are uncorrelated, they are also independent. Thus,
P (C | I) = P (0 X 2a) P (0 Y 2a)
Z 2a (xa)2 /N0 Z 2a (ya)2 /N0
e
e
=
dx
dy
N0
N0
0
0
Let
2 (x a)
2 (y a)
u=
and u =
N0
N0
This results in
P (C | I) =
2a2
N0
r
2
2a
N0
r
2
eu /2
du
2
2a2
N0
r
2
2a
N0
r
Z
2
eu /2
du
= 4
2
0
0
s
2
2a2
= 1 2Q
N0
Z
2a2
N0
ev /2
dv
2
2a2
N0
ev /2
dv
2
Similar derivations can be carried out for the type II and III regions.
Problem 8.16
The symbol error probability expression is
1
1
1
Ps = 1 P (C | I) + P (C | II) + P (C | III)
4
2
4
where
P (C | I) = [1 2Q (A)]2 , A =
2a2
N0
P (C | III) = [1 Q (A)]2
Thus
1
1
1
[1 2Q (A)]2 + [1 2Q (A)] [1 Q (A)] + [1 Q (A)]2
4
2
4
1
1
1
2
2
2
1 4Q (A) + 4Q (A) +
1 3Q (A) + 2Q (A) +
1 2Q (A) + Q (A)
= 1
4
2
4
PE = 1
2
2a
= 3Q
N0
10
Problem 8.17
This follows by counting type I, II, and III regions. There are M M total regions,
2
M 2 type I regions. A sketch will help in determining this. Thus, the given
expression for PE follows. The expression for a follows by computing the average symbol
energy in terms of a. To accomplish this, the sums
m
X
i=1
m
X
m (m + 1)
m (m + 1) (2m + 1)
i=
i2 =
and
2
6
i=1
are convenient. The approximate probability of error expression follows in a manner similar
to the derivation for M = 16 outlined in Problem 8.16.
Problem 8.18
Use
PE, bit =
Es
Eb
M
1
PE, symbol and
=
2 (M 1)
N0
log2 (M ) N0
A tight bound for the symbol error probability for coherent M -ary FSK is
r !
Es
PE, symbol M Q
N0
Use the asymptotic expression for the Q-function and iteration on a calculator to get the
following results:
For M = 8, PE, bit = 104 for Eb /N0 = 7.5 dB;
For M = 16, PE, bit = 104 for Eb /N0 = 6.5 dB;
For M = 32, PE, bit = 104 for Eb /N0 = 5.9 dB;
For M = 64, PE, bit = 104 for Eb /N0 = 5.3 dB.
Problem 8.19
Use the same relations as in Problem 8.18 for relating signal-to-noise ratio per bit and
symbol and for relating bit to symbol error probability, except now
PE, symbol =
M1
X
k=1
M 1
k
k Es
(1)k+1
exp
k+1
k + 1 N0
Use MATLAB to perform the sum. The following results are obtained:
For M = 2, PE, bit = 104 for Eb /N0 = 12.3 dB;
11
2 axes at Es . The decision regions are formed by the positive coordinate axes and the
45-degree bisector of the first quadrant angle.
Problem 8.21
The bandwidth eciencies are given by
(
0.5 log2 (M ) , M -PSK and M -QAM
R
=
log2 (M)
B
M+1 , coherent M -FSK
This gives the results
given in the table below:
1.5 bps/Hz, M = 8
R
PSK: B
=
2.0 bps/Hz, M = 16 ;
2.5 bps/Hz, M = 32
FSK:
R
B
R
B
0.33 bps/Hz, M = 8
=
0.24 bps/Hz, M = 16 ;
0.15 bps/Hz, M = 32
16-QAM:
6.67 kHz, M = 8
B=
5.0 kHz, M = 16
4.0 kHz, M = 32
B = 5.0 kHz
30.0 kHz, M = 8
B=
42.6 kHz, M = 16
66.0 kHz, M = 32
Problem 8.22
Use Figure 8.19 noting that the abscissa is normalized baseband bandwidth. RF bandwidthis twice as large. The 90% power containment bandwidth is defined by the ordinate
= -10 dB. (c) B90, BPSK = 1.6/Tb = 1.6Rb ; (b) B90, QPSK, OQPSK = 0.8/Tb = 0.8Rb ; (a)
B90, MSK = 0.8/Tb = 0.8Rb .
Problem 8.23
Use Figure 8.19 noting that the abscissa is normalized baseband bandwidth. RF bandwidth
is twice as great. The 99% power containment bandwidth is defined by the ordinate =
-20 dB. (a) B99, BPSK = 14/Tb = 14Rb ; (b) B99, QPSK, OQPSK = 3.5/Tb = 3.5Rb ; (c)
B99, MSK = 1.23/Tb = 1.23Rb .
Problem 8.24
The baseband power spectrum is
G (f ) = 2A2 Tb [log2 (M )] sinc2 [log2 (M ) Tb f ]
12
where
A2 = Es cos2 i = Es sin2 i
M
M
1 X 2 2 (i 1)
1 X 2 2 (i 1)
=
=
cos
sin
M
M
M
M
i=1
i=1
0.267Rb Hz, M = 8
= 0.8Rb / log2 (M ) =
0.25Rb Hz, M = 16
0.16Rb Hz, M = 8
Problem 8.25
(a) For NRZ mark:
Rm =
Sr (f ) = Tb sinc2 (f Tb )
A2 , m = 0
0, m 6= 0
Tb
sinc2
Sr (f ) =
2
f Tb
2
A2 Tb
Spolar RZ (f ) =
sinc2
4
f Tb
2
13
1 2
1 2
1 2
1 2
1 1
Rm =
(A)
(A)
+
(A)
(A)
+
(A)
(A)
+
(A)
(A)
+
(A)
(0)
4
4
4
4
2
1 1
f Tb
2
A2 Tb
sinc2
Sbipolar RZ (f ) =
8
f Tb
2
Problem 8.26
To show:
cos
t
2Tb
2Tb
Use the modulation theorem together with the Fourier transform of a rectangular pulse to
get
t
t
Note that
sin (2Tb f /2) = cos (2Tb f )
Then
RHS =
=
1
1
2Tb
+
cos (2Tb f )
1 4Tb f
1 + 4Tb f
4Tb cos (2Tb f )
1 (4Tb f )2
14
Figure 8.4:
Problem 8.27
Apply (5.28).
Problem 8.28
This is a matter of MATLAB programming and plotting.
Problem 8.29
A plot is given in Figure 8.4.
Problem 8.30
The states are (read from top to bottom, column by column):
1111
0100
1011
0111
0010
0101
0011
1001
1010
0001
1100
1101
1000
0110
1110
The output sequence is the last digit in each 4-element word. The autocorrelation function
is a triangular pulse centered at the origin two units wide repeated every 15 units and a
horzontal line between the triangles at 1/15 units.
15
Problem 8.31
The states are (read from top to bottom, column by column):
11111
00101
10100
01101
01111
10010
01010
00110
00111
01001
11010
00011
10011
00100
11101
10001
11001
00010
01110
11000
01100
00001
01110
11100
10110
10000
10111
11110
01011
01000
11011
The output sequence is the last digit in each 5-element word. The autocorrelation function
is a triangular pulse centered at the origin two units wide repeated every 31 units and a
horzontal line between the triangles at 1/31 units.
Problem 8.32
To find the aperiodic correlation function, we slide the sequence past itself and compute the
number of alike bits minus the number of unalike bits for the overlap (the sequence is not
periodically repeated). The result can be scaled by the length of the sequence if desired.
(a) -1, 0, -1, 0, -1, 0, 7, 0, -1, 0, -1, 0, -1 (the maximum absolute value correlation is 1 nonzero delay); (b) -1, 0, -1, 0, 3, 0, 1, -2, -1, -4, -1, 0, -1, 0, 15, . . . (the maximum
absolute value correlation is 4 - nonzero delay).
Problem 8.33
Note that the expectation of Ng is zero because n (t) has zero mean. Write the expectation
of the square of Ng as an iterated integral. The expectation can be taken inside. Use the
fact that
E [n (t) n ()] =
N0
(t )
2
to reduce the double integral to a single integral. The integral of the resulting cosine
squared is Tb /2. The result for the variance (same as the mean square) is then found to be
N0 Tb .
Problem 8.34
The random variable to be considered is
NI =
Tb
AI c (t) cos (t + ) dt
16
where is assumed uniform in[0, 2). Clearly, the expectation of NI is zero due to
this random phase. The variance is the same as the mean square, which is given by
var (NI ) = E
Z
Tb
Tb
Tb
Tb
+ ) cos ( + ) dtd
Problem 8.35
(a) The processing gain is
Gp =
Tb
Rc
=
or Rc = Gp Rb
Tc
Rb
For Gp = 100 and a data rate of 1 Mbps, Rc = 100 megachips per second; (b) BRF = 2Rc =
200 MHz; (c) Use (8.99) to get the following:
PE = 5.03 105 for a JSR of 5 dB;
PE = 8.34 104 for a JSR of 10 dB;
PE = 1.42 102 for a JSR of 15 dB;
PE = 0.34 for a JSR of 30 dB.
Problem 8.36
The results are
PE = 5.72 106 for a JSR of 5 dB;
PE = 1.09 105 for a JSR of 10 dB;
PE = 5.03 105 for a JSR of 15 dB;
PE = 0.0895 for a JSR of 30 dB.
Problem 8.37
3N
3.81 to give PE = 104
SNR =
K 1
17
Thus,
3N
+1
(3.81)2
= 53.7
K =
Round this down to K = 53 users since the number of users must be an integer.
Problem 8.38
The result is
Tacq
Problem 8.39
(a) Only the OBP case will be done. See the text for the bent-pipe case. Equation (8.121)
becomes
pd =
105 pu
1 2pu
For BPSK, the uplink and downlink probabilities of error are related to the uplink and
downlink SNRs by
s !#
"
"s #
Eb
Eb
1
1 erf
=
2
pu = Q
N0 u
2
N0 u
s !#
"
"s #
Eb
Eb
1
1 erf
=
2
pd = Q
N0 d
2
N0 d
where these probabilities have been put in terms of the error function because MATLAB
includes an inverse error function. When these relations are inverted, these become
2
Eb
= erf 1 (1 2pu )
N0
u
2
Eb
= erf 1 (1 2pd )
N0 d
Typical values are given in the table below. The MATLAB program for computing them
is also given below along with a plot. Part (b) is just a matter of inputting the desired
p_overall in the program.
18
Figure 8.5:
pu
109
3 109
7 109
4.3 108
7.2 107
(Eb /N0 )u , dB
12.5495
12.3228
12.0839
11.5639
10.6497
pd
9.999 106
9.997 106
9.993 106
9.957 106
9.280 106
(Eb /N0 )d , dB
9.5879
9.5880
9.5882
9.5898
9.6217
19
Problem 8.40
(a) This is similar to the previous problem except that the error probability expresseion for
noncoherent FSK is
Eb
1
PE = exp
2
2N0
Solving for
Eb
N0 ,
we have
Eb
= 2 ln (2PE )
N0
Thus,
106 pu
pd =
1 2pu
Eb
= 2 ln (2pu )
N0 u
Eb
= 2 ln (2pd )
N0 d
(b) For DPSK, the probability of error is
PE =
Eb
1
exp
2
N0
20
Figure 8.6:
pd = (p_overall - pu)./(1 - 2*pu);
if mod_type == 1
Eb_N0_u = 10*log10(-2*log(2*pu));
Eb_N0_d = 10*log10(-2*log(2*pd));
elseif mod_type == 2
Eb_N0_u = 10*log10(-log(2*pu));
Eb_N0_d = 10*log10(-log(2*pd));
end
plot(Eb_N0_d, Eb_N0_u), xlabel((E_b/N_0)_d, dB), ylabel((E_b/N_0)_d, dB),...
grid, axis square
if mod_type == 1
title([OBP link performance for overall P_E = , num2str(p_overall), ; NFSK
modulation])
elseif mod_type == 2
title([OBP link performance for overall P_E = , num2str(p_overall), ; DPSK
modulation])
end
21
Figure 8.7:
Problem 8.41
For noncoherent FSK, the bit error probability, using (8.51) and (8.54), is
r
r
!
!
M
M2
Eb
Eb
Q
Q
Pb =
log2 (M )
log2 (M )
2 (M 1)
N0
2
N0
So, the equations for the OBP link are
pd =
pu
Eb
N0
pd
Eb
N0
106 pu
1 2pu
s
!
Eb
M
Q
=
log2 (M )
2
N0 u
4pu 2
2
1
1
erf
log2 (M )
M
s
!
Eb
M
Q
=
log2 (M )
2
N0 d
4pd 2
2
1
1
erf
log2 (M )
M
"
s
!#
log2 (M ) Eb
M
1 erf
4
2
N0 u
"
s
!#
log2 (M ) Eb
M
1 erf
4
2
N0 d
22
Figure 8.8:
A MATLAB program is given below and a plot for 16-FSK is also given in Fig. 8.8.
% Solution for Problem 8.41
%
p_overall = input(Enter desired end-to-end probability of error )
M = input(Enter the desired M )
pu = logspace(log10(p_overall)-4, log10(p_overall)+1e-20);
pd = (p_overall - pu)./(1 - 2*pu);
Eb_N0_u = 20*log10((2/log2(M))*erfinv(1 - (4/M)*pu));
Eb_N0_d = 20*log10((2/log2(M))*erfinv(1 - (4/M)*pd));
plot(Eb_N0_d, Eb_N0_u), xlabel((E_b/N_0)_d, dB), ylabel((E_b/N_0)_d, dB),...
grid, axis square
title([OBP link performance for overall P_E = , num2str(p_overall), ; coherent ,
num2str(M),
-FSK modulation])
23
Problem 8.42
(a) The number of users per reuse pattern remain the same at 120. For 20 dB minimum
signal-to-interference ratio and a propagation power law of = 3, we have
Dco
20 = 10(3) log10
1 7.7815
dA
or
Dco
20 + 7.7815
= 0.794
1
=
log10
dA
30
Dco
= 100.794 + 1
dA
= 9.43 = 3N
or
N = d29.67e = 31 (i = 1, j = 5)
The eciency is
v =
120
31
6 MHz
3
1
=
= voice circuits per base station per MHz
6
2
(b) For 14 dB minimum signal-to-interference ratio and a propagation power law of = 3,
we have
Dco
14 = 10(3) log10
1 7.7815
dA
Dco
14 + 7.7815
= 0.726
log10
1
=
dA
30
Dco
= 100.726 + 1
dA
= 6.32 = 3N
or
N = d13.32e = 19 (i = 2, j = 3)
The eciency is
v =
=
120
19
6 MHz
6
= 1 voice circuits per base station per MHz
6
24
8.2
Computer Exercises
25
26
Figure 8.9:
LTbf = length(Tbf);
A_BPSK = [];
A_QPSK = [];
A_MSK = [];
for k = 1:LTbf
A_BPSK(k) = quadl(G_BPSK, Tbf(k), 14);
A_QPSK(k) = quadl(G_QPSK, Tbf(k), 7);
A_MSK(k) = quadl(G_MSK, Tbf(k), 7);
end
OBP_BPSK = 10*log10(A_BPSK/A_BPSK(1));
OBP_QPSK = 10*log10(A_QPSK/A_QPSK(1));
OBP_MSK = 10*log10(A_MSK/A_MSK(1));
plot(Tbf, OBP_BPSK, A(1,:)), ylabel(Relative out-of-band power, dB), xlabel(T_bf),...
axis([0 5 -40 0]),grid,...
hold on
plot(Tbf, OBP_QPSK, A(2,:))
plot(Tbf, OBP_MSK, A(3,:))
legend(BPSK, QPSK/OQPSK, MSK)
A typical plot generated by the program is shown in Fig. 8.10.
27
Figure 8.10:
Computer Exercise 8.3
% ce8_3.m: Computes spectrum of continuous phase FSK
%
clf
A = char(-,,-.,:,.,-..);
Tbf0 = input(Enter f_0 times T_b )
delTbf0 = .5:.25:1.5;
L_delTbf = length(delTbf0)
Tbf = 0:.025:10;
for k = 1:L_delTbf
delTbf = delTbf0(k);
G_FSK = (S_CFSK(Tbf-Tbf0) + S_CFSK(Tbf-Tbf0-delTbf)).^2;
area = sum(G_FSK)*0.025;
G_FSKN = G_FSK/area;
plot(Tbf, G_FSKN, A(k,:))
if k == 1
hold on
grid
xlabel(T_bf), ylabel(Spectral amplitude)
end
28
Figure 8.11:
end
legend([\DeltafT_b = ,num2str(delTbf0(1))], [\DeltafT_b = ,num2str(delTbf0(2))],
[\DeltafT_b = ,num2str(delTbf0(3))],[\DeltafT_b = ,num2str(delTbf0(4))],
[\DeltafT_b = ,num2str(delTbf0(5))])
title([Spectrum for continuous phase FSK; T_bf_0 = , num2str(Tbf0)])
% Function to approximate CFSK spectrum
%
function y = S_CFSK(Tbf)
y = sinc(Tbf);
A typical plot is shown in Fig. 8.11.
Computer Exercise 8.4
% ce8_4.m: Computes bit error probability curves for jamming in DSSS.
% For a desired P_E and given JSR and Gp, computes the required Eb/N0
%
clf
A = char(-,,-.,:,.,-.x,-.o);
Gp_dB = input(Enter desired processing gain in dB );
29
30
A typical run follows, with both a plot given in Fig. 8.12 and a specific output generated:
>> ce8_4
Enter desired processing gain in dB: 30
Strike ENTER to continue
Enter desired value of P_E: 1e-3
Enter given value of JSR in dB: 20
Enter given value of processing gain in dB: 30
Infinite Eb/N0 BEP limit
3.8721e-006
To give BEP of:
0.0010
Requires GP, JSR, and Eb/N0 in dB of:
30.0000 25.0000 9.6085
Computer Exercise 8.5
% ce8_5.m: Given a satellite altitude and desired spot diameter for
% illumination, determines circular antenna aperture diameter and
% maximum antenna gain.
%
h = input(Enter satellite altitude in km: );
d_spot = input(Enter desired illuminated spot diameter at subsatellite
point in km: );
f0 = input(Enter carrier frequency in GHz: );
rho = input(Enter desired antenna eciency: 0 < \rho <= 1: );
31
Figure 8.12:
theta = d_spot/h;
phi3dB = theta;
lambda = 3E8/(f0*1E9);
d = lambda/(phi3dB*sqrt(rho));
% G0 = rho*(pi*d/lambda)^2
G0 = (pi/phi3dB)^2;
G0_dB = 10*log10(G0);
disp( )
disp(3-dB beamwidth in degrees: )
disp(phi3dB*57.3)
disp(Wavelength in meters:)
disp(lambda)
disp(Antenna diameter in meters:)
disp(d)
disp(Antenna gain in dB:)
disp(G0_dB)
disp( )
A typical run follows:
32
33
34
Figure 8.13:
to give P_E = ,num2str(PE0),; noncoh. FSK modulation])
end
A typical run follows:
>> ce8_6
Enter type of modulation: 1 = BPSK; 2 = coh. FSK; 3 = DPSK; 4 = noncoh. FSK 2
Enter desired value of P_E 1e-3
EbN0r_dB =
9.7998
Computer Exercise 8.7
% ce8_7.m: plots waveforms or spectra for gmsk and msk
%
A = char(-,-.,,:.);
samp_bit = input(Enter number of samples per bit used in simulation: );
N_bits = input(Enter total number of bits: );
GMSK = input(Enter 1 for GMSK; 0 for normal MSK: );
if GMSK == 1
BT_bit = input(Enter vector of bandwidth X bit periods: );
N_samp = 50;
end
35
36
37
38
Figure 8.14:
39
Figure 8.15: