Scribd
Upload
6 views

Assignment I

The document outlines a series of assignment problems related to signal processing, including topics such as sampling theorems, quantization, modulation techniques, time-division multiplexing, and orthogonalization procedures. It also covers the design of systems for PCM and TDM, as well as signal detection principles. Each problem requires theoretical explanations, calculations, or diagrammatic representations.

Uploaded by

radhamadhabpattnaik23
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
6 views

Assignment I

The document outlines a series of assignment problems related to signal processing, including topics such as sampling theorems, quantization, modulation techniques, time-division multiplexing, and orthogonalization procedures. It also covers the design of systems for PCM and TDM, as well as signal detection principles. Each problem requires theoretical explanations, calculations, or diagrammatic representations.

Uploaded by

radhamadhabpattnaik23
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Assignment Problems

1. Explain natural sampling theorem.

2. Find the Nyquist rate for sampling the signals x(t) = 2sin2 (800πt), x(t) = sinc2 (100πt),
1
and x(t) = 2π cos(6000πt) cos(500πt).

3. Why quantization is required? What is the purpose of non-uniform quantization?

4. Determine the output signal-to-quantization-noise ratio for a sinusoidal input signal of


amplitude Am given that L is the number of representation levels and R is the number of
bits per sample.

5. Explain the µ- and A-law companding techniques for PCM systems.

6. A sinusoidal signal of amplitude A is quantized by a uniform quantizer. Assume that the


signal utilizes all the representation levels of the quantizer. If the signal-to-quantization
noise ratio is 31.8 dB, what is the number of levels in the quantizer?

7. Explain with the help of block diagrams the delta modulation.

8. Explain with the help of block diagrams the differential pulse code modulation.

9. Consider the signals x1 (t), x2 (t), x3 (t), and x4 (t) band-limited to 6 KHz, 2 KHz, 2 KHz,
and 2 KHz, respectively. Design a two-level time-division multiplexing (TDM) scheme
for aforementioned signals. Calculate the resulting frame interval and bit duration. Each
sample is assumed to be encoded in 4 bits.

10. Consider the analog signals x1 (t), x2 (t), x3 (t), and x4 (t) band-limited to 9 KHz, 3 KHz,
3 KHz, and 3 KHz, respectively. Design a two-level time-division multiplexing (TDM)
scheme for aforementioned signals if each signal is sampled at the Nyquist rate and PCM-
encoded with 4 bits. Calculate the resulting frame interval and bit duration. What is the
minimum transmission bandwidth required for the multiplexed signal.

11. A voice signal band-limited to 3.4 KHz is sampled at 8 KHz and converted to PCM using
64 quantization levels. Four such signals are time-division multiplexed (TDM) using a
5 bit synchronizing codeword at the beginning of a data frame. What is the minimum
channel bandwidth required for the transmission of TDM signal?

12. Apply the Gram-Schmidt orthogonalization procedure to represent the vectors v̄1 =
[0 0 3]T , v̄2 = [0 3 3]T , and v̄3 = [3 3 3]T in the form V̄ = Ū R̄, where V̄ = [v̄1 , v̄2 , v̄3 ],
Ū = [ū1 , ū2 , ū3 ] is a matrix of orthonormal basis vectors, R̄ is an upper triangular matrix,
and [·]T denotes the matrix transpose.

13. Apply Gram-Schmidt orthogonalization procedure to represent following signals in signal-


space.

 +2, for 0 ≤ t ≤ 1,
s1 (t) = −2, for 1 < t ≤ 2,
0, else.


+4, for 0 ≤ t ≤ 2,
s2 (t) =
0, else.


−6, for 0 ≤ t ≤ 3,
s3 (t) =
0, else.

1
14. A source emits four equiprobable messages m1 , m2 , m3 , and m4 , encoded by signals s1 (t),
s2 (t), s3 (t), s4 (t), where
 √
20 2 sin 2πt
T , for 0 ≤ t ≤ T,
s1 (t) =
0, else.


0, for 0 ≤ t ≤ T,
s2 (t) =
0, else.

√
10 2 cos 2πt

s3 (t) = T , for 0 ≤ t ≤ T,
0, else.

√
−10 2 cos 2πt

s4 (t) = T , for 0 ≤ t ≤ T,
0, else.

with T = 1/20. Represent these signals in signal space. Determine the decision regions
for signal detection. Calculate the probability of error.

15. Apply the Gram-Schmidt orthogonalization procedure to represent following signals in


signal-space and corresponding vector form.

s1(t) s2(t) s3(t) s4(t)


1 1 1
2

1 1 2 1 3
-1

Figure 1:

16. Explain the principle of optimum signal detection over AWGN channel. Draw the block
diagrams of correlator and matched filter receivers.

You might also like