Communication Engineering – II (21ET52)

Sample Questions

UNIT-1 Answers
(Page No)
1 With a block diagram, explain the model of a digital communication system.

2 Consider Three signals s1(t), s2(t) and s3(t) as shown in the fig-2. Use Gram-
Schmidt orthogonalization Procedure to find the orthonormal basis for this set
of signals. Also express the signals in terms of basis functions.

3 Use Gram-Schmidt Orthogonalization Procedure to find the ortho-normal

basis for the set of four signals s1(t), s2(t), s3(t) and s4(t) shown in the figure
below. Express the signals in terms of the basis functions.

4 Use Gram-Schmidt Orthogonalization procedure to find the ortho-normal

basis for the set of four signals s1(t), s2(t), s3(t) and s4(t) shown in the figure
below. Express the signals in terms of the basis functions.

5 Illustrate the geometric representation of signals using basis functions for the
case N=2 and M=3, where N is the dimension of signal space and M is
number of signals.
6 With block diagrams, explain the working of detector and vector receiver of a
correlation receiver.
7 What is a Matched Filter? State and explain the properties of a Matched filter?

8 Derive an expression for maximum SNR in a matched filter.

UNIT-2 Answers
(Page No)
1 Explain the Nyquist criterion for distortion–less base band binary
transmission systems.
2 What is meant by Inter-symbol Interference (ISI)? Explain the ideal and
practical solutions to overcome ISI problem.
3 Consider a channel of bandwidth 3000 Hz. The requirement is to transmit data
over the channel at the rate of 4500 bits/s using binary PAM.
(a) What is the maximum roll-off factor in the raised-cosine pulse spectrum
that can accommodate this data transmission?
(b) What is the corresponding excess bandwidth?
4 A source outputs data at the rate of 56 kilo-bits/sec. The transmitter uses
binary PAM with raised cosine pulse in shaping of optimum pulse width.
Determine the bandwidth of the transmitted waveform if the roll-off factor is
(i) α = 0.25 (ii) α = 0.75 (iii) α = 1.0
5 What is “Eye pattern”? Explain how it is useful in understanding the ISI
problem with a suitable diagram.
6 A binary wave using non-return-to-zero signaling is generated by representing
symbol 1 by a pulse of amplitude +1 and symbol 0 by a pulse of amplitude -1
in both cases, the pulse duration equals the bit duration. This signal is applied
to a low-pass RC filter with transfer function: H(f) = 1/ ( 1 + j f/fo).
Construct the eye pattern for the filter output for the following sequences:
(a) Alternating 1s and 0s.
(b) A long sequence of 1s followed by a long sequence of 0s.
(c) A long sequence of 1s followed by a single 0 and then a long sequence of
1s. Assume a bit rate of bits per second.
7 The binary sequence (101010……) is passed through a low pass filter.
Assuming the signal is represented by polar signaling, draw eye pattern for
the output signal of the filter.
8 Illustrate the generation of MSK waveform for the binary data 01001011.
Sketch the MSK waveform. Assume that the carrier frequency equals the bit
rate.
9 For an MSK system, draw the phase trellis for the sequence 11010000.

10 With block diagrams, explain the working of a MSK transmitter and receiver.
11 With a signal space diagram for M=8, explain the M-ary PSK modulation
technique.
12 Explain the principle of Quadrature Amplitude modulation with a signal space
diagram for 16-QAM scheme.
13 What is meant by Bandwidth Efficiency or Spectral Efficiency? Compare the
Bandwidth efficiency of M-ary PSK signals for different values M.
14 Compare the Bandwidth efficiency of M-ary FSK signals for different M.

15 Compare the Bandwidth efficiency of M-ary QAM signals.

16 Explain the OFDM scheme with a block diagram.

