BECS503 Model Question Paper USN 5"" Semester B.E. Degree Examination Digital Communication ‘TIME: 03 Hours lax. 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 | | Define Hilbert transform, List the properties of the Hilbert 12 col | 6 transform. } | Define pre-envelope and complex envelope ofa real valued signal. | L2 cor [6 Determine the pre-envelope and complex envelope of the RF pulse E defined by x(t) =A rect(t/T)cos(2nfet) © | Explain the geometric representation of signals. Show that the 12 col {8 energy of the signal is equal to squared length of the vector representing it, OR Qoz Ta | Express Bandpass signal s(t} in canonical form and polar form. | L2 col |6 Also express the relationship between Cartesian and Polar | | Representations of Band-Pass Signal 4 D | Using the Gram-Schmidt orthogonalization procedure, find a set of | L2 Cor [6 orthonormal basic functions to represent the three signals si(t),s2(t) and s3(t) shown in figure. Also express each of these signals in terms of the set of basis functions. ws a “| ‘ HE Ed Pe aot as With neat diagram and expressions, explain the 12 corfs | a. Correlation receiver __b. Matched filter Receiver. Module-2 [SOS [a] Detine binary phase shit keying. Drew the wansmiter and | Cor [8 receiver block diagram and derive the probability of error or BER of the Coherent BPSK, Binary data are transmitted over a microwave Tink at the rate oF 10 bps and power spectral density of noise atthe receiver input i 10- % eo 8 Wiz Find the average carr ower required to mana an average probability of error Pe< 10% for iJBPSK ii , | _|96.72}<104) for BPSK ii)DPSK {RefDescribe the QPSK signal with its signal space characterization With a neat block diagram explain the generation and detection of C02 QPSK signals BECSOS 9 Q.04 OR Define binary phase shift keying. Draw the transmitter and receiver block diagram and derive the probability of error or BER of the Coherent BPSK. C02 Binary data are transmitted over a microwave link at the rate of 10° bps and power spectral density of noise at the receiver input is 10° 10 W/Hiz. Find the average carrier power required to maintain an average probability of error Pe< 10% for i)BPSK ii)DPSK {Ref: 12 C02 QG3.72)<104} Describe the QPSK signal with its signal space characterization. With a neat block diagram explain the generation and detection of 12 co2 QPSK signals Module-3 Q05 Define the following terms with respect to information theory () —_Entrophy (ii) Self information (iii) Rate of Information (iv) Source efficiency (v)Channel Capacity 12 CO3 ‘A zero memory has a source alphabet $ = {S1, Sz, $3} with P= {1/2, 1/4, 1/4}. Construct second order source and compute its entropy. Verify that H(S*) = 2.H(S) 12 CO3 Figure shows the Binary symmetric channel. Find H(X), H(¥), H(YX), HOVY)H(K,Y) and ICKY). Also find the rate of information transmission in bits/sec. Given P(X!) = 0.6 and P(X2) = 0.4 and rs = 1000symbols/see. 12 CO3 OR 2.06 ‘A DMS emits symbols from the source alphabet S = {S1,S2,S3,54,5s,55S7} 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 Rift, =5 symbols/sec. 12 CO3 State the following along with relevant equations: (@) Source coding theorem (b) Channel Coding theorm (©) Information Capacity Law 12 CO3 ‘A Source has an alphabet S = {s1, s2, $3, s4, s5, s6} with statistics 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 efficienc’ 12 ‘CO3 Module-4 Q.07 For a(6,3) linear block code, the check bits are related to the message bits as per the equations given below : C4 = dl+d2, C5 = d1-+d2+d3, C6 = d2+d3 Obtain G and H matrix Find all the possible code words. Find the minimum distance of the code. iv) Ifthe received code is { 110101], detect and correct the error. 13 cog 10 b ‘The generator polynomial of a (7,4) cyclic code is g(x) = L¥x¥x2, Lobtain 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. 13 COS 10 Page 02 of 02BEC503 OR. ‘3 and Design a linear block code with minimum distance dmi message length of 4 bit 3 ‘C04 For a systematic (7,4) linear block code, the parity matrix is given by 1 [ 0 1 i 3 () Find all the possible code words Gi) Find the error detecting and error correcting capabilities of the code. Bone 13 co4 “A generator polynomial for a (15, )eyclic code is g(x) = 1+x* +x° +x’+ x3, Find the code vector for the message D(x) = x*4x2+x* Also find the syndrome of the received polynomial r(x) = I-+x#x+ xS+ x84 0+ x!14 x! and draw the syndrome calculation circuit. 13 COs 10 Modul ao For the convolution encoder with a code rate r=1/3, constraint length v=3 and the impulse responses g(1) = {1,1,0}, g(2) 0,1) and g(2) = {1, 1,1}. (i) Draw the convolutional encoder diagram i) Draw the State diagram i) Trace the path through the state diagram that corresponds to the message sequence m= {111 01} 1, 13 COS 12 Write the step by step procedure for decoding of convolution codes using Viterbi algorithm 13 COS OR. x For the convolution encoder with a code rate r=1/2, constraint length K=4 and the impulse responses @(1) = {1,1,1,1} and g(2) = {1, 1,0,1}, find the code C for the message m= {101 11} and. draw the convolutional encoder diagram. 13 cos 10 For the convolution encoder with a code rate r=1/2, constraint length K=3 and the impulse responses g(1) = {11,1} and g(2) = {1, 0,1}, Apply the Viterbi algorithm for the received sequence 1000100000.. and compute the decoded sequence. 13 COS 10ScmEwls den E ay BECS03 Fifth Semester B.E./B,Tech. Degree wsningh Nt Vcsitpea Sis Digital Communication ‘Time: 3 hrs. ty Max. Marks: 100 Notes 1. Answer any FIVE full questions, ching ONE full question frghich module. 2M: Marks , L: Bloom’s level , C:(COurse outcomes. ie: Modules 1 ee MIL [ce a, | Explain Hilbert transform and its properties, a 6 | L2 | Col , | Describe the canonical representation of bandpass signal. “>” 7 |12 [cot ¢. | Describe the correlation receiver with neat diagram. 2 7 {42 [Cor & 7 OR ¢ Q2 [a Apply grim Schmidiorthiogonalization procedire: find the set of 10] 13 [COI orthonormal basis functién’to represent the signals $¥(t), S2(t) and S3(t) as Q2 a). ‘Also express each of these Tigures interms of set of tg (S29 Fig.Q2@) Derive the equation for Converting continuougAWGN channel into a vector | 10 [L2 | COT channel. ¢ a Cm Ta Module=-2 7 a aaa) Deseribe with antat diagram, the genctation and detection of BPSK sy ® [ia [con Define bandwidilr’ efficiency. Tabilate the comment. of” the band 8 [12 [cor efficieney of M-ary PSK signal. /~ eS © | Encode the,binary sequence ysing-DPSK TI0ITOI Assume reference bit| 4 | U2 | COD 1 fast, Ader cm :2 2 2 OR Fa Détiye the expression for probability of error 6f QPSK signal, 3 [12 [con ‘Discuss the [Link] of BFSK‘signal. 8 | L2 | co2 . }Galeulate the averaje) power required for a DPSK signal operation gat a] 4 | L3 | CO2 data rate of 1009 bivie, over a badass channel having @ bandwidth of | {3000 Fiz, Nee J0" w /H, probably of error P.= 10°, L [Link] = 3 (OS Ta. Define entropy and sumnsrigs ils properties. eT Tos Bb. | A source has five symbols S = (8). Sz, Sy Sq Ss) with probabilim s P= (04,02, 02, 0170.1} ws } probabilities | 8 |13 | CO3 ‘ pectively. compute the source code using __| Huffman binary coding. Also find the average lenuth and entropy. | Tes | Briefly discuss instantaneous code with an example, OR Derive the expression for mifual information and summarize Ws propenicn erive ,theexpression for the channel capacity of bimanre 7 Derive BB pacity of binary symmetric FP 1 L 1of2meee TR aS Dec 2024) 2~ BECS503 E Module=4 [Qa [a: [indicate the advantages and disadvantages of error contol e@aing. Also | 8 [12 | COs fferentiate between block code and convolution code, __ b. | If ‘© is a valid code vector then show that CH= 0 whepe agar cheek | § [12 | COs of code. z Lf ‘an encoder for the (7, 4) binary cyclic code geiérated by + 7 [13 [cos g(x) = 1+x-+2° for the message vector [1001]. fe" ® ‘OR wt QS [a. [Bescribe the block diagram of generator and parity check matrix with [10] L2 | CO4 | equation. Also write the syndrome equation fatidfist its properties. b. | A (7, 4) Linear block code has : 10/13 [COs 110 e pao 1h) WO Led ay lod + i) Allpossible code veetbPn’s (2 ii) Determine the Hamfiig weight of cach code word” i fii) Ifthe received yeetor iS [1100010]. Determing,its’syndrome correct the codeword. Vad “y ‘Module ~ 5, QD |a. | For a given,conjolutional encoder shown'in Fig Qd(@), with D = 10011. | 10] L3 | COS ‘Compute afiboviequenee using transfornt domain approach. Also draw the code freediagram. 4 Fig Bt" he | ‘b. | Describe the recursive systematic Convolutional Seenaer with an |10|13 | COS example. “~», 2 4 {eT < YOR ~~ [QAO Ta. ]A convolution encoder has Go flip-flop with iworstates, three modulo 2] 10] L3 | COS ‘addersiand an output multiplexer. The generatorsequences of the encoder. 2251, 0, 1), 8= (1, 160), 2= (11, DE }y Generator matrix’ [G]- ) Draw the encoder block diagram. * iii) Calculate thie cédeword for the,ntesSage input vector 11101. b. | For a given,convolution encoder shown in Fig.Q10(b). Build state table, | 10] L3 | COs tate transaction table, sketch diagrim and describe the Trellis diagram for ‘the input message vector (101). ber”CB CSISCHENE usN | & BECS03 Fifth Semester B.E./[Link]. Degree Exami anion, June/July 2025 : Digital Communication Time: 3 hrs. i Max. Marks: 100 Not Answer any FIVE full question choosing ONE full question from 2M: Marks, L: Bloom's level , C Course outcomes, oh module. ‘Module=1 { ie L[¢ [Q4 Ta. [Dist the properties of Hilbert wansform: 12/ COT) Hieare [eae | | [e Describe preenvelope of low passisignal. 12 | Cor, { ¢ | | /e.| Outline the steps for deriving nd reconstructing the band’ pass signal from | 10| L2 | COT | n-phase and quadrature L i mY | =e OR | Q2 Ta.) Discuss correlation receiver of AWGN channel, 7 [Lz] cor | | b. | Describe the miatched filter with a necessary diagram: [s [2 [cor | | [Ter Relate signal representation of 2 [Link]. 5 [2 | Cor CT nea “Modul se Q3 | a. | Illustrate BPSK using coherent detection with tran [io | 12 | coz ) | deriv cession for erforprobability funct he’) |_| [setting eresion for egarprobaitiy fonction, ae |] b. Interpret the working ofcoherent generation and detection of QPSK. Draw | 10 | L2 | CO2 || QPSK wn fr uP binary sequence 01101000, | | 7 feel { OR eee | Q4 [a | Demonstrate M-ary QAM M=4 with signal space diagram. 10] 12 | Coz |b. | Discuss the working of FSKGcoherent receiver [Link] with block | 10 | L2 | CO2 || diagram: ~ | { Besse tesa 2 Module-3) i So] | Q5 [ai [Intemational Morse, code uses a sequence of dots and dashes to transmit | 8 | L3 | CO3 | 1 letters of Englishvalphabet. The dash is represented by a current pulse that | has a duration“of)3 units and the dot has a duration of 1 unit. The | probability of currence of a [Link]'1/3 of probability of occurrence of a dot eye) . I> Calculate information content of dot and dash, Caleulate average information in the dot-dash-code, Assume that dot [Link] sec, which is the same-time interval as the | pause between'symbols. Find average rate of information | transmission. | | di : 4 ro Vof3 |> BECS03 ——— al Sais with [3 [12 | Ct ees ze oo i a3 BTA binary source is emitting an independent sequence of O’s and 1°s with 3 | probabilities P and 1-P outline the entropy of source, With —T ~ aan ae - 7 [12 | Coa ‘ec. | Show that entropy of 2 MS is given by H(s!)=2H()eonsidering Baa | ae | pet pel AN wep hey LI Ld 6 | | +t ~Y7 La | cos 1 | {80,8 3. Sa) having probabilities {0.4, 0.2, 0.2, 0.1, 0/1} = {1 - —~ | ay {7 [1s | cos | A. binary —symmetrie channel has _mateix orro-{o3 i [| Also P(X) = 0.6 PEK) = 04. Caleutate ICX, ¥) tt a” == Module ~4) Q.7_ | a, | Mlustrate different error correcting codes. Tb. Outline the procedure of syndrome decoding, @ procedure (np-k) cyclic code steps considering linear | 9 | L2 Cos I | shift register with (n-k) stages. aD __ nm oR) Qs | a. | Define G and H matrie show that [Link]= 0. : Tb. For (6, 3) linear block eode the parity mat Z 10/13 j 10] : | ipsfo 1 M | 1) tieio || i) Calculate the generator matiix || ii) “Compute all possible code words. I ’ TeaLBAUS, 3) cyelie code fas fhe gonetalor “polynomial given by/S [13] COs \ Ao) = 14x + xtaixt + x) + x8 + x" Construct the block diagram of encoder and syridrome calculator. : : | | ‘Module —5. _ “QS Ta. | Consider oG, 1, 2) convolutions encoder with g = 110, g” = 101, / 147 L3 | COs ? (gs 7 i) Build the encoder diagram. ii) Compute the code! word for message sequence (11101), Ae 20f3BECS03 \b. [Consider convolutional encoder shown in Fig Q5(). See the [6 [3 [COs generator polynomial, output polynomial for path! | au ath2. Also nes” | compute encoded sequence. Fly Hee | | © Fig Q90) i \ : eal OR zs "QO [a | Interpret optimum decoding of convolutional codes 6 [13] Cos ] Bb. | Apply viter bi-decoder algorithm steps considering allszero sequenve [14 ) LY | COS | 0100010000): L ry 66% 3of3GHGS SCTEME » liee Up exam LET) BECS503 Fifth Semester B.E./[Link]. Degree Examination, June/July 2025 Digital Communication USN ] Time: 3 hrs. Max. Marks: 100 Note: 4. Answer any FIVE full questions, choosing ONE full question from each modute. 2M: Marks , L: Bloom's level , C: Course outcomes. ~-Medule-1 _[M{L Define Hilbert wansform, Mention its applications. Show that a signal e(t) | 6 | L: and its Hilbert transform’ are orthogonal over the entire time interval | (=, >), | [b. Using Gram-Schmidth orthogonalization proceducer calculate a set | 8 orthonormal basis functions to represent the three signals S\(t), S2(t) and || $3) shown in Fig.Q1(b). Also express each of these signals in terms of the set of basis functions. a | Sate Sot “ a | of? oat oS > | | 1 | eg ae | [Link](b) | |e. Describe the correlation receiver with the neat diagrams and the maximum —| 6 likelihood decoder. = — EE = Q2 | a. Express band pass signal s(Q) in canonical form. Represe | quadrature components of the bandpass signal s(t) the in phase and [6 |L27 CO1 | 8 | L2| cor] t Tord ; pre-envelope and complex — envelope ot he signal shown in| 6 | 13 1} | cor ae Fochaw © Sew ae | Fig.Q2(b) | [& | Discus ion of matched fi |__| Piseuss the operation of maiched filter receiver with necessary diagram,Module -2 Q3 ]a. | Describe the generation and reception of BPSK signal with a necessary equation an¢ constellation diagram, b. | The binary sequence 1100100010 is applied to the DPSK transmitter : | |G). Sketch rhe resulting waveform at the transmitter output . (ii) Applying this waveform to the DPSK receiver show that in the absence of nois’, the original binary sequence is reconstructei at the receiver uty, c. | Explain M-ary QAM. Mention its advantage over M-ary PSK system. Obtain he constellation of QAM for M=4 and draw signal space diagram. L2 ‘OR Q 4 [a.|Derive the expression for error probability of BFSK using coherent | detection. 13 coz b. | Binary data are transmitted over a microwave link at the rate of 10° BPS and | PSD of noise at the receiver is 10'° watts/Hz. Compute the average carrier | power required to maintain an average probability of error P. < 10~ for the | following cases | (@)_ Binary PSK using coherent detection | (ii) DPSK | Note : take erfo(2.63) = 2 x 104 Q(3.7) = 104 12 co2 |e. | With a neat tiock diagram outline the generation and cohrr int detection of | QPSK signal | 12 coz Module - 3 Qs a.] Briefly discuss entropy and information rate. Derive the expression oF | average information content of a zero memory source, 12 C03 b. | An international Morse code uses a sequence of symbols of dots and dashes | to transmit letters of English alphabet. The dash is represented by a current pulse of dvr..ion 2 msec and dot by a duration of | msec. [se probability of dash is half that of dot. Consider 1 msec duration of gap is given in between | symbols, Calculate ; | @. Self info-mation of a dot and a dash | (ii) An aver, ge information content of a dot-dash code (iii) Aver. rate of information. | C03 |e. An information source produces a sequence of independeit symbols having | the following probabilities. | Pd’idiid S= s Pafe, in | {51 $25. 54 Ss 56 Sy}, fatitect | { conse the binary and temary code using Huffman encoding procedure. | |_| Find its efficiency and redundancy. 13 co3 detaBEC503 OR @Q6 [a] Define mutual information, Derive the expression for mutual information | 6 | L2 | CO3 and joint entropy interms of probabilities. by For the JPM given below compute individuality HOO, HCA, HQ ¥),| 7] £3) COs H(XIY), H(Y/X). | 0.05 0 0.2 0.05 Ol 91 0 0 0 02 01 0.05 0.05 0 0.1 P(X,Y) =| ‘A binary symmetric chanael has the following noise matrix with sowree | 7 | L3 | CO3 3 probabilities of P(x,) = Po) =4 revi 4| 3 Nts Determine : | i) HOO, HCY), HOX, Y), H(Y/X), H(X/Y) and 1(X, Y). | ti) Channel capacity }) Channel efficiency and redundancy. ____ Module-4 QT | a. | Calculate the generator mat’ix G and parity check matrix H fora linear blork] 4 | L3[CO4 ‘code with matrix H for al r ar block code with minimum distance three + 1 aunessage block size of eignt bits. 7b. | Draw the general block diagram of syndrome calculation circuit for cyclic | 6 | L2 | CO4 codes and explain its operation. a | For a systematic (7, 4) Tinear block code, the parity matrix P is given by 10/3 | Cos ' es | als. 1 (P= (Pll ot | | ol | @ Calculate all possi" v ilid code-vectors Gi) Draw the correspowJ «,: encoding circuit (iii) A single error has curred in each of these rec and correct those errors. a)Ra=(0111110] 0)Ra=[1011100] c)Rc=[1010000} (iv) Draw syndrome calev! tion circuit red vectors. Detect -3of4- | |v | BEC3q, ‘OR { E = T 1 QB ] The generator polynomial for 2 15, 7) cyclic code is 6 | L3 coe |g) =Lexte xo +x txt (Compute the code = vector is systematic form for the message | Dixyertx txt | Gi) Assume that the first and last bit of the code vector V(x) for lee D(x) = x? + 2, xt suffer transmission errors. Calculate the | | ! i syndrome of V(x). | b. With a neat block diagram: ain suitable example, describe erro, ~ contro! ~; 6 | L2| CO4 | based communication system. ©. | Consider a (6, 3) linear code witose generator matrix is 8 | 13 | Cco4 | flooro)%?f i G=|Oo 10110 | 00 1:0 1%, | Calculate : i) All code vectors | ii) All the hamming weights and distances | iii) Minimum weight parity check matrix iv) Draw the encoder circuit for the above codes awe a ___ Module = 5 = a z Q9 Ja. | Describe decoding of convolution codes using viterbi algorithm with a] 10] L2] COs 1B lec | | suitable example. i ee = t 'b. Consider the convolution of ancoder shown in Fig.9(b). The code is! 0 L3| COS | systematic i) Represent the siate diagram ii) Relate the code tree | iii) Calculate the endoder output produced by the message sequence 101 1 1 | | iv) Verify the output using time-domain approach. | | | | L Fig.Q9(b) Hi 1 | ‘OR, | Q.10 [a. | Illustrate recursive systematic crnvolution codes with a suitable example. | 6 [12] CO3| |b. | Consider a (3. 15.2) convolutian encoder with g7= 110, g7 = (10, | 14] 13] Cos ga | @ Encoder block diag | | Gi State table : | Gi) State transition table i | |v) State diagram | \ |, FW) Compute encoder oust traversing through the state diagram for | | | input message sequen. of (11101) ' 1 1 (vi) Draw the code trellis and obtain the output of the encoder for the 1 | | same input sequence of (11101). | | oe - a LL tofs