Figure 1.a shows a four stage feedback shift register.

The initial
state of the register is 1000.
a) Find the output sequence of the shift register.
b) Demonstrate the balance property and rum property of a PN
Sequence. Also, Calculate and plot the autocorrelation function
of the PN sequence produced by this shift register.

Flip Flop
Output
1 2 3 4 Sequence

Clock

What is Frequency Hopping?

i. Explain the concept of frequency hopping.
ii. Explanation of slow frequency hopping with hopping frequency Vs Time
Explanation of Fast frequency hopping

In a DS/BPSK system, the feedback shift register used to generate the PN sequence has length m=19.
The system is required to have an average probability of symbol error due to externally generated
interfering signals that does not exceed 10-5. Calculate the following system parameters in decibels:
(a) Processing gain
(b) Antijam margin.

The processing gain of a spread –spectrum system may be expressed as the ratio of the spread
bandwidth of the transmitted signal to the de-spread bandwidth of the received signal. Justify this
statement for DS/BPSK system.

Determine the transmission bandwidth reduction and average signal energy of 64-QAM compared to
16-QAM

Draw the spectrum of an OFDM transmission signal with 4 subcarriers.

Demonstrate the difference between Slow FH and Fast FH with a sketch on hopping frequency Vs
Time. Illustrate with an example.

Determine the bandwidth required for M-FSK system. Draw the geometrical representation of Mary
FSK signals. Find out distance between the signal points. What is the bandwidth of this system?

Explain the transmitter / receiver arrangement for MSK

Compare the M-ary FSK and M-PSK in terms of Spectral efficiency and error rate performance.
Why GMSK is preferred over MSK for GSM wireless communication standard

Starting from channel Capacity Theorem, and using bandwidth efficiency diagram, find the
Shannon’s limit value and discuss its its implications.

Explain MSK with the help of relevant expressions and waveforms. Show that MSK is basically
continuous phase FSK(CPFSK)?

Explain briefly about a MIMO system and its classification?

A digital communication system uses a 4-ary signalling scheme. Assume that 4 symbols -3, -1,1,3
are chosen with probabilities 1 /8 , 1 /4 , 1 /2 , 1 /8, respectively. The channel is an ideal channel with
AWGN, the transmission rate is 2 Mbaud ( 2 × 10^ 6 symbols/s), and the channel signal to noise
ratio is known to be 15.
1. Determine the source information rate.
2. If you are able to employ some capacity-approaching error-correction coding technique
and would like to achieve error-free transmission, what is the minimum channel bandwidth required?

Determine the rate of transmission of information through a channel whose noise characteristics is as
shown in Figure 3.b, given P(x1)=P(x2)= ½. Assume rs= 10,000 symbols/sec.

A source emits symbols Xi , 1 ≤ I ≤ 6, in the BCD format with

probabilities P ( Xi) as given in Table 1, at a rate rs = 9.6 kbaud
(baud=symbol/second).
Table 1:
Xi P(Xi) BCD word
A 0.30 000
B 0.10 001
C 0.02 010
D 0.15 011
E 0.40 100
F 0.03 101

a) State (i) the information rate and (ii) the data rate of the
source.
b) Apply Shannon-Fano coding to the source signal
characterized in Table 1. Are there any disadvantages in
the resulting code words?
c) What is the original symbol sequence of the ShannonFano
coded signal 110011110000110101100 ?
d) What is the data rate of the signal after Shannon-Fano
coding? What compression factor has been achieved?
 e) Derive the coding efficiency of both the uncoded BCD
signal as well as the Shannon-Fano coded signal.

Consider a zero-memory sourse with S={s1, s2,s3, s4,s5,s6,s7}

P={ 0.4,0.2,0.1,0.1,0.05,0.05}. Construct a binary Huffman code by placing the composite symbol as
low as you can.
Calucalte average length and Variance of word length.

For a given joint probability matrix,

0.05 0 0.20 0.05

0 0.10 0.10 0
P[A,B] = [ ]
0 0 0.20 0.10
0.05 0.05 0 0.10