UNIT-3 Answers
(Page No)
1 Explain the following terms: (with mathematical relations)
(a) Uncertainty (b) Information (c) Entropy
2 Explain the following terms:
(a) Prefix codes (b) Instantaneous codes (c) Uniquely decodable codes
3 Define the Entropy of a discrete memory less source. State the properties of
Entropy.
4 State and explain the following:
Source coding theorem and Channel coding theorem.
5 A series of messages are transmitted between two computers over a wired
network. The message comprises the following characters, with their
probabilities of occurrence within parenthesis: A(0.25), B(0.25), C(0.14),
D(0.14), E(0.055), F(0.055), G(0.055) and H(0.055).
Calculate the entropy of the source. Use Huffman coding to derive a code
word set and construct the Huffman code tree. Also find the average number
of bits per character for your code word set, efficiency and variance.
6 A text message consists of six different characters: (A, B, C, D, E and F), and
the probability of occurrence is: (0.25, 0.1, 0.2, 0.05, 0.3, 0.1) respectively.
Using Huffman coding scheme for this source, derive a suitable set of code-
words. Determine the average code word length, coding efficiency and
variance for the code.
WE A discrete memory less source (DMS) has an alphabet of five symbols,
S = [ s1, s2, s3, s4, s5 ] with probabilities [ 0.4, 0.2, 0.2, 0.1, 0.1 ]. Derive the
two different Huffman codes for this source. For each of the code set obtained
calculate average code word length and the variance of the code word length
over the ensemble of source symbols.
7 What is mutual information of the channel? State and explain the properties of
mutual information.
8 A binary symmetric channel has the channel matrix, P(Y|X). Write the

transition probability diagram for the channel. ( | ) [ ]

Compute mutual information.

9 Explain the channel matrix and transition probability diagram for the Binary
erasure channel.
10 The joint probability matrix P(X, Y) for a channel is given below. Compute
the following: H(X), H(Y), H(X,Y), H(Y|X) and I(X, Y).

( ) [ ]

11 The joint probability matrix P(X, Y) for a channel is given below. Compute
the following: H(X), H(Y), H(X,Y), H(Y|X), H(X|Y) and I(X, Y).

( ) [ ]

12 A voice grade channel of the telephone network has a bandwidth of 3400Hz.

(i) Find the channel capacity of the channel for a signal to noise ratio of 30dB.
(ii) Calculate the minimum SNR required to support information transmission
through the channel at the rate of 4800 bits/sec.
(iii) Repeat part (ii) for 9600 bits/sec.
UNIT-4 Answers
(Page No)
1 Differentiate Source encoder and channel encoder.

2 A (6, 3) linear block code has the following generator matrix, G.

Write the parity matrix and parity check matrix. Compute all the code words.

[ ]

3 A (7, 4) linear block code has the following Parity 1 10 

0 1 1 
matrix, P.
P
(i) Derive the generator matrix, G and parity check 1 1 1 
 
matrix, H of this code. 1 01 

(ii) Compute all the code words.

(iii) How many errors can be detected and corrected?
4 A (7, 4) Hamming block code has the following generator matrix, G.
(i) Derive the parity matrix and parity check matrix of this code.
(ii) Compute all the code words and its Hamming weight.
(iii) How many errors can be detected and corrected?
1 1 0 1 0 0 0 
0 1 1 0 1 0 0 
G
1 1 1 0 0 1 0
 
1 0 1 0 0 0 1

5 The generator polynomial of a (7,4) cyclic code is g(D) = 1 + D + D3.

(i) Develop the encoder and syndrome calculator for this code, using
a systematic form for the code.
(ii) Illustrate the code-word generation for the message 101101.
6 Repeat the previous problem for g(D) = 1 + D2 + D3.

7 The generator polynomial of a (7,4) cyclic code is g(D) = 1 + D + D3 .

Perform syndrome decoding for a received code word: 0110001.
8 Compare the key features of Block codes and Convolution codes.

9 A convolution encoder has a single shift register with two stages, three
modulo-2 adders and an output multiplexer. The generator sequences of the
encoder are as follows: g(1) = [ 1, 0, 1], g(2) = [ 1, 1, 0] and g(3) = [ 1, 1, 1].
(i) Draw the block diagram and state diagram of the encoder.
(ii) For the message sequence (10001), obtain the encoded sequence using
time domain approach and transfer domain approach.
10 A convolution encoder is shown in figure below:
(i) Draw the state and trellis diagrams for this encoder and explain.
(ii) For the message sequence (110011), obtain the encoded sequence.

