SAVEEETHA SCHOOL OF ENGINEERING

SAVEETHA UNIVERSITY

DEPARTMENT OF ECE

CO1901/CC1902 DIGITAL COMMUNICATION TECHNIQUES

UNIT- I POWER SPECTRUM AND COMMUNICATION OVER MEMORYLESS CHANNEL

PART A

1. Define WSS sequence

2. Define cyclostationary sequence
3. What are the elements of detection system
4. What is scalar communication over memory less channel
5. What is vector communication over memory less channel
6. Define memory less channel.
7. Define maximum likelihood (ML)criterion
8. Define maximum a posterior (MAP) criterion
9. Define bayes decision rule
10. What is minimum maximum rule?
11. What is neyman pearson criterion
12. List the examples of discrete memory less channel
13. What is meant by uncorrelated convolutional codes

PART B

1. What is an M-ary Markov source? Discuss the power spectral desity M-ary Markov source
2. Explain in detail about continuous phase modulation and its PSD
3. Describe the scalar and vector communication over memoryless channel.
4. Explain in detail about the power spectral density of synchronous data pulse stream
5. Discuss the power spectral density of convolutionally coded modulation

UNIT-II COHERENT AND NON COHERENT COMMUNICATION

PART A

1. What are the general characteristics of a coherent receiver?

2. What is a multi dimensional signal? provide an example.
3. When a channel is called as Rician channel?
4. What is meant by coherent and non-coherent detection?
5. what is white noise ? where is it encountered ?
6. what is random phase channel?
 7. What is M-FSK signals
8. What is Rayleigh channel? write the expression of the received signal.
9. What is partially coherent detection
10. What is antipodal signals?
11. What is M-DPSK?
PART B

1. Discuss the optimum receivers in WGN

2. Explain the various kind of IQ modulation.
3. Explain the function of M - FSK receiver.
4. Draw the block diagram of M-ary PSK transmitter and receiver andexplain in detail.
5. What is a matched filter? discuss the various properties of it.
6. With a neat block diagram discuss the function of DPSK and MPSK demodulators

UNIT III BAND LIMITED CHANNELS AND DIGITAL MODULATIONS

PART A

1. What is communication over band limited signals?

2. What are partial response systems?
3. What are the causes for ISI?
4. What is an eye pattern?
5. What is maximum likelihood sequence estimation?
6. Explain viterbi algorithm.
7. Why do we require equalization for a communication system?
8. What are the advantages of MSK when compared to QPSK?
9. State Nyquist pulse shaping criterion for zero ISI.
10. What is QPSK ?
11. Explain the types of linear equalizer.
12. What is decision feedback equalizer(DFE)?
13. What is the idea behind zero forcing decision feedback equalizer(DFE-ZF)
14. What is quadrature amplitude modulation(QAM)?
15. What is quadrature bi-orthogonal modulation(QBOM)?
16. What is continuous phase modulation(CPM) and CPFM?

PART B

1. Derive the decision rule for optimum demodulation of digital signal in the presence of IS I
and AWGN
2. Define the various equalization techniques used for band limited channels.
3. What is an eye pattern? How it is used to know the info about a channel.
4. Explain the IQ digital modulations in detail.
5. Explain CPFM and CPFSK.
UNIT IV BLOCK CODED DIGITAL COMMUNICATION

PART A

1. The bandwidth of the media is four KHz and the SNR is 3100. obtain the channel capacity.
2. How will you generate the convolutional codes?
3. What is a Golay Code?
4. Define coding gain. How to increase it?
5. State Shannons channel coding theorem.
6. Define linear block code.
7. What is Shannons Theorem? What is the mean of Capacity of a Gaussian Channel?
8. Define code efficiency?
9. Define code redundancy ?
10. What is channel cut off rate?
11. Define random errors.
12. What are random error correcting codes and burst error correcting codes.
13. What are systematic codes?

PART - B

1. Explain orthogonal and bi-orthogonal binary codes. (10)

(ii) Explain binary coded DPSK with infinite quantization. (6)
2. Explain the error detecting and correcting capabilities of linear block code. (6)
(ii) Write short notes on :
(1) BCH code and
(2) Read-Solomon Code. (5 + 5)

3. With a suitable example discuss the Hamming and cyclic codes.

4. Discuss the architecture and performance of block coded digital communication system.

5. Explain in detail (i) shannons channel coding theorem (ii) spread spectrum communication.

UNIT V CONVOLUTIONAL CODED DIGITAL COMMUNICATION

PART A

1. Compare the Maximum likelihood and Viterbi algorithm methods for decoding.
2. What is meant by systematic convolutional code?
3. What is meant by constraint length and free distance for convolutional code?
4. What is meant by correlative coding?
5. What are convolutional codes or recurrent codes?
 6. List the methods for representing the convolutional codes.
7. What is meant by constraint length and free distance for convolutional code?

PART B

1. With an example define the following:

(i) State diagram
(ii) Tree diagram
(iii) Trellis diagram
2. Write short notes on the following:
(i) Decoding technique using maximum likelihood (8)
(ii) Turbo coding (8)
3. A convolutional code is described by the following generatorsequences :
g(1) =(1 0 1) g(2)= (1 0 0) g(3) =(1 1 1)
(i) Draw the encoder diagram for this code.
(ii) Draw the state and trellis diagrams for this code.
(iii) Find the code word corresponding to the message sequence 10101.
(4 + 8 + 4)
4. (i) Explain Viterbi decoding algorithm for convolutional code. (8)
(ii) Explain Turbo encoder with block diagram. (8)
5. Discuss the sequential and threshold decoding techniques.