BEC503

Model Question Paper

USN

5th Semester B.E. Degree Examination

Digital Communication
TIME: 03 Hours Max. Marks: 100

Note: Answer any FIVE full questions, choosing at least ONE question from each
MODULE.

Bloom’s COs
Module -1 Taxonomy Marks
Level
Q.01 a Define Hilbert transform. List the properties of the Hilbert L2 CO1 6
transform.

b Define pre-envelope and complex envelope of a real valued signal. L2 CO1 6

Determine the pre-envelope and complex envelope of the RF pulse
defined by x(t) = A rect(t/T)cos(2πfct)
c Explain the geometric representation of signals. Show that the L2 CO1 8
energy of the signal is equal to squared length of the vector
representing it.
OR
Q.02 a Express Bandpass signal s(t) in canonical form and polar form. L2 CO1 6
Also express the relationship between Cartesian and Polar
Representations of Band-Pass Signal
b Using the Gram-Schmidt orthogonalization procedure, find a set of L2 CO1 6
orthonormal basic functions to represent the three signals s1(t),s2(t)
and s3(t) shown in figure. Also express each of these signals in
terms of the set of basis functions.

c With neat diagram and expressions, explain the L2 CO1 8

a. Correlation receiver b. Matched filter Receiver.
Module-2
Q. 03 a Define binary phase shift keying. Draw the transmitter and L2 CO2 8
receiver block diagram and derive the probability of error or BER
of the Coherent BPSK.
b Binary data are transmitted over a microwave link at the rate of 106 L2 CO2 4
bps and power spectral density of noise at the receiver input is 10-
10
W/Hz. Find the average carrier power required to maintain an
average probability of error Pe ≤ 10-4 for i)BPSK ii)DPSK {Ref:
Q(3.72)≤10-4}

Page 01 of 02
 BEC503
c Describe the QPSK signal with its signal space characterization. L2 CO2 8
With a neat block diagram explain the generation and detection of
QPSK signals
OR
Q.04 a Define binary phase shift keying. Draw the transmitter and L2 CO2 8
receiver block diagram and derive the probability of error or BER
of the Coherent BPSK.
b Binary data are transmitted over a microwave link at the rate of 106 L2 CO2 4
bps and power spectral density of noise at the receiver input is 10-
10
W/Hz. Find the average carrier power required to maintain an
average probability of error Pe ≤ 10-4 for i)BPSK ii)DPSK {Ref:
Q(3.72)≤10-4}
c Describe the QPSK signal with its signal space characterization. L2 CO2 8
With a neat block diagram explain the generation and detection of
QPSK signals
Module-3
Q. 05 a Define the following terms with respect to information theory L2 CO3 5
(i) Entrophy (ii) Self information (iii) Rate of Information (iv)
Source efficiency (v)Channel Capacity
b A zero memory has a source alphabet S = {S1, S2, S3} with P = L2 CO3 7
{1/2, 1/4, 1/4}. Construct second order source and compute its
entropy. Verify that H(S2) = 2.H(S)
c Figure shows the Binary symmetric channel. Find H(X), H(Y), L2 CO3 8
H(Y/X), H(X/Y),H(X,Y) and I(X,Y). Also find the rate of
information transmission in bits/sec. Given P(X1) = 0.6 and P(X2)
= 0.4 and rs = 1000symbols/sec
OR
Q. 06 a A DMS emits symbols from the source alphabet S = L2 CO3 6
{S1,S2,S3,S4,S5,S6,S7} with P = { 0.25, 0.25, 0.125, 0.125, 0.125,
0.0625, 0.0625}. Compute: (i) H(S) (ii) H(S) max (iii) Information
rate R if rs = 5 symbols/sec.
b State the following along with relevant equations: L2 CO3 6
(a) Source coding theorem (b) Channel Coding theorm
(c) Information Capacity Law
c A Source has an alphabet S = {s1, s2, s3, s4, s5, s6} with statistics L2 CO3 8
P ={1/3, 1/8, 1/4,1/8, 1/12, 1/12}. Construct a Huffman code by
placing the composite symbol “as high as possible” and compute
the efficiency.
Module-4
Q. 07 a For a(6,3) linear block code, the check bits are related to the L3 CO4 10
message bits as per the equations given below :
C4 = d1+d2, C5 = d1+d2+d3, C6 = d2+d3
i) Obtain G and H matrix
ii) Find all the possible code words.
iii) Find the minimum distance of the code.
iv) If the received code is [ 110101], detect and correct the
error.

b The generator polynomial of a (7,4) cyclic code is g(x) = 1+x+x2. L3 CO5 10