compute mutual information and verify the relation I(X;Y) = H(X)+H(Y)-H(X,Y)

A CRT terminal is used to enter alphanumeric data into a computer. The CRT is connected through a
voice-grade telephone line having usable bandwidth of 3KHz and an output (S/N) of 10dB.Assume
that the terminal has 128 characters and data is sent in an independent manner with equal probability.
i) Find the average information per character.
ii) Find capacity of the channel
Find maximum rate at which data can be sent from terminal to computer without error.

The parity digits of a (6,3) linear block code are given as

C4= m1m3, C5= m1m2m3, C6 = m1m3
i) Determine the generator and parity check matrices for the systematic code
ii) Comment on error detection and error correction, capacities of the code if dmin=3
iii) If the received sequence is 1 0 1 1 0 1, determine the syndrome and detect the position of
error.
The generator sequence of (2,1,1) convolutional encoder is given by g(1) =[1,1] and g(2) =[1,0]
i) Draw the encoder circuit
ii) Draw the state diagram
iii) Draw the code tree
iv) Find the encoder output produced by the message sequence 10111

A black and White television picture may be viewed as consisting of approximately 3X 10^ 5 elements,
each of which may occupy one of 10 distinct brightness levels with equal probability. Assume that rate
of transmission is 30 picture frames per second, and the signal to noise ratio is 30dB. Using
information capacity theorem, calculate the minimum bandwidth required to support the transmission
of the resulting video signal.

Using Hamming bound, verify that the (63,57) hamming code is a perfect code if minimum distance
dmin=3

For a (7,4) cyclic code, the received vector Z(x) is 0100101 and the generator polynomial is g(x) =
1+x+x^3.Draw the syndrome calculation circuit and correct the single error in the received vector.
For a systematic (7,4) block code, the parity matrix P is given by

1 1 1
1 1 0
[P] =
1 0 1
0 1 1

(i) Find all possible valid code-vectors

(ii) Draw the corresponding encoding circuit.

(iii) A single error has occurred in each of these received vectors. Detect and correct those errors.
a) RA= [0111110] b) RB=[1011100] c) RC=[1010000]

iv) Draw the syndrome calculation circuit.

Consider the (3,1,2) convolutional code with g(1) =(1 1 0), g(2) = (1 0 1) and g(3) = (1 1 1).
(i) Draw the encoder block diagram
(ii) Find the generator matrix.
Find the code-word corresponding to the information sequence (1 1 1 0 1) using time domain and
transform domain approach

Explain briefly the following : i) Golay code ii) BCH code

A rate ½ , binary convolutional encoder is shown in

If the received signal at the decoder for the eight message bits is Y=(00 01 10 00 00 00 10 01). Trace
the decision on a Trellis diagram and find out the message bit sequence.

The generator sequence of (2,1,1) convolutional encoder is given by g(1) =[1,1] and g(2) =[1,0]
i) Draw the encoder circuit
ii) Draw the state diagram
iii) Draw the code tree
iv) Find the encoder output produced by the message sequence 10111

Verify the output using Transform domain approach (polynomial approach).

For any positive integers m>=3, what are the parameters for
BCH code ii) Reed –Solomon codes
Compare the code tree and trellis diagram which are used as a graphic structures to generate and
decode convolutional code

Consider the (31,15) Reed-Solomon code.

(a) How many bits are there in a symbol of the code?
(b) What is the block length in bits?
(c) What is the minimum distance of the code?
How many symbols in error can the code correct?

For the convolutional encoder shown in Figure 5.d , draw the Trellis diagram and extract the
transmitted code word using Viterbi algorithm for the received sequence r={101,
110,101,010,101,110,011}

m
m1 m2

Output

i) Using Hamming bound, verify that the (31,26) hamming code is a perfect code if minimum
distance dmin=3
ii) The parity check bits of a (7,4) Hamming code are generated by
c5=d1+d3+d4
c6=d1+d2+d3
c7=d2+d3+d4
Where d1,d2,d3,d4 are message bits. Find the generator matrix [G] and parity check mateix [H] for
this code and Prove that GHT=0.