CHAPTER 1 Information Theory and Source Coding Multiple Choice Questions Q.11 For formating the signal which of the following steps need tobe flowed? (@) Sample) Quantze (©) Encode @ Allofthe above Ans. :(d) Explanation : ‘0aig sna! —} Sample | + ovatzo|—f Encode | vital is * | ((A9)Fig. Q. 1.1: Block diagram of formatting Q.12 The process of quantization is (@) Averaging (&) Approximation (© Summation Ans. (0) Explanation : Quantization: Is the proces of approximation of the signal 13 Whatis source coding? (@) Source coding i a process of conversion of analog to digital signals (b) Source coding is a process of conversion of analog to analog signals (©) Source coding isa process of conversion of digital to analog signals Ans. (a) Explanation : Source coding is a process of convenion of analog to digital signals Q.14 Encryption is necessary to maintain authentication and security ofthe data, (@) Truc () False Ans. : (a) Quis Explanation : To maintain the authentication and Security ofthe information dat signal, encryption ofthe data is carved out. Encryption of data prevents any unauthorized receiver to disturb the signal. It also Prevents data from the spurious signals entering in the channel Which of the following steps are followed on receiver's side? (@) Maipe access : © Source decode Explanation : ‘The steps followed at the receiver side are exactly reverse that of transmitter seeton, They are: (b) Detect, (@) All of the above Ans. : (d) - (1) Multiple access (2) Frequency despread (3) Demodulate and sample ) Detect (5) Demuttiplex (©) Channel decode (7)_Deerypt (8) Source decode (©) Format ‘Which of the following processes are carried out on both the sides of digital transmission system ? (a) Multiple access schemes () Detect (©) Decode Ans: (@) Explanation :b —————— lL munication (MU - Sem. §- E&To ital Co ) (information Theory & Source Coding) oo eee CS Transmit Information Message ha souce ee Smet oi (— From tier Message Information symbols sink #5 CS Receiver optnat esseniat (WF. Q. 1.6: Block dlagram of typical digital communication system x Probability of enor can be defined as the probability of 17 Detection can be defined asthe decison making ofthe eee eae ) e ae . (6) Both (a) and &) (4) None ofthe abo = Tm any of the digital communicaion system ‘Ans. (b) Perfomance i measured based on probly of ETO" Explanation : The function of the transmitter is to Provide the signal suitable for transmission channel, fech-Neo Publications..A SACHIN SHA\ Me Sabus wef academic yeat 2-22) (M56) oe iDigital Comm Q.143) The function of the eeeiver isto (9) Demodutate and detect (b) Mostulate and amplify (6) Inereave the power of the signal () All of the above Y Ans. (a) Fxplanation : The function of the receiver is. to Alemoduate and detect the signal 0.1.14 The cominous valued Information Is known 08 Infomation (1) Anson, (&) Digital —(€) Binary Ans. (0) eplanatlon Analog information sure fo ‘aed infomation our unas consists of discrete set of letters of alphabets of symbols. (2) Analog information source (b) Discrete information source (©) Both (a) and Explanation : Discrete information source consists of discrete set of letters or alphabets of symbols. 0.146 Temes of nforaion gen wrmenn(st) © 1)=106( 42) (0 10m) =H() Yans (0) Explanation Suppose an information source emits one of q possible messages m,, m.... my with probabilities of occurance PG PAP ey Hence amount of information in k message 1 (m,) is inversely proportional 1 F. ‘Therefore measure of information is given as, mal) Q.1.17 When the base of the log is not specified then the unit of 1(m) information is __ and when the base of the log is 2 then the unit is (a) Binit, nat (b) Nat, bit (@) Bini YAns. (0) Explanation : ‘Table Q. 1.17 + Log base an respective units used Sr.No. | Base of lox Unit 1. | Not specified | Binit 2 (2, Bit 3._ [10 Decit or Hartley 4 [e nat Q.1.20 A Letspenstetagty BOS ge no. (M (information Thoory & Source Coding) 18 Information f, should always be postive (a) Tue (b) False Ans. (a) Explanation + Information I, should always be positive Q.1.19 For a symbol with probability approaching its highest value the amount of information in it should approach its fowest value (True b) Fase Ans. (a) Explanation : For a symbol with probability approaching its highest value 1, the amount of information init should approach its lowest value inary symbol occurs with a probability of 0.75, Determine the information associated with the symbol in bits (@) O4IS bit (b) 0.2876bits —(€) 0.124 bits Ans. : (a) Explanation : 1 log, init = log 1 xu a) ~-(cou=t) = 0415 bit Q.1.21 The average information content per symbol is called as (a) Information (b) Message (c) Entropy Ans. : (6) Explanation : The average information content per symbol is called as “source entropy". 1.22 The source entropy is given as__ M @ 2 F toe,() bitslsymbot ist 7 wu (Eton) sary ist ‘ M © ZX hog(Fr) biteymbot ist Explanation : Average information per symbol can be obtained by dividing the (qu) term by number of symbols in message, M E Plog p) bitsymbol Itis source entropy equation (New Syllabus w.e,f academic year 21-22) (5-69) Wlrech-neo Publications... SACHIN SHAH Venturecommunication (MU - Sem. § -E&TC) 0 ws pis maximum valve of entropy i qs aximum value of entropy occurs wen prdaces equiprobable symbols (b) False the rouse (a) Tne Explanation Maximum value of entropy occus when the soure preduces equiprobabe symbols Ans. (a) HO) =0if and only if P,-> 1 for some k (@) Tre (0) False Ans. (a) Explanation = Property of entropy states that H(M) = 0 if and only if P| for some k. The remaining probabilities in te set are all zero. H(M) = 0 is the lower bound on entropy and itcomesponds to no uncertainty in the event. Proof “As we know, forno uncertainty, Py-> 1 1 «loss > 0 H>O {Information Theory & Source Coding) Ao, Ps ogg, = 0 iff Py=0 oret * Ho = 0° iffPy=0 of Py=1 ...forsomek Hence Proved 0.1.25 Fora source encoder to be efficient, the code should be uniquely decodable (@) True (b) False Y Ans. :(a) Explanation : Fora source encoder to be efficient, the code should be uniquely decodable Q.1.26 Any sequence made up of inital part ofthe codeword is called as ‘___ ofthe codeword (@) Suffix (6) Prefix. (¢) Subscript ¥Ans. :(b) Explanation : ‘Any sequence made up of inital part of the codeword is called as ‘prefix ofthe codeword” Q1.27 is a code in which no code word is the prefix of any crber codeword (b) False Ans. (a) + Teis a code in which no code word is the prefix of anyother codeword aoaModule 2] Error Control System and Error Detection Codes CHAPTER 2 INST Tey rem sarin 2 8 the condition when opt wf the rexxiver oes nek ent with ing ) Exror is the condition when unit of the tonsiter ee wok erty with int one A the abe. eo) Exphanation : Essar is the condition when omiput of the reociver Ooms 20h rach with ipa Morin 206 te types oh the envuns) ors (b) Plow intensity evons A hav se) (0) Pow iaseapiy ene a2 ae the errors cared doe vy missing (0) Faber V Asis) (a) Contveat exrons Tire exis sen toe erst in the Unsead N wnesenye ey, nary *S° secry be received to binary “W, These exon caso Owe wy nie intrhuction during. Srannaninsion Gheoni case, ) Fem idea ity errors Test: cavers eehers to missing Vircks of dita unite, In ace A Srasse texenssiosionn, these exrons can be seherted so hora o7 Duplicate dats trans sos) wctoownedysvents, D258 Wihicdy S Oe Slowing we be Sw ieyny end (e) Siuppetitenons —) Burtenvs © AVS the stove Y han ste) Eapistion 2 How iin exsons ase Sure chasibie a () Saupe ba exsoes Gi) Bars exxors 0.25 Win type oh en bo ornn ne D289 —— Tanne daly ofofafofopoya la} vw Comypos VA ears Pehve data Do afo [opal fo wn we 0as (») Side bit enor (©) Comesn on Explanation + Transits da ToT so ToT oT To J ont Compost netlissda SVOT5Jo To ToT Jo wnat ings bitin error ()) Borst erron ” 1 hos. ss) Asie 0, 2.5ta) ‘Which Uf the type of esror bs shown jn Fig. Q2.0°7 3]o ether we omy ToT sJoTs ToT oTsTs To] Receives sos in .26 (») Single bit err (©) Content enor ofo (b) Burst enor Y psa. (b)jy Gomnunicalon (MU Som. §- E8TC) innate {E'ror Control stom and Error Detection Codes) ...Page no. (M2-2) planation: enor orer=7 | Tent Olah! |_| comp it tPolo[s [1 To] Recoived data unit t]+Jofo Fig. Q.2.6(0) Which ofthe following are the causes of content errors? (@) Signa impairment (b) Loss ofsynchronization (©) Both (a) and (0) Ans. (0) Exphanatic Causes of content errors (e) Signal impairment (b) Loss of synchronization (@ Seamblers (8) Transmission channel switching a7 Q.28 Content errors occurs majorly due to distortions of clectical signals and noise. (0) Te (0) False ans: :(a) Explanation : Content errors occurs majorly due to distortions of electrical signals and noise Thermal noise causes sporadic bit errors. The duration of the impulse can be Jong enough to corrupt multiple bits causing burs errors. Q.29 Scramblers multiply errors as it consists of shift registers. (a) True (b) False Ans. (a) ‘Explanation : Scramblers multiply errors as it consists of shift registers (Q210 Incase of system channel failure burst eros occu. (@) Tre (b) False Yans.:(@) Explanation: Transmission channel switching: Generally transmission channels are communication systems are protected. I the min channel fils, system is switched to stand by one This switching may take 10 ~ $0 ms duration causing temporary oss of digital data. This temporary loss of ata leas to burst errors. 211 Which of the following are the causes of flow integrity rors? (@) The data unit may be delivered out of sequene® (b) Data unit may have been detivered to wrong adres © Allofthe above eee Explanation: ba ot Typical integrity mors oocur due 10 eS yaw see 3 of this. ‘message block. There are several reas00* e “The data unit may be delivered ut of SAVERS (Ne = Sylabus wef académic year 21-22) (5-69) » 22 213 Q.2u4 Q.215 (i) Data unit may have suffered from content errors and hence got rejected by the node in between the ‘network before reaching destination. (li) Data unit may have been delivered to wrong address. (Gv) Data unit may be discarded by node in congestion in the network (¥) Due to loss of acknowledgement, sender may send duplicate data units. Which ofthe following are types of party? (2) Even parity (b) Odd patty (c) Both (a) and (b) Vans. (6) Explanation : Parity method is the simplest method of the error detection, In this method an extra bt is added atthe end ‘of each word. Tis extra biti known as party check bit. Party canbe of either ofthe two types. (@) Evenparity (6) Odd parity ‘The parity bit is added in such a way that the total number of ones become even then itis known as evea pas. (a) True () False VAns.:(a) Explanation: Even parity : The paity bit is added in such a way that the total number of ones become even. eg.lt tfofofififo is the data stream then the parity bit “is added to make the total number of ones even ie. 4. Hence the new word becomes. nooo SS Data bits (asFig. Q.213 1 + Parity bit Party bit is oe of the message bit itself used for error detection purpose. (@) Tre (0) False Vans. 2 (0) Explanation Pay method is the simplest method of the eror detection. In his method an extra bits added atthe end of each word. This extrait is known as party chek bit Redundant bis increases __ bits (a) Even parity (0) Odd parity (¢) Overhead Vans. (0) Tech-Neo Publications..A SACHIN SHAH VentureDigital Communication (MU - Sem. 5 - ETC) Explanation By adding redundant parity bits, overhead bits are increased, This affects transmission bandwidth Q.2.16 Party check method can be used for error correction (a) Tre (b) False Q.217. Which of the following are the disadvantages of parity check method ? (0) Teredaces transmission bandwidth () Iris unable to detect burst errors (©) None ofthe above Explanation : Disadvantages (1) By adding redundant parity bits, overhead bits are increased, This affects transmission bandwidth, (2) Parity check method cannot detect burst errors. () This method is unable to detect which bit is in error. Q.218 In parity check method, receiver checks number of zeros to detect the errr, (2) Tre (®) False Explanation : Receiver checks the received word for total number of ‘ones. Ifthe total number of ones does not match with the transmitted parity then the eror is detected, Q.2.19 Which of the following are the two dimensional parity check methods? (a) Longitudinal Redundancy Check (©) Vertical Redundancy Check (c) Both (a) and (&) Ans. :(@) Explanation : There are two types of two dimensional parity check ‘methods namely Longitudinal Redundancy Check and Vertical Redundancy Check, Q-2.20 LRC increases the likelihood of detecting burst errors. (@) True Vans. Explan: LLRC increases the likelihood of detecting burst errors, () False Q.221 block, the data block is__ (a) Discarded (0) Corrected (c) Processed as it is. Ans. (0) Explanation : In LRC method when there are more than one error per block, the data block is discarded and request for retransmission is issued by receiver, (New Syllabus w.e academic year 21-22) (M5-69) Ans. (b) Ans. :(b) Y Ans. :(b) In LRC method when there are more than one errors per (Error Control System and Error Detection Codes) Q.2.22 0.2.23 Q.225 Q.227 Page no. (M2-3) ‘In LRC, long block needs many retransmission which slowdowns the data rate. a (b) False (9) True “Ans. Explanation : In LRC, tong block needs many retransmission requests Which slowdowns the data rate. In VRC piyiisaed __ wie (0 extn) 4 (none te above Yh) Ela In VRC mete, data ok rien in tbl orn int ke LR. Now the pty bis ae clad on went of conidsing cobain LR. VRC is able to detect __ errors @) Signal (6) Content (©) Single bit Ans. (6) Explanation : VRC can detect ll single bit ors. there are __ bits in eror, VRC, method is unable to detect the errors @O m1 ©2 Yans.:(0) Explanation : If there are 2 bits in error, VRC, method is unable to ‘detect the errors. ‘What is the objective of error control coding? (@) To sample and quantize the given signal (©) To detect and correct the error (©) None of the above Explanation : Objectives of error control codes (@ Tohave the capability to detect and correct errors. i) To be able to keep the overhead of error control and ‘correction as minimum as possible practically. (ii) To be able to encode the symbol in a fast and efficient way, (iv) To be able to decode the symbol in a fast and efficient way. V Ans. (0) Which are the error control methods? (a) Error detection and retransmission ARQ (b) Errordetection and correction (©) Allof the above Vans: [Bbrech.wveo Publications... SACHIN SHAH Venturecommunication (MU - Som. 6 - ETO) ogi 1m and Error Dotoction Codes) ....Pago no. (M24) plonaton Error control method eaten a Error datoton and ensi8s correction acy Fig. Q.27 q238 —metod sus in pot point ak (a) Error detection and retransmission ARQ {t) Error detection and conection (6) Allof the above Ans. (a) planation: or detetion and retransmission ARQ method is useful in pint to point links. 0.239 Which of the following are the disadvantages of eror correction codes? (0) Increase in overhead bits (Increased noise (© Allof the above Explanation: Disadvantages Y Ans. : (a) @ For correction purposes, more redundancy ot extra bits are needed in the code. (i) These extra bits increase overhead more as compared to evansmission methods. (0.230 Which ofthe following are the error conection odes? (8) Block codes (b) Convolutional codes (©) All of the above. Explanation Y Ans. (6) The error comection codes ar classified as (®) Block codes (b) Convolutional codes. This classification is dependent upon the presence and 1 = Redundant bits Hence encoder nds ‘r' redundant bits to k message bis. ‘This is for error correction purposes. Hence codeword is defined as ‘bit block of data with m sttk 0.232 Total number of bits in a codeword (n) is called as ‘of the code’ (0) Fed length (©) Vatible length Explanation: ‘Total number of bts in a codeword () is called as “block length ofthe code" () Block length V Ans.:(b) Q.233 ‘The ___ is defined as the ratio of the number of message bits ott umber of bi in codeword ( Coderate —()Blocklength (c) Codeword W Ans. :(a) Explanation: ‘The code rate is defined as the ratio of the number of message bits to total number of bits in codeword. Q.234 The hamming weight of a codeword is equal to the ‘number of __components in it (@) Allzero(b) Non zero. (@) Allone ¥Ans. :(b) Explanation : ‘The hamming weight of a codeword is equal to the number of non-zero components init Q.235 Which type of ARQ system introduces the transmission delay between the transmitter and receiver before the reception of frame at receiver for the purpose of error detection? (a) Go-back-N ARQ (b) Selective Repeat ARQ (©) Stop-and-Wait ARQ (4) None of the above Vans. : (0) 0.236 Which provision can resolve 1 overcome the shortcomings associated with duplication or faifure absence of memory in the encodet. condition of Stop and Wait Automatic Repeat Request protocol especially de to loss of data frames or noa- 231. The a bit block of data is known as __ reception of acknowledgement? (@) Signal (0) Codeword (e) Provision of sequence number in the header of (©) None ofthe above Vans. 20) message Explanation: (0) Povisn of teksum computation Let there are ‘bits in every block of information dite (© Botha& ‘The encoder produces block of total ‘n’ bits such that (@) None ofthe above. Wns. () tee wen >) Where, n= ‘Total number of bits in block k_= Number of information bits Ne “"Sllabus we academic year 21-22) (W5-69) ba [el rech-Neo Publcations..A SACHIN SHAH VentureQ.237 Q.2.38 Digital Communication (MU = Bom, 6 « E&TO) Which consequences ate mors Ukely to occur ding the Ano tntnssion in Stop: Walt ARQ iechnnism? (6) Loss of finmo oF an sckaowledgement (0) ony tn nn acknowledgement (©) Normat operation (W) Atlof te nbove YAns.1(@) ‘Which fenturo of Go-Dack-N ARQ mechanism possesses fn ably 10 nssign the sliding wldow In the forward Aitetion? (0) Control Variables () Send Sliding Window (©) Receiver Stlding Window Q.240 (@) Resending of frames ARQ stands for (8), Automatic repeat quantization (b) Automatic repeat request (6) Automatic retransmission request (d) Acknowledge repeat request Ana. : (6) the ertors ae coreted at __end it is known ag "Porward For Correction (FEC), (0) Transmitter (b) Receiver (©) Bothasndb (4) None ofthe above Ana) gooaut Qa 33 ass Qas Error Correction Codes Tlie tres Questions edundantbits increases ___ bit (e) Even pity (0) Odd parity (¢) Overhead Ans. (0) Explanation: By ding redundant parity bits, overhead bits ae inressed, Ths affects transmission bandwidth Party check method can be used for error correction a0 (True (b) False Y Ans. :(b) Which of the following are the disadvantages of parity check method ? (a) treduces transmission bandwidth (0) Its unable to detect burst errors (©) None ofthe above Explanation : Disadvantages (1) By adding redundant party bits, overbead bits are increased. This affets transmission bandwidth (2) Party check method cannot detect burst errors (3) This method is unable to detect which bit sin eror. Ans. (0) | parity check method, receiver checks number of zeros to detect the error. () True (b) False Explanation : Receiver checks the received word for total number of nes If the total numberof ones does not match withthe ‘ransmited parity then the errors detected. ¥ Ans. (0) Cyelic coves form a subclass of __ (9) Convolutional codes. (b) Linear block codes (©) Ree sloman codes Aas: 0) Explanation : etic codes form a subclass of linea block codes. 0.36 Q.37 38 0.39 Which of the following are the advantages of cyclic codes? (2) Easy to encode (©) Bificient decoding schemes are available (© Allof the above ‘Explanation : Advantages of eyclic codes are: (They are easy to encode. They possess well defined mathematical structures. (ii) Good efficient decoding schemes are available for cyclic codes Y Ans. :(€) Which ofthe following statement states linearity property of eyclc codes? (®) The sum of any two binary numbers form code vectors (©) The sum of any two codewords in the code is also a codeword (© None of the above Explanation : ‘The sum of any two codewords in the code is also a codeword. Its the linearity property of cyclic codes. Ans. :(b) ‘CRC codes ae suitable for detection of burst erors (@ Te (b) False Y Ans. : (a) Explanation: ‘These codes ar suitable for detection of bursts of errors, ‘What i the generator polynomial for standard CRC-12 cade? fo) Peete tte? (by Leet ex 7 (Lan exPex!® Ans. : (a)Digital Communication (MU - Sem. § - E&TC) {Error Correction Codes) ....Page (143-2) ; to linearity property. the of yg Explanation Table Q. 3.9 : CRC codes (International standards) Sr. Code Generator polynomial [n= No. 202) 1. | CRC~I2code |iextx'txex 4x” | 12 2. | CRC-16code [14x74 x" 4x" 16 3. | CRC-CCITT [i+x? +x" 4x” 16 code Q.3.10 For the generation of a cyclic code, the generator polynomial should be the factor of _ (@) x41 @) x1 xn @xm Y Ans. (a) Q.3.411 In register contents at decoder, the syndrome register ‘consists of syndrome afterall bits of received vector are clocked into the decoder (@) Input (©) Output (©) Bothaandb (4) None of the above Ans. : (a) Q.3.12 In decoding of cyclic code, which among the following is also regarded as ‘Syndrome Polynomial”? (@) Generator Polynomial (b) Received code word Polynomial (©) Quotient Polynomial (@) Remainder Polynomial Explanation: No explanation is available for this question! Q.3:13 While decoding the cyclic code, if the received code Word is similar as transmitted code word, then r(x) mod W Ans. : (4) (3) is equal to @ a0 (©) Unity © Infinity (@) None ofthe above Ans. : Explanation: No explanation is available for this question! Q.3:14 What is the value of leading coefficient of a monic polynomial? @0S O11 ©4 G16 — MAns.: (0) Explanation: [No explanation is available for this question! Q.3:15 A cyclic code can be generated using codes can be generated using ——~ (@) Generator polynomial, Generator matix (©) Generator matrix, Remainder polynomial (©) Generator matrix & Generator polynomial (@ None of the mentioned Ans. : (a) & block ‘Accor code words in a cyclic code is also a valid code wor, () difference (@) division () sum (6) product Cyclic Property of eyclic codes indicates that (@) A cyclic shift of bits in a code word gives rise tg another valid code word (b) Sum of two code words isa valid code word (© Polynomial Product of two code words is a. vaig code word (@) Polynomial Division of two code words is a vatig code word Wns. (a) YAns(9) Q.3t7 Cyclic code polynomial (x) can be generated using data polynomial of degree (k-1) and generator polynomial (x) of degree (0-4) as (@) efx) =dtnr.g(0) (© efx) = a(x) - 268) 0.3.18 (b) (x) = d(x) mod g(x) (@ None of the above Ans. = (a) For systematic cyclic codes, x(n-K)d(x) +p(x) = 4(x).g(x) (@) p(x) are remainder (k-1) bits & q(x).g(x) are shifted message bits (©) p(x) are remainder (k-1) bits & q(x).g(x) is code (©) p(x) are remainder (K-1) bits & q(x).g(x) is code @) pC) are remainder (k-1) bits & x(n-k)d(x) is code Ans. :(b) 319 Q.320 With reference to Decoding of eyclic code following is, tue (@) W(x) = c(x) modulo 2 addition e(x) , where r(x) is received codeword polynomial , e(x) is error polynomial & c(x) is codeword polynomial (©) (x) = c(x) + e(x) (© Hx) =e(x)-e62) (@ 1x) =¢(x) modulo 2 multiplication e(x) Ans. : (a) Q.321 Encoding and Decoding of eyclic codes involves (@) Mutiplication of Polynomials (©) Polynomial Subtraction (©) Division of Polynomials (@) None of the above VY Ans.:(0 Q.322 The Decoding algorithm for Cyclic code is known as: (@) Vitetbi decoding (©) Zeiler Gorenstein decoding (©) Sequential decoding (@ Syndrome decoding Vans: (New Syllabus wef academic year 21-22) (M5-69) Tech-Neo Publications... SACHIN SHAH Ventureon ‘umber of parity bits are equal to highest power of (a) Generator Polynom (0) Received code word Polynomial (0) Minimal Polynomial {@) Remainder Polynomiat Ans. (a) Generation of non-systematic cyclic code: @)a6x)4m(x) © g(x) mod m(x) (@) g(a) (o erm) systematic Code means: (a) Parity bits and message bits are interleaved in codeword bits (0) Only message bits are resent in codeword bits (o Pary bits and message bits are clearly separated in codeword bits (j) Encoding is done in systematic way oss Vans. (0) syndrome is calculated by (a) HT (b) HT om (d) None of the mentioned Ans. : (b) 36 {Error Correction Codes) Explanation : The syndrome is calculated Q.3.27 The cyclic codes are designed using (4) Shift egisters with feedback (b) Shift registers without feedback (©) Flipfops (@) None of the mentioned Y Ans. (a) Explanation : The cyclic codes are a subclass of linear codes. It is designed using feedback shift registers. Q.3.28 A cyclic code can be generated using (@) Generator polynomial (b) Generator matrix (©) Generator polynomial & matix (@) None of the mentioned Vans. :(0) Explanation : A cyclic code can be generated using generator polynomial and block codes can be generated using generator matix. ao| rrr Baseband Transmission CHAPTER 4 Multiple Choice Questions QA. Which of the following are the types of line cules? Y hos. fe) (a) Unipolar RZ Explanation : (b) Polar NRZ (c) All of the above “Types of Line Codes are : Unipotar i) Unipolar RZ li) Unipolar NRZ Polar i) PolarRZ ii) Polar NRZ = Split phase Manchester Bipolar NRZ/Alternative Mark Inversion (AMI) Pseudo-trinary 0.42 The Fig. Q.42 shows [ea led alee el [aes] pala pott1+to f+ tole ol? [ TI [es] A | | i output | |_| | |} signal I | (| | 2 Lie tt | I (@) Unipolar NRZ Explanation : (nin Fig. Q. 4.2 Ans. (0) (b) Unipolar RZ (c) Polar RZ Teer el pafcom|eta|aom|ant Data A Output ] f | l signal rT + + — leielel2 (aie | I (1n19Fig. Q, 4.2(a) : Unipolar RZ format@ (MU- Sem. § Eat) (4) Small Transmission bandwidth (@) Powerefficency (©) Allofthe above V, Explanation : Properties of line codes are 1, Transmission bandwidth Powerefficiency ‘Ans. (@) 2 4 Error detection and corecton capt 4, Favourable power spectral density 5, Selfclocking 6. Noise immunity q4Fsamples of ryquis iter ae (a) Root mised cosine filter (b) Raised eosin filter (©) Root raised & Raised cosine filter (@) None of the mentioned Vans. :(0) Explanation : The most popular among the clas of ayquist fers are raised cosine and root raised cosine fie. Qs. The minimum nyquist bandwidth for the rectangar spectrum in raised cosine filter is (@ 27 () 1aT OT O27 Mans: @) ‘Explanation : For raised cosine spectrum the minimum ryguist bandwidth is equal to 1/27. Q46 The oumber of bits of data transmitted per second is called (@) Data signaling rate (6) Modulation rate (c) Coding (@) None of the above Ans: (8) Q47 The process of coding multiplexer output into electrical pulses or waveforms for transmission is called (@) Line coding (b) Amplitude modulation (© FSK (@) Filtering Y Ans. : (@) Q48 Fora line code, the transmission bandwidth must be (@) Maximum possible (b) As small as possible (©) Depends on the signal (d) None of the above W Ans. :(b) 49" In polar Rz format for coding, symbol 0" srepresened by (2) Zero voltage (b) Negative voltage (©) Pulse is transmitted for half the duration : (@ Both b and care correct Yam ao Ina uni-polar RZ format, o (@) The waveform has zero value for symbol ‘0 (©) The waveform has A vols fr syinbol ive values for (© The waveform has positive and Begaive aS 41 42 Q413 Q414 Q.416 Q4i7 Q.4t8 gin om (Ba Transmission) (M4-2) 13, Whidhof he fllowing ar the properties fine eadeyy ! a (8) Both a and b are corect Ans.) Polar coding is a technique in which (© 1 is tansmied by a positive pulse and 0 is transite by negative pulse ©) 1 is transmitted by a positive pulse and 0 is ‘ransmited by ero vols © Bothaeb (d) None of the above Wns. : (a) ‘The polarities in NRZZ format use (4) Complete pulse duration (b) Half duration (©) Both positive as well as negative value (@) Each pulse is used for twice the duration Y Ans. : (a) ‘The format in which the positive half interval pulse is followed by a negative half interval pulse for ‘transmission of “1” is (@) Polar NRZ format (©) Manchester format (®) Bipolar NRZ format (@ None ofthe above Ans. (0) The, maximum synchronizing capability in coding techniques is present in (@) Manchester format (b) Polar NRZ (© Potarkz (@) Polar quatemary NRZ. ans. :(0) ‘The advantage of using Manchester format of coding is (a) Power saving _(b) Polarity sense atthe receiver (©) Noise immunity (4) None of the above Vans. ‘Alternate Mark Inversion (AMI) is also known as (@) Pseudo'emary coding _(b) Manchester coding (©) Polar NRZ. format (@) None of the above Ans. (a) Ist may be removed by using (a) Differential coding () Manchester coding. (©) Polar NRZ_ (@) None of the above: Vans. :(@) In Altemate Mark Inversion (AMA) is (@) 0 is encoded as postive pulse and 1 is encoded as negative pulse () Oisencoded as no pulse and 1 is encoded as negative pulse (Os encoded as negative pulse and 1 is encoded as, positive pulse (@) 0s encoded as no pulse and 1 is encoded as postive ornegative pulse Ans.) SACHIN SHAH Venture s |__reeenive poe _Vans (0) Nun aoe [Bab rech-Neo Publications. ™™Silabus wef academic year 21-22) (M5-89) |Digital ommuinigation (MU fom, f Q.4t0 0 Qa Qasr Qa Qaae 428 Q426 Advantages of using ANE (a) Neva Foast power ae de te eppaito patty (by Proventstaikt ap of DC (0) May to use for longer distance GA) ATL oF the atone ¥ Aner) ‘Too taovtoooe cast by tho jor bos in gla towgorision i allt (49 ver ayabeinosovenge (RY White noise {6 truge fogueney etorenes han ne nolo ¥ Ane t (a) ye pattern is (4) Beuasat to staty ISL (OY May be seen 8 CRO (6) Restos the shape of harman eye (@) Alot the atowe Yaw “TW tie interval over whit the reset signal my’ Be sale witout nror may be oupant ty {a With of eye opening of eye pattern (0) Rate of closure of eye of eye yattent (6) Height ofthe eye oponing ot eye patent (d) Alot the above Y Avs. r(a) For a noise to be white Gassian aoise, the opti fers known as (a) Low pass ter (©) Match filter (b) Ra bane iter (Besse ter YANG (0) ‘The number of bits of data transmitted por second is called (2) Data signaling eto (b) Modulation rate (© Cating (None of the adore YAns.2(a) Nyquist eritetion helps in (Transmit the signal without IST (b) Reduction in transmission bandwidth (6) Ancrease in transmission bandwidth (@) Both a and b Vans) ‘The difficulty in achieving the Nyquist criterion for systean desig is (a) There are abvypt transitions obtained at edges of the bands (b) Bandwidth criterion i wot easy achiovest {€) Eiters aro not available (@) None of the above Yansew Quan Quay QAM Qa QA Qa Qs Hiaaobant te Lalita co (a) Resto tater ayenbot Interferon (ty Hewes llatortion cae de channel () Heaton using Hiner Mon Gl AML oF tho abo quali Y Ans. c(t) Zon foqoedt equalizers are weedt for (dy Sampling (d) Nowe of the abow Y Anetta) (0) Resta 18E 10 gov (0) Quantization ‘Wo teawamnisston eandwidih of the ised coving sguctrn even by (w Meal ew) (o) Me aw(ly 20) Oy Me wea (i Bee awaear YAne aqualzor Is used to {a tuerease the signal a noise rato a the receiver () Uquatle he distortion intrxtaced by channel (6) Decrease the eee prota oF signal detection Ad Nowe ot these Vans (b) yeoquttor sulle foe the sty of € Biter rate (8) Brrorsvector magnitude (©) The Quantieation noises (a) Lntorsy bol interferences V Ans :(d) ‘The Nyquist interval foe MO = is (0 0001s) OOS (@) 0.00285 GE 280 p8 Aner) In bye Patter, as eye cloves: (4) Wlinerease (8) ISl decrease (6) Tieng ter inereases Vans) (A) Tining iter decreases Transversal equalizer uses tapped delay’ Hie to a) Reshago and St () Retuge BER 4) Iworwase bit ato GH) Anevease Rants Vans r(e) Whieh consists of fess 1ST? 0 Nyquist ft 0) Raised cosine titer (©) Nyquist & Raised easine fitter ) Nowe oF the mentioned Vans sth) Nyptanation : Raised cosine filter results in tess ISUAHM Nyquist filter gaaOptimum Detection of Baseband Signal Multiple Choice Questions For a noise to be white Gaussian noise, ast anuaeea the optimum | Q.5:7 Matched filtering operation includes : (@) Spectral phase matching 2) Low pass filter b) Bi ° | ©) Decpams fle (©) Spectral amplitude matching (o) Matched filter (@) Bessel ter Y Ans. :(¢) (6 Spectral phase & amplinde matching 52 Matched filters are used (@) None ofthe mentioned Vans. :(€) () For maximizing signal to noise ratio Explanation : Matched filtering includes two operations (b) For signal detection = sel amp cing ed “ple smatcin (6) Inradar : (4) Allof the above Vans. ;(@) | O58 Matched fiteris (@) Linear (©) Non linear (53 Matched filter may be optimally used only for (© Linear &Non near (@) Nooe of the ment (@) Gaussian noise (b) Transit time noise ea (©) Flicker @ Allof the above ¥ Ans. (a) Explanation ; Matched filter isa linear filter. (54 Characteristics of Matched filter are 5.9 Matched filter provides __ signal to noise ratio. lke p (2) Matched filter is used to maximize Signal to noise (@ Maximum (©) Minimum ratio even for non Gaussian noise © Ze ( Infinity ans. (a) (b) I gives the output as signal energy in the absence of planation :A maiché fers a incr fiter designed noise to give a maximum signal to noise ratio power at the ai (©) They are used for signal detection output. (@) Allof the above Q.510 Matched filter technique i used to {85 Matched filters may be used © poate ie i a rae ied Ti affect ne of the mention (2) To estimate the frequency of the received signal (©) SNR is 208 Vane: @ ) . lems es (© Toesimate tedistnee ote cbiet demodulation process used to increase SNR. (©) Allo the above atched filter can also be used as least squares estimator. Os Q.sat M 6 Matched filters are used (a) Tre (0) False Ans. = (a) Explanation: A matched filter can also be used asa least (2) For maximizing signal to noise rao squares estimator. (b) For signal detection (© Inradar Vie @ |e eer (no (4) Allof the aboveDigital Modulations CHAPTER 6 Multiple Choice Questions Q.6.1 ‘The mathematical equation af HPSK Is piven ws. (8) Vpyge (= WO YPF, 08. 1 (8) Vora (= A,B ain rf) 008 1 (6) Vins (=n (0,1) YAnssin) Explanation + "© Mathematical expression VF, cos (0,0) Vowesx (0) 0° phase OF Vase W) = YEP, €08 (0), 42) “1c phse APP, -c05 (0,1) Hence in a general form, Vosn b ()Y2P, cow 0, 1 Jt is the expression for output BPSK, 0,62 The Fig. Q.06.2 shows CoH (+0) cOHR(ngh 40) Band pass Frequenay) 008 (igh # 0) finer VIGO ommmnrmmt 2 Pe Qa tid (8) BPSK transminter——(b) Carrier recovery section of HSK reeeiver (0) QPSK reeeiver Anis (h)Band pass] filler 2a, -——t— (Qigital Modulation Recovered carrier C08 (ot + 0) Integration over ‘one bit interval Sy be VolkTy) = bt (ME20FFg. Q. 6.20): Block, 0.63 Whatis the bandwidth of BPSK? @2 Oh © 4h, Explanation Bandwidth-Higher frequency Lower fequency » B= (+h)-(-f) = 24, Ans, : (a) Q64 The Fig. Q.64 shows, Fig.Q.6.4 () Signal space diagram of BPSK (©) Sina space diagram of BASK (©) Signal space ‘diagram of BFSK Explanation : Vans. i(@) EOFs. Q. 6.4(a : Signal space dlagram of BPSK: — stows etter results in presence of noise ‘ompared to other shift keying techiques (9 BASK —@&) BFSK (@) BPSK Y/Ans.:(€) 68 SMlabus ve 11) (M5-69) academic year 2¢ diagram of BPSK receiver Explanation : BPSK shows better results in preseie of noise compared ‘o other shift keying techniques, 66 The detection of BPSK is___ (@) Simple (&) Complex (¢) Beter_ Ans. :(b) Explanation : ‘The detection of BPSK is complex. In case of coherent detection techniques, separate carrier recovery section is needed. It increases size and complexity of circuit. 67 ‘Which ofthe folowing is the aplication of BPSK? (@) Suite communication (6) DVB (© COMA Wimax (@ Allof te above Y Ans. :(€) Explanation: Aplications of BPSK Low speed communication systems CDMA WiMAX 802.1 afogfn (WLAN) Satellite communication DVB, cable modem, ete. In QPSK four symbols are phases, (@) Tre Explanation: In QPSK or 4-PSK system, to bits are 0% orp St combaatons of Ny is (00, 01, 10 an 1) ribs Te uso ae rept wi ‘Tepresented with four different © Fate Ans. :(@) 'e0 Publications..A SACHIN SHAH, Venturedifferent phases. Hence, changes in phases of carrier cartes the information in QPSK. Q.6.9 Which of the following blocks are present in the QPSK transmitter? (a) Dip Nop (©) Allof the above Explanation QPSK transmitter con (0) D Flip-Flop (Delay) @) Multiplier (b) THlip flop Vans.) sof Q) THlip-Flop (Togete) (8) Adder. Q.6.10 The mathematical equation of BPSK is given as__ @) Vorsy (= b (YIP, “cos 0, (©) Versi (0 = YP, -b,(0 sin a, t+4YP, DAH) cos «, t (©) Vogsx (0) = dit) - sin (@, ) W Ans. : (b) Explanation : Verse (0 =P, b,(0 sin 0, +P, -b,(0) c08 0, ¢ = SW +S,0) Ina generalized form, Voose (0) =VFF,-cos[ 0,14 0m+ 2 m=0,1,2,3. Q.6.11 Which ofthe following are the important sections of the QPSK receiver? (@) Cartier recovery section (b) D flip flop (©) T hip flop Y Ans. : (a) Explanation : ‘There are two important sections in QPSK receiver : 1. Carrier recovery section. 2. Data recovery section. Q.6.12 The Euclidean distance measures the ability of the receiver to detect the bit without error (@) Tre (b) False W Ans. : (a) Explanation : Euclidean distance measures the ability ofthe receiver to detect the bit without eror. Q.6.413 Whats the bandwidth of QPSK? @2, OF ©4% ans.) Explanation Bandwidth of QPSK is one half ofthe BPSK. 2, Bw=3! =f, .6:14 Which ofthe following re the advantages of QPSK? (@) Better noise immunity (b) Bandwidth efficient system (New Syllabus w.e academic year 20-21) (M5-69) (Digital Modulations)...Pago Ho, (Mé-3 (© Allof the above When se Explanation ¢ Advantages of QPSK. = Better noise immunity. Effective utilization of available spectrum ay 2bitslsymbol. Also it is bandwidth efficient system. Error probability is low. In M-ary PSK phases differ by _ (14) 20M (ey 8 Explanation Mcary PSK is extension to these PSK systems, In this, “N’ bits together form a symbol. Hence, 2" = M symbols 2a are possible. Phases differ by $F. V Ans. :(b) Q.6.6 Which of the following are the blocks present in the M-PSK system? (@) DAC (b) Sampler (©) Quantizer¥ Ans. (a) Explanatio sinusoidal signa wo] Son Mat A loupe porate converter Phase > ty nl ViSp) Now Symbol (e19Fig. Q. 6.16 : M-PSK transmitter Q.6.17 The Fig. Q.6.17 shows__ won, sn (1) Caer Stier Digital sional bo Fig. Q.6.17 (a) BPSK transmitter (©) QPSK transmitter Explanation : (b) BASK transmitter Ans. :(0) [Blrech-neo Publications..A SACHIN SHAH Ventureg (Digital Modulations)...Page No_ (M6-4) af bel pnmunication (MU - Sem. 5 - E&TC) aa, cgi! nt Bandiintes s8.| Pet [earl soe |S be Qenentsy Come sciatr Bitrate f= tm, ecg, 0.6712): Block dgram of BASK tranmiter q0i8 Themes equation is__ © 0 Yuse(0= BOE, -c280,¢ 0) Vaasn = VP, BO sino, t+ © Vaasu = 40 sin (0) ‘Explanation : Mathematical expression Vax) =) sin (0,1) Vase = Sin @.0) (for dt) = 1) -olfor d() = 0] 619 Which of the following blocks are present in the BASK =0 receiver? (@) Integrator (&) Sample and hold (© Allo the above Yans.:() Explanation: ASK + Noise a 1 co Sega] _pCoreanir ace Binary i= sional a Ls Reference synchronous = Yowagev (14gFig. Q. 6.19: Block diagram of BASK receiver 0620 What isthe bandwidth of BASK? @2, Of © 4h W Ans. : (a) Explanation : ‘Bandwidth of BASK signal = 2f, Hz B= 24, W621. The disadvantage of BASK is low noise immunity (@) Te (False Yan Explanation : Disadvantage of BASK is The noise immunity 1 YeFY lo. 1.6.22 QAM system is actually the combination of amplitude and phase shift keying techniques. (a) True (b) False “Ans. : (a) Explanation : QAM system is actually the combination of amplitude and phase shift keying techniques Q.623. Which of the following blocks are present in the 16 QAM transmiter? (a) DAC (b) register (c) All of the above Vans. :() Explanation: VP,cosot af, t—] a DIA AM, BS laid dee lies Voss) —_] Paacer| > Deere oD T vere Ea Het ? t VPisinot Tock Period equal 1° symbol ine Ts. (NE) Fig. Q. 6.23 : Block diagram of QASK or 16 QAM. transmitter 0.624 The mathematical equation of QASK is__ () Voasx = b(2P, +05 0, ¢ ©) Verse = VP, 80 sin 9, t+ YP, “0 605 0 © Vorsx O = AW YR. os a tt Ay OP, -sino,t V Ans.:(0) Explanation : the mathematical equation of QASK is Voass (= A YP, “£08 014A, (0/P,-sin @,t Q,6.25 The *-ndwidth of QAM is__ 2f, oF 2h Of V Ans. : (a) Explanation : Bandwidth of QAM. 2k 2 =fh-Cf, ott ak B =f,-Cf) = WW 'y Me Sabus w.ef academic yeat 20-20) (5-69) Eel rech.Neo Pubications..A SACHIN SHAH VentureConnnunioation (MUs Rom, 8» BATE) AQAA _W NESE system, Nnary Nhe ant A ave pene 1 vaviations in teens 9) Dea) Rate yptanation | {in NENN gosto, Ninary NC Tat O° ane topes by Vaviations in tegen V Ameen) QAAT_ Which ot he thos am prosent da NESK transmitter? 9) Cur ossitlanr G) Aor te above Ryptanation : 8) Maiptiny VAme 110) NPT Ped NEBLP AC) 608 044 YB,Py() 008 ot Feeat NATAL QEWWA Ks, Q.627 : Block lagram of BESK transmtter 0.624 The maematienl expen 0 _ (0) Vyyylt PPR e+ (0) Vovyy (* WOYZP, con, (0) Voran 0 yplanatton Vorgalt) #2, cos fn + dC) A) o Vargnlt) 9/20, 608 (09.4) = 41 for logic 1) and Viygxlt) & YIP, 608 (00, t ~ Qt}...[for d(t) =~ 1 for Jogle 0} Lot © O40 2 Vong (O af2P,c08 any and Vyryx (0) Y2P, cos 0, Q.6.29 ‘The *=ndwidth of QAM is__ wt W4h © f [xplanatlon : The bandwidth of BFSK signals, B= 4, Itis twice tho bandwidth of BPSK. Ans. : (0) oo