11 A convolution encoder with code rate r=1/2 and constraint length K=2, is
shown in figure below: For the message sequence (11000011), obtain the
encoded sequence.
12 A convolution encoder with code rate r=1/2 and constraint length K=4, is
shown in figure below: For the message sequence (1010101010…), obtain the
encoded sequence.

UNIT-5 Answers
(Page No)
1 State and explain the properties of maximal length sequence.

2 The PN sequence for one period is given: 000101001101111.

Verify the different properties.
3 A PN sequence is generated using a feedback shift register of length M=4.
The chip rate is 107 chips per second. Calculate the PN sequence length, Chip
duration of the PN sequence and PN sequence period.
4 A linear feedback shift register shown in figure below, is used to generate PN
sequence. Assuming the initial state as 100, derive the output sequence.

5 A 4-bit sequence generator is shown below, obtain the output sequence. Is it a

maximal sequence generator? State and verify the balance and run properties
for the output sequence. Assume the initial condition as 1111.
6 Design a PN sequence generator consisting of 4 flip-flops. Explain its
working considering the initial contents of flip flop is (1111). Verify the
properties of the sequence generated.
7 Design a circuit to generate a PN sequence of length 15, that can be used in a
direct sequence spread spectrum system.
8 Explain the working of a direct sequence spread spectrum (DSSS) system
employing BPSK modulation, with block diagrams and waveforms.
9 A DSSS/BPSK system has a processing gain of 1000 and the bit rate of the
message data is 2000 bps. Calculate the bit duration and chip duration.
Determine the Jamming margin of the system, if probability of error is not
more than 10-5. Assume erfc(3.05) = 2x10-5.
10 Determine the Jamming margin of a DSSS/BPSK system having a processing
gain of 40dB and probability of error not more than 10-6. (Use Error function
table for calculation of Eb/No).
11 With block diagrams, explain the working of transmitter and receiver of a
frequency hop spread spectrum system employing the M-ary frequency shift
keying modulation scheme.
12 What is frequency hop spread spectrum? Illustrate the slow frequency
hopping with FH/MFSK using the following PN sequence and input binary
data. Input binary data: 11001001001111010110.
PN sequence for one period: 111100010100110.
Assume M=4, number of bits/symbol = 2 and length of PN segment/hop =3.
13 Illustrate the fast frequency hopping with FH/MFSK using the following PN
sequence and input binary data. Input: 11001001001111010110.
PN sequence for one period: 111100010100110.
Assume M=4, number of bits/symbol = 2 and length of PN segment/hop =3.
14 For each of the following Frequency Hop spread spectrum systems, calculate
the Processing Gain (in dB) of the system.
(a) Slow FH/MFSK system having Number of bits per MFSK symbol = 4
and Number of MFSK symbols per hop = 5.
(b) Fast FH/MFSK system having Number of bits per MFSK symbol = 4
and Number of hops per MFSK symbol = 4.
15 Explain any two applications of Spread Spectrum.
 Communication Engineering – II (21ET52)
Short Questions

UNIT-1 Answers
(Page No)
1 Write the AWGN model of a channel.

2 What is the meaning of AWGN channel?

3 A set of four signals s1(t), s2(t), s3(t) and s4(t) are linearly independent. How 4-basis
many basis functions are required to represent the signals in terms of basis functions
functions?
4 Write the geometric representation of signals for N=2 and M=3.

5 Two signals are defined as s1(t) = 3ϕ1(t) + 2ϕ2(t) and s2(t) = 2ϕ1(t) + 4ϕ2(t),
where ϕ1(t) and ϕ2(t) are two basis functions. Draw the geometric
representation for the signals.
6 The input signal to a matched filter h(t) = s(T-t)
is given. Determine and sketch the
impulse response of the filter.