Obtain the code polynomial in systematic form for the input
sequences [1001] and [1011]. Draw the encoder circuit for the
same.
If the received vector is 1110101, draw the syndrome calculation
circuit. Find the syndrome by listing the states of the registers.

Page 02 of 02
 BEC503
OR
Q. 08 a Design a linear block code with minimum distance dmin = 3 and L3 CO4 4
message length of 4 bits.
b For a systematic (7,4) linear block code, the parity matrix is given L3 CO4 6
by
1 1 1
P = [1 1 0]
1 0 1
0 1 1
(i) Find all the possible code words
(ii) Find the error detecting and error correcting capabilities
of the code.

c A generator polynomial for a (15,7)cyclic code is g(x) = 1+x4 +x6 L3 CO5

+x7+ x8. Find the code vector for the message D(x) = x2+x3+x4 . 10
Also find the syndrome of the received polynomial r(x) = 1+x+x3+
x6+ x8+ x9+ x11+ x14 and draw the syndrome calculation circuit.

Module-5
Q. 09 a For the convolution encoder with a code rate r=1/3, constraint L3 CO5 12
length v=3 and the impulse responses g(1) = {1,1,0}, g(2) = {1,
0,1} and g(2) = {1, 1,1}.
(i) Draw the convolutional encoder diagram
(ii) Draw the State diagram
(iii) Trace the path through the state diagram that corresponds to
the message sequence m = {1 1 1 0 1}

b Write the step by step procedure for decoding of convolution codes L3 CO5 8
using Viterbi algorithm
OR
Q. 10 a For the convolution encoder with a code rate r=1/2, constraint L3 CO5 10
length K=4 and the impulse responses g(1) = {1,1,1,1} and g(2) =
{1, 1,0,1}, find the code C for the message m = {1 0 1 11} and
draw the convolutional encoder diagram.

b For the convolution encoder with a code rate r=1/2, constraint L3 CO5 10
length K=3 and the impulse responses g(1) = {1,1,1} and g(2) =
{1, 0,1}, Apply the Viterbi algorithm for the received sequence
1000100000.. and compute the decoded sequence.

Page 03 of 02
Oyor a (6,3) gnean blort Code. the check
elated to the me6 6ge bit
Pen the equati ons qven below:
C4.- dit d, C5= di +do td 3,
olotain G and matriX
?) Tiad al pos6ible Code w)ovds
tha
Find ditane a thu code
odp
v) Tg the e ceived code R6 I 000), dete ct
and Cor ec the
he
Ghenematon Matix(Gi)
=>slepi: ontuct
and parçty chect matrix CH)
C5zdI+ d9+d

k=3

GIIP)

H LP
H
)

all tu pos6ible ode voode

di d3 ditd du+dstdz do d3Codewgnds
i1) Stp3 The minimuum dtanee
et hammig distance blw
Codeoo
Codew ond.. Ry ?rpect rag the st0ce
- c , we 3ind minimm
tho

iy) S p43 necei ved

1. Calel ate tho syndnome : Syndnome = ecel
ve d I0101)* H= Ioi0)
Code wor d x H T TlOlo]
. the syndom e ce cend bit
?n the
3 Cone ct the ecei ved codewond by ppiag
h FeCond brt: IDolo1
 mii check foaity 4x3
4
-the howe
a gze omilhk gencato aneed we *
matiist: aesoato theegu Stei
(I+n)
J1,-the esmes dovnd
gtam 3,
ine: qaid a
esoge the aud '3,
the (n)longh wod tode hemne dter
toneed (ode,
we Llock ineay dulgaa T
4 d Jaagt Mesg amd 3
aimm cDde block linea, a
 ou geaan ato mabe 3:

Hep3: nimm okote

hd-the i nm diseoce
we
eed to Vy
d-the code
this the tanig
fovible pais alodeoosd, aternativey we

ng-ao inea
eslodbe 3.
(ase t

block coce wth a meioge

testeoce al Con eouqned
Cud a mlninun
 M4J M3, m, M, Veton
me
yle =lG code (H,4) gona
D
enái e a1 qeratr
ma -the
tode Capa?iies
coO%d Code poys?le tle ale iad (3)
1
ock leay C+) aicsys4om ajon
 ?-te code
aioihe )
Copobauu:
1118DtDl
41||||D 1110
11000||
11D|Do0 |100
1DlD0D
|D1DOlD
DO D01 |D
DDI11| | 1000
trl
D111010
011D0D| hift
Lock Caps
Ol001|
bollD| Tao
Esc
dlc) Codecoo
 to
