Reg. No
1A.
01 December 2012
Max. Marks: 50
For the signal x(t) as shown in fig. 1A, find Fourier transform in terms of sinc function.
4
(05)
1B.
Signals g1(t) = 10 rect(10 t) and g2(t) = (t) are applied at the inputs of ideal low pass filters H1(f) =
rect(f/40,000) and H2(f) = rect(f/20,000) respectively. The outputs of these filters y1(t) and y2(t) are
multiplied to obtain the signal y(t) = y1(t)y2(t).
(i)Sketch G1(f), H1(f), G2(f), and H2(f)
(ii) Find bandwidths of y1(t), y2(t) and y(t).
(05)
2A.
Consider a square law detector, using a nonlinear device whose transfer characteristics is defined by
, where ,
are constants,
is output and
is input. The
input is
.
(05)
i.
ii.
2B.
Discuss the schemes used for generation and detection of DSBSC AM. Verify that the schemes used for
generation and detection of DSBSC AM can be used for AM generation and detection or not?
(05)
3A.
(05)
3B.
Specify the Nyquist rate and Nyquist interval for the following signals
i. x(t) = 10 cos (200t) + 10 sinc (200t)
ii. x(t) = sinc (200t) sinc2(1000t)
(05)
4A.
Starting from the governing equations of FM, prove that the spectrum of a frequency modulated wave
has an infinite number of side frequency components. Hence plot the amplitude spectrum of
frequency modulated signal xc(t) = 10 cos [108 t + 4 sin 2 (103)t] with respect to Carsons rule. Use
Bessel function table.
(06)
4B.
With respect to the signal S(t) shown in Fig.4B, sketch the impulse response and output of the matched
filter.
(04)
5A.
In a binary FSK modulation scheme, assuming coherent detection, derive an expression for average
probability of error. Hence determine the probability of error for a coherent BFSK with data
transmission rate of 2 MBPS over an AWGN channel. The amplitude of the received signal in the
absence of noise is 1 V. Assume that noise has zero mean with power spectral density = 10-20 W/Hz.
(06)
5B.
(04)
0 0 1 1 1 0 1
G=
1 0 0 1 1 1 0
0 1 0 0 1 1 1
Find the Generator Matrix in systematic [I:P] form, Parity check Matrix and examine whether the code
word corresponding to information sequence [ 1 0 1] is orthogonal to H.
Page 1 of 2
Reg. No
6A.
Perform Viterbi Algorithm to the received sequence [1111111101] for a convolution encoder with
constraint length 3 and whose paths are [1,1,1] and [1,0,1]. Decode the errors and give the
corresponding message. (Initial states are a=00,b=10,c=01 and d=11).
(07)
6B.
(03)
X(t)
2
2
2
S (t)
A
1
-2
-1
1
Fig. 1A
Fig. 4B
Page 2 of 2