Scribd
Upload
139 views2 pages

451 Problems

This document contains exam problems related to digital communication systems. It covers topics like quantization, source coding, orthogonal signals, amplitude shift keying modulation, and optimum demodulation. The problems involve calculating things like average quantization distortion, minimum bit rates for source encoding, designing Huffman codes, performing Gram-Schmidt orthogonalization on signals, determining power spectral densities, and analyzing optimum receivers.

Uploaded by

Sakshi Popli Chopra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
139 views2 pages

451 Problems

This document contains exam problems related to digital communication systems. It covers topics like quantization, source coding, orthogonal signals, amplitude shift keying modulation, and optimum demodulation. The problems involve calculating things like average quantization distortion, minimum bit rates for source encoding, designing Huffman codes, performing Gram-Schmidt orthogonalization on signals, determining power spectral densities, and analyzing optimum receivers.

Uploaded by

Sakshi Popli Chopra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

EXAM PROBLEMS IN DIGITAL COMMUNICATION SYSTEMS

DR. MOHAMMAD M. BANAT

1) An analog source produces a baseband voltage signal x( t ) with bandwidth equal to 10


kHz. Assume that sample functions of x( t ) follow a probability density given by:
⎧1 −x 2
⎪ e , x>0
f X ( x) = ⎨ 2
⎪⎩0, otherwise
The source output is quantized according to the rule:
⎧ i − 0.5, i − 1 ≤ x < i , for 1 ≤ i ≤ 5
yi = ⎨
⎩6.0, x ≥ 5.0, i = 6
Each quantized level yi is denoted as a discrete source symbol gi for i = 1, 2, … , 6 .
1.a. Determine the average quantization distortion.
1.b. What is the minimum required bit rate of a fixed-length encoder for the quantizer
output?
1.c. Determine the discrete source average entropy.
1.d. Determine the minimum source encoder bit rate. Compare to part b.
1.e. Design a Huffman code for { gi } and calculate:
i) the averag e codeword length
ii) the code efficiency
iii) the encoder minimum bit rate (Compare to parts b and d)
2) A message signal x ( t ) = Am cos ( 2πf m t ) is sampled at a rate f s = 8 f m . A 2nd order (two-
tap FIR) linear predictor based on the minimum mean squared error is to be employed to
encode this signal using 16-level DPCM. Assume the autocorrelation function of x ( nTs )
- to be denoted for short by x ( n ) - can be estimated using the relation:
N −m
1
Rˆ xx ( m ) ≈
N
∑ x (i) x (i + m)
i =0

2.a. What is the DPCM encoder bit rate?


2.b. Derive conditions on the optimum predictor taps.
2.c. Assuming N = 4 , determine the optimum coefficients of the predictor.
3) A discrete memoryless information source has an alphabet consisting of three symbols
a1 , a2 , a3 with respective probabilities 0.3, 0.6, 0.1. Symbols are emitted at a rate of 2000
symbols per second. A binary Huffman code is designed to represent the source output
(call this Code A). Another binary Huffman code is designed to represent the 2nd
extension of the source output (call this Code B).
3.a. Determine the codewords of Code A.
3.b. Determine the code efficiency of Code A.
3.c. Determine the bit rate of encoder A.
3.d. Determine the codewords of Code B.
3.e. Determine the code efficiency of Code B.
3.f. Determine the bit rate of encoder B.
4) A 4-symbol baseband digital communication system uses the waveforms below to
represent its symbols, each of duration T . Assume that transmission is corrupted by
AWGN with zero mean and N 0 2 power spectral density.
⎧1, 0 ≤ t ≤ T 2 ⎧1, T 2 ≤ t ≤ T
s1 ( t ) = ⎨ s2 ( t ) = ⎨
⎩ 0, elsewhere ⎩0, elsewhere
⎧1, 0≤ t ≤T 2 ⎧ −1, 0 ≤ t ≤ T 2
s3 ( t ) = ⎨ s4 ( t ) = ⎨
⎩ −1, T 2 ≤ t ≤ T ⎩1, T 2≤ t ≤T
4.a. Use Gram-Schmidt orthogonalization to determine two basis functions φ1 ( t ) and
φ 2 ( t ) to represent the signals above.
4.b. Sketch the signal space representation of the four signals.
4.c. Determine and sketch the noise-free outputs of two filters matched to φ1 ( t ) and
φ 2 ( t ) when s3 ( t ) is transmitted.
5) An M -ary amplitude shift keying digital communication system transmits every T
seconds a signal of the form:
si ( t ) = Ai cos ( 2πf c t ) , Ai = 2i − M + 1, i = 0, 1, … , M − 1
5.a. Determine and sketch the power spectral density of the transmitted ASK signal.
5.b. How does the PSD depend on M ?
6) An 8-symbol digital communication system transmits every T seconds a signal of the
form:
si ( t ) = Ai cos ( 2πf1t ) + Bi cos ( 2πf 2 t )
where f 2 = f1 + 1 2T . Assume Ai takes values from the set {± d , ± 3d } , while Bi = ± d ,
where d is a positive constant. The transmitted signal is corrupted by an zero-mean
N
AWGN process with an autocorrelation function equal to Rn ( τ ) = 0 δ( τ ) . Assume
2
equally-likely symbols.
6.a. Completely specify the optimum demodulator.
6.b. Determine the minimum average symbol probability of error.

You might also like