D44 Digital Communication Systems

3:0

Preamble: The course D44: Digital Communication Systems is offered in the fourth semester in continuation with the course on D34: Analog Communication Systems. The course will be followed by the course on Wireless Communication Systems. This course aims at designing digital communication systems for a given channel and performance specifications choosing from the available modulation and demodulation schemes. Program Outcomes addressed a. Graduates will demonstrate knowledge of mathematics, science and engineering. b. Graduates will demonstrate an ability to identify, formulate and solve engineering problems. d. Graduates will demonstrate an ability to design a system, component or process as per needs and specifications. f. Graduate will demonstrate skills to use modern engineering tools, softwares and equipment to analyze problems. k. Graduate who can participate and succeed in competitive examinations. Competencies 1. Determine the minimum number of bits per symbol required to represent the source and the maximum rate at which reliable communication can take place over the channel. 2. Describe and determine the performance of different waveform coding techniques for the generation of a digital representation of the signal. 3. Describe and determine the performance of different error control coding. Schemes for the reliable transmission of digital information over the channel. 4. Describe a mathematical model of digital communication system, to provide a frame work for the bit error rate (BER) analysis. 5. Characterize the influence of channel, in terms of BER on different digital modulated signals 6. Determine the performance of different digital communication systems 7. Design digital communication systems as per given specifications

Assessment Pattern S.No Blooms Category Test 1 Test 2 End-semester examination 0 20 60 10 10 0

1 2 3 4 5 6

Remember Understand Apply Analyze Evaluate Create

10 30 60 0 0 0

0 20 60 10 10 0

Course level Learning Objectives Remember: 1. State Channel Coding Theorem. 2. State Channel Capacity theorem 3. What are prefix codes? 4. State the balance property of maximum length sequence. 5. Define entropy. 6. Draw the structure of a typical correlation receiver. 7. State the Nyquists criterion for distortionless baseband data transmission. Understand: 1. Draw the binary on-off signaling waveform for a binary sequence 11011010. 2. Distinguish between bit versus symbol error probabilities. 3. Generate a maximal length sequence of period 7 using 3-stage feedback shift register. 4. Find the differentially encoded sequence when the binary sequence 1100100 is applied to the DPSK transmitter. 5. Compare the power spectra of binary phase shift keying and frequency shift keying modulation schemes. 6. Consider the (5,1) repetition code. Construct the generator and parity check matrices. 7. The Generator Polynomial a (15,11) Hamming code is defined by

g ( D) = 1 + D + D 4 . Develop the encoder for this code.

8. Find the transfer function of a rate , constraint length 3, convolutional Encoder with generator sequences g(1) =( 1 0 1) , g(2) =( 1 1 0) and g(3) = (1 1 1). Construct the trellis diagram of the Convolution encoder for message length of 4. 9. Prove that the output signal of a matched filter is proportional to the shifted version of the autocorrelation function of the input signal. Apply 1. Calculate the capacity of a channel, which has a bandwidth of 3.4 kHz for a signal to noise ratio of 30dB. 2. Consider a discrete memoryless source with source alphabets S=[S1,S2,S3,S4] with probabilities P=[.25 .25 .25 .25].Calculate the entropy of second order extension of the source S. 3. Find the syndrome using syndrome calculator for (7,4) cyclic hamming code of a given polynomial 0111001. 4. A PN Sequence is generated using a Feedback shift register of length m=4. The chip rate is 107 chips/sec. Find the PN Sequence period of the sequence. 5. The binary data stream 001101 is applied to the input of a duo binary system. Construct the duo binary coder output. 6. Compute the differential entropy of a random variable x, distributed over the interval [0,a]. 7. A spread spectrum communication system has information bit duration

g ( D) = 1 + D + D 3 assuming that the received code word is

Tb = 4.095m sec and PN Chip duration Tc = 1 sec .Compute the processing gain.
8. Determine the transmission bandwidth of the base band binary PAM system with raised cosine spectrum at the rate of 56Kbps. Assume that roll off factor = 0.5 9. Find the minimum value of n of a (n,k) linear block code with a minimum distance of three and message block size K=8. 10. Consider the set of signals 1 S1(t) = 0 other wise 1 T/3<t< T 0 other wise 0<t<T /3 S2(t)= 0 other wise 1 0<t<T S4(t)= 0 other wise 1 0<t<2 T/3

S3(t) =

(a) Find a set of orthonormal basis functions to represent this set of signals. (b) What is the dimensionality N of the space spanned by this set of signals.
N

(c) Using the expansion

si (t ) = sij j (t )i = 1, 2, 3, 4 find the coefficients sij.

j =1

Analyze 1. Analyze the BER performance of the following binary modulation schemes. a. Binary Phase Shift keying b. Amplitude Shift Keying c. Frequency Shift Keying

2. A Binary wave uses on off signaling to transmit symbols 1 and 0. The symbol 1 is represented by a rectangular pulse of amplitude A and duration Tb sec. The additive noise at the receiver input is white and Gaussian with zero mean and Power spectral density N O / 2 .Assuming that symbols 1 and 0 occur with equal probability. Analyze the BER performance of this system. 3. Derive the expressions for Probability of error, Jamming Margin and Processing Gain of a Direct Sequence Spread Spectrum system. 4. Derive an expression for the probability of error of Mary PSK modulation scheme. Evaluate 1. A PCM system uses a uniform quantizer followed by a 8 bit binary encoder. The bit rate of the system is 64Mbps. What is the maximum message bandwidth for which the system operates satisfactorily? 2. The sinusoidal signal