1D1DDlD, 1DlDD,
D I1DDDl1, lolDD,
ol|bD,I l00D|, DIloo olol
,lbDol 1).1,
o| oDlDl1, Dool
DIl, DODODO0,
|), DoloDI||b1,
ce:CoduDLd paLle. 16te ?)
2
to
Con tofaly:
Lode A ptutoo eAs
dloond) co
ale Caeeue nn8(
ianee.od painuse au
npue
 2.
initiabdio so)
6
5,1)

|oD0|o 10 (ycbr

ode
olutal
ncwt to

Gati-2
 stat ?°)Tnace
mesage
diagram
æ that ton a)
dagn
stade(R) Drdw and Code
einany V2
Vam,m3 Dnaw
00 33C, 1,
(1,o,)
8iC,
) 8ao)
I, .
Ratt
m, the
des - ihe
4he he
cri uenc$eq e the ulse
ernp
dia pi
trellidagan mgt 7=/3,
rafnt
Const
Convoluti
on /3
000
m3 path Statt vo
Code luti
dg) on
thoiou onal
diagnam enode
k/o
encoden
diagam
shade gh
7 3
the ,3lengthV=3
b thu diagam th
|l0D tete
 (?).
Malce ) Dobj ng
- Codew
Ondll|
4) 2)Folve. ) the Voluti
to 9
llow?ng fo
ample Pro venb? 1
Mat h Bequente e deCon
cloretbept cti code
nd ces_q voCoding de
vt ve lui
min Trellis
trell?pTelie
encode AlgoriHhm
o9 a Ma
wei arn. pathtoTeceaved on Vøtnbi the
mO
diagram veten
gt vttyb? codeB.
vr the Aep V,
to age Algorit
en ane
hm to bi
krerough Con vo
b+ wi Coden
u re Hesie
gorfHhm, al by Vg
gh Algorithm: Algorthm: data lutt
Celve
tgorithn: be
age hmake metthod tep
we en
eppe dthe
path golwelod to po
telliK data tre wse
ct Co
en ilis To decod g Cedne
de
Arellis
trelli bit 3?nd s
dia hat
 torepect
lo E
huul quonce
diagnan.
agram ge
deEnco net
show bit
Di
bata
Sep3-Tielli5Ma
Mo Ili6 Matt
tateMom,
Te
Lnput=t
CO
0)
Co) )dCi
state ved
cef
Mo stepa- -
State
a lo
State Re
) 3
af tep
s
 Decoded
So Dato
de
Co
di
ng
algor7thn
vitrbiby
bit

equence
bit

ven
by
 F3

Catcubg Eotode-
step2:the te L)
sligig congboin
Y=/2
Sate
tnpe.szpese.
J,
niaaty
,9, ,DSig geconotos
(s) bo
e

egly the
stept- ogl me
Emeded S.(s,o,03) glt)=
ugitU ,
eoated
i,
outpuC) ),
1
utti
uileine
zO02L)
<space 5ert

PrntSc
 entode
the
Enlod
coiauoiDO D,
ci
oJ DJ
,[,I, c9nl m
, the
MIme-m3
o,
I, pra einodyy
VI
4-
Step the
V
2 3
suetived
Qeawen
Ce
7:/2 eo
terminoti
hi entodo.apue
2eceied,-geawenCe.
.coe glake put
sal-esusperse Cobr)1)
nput
ncony out LO
coded
:auropieg Stal-e|,
r4
poulble
uth
toputetle.cu ORoqoro y(E-)
Agonth atodPpulse poopo)
toathe.9 gos -the
-tlhe
eNelLD
and gapu-2-ond
hawe
auUmeth
weOoD100000. gluows
osioovaluaioo
.the
fiti K-3 we psti
nput-
tel-e:
Cue
and
amea
awe diogtocn
k=3
0ee
teps;
slate. durgn PnCe
lDooloooo0
a the D,)
haye Gei wspese.
tengtain ea
vten o,
*we Ihebase (oo,
 Step3:-Appsy -the tel? Agont tlh
seaOn ce-|DoolDo000 and
we agethe heceived
emaig dience. bueweeo.the
Coltlate -the
Colt l ate-the Ce aal
tale.opul-
eceived.R8and the oble outpu- geawes
geaea Ce
Salh etep. cummultve
Taiaizatien:- au stete l a t h a
atence od o
teeieseceed -?l- pau
Pa we calto
Bteaiea; fon Each GBeoukpu
istence to gah
ade theHanig we add this otiste.tote
ubn Each 3fale, t u po
Stele.we
twmuive -oitence.oR
jen Eah Stale
Stp 4: Taceback :
{bon has pro leeyted the Etae
enee the olgon awe (uem
aulc
Stecy ecelved geaenCe . we bace cnuohe
ial gtateuth the-nmum.
the
ditea ce.tothe Ritio Slateloo). he Reaven ce ul
scasese
s poeithe.ceo ded
înpud- til- clleg