7 The input signal, s(t) to a matched filter is defined below. Determine and Same as
sketch the impulse response of the filter. Assume T=2 seconds. (4)

( ) {

8 What is the maximum Signal to Noise ratio of a matched filter? 2E / No

9 Determine and sketch the impulse response

of the matched filter, whose input x(t) is
given below. Ans: h(t) = x(T-t)

10 What are the two basic blocks of a Correlation receiver? Detector

Vector Receiver
 UNIT-2 Answers
(Page No)
1 Using polar signaling (NRZ) format, draw the waveform for the binary data
10011101.
2 Draw the waveform for the binary data 10001101 using Manchester format.

3 Define the term ISI. Inter Symbol

Interference
4 Define a signal waveform that produces zero inter-symbol Sinc(2Bt)
interference.
5 A source outputs data at the rate of 56k bits/sec. The transmitter BT = Bo ( 1 + α)
uses binary PAM with raised cosine pulse in shaping of optimum Bo = Rb/2 = 28k
pulse width. Determine the bandwidth of transmitted waveform if BT = 42k Hz
roll-off factor, α =0.5
6 A communication channel of bandwidth 75 KHz is required to BT = Bo ( 1 + α)
transmit binary data at the rate of 100 kbps employing raised cosine Bo = Rb/2 = 50k
pulses. Determine the required roll-off factor. α = 0.5
7 The T-1 carrier system is used to multiplex 24 voice signals based BT = Bo ( 1 + α)
on 8-bit PCM word. The bit duration of the time-division Bo = Rb/2 = 1/2Tb
multiplexed signal is Tb = 0.647 µsec. Calculate the transmission BT = 2Bo
bandwidth required to accommodate the raised cosine spectrum = 1.544MHz
with roll-off factor, α = 1.
8 Define the term Bandwidth Efficiency or Spectral ρ = Rb/ B bits/sec/Hz
Efficiency (ρ). ie.. Bit rate / Bandwidth
9 Define Bandwidth Efficiency for M-ary PSK. B = 2/Ts = 2 Rb /log2M
(Note: Ts = Symbol duration, B=bandwidth) ρ = Rb/ B = log2M / 2
10 Define Bandwidth Efficiency for M-ary FSK. B = M/2Ts = Rb M / (2 log2M )
(Note: M= number of bits per symbol) ρ = Rb/ B = 2 log2M / M
11 In a QPSK system, bit duration of 1µsec is used to represent the binary B=2/Ts
sequence applied to a QPSK modulator. The carrier frequency is 10 Ts =2 µsec
MHz. Calculate the transmission bandwidth of the QPSK signal. B=1MHz.
12 For the QPSK system mentioned above, find the M=4
bandwidth efficiency. ρ = Rb/ B = log2M / 2 = 1
13 Draw a signal space diagram for 8-PSK 14. Draw signal space diagram of 16-QAM
modulation scheme. technique used in Digital Radio.
ANS Note: In this case, adjacent points differ
by only one bit.

Note: You can choose alternate bit patterns

for different signal points.
UNIT-3 Answers
(Page No)
1 Define the terms: Uncertainty and Information. Page 14

2 State the properties of Information. Page-15

3 Obtain the Entropy of a Binary memory less source and sketch the curve. Page-18

4 Define Prefix code in source coding. Page-22

5 State the two functional requirements that are to be satisfied in the design Page-20
of an efficient source encoder.
6 A discrete memory less source emits three symbols with probability H(s) = 1.5
[0.25, 0.25, 0.5]. Calculate the entropy of the source.
7 A discrete memory-less source emitting message consists of 20 symbols H(s) =
each having the same probability. Determine the entropy of the source. Log2(20)
8 A discrete memory less source emits four symbols [A, B, C, D] and the
code words used to represent the symbols are [1, 01, 001, 000]. Write a
decision tree for this code word set.
9 A discrete memory less source emits four symbols [A, B, C, D] and the Not uniquely
code words used to represent the symbols are [1, 01, 001, 101]. Verify decodable
whether this is Uniquely decodable.
10 In Huffman encoding, the variance is _______when the combined symbol High
is moved as low as possible.
11 State the Shannon’s first theorem for a discrete memory-less channel.
12 State the Shannon’s second theorem for a discrete memory-less channel.
13 State the Channel capacity theorem.
14 A voice grade channel of the telephone network has a bandwidth of
3400Hz. Calculate channel capacity of the channel for a signal to noise
ratio of 30dB.
15 A channel has a bandwidth of 8000Hz. Calculate the minimum SNR
required to support information transmission through the channel at the
rate of 16000 bits/sec.
UNIT-4 Answers
(Page No)
1 In the design of a digital communication system, what Page-365
are the two key system parameters available to the 1.Transmitted signal power
designer? 2.Channel Bandwidth
2 State the functions of the channel encoder and channel decoder. Page: 365

3 State the basic difference between block codes and convolution codes.
OR Differentiate Block codes and Convolution codes.
4 When a linear block code is called a perfect code? Page 376
Ans: A binary code for which the Hamming bound is satisfied with
equality sign is called perfect code. (Ex: n=7, k=4)

∑( )

5 Determine the Hamming distance between the code words C1 and C2: Distance = 3
C1 = (101011) and C2 = (110111). ( 3 bits differ)
6 In a (n, k) linear block code, it was found that minimum distance, dmin = Detect: 2
3. How many bit errors can be detected and corrected in a code-word? Correct: 1.
7 The parity matrix of a (8, 4) Linear block code is
given. Obtain the parity check matrix. [ ] find H

8 State the two properties of syndrome. Page-374 ( 4 properties)

9 A binary code is said to be cyclic code if it exhibits 1. Linearity property

two fundamental properties. State the properties. 2. Cyclic property
10 What is meant by Cyclic Redundancy Check Codes? A cyclic code used for error
detection is CRC code.
 UNIT-5 Answers
(Page No)
1 Define the term: spread spectrum Page -445

2 Define maximal length sequence. Page-448

3 A direct sequence spread binary phase shift keying

system uses a feedback shift register of length 19 for the N = 2m - 1
generation of the PN sequence. Calculate the processing N = 219
gain of the system. PG = N = 10 log(219)= 57.2dB
4 In a spread spectrum system, the bit rate of the binary PG = (Tb /Tc)
data is 10 kbps and the bandwidth of the PN sequence is PG = (Wc/Rb) = 1000
10 MHz. Calculate the Processing gain of the system. PG = 10 log(1000)= 30dB
5 In direct sequence spread spectrum system, the JM = PG – (Eb/No) in dB
Processing gain is 30 dB and the (Eb/No) ratio is 20 dB. JM = 10 dB
What is the Jamming Margin of the system?
6 Determine the Jamming Margin of a direct sequence JM = PG – (Eb/No) in dB
spread spectrum system, which has a Processing gain of PG =1000 = 30 dB
1000 and (Eb/No) ratio is 15 dB. JM = 15dB
7 What is frequency hop spread spectrum? Page - 462
8 What is the relation between hop rate, symbol rate and Rc = max( Rh , Rs)
chip rate for a frequency hop spread spectrum system?
9 What is the difference between slow frequency hopping Slow FH: Rs = k.Rh
and fast frequency hopping spread spectrum? Fast FH: Rh = k.Rs
Where k is an integer.
10 A slow FH/MFSK system has the following parameters: PG =
The number of bits per MFSK symbol = 4 and the (Freq hop BW)/ Symbol rate
number of MFSK symbols per hop = 5. Calculate the PG = (Wc/Rs) = 4 /(1/5) = 20
processing gain of the system. PG =10log(20) = 26 dB
11 A fast FH/MFSK system has the following parameters:
The number of bits per MFSK symbol = 4 and the PG = (Wc/Rs) = 4 /(1/4) = 16
number of hops per MFSK symbol = 4. Calculate the PG =10log(16) = 12 dB
processing gain of the system.
12 List applications of Spread spectrum system. Code division Multiple Access (CDMA)
Multipath Supression