x(t ) = sin( 2 (2000)t ) is applied to a delta modulator and

the sampling duration is 20ms. Calculate the minimum step size required to avoid the slope overload distortion. 3. A Discrete memoryless source has an alphabet of x=[x1 x2 x3 x4 x5 x6 x7] with the statistics P=[ .35 .3 .2 .1 .04 .005 .005]. a. Compute the Huffman code and its average length. b. Compute the entropy of the source c. Evaluate the efficiency of the code. 4. The binary data 011100101 are applied to the input of a modified duo binary System. a. Construct the modified duo binary coder output and corresponding Receiver output without a precoder.

b. Suppose that due to error during transmission, the level produced by third Digit is reduced to zero. Construct the new receiver output. c. Evaluate the performance of the decoder with the use of a precoder in the transmitter. Concept Map:

Course Contents and Lecture Schedule No. of Lectures

No. 1. 1.1 1.2 1.3 1.4 2. 2.1

Topic Fundamentals of Information Theory Information, self Information, Entropy Mutual Information, Differential Mutual Information Channel Capacity Channel Capacity Theorem Source Coding Huffman Coding, Shannon Fano Coding, Lempel Ziv Coding Source Coding Theorem Waveform Coding Techniques

1 1 1 1

2.2 2.3

No. 2.3.1 2.3.1.1 2.3.1.2 2.3.2 3 3.1 3.2 3.3 3.4 3.5 4 4.1 Pulse Code Modulation

Topic

No. of Lectures

Sampling, Quantizing, Encoding Quantization noise and robust quantization Differential Pulse Code Modulation, Delta Modulation Error Control Coding Channel Coding Theorem Linear Block Code Cyclic Codes Convolutional Codes Trellis Codes Baseband Modulation Gram-Schmidt Orthogonalization Procedure, Geometric Interpretation of Signals Signal Space Diagram Binary Digital Modulation Techniques: PSK, ASK, FSK Mary Digital Modulation Techniques:QPSK, Mary FSK Minimum Shift Keying Baseband Pulse Shaping for finite bandwidth system Discrete PAM signals Power Spectra of Discrete PAM signals Intersymbol Interference, Nyquist Criterion for Distortionless baseband binary transmission Eye Pattern Correlative Coding Coherent Receiver Correlation Demodulator

1 1 1

1 1 1 1 1

4.2 4.2.1 4.2.2 4.2.3 5 5.1 5.1.1 5.2

1 1 1 1

1 1 1

5.2.1 5.3 6 6.1.1

1 1

No. 6.1.2 6.2 6.3 6.3.1

Topic Matched Filter Demodulator ML Detector BER Analysis : PSK,ASK, FSK, QPSK Comparison of Binary and Quarternary Modulation Techniques Bit Vs Symbol Error Probabilities Bandwidth Efficiency Noncoherent Receiver Envelope Detector BER Analysis; FSK Application Direct Sequence Spread Spectrum System

No. of Lectures 1 1 1 1

6.3.2 6.4 7 7.1 7.2 8. 8.1

1 1

1 1

Syllabus Fundamentals of Information Theory: Information, self Information, EntropyMutual Information, Differential Mutual Information Channel Capacity - Channel Capacity Theorem, Source Coding - Huffman Coding, Shannon Fano Coding, Lempel Ziv Coding, Source Coding Theorem, Waveform Coding Techniques: Pulse Code Modulation - Sampling, Quantizing, Encoding - Quantization noise and robust quantization - Differential Pulse Code Modulation, Delta Modulation, Error Control Coding: Channel Coding Theorem, Linear Block Codes, Cyclic Codes, Convolutional Codes, Trellis codes, Baseband Modulation: Gram-Schmidt Orthogonalization Procedure, Geometric Interpretation of Signals Signal Space Diagram Examples: ASK,PSK,FSK,QPSK,MSK Baseband Pulse Shaping - Discrete PAM signals Power Spectra of Discrete PAM signals - Intersymbol Interference, Nyquist Criterion for Distortionless baseband binary transmission - Correlative Coding - Eye Pattern. Coherent Receiver: Correlation demodulator, Matched Filter Demodulator Maximum Likelihood Detector - BER Analysis for PSK, ASK, FSK, QPSK, - Comparison of Binary and Quarternary Modulation - M-ary Modulation Techniques - Bit Vs Symbol Error Probabilities - Bandwidth Efficiency Non-Coherent Receiver: Envelope

Detector BER Analysis for Non-coherent FSK system Application: Direct Sequence Spread Spectrum System. Text Book 1. Simon Haykin: Digital Communications, John Wiley & Sons Pvt. Ltd., 2001 Reference Books 1. John G. Proakis: Digital Communications, McGraw Hill International Edition, Fourth Edition, 2001. 2. Simon Haykin: Communication Systems 3rd Edition, PHI, 1996. 3. Bernard Sklar: Digital Communications: Fundamentals and Applications, 2nd Edition, Prentice Hall, 2001 4. John R Barry, Edward Lee and David G. Messerschmitt: Digital Communication, 3rd Edition. Springer, 2003. Course Designers 1. S.J. Thiruvengadam sjtece@tce.edu 2. G. Ananthi gananthi@tce.edu 3. V.N. Senthil Kumaran vnsenthilkumaran@tce.edu