[NATION [MAY-2016] STER[B.TECH] & CODING [ETEC-304] M.M.: 75 END TERM EXAM sIxTH SEME UNF" ORMATION THEORY Sjme :3 hrs. ote: Attempt any five quetions in¢ studing Q. no. 1 which is compulsory: hat are random signals? State the significance of random signals (3) Qi @ Ww probability theory: i 4 a random variable acquires values, randomly. All single random experiments for example, the amount of noise received to mathematics h terized by random variables, v when it comes tion link. However, ban he chara Guring a single use of a communica omes | gor engineering, of course, a more Procisy “nd analytical definition is necessary. By mathematical definition, a random Nariable is not random, nor is it variable: it is a “ther area. The first area being a subset ofa iment, and the random experi ‘the real line, also known as a real-valued ith a constraint in place on the function. ing from one area into an ‘e corresponding to a speci or space, being a subset o! This theory only makes sense Wi needom variable can be defined as a function. or some, a random variable is best defined as a measurement on a probability of ace, meaning that for each sample point o, the random variable will produce a value, chown as f («). The outcome o: iment is o and f(a) is the result of the abstract space, sooyarement obtained on the experiment: The outcome comes from an mich as real numbers, waveforms, sequences, integers ASCII characters, and Chinese characters, or others. However, the value of measurement or f (@) must be concrete, qneaning a real number, or a meter reading QL (6) Define ergodic process. Explain the difference between ergodic process and stationary process. (3) ‘Ans. Ergodic process is defined to as a random process in which time average is same as that of the, ensemble average. ‘An ergodic process is random in general the property of stationarity in which different the same irrespective of the shift in time origin. . Arandom process is a sequence of random variables, where in its simplest form as discrete random process it is equivalent to a random vector*\ random process can also be continuous-time, modeling a waveform signal, where at each continuous time ¢ the provess describes a random variable X(t). A discrete time'random Process, also known ‘n statistical studies and can be denoted as X(n), as a random sequence, is a time series i ” 0,1...) Itcan also be denoted in the digital signal processing li n also be de ssing literature by (X [n]}. ee cA peseriaaliahs discrete and continuous also refer to the amplitude of the ee ree sequence can be defined by the discrete or continuous nature pits poe is entropy? Explain alongwith its properties. (3) PR ep ee of unpredictability of information content. To get an Ueuatly putt peeeraee of these three terms, consider the example of a political poll. ey gore bare because the outcome of the poll isn't already known. In other otliaid: Secchi trae the poll is relatively unpredictable, and actually performing the Eta farine results gives some new information’ these are just different ways ving entropy of the poll results is large. Now, consider the case that the function mapP probability spac fic outcome of the second area, random variable. Informally, however, @ I sense while a stationary process reflects t statistical properties are observed to beand system space and time pafameter index needs to be specified. The Niives an everview of the different instances of Markov processes for f state space general for discrete time vs. continuous time, ‘channel is described by the following channel matrix: ese eva - [2 2 “]. oo1 (i) Draw the channel diagram. Gi) Find the channel capacity. ‘Ans. Given, cont pty ay thin ina aoe go BO) ayy =} a AY) = 5 PY = AM = = Sapien) «Guede LbityIRST TERM EXAMINATION (FEB, 2017) SIXTH SEMESTER (B.TECH,} INFORMATION THEORY & CODING (ETEC-304) Constant (iid) Infinite (do) Variable of ea Je binary source. o a aay ae ymbole any sobre then entropy of uct 1 : Spite raat 1 Here Pe) - if (3,)to6a = log, M o ‘source efficiency? So nny have been removed fF Gipetmsnimam edundant odie:EXAMINATION [MAY-JUNE 209; nea LGR THEORY AND CO TION THE! ING a [ETEC-304] ween the transmitter and receiver. llowing properties: wrefix codes. Prete define the prefix condition let code is (mg, mys .- ql initial | part of the code is represented by (m,, mya... my) where i Sn. Ran (CRY): This variable always indicate a ‘pereniter gud an cenpusuee pease ga 7 XQ: A continuous random variable variable (DRV): This type of variable does not encoder. ‘can take only finite no. of values in finite time period. LINEAR BLOCK CODESalWIA iS ph : coding scheme, knowledge of probabil ere ere Src ae cee ‘by 0 or 1 and the second digit ie ‘by the. by 0010, zero's will be ndded in MSB depending ‘ntronm '010010011100" as follow eryoeLP. University-(B.Tech.)-AB Publisher 18-2017 040.15 + 0.05) Now HOH) ~HC¥%9) rate of information is equivalent tothe capacity of channel so Jim OGY) C= Phar lim (HY) ~ HOO) Sine theee ar parity eck bite Sowe can write lecegt dea = Wadads) Plas fe za] st Pn Pa P| 14,4ya3)|P0 eg = Py Ctr O45P = dP OtaPn OdsPar a3 a +0180 (0.5) + 0.15 10 (0.8) ‘On ceaseLP. University-(B-Tech )-AB Publisher 2007-81 rout % one p cSt up [ates Output sequenceLP, Univeraity-(8 Tech,)-AB Publisher ‘be obtained by multiplying g(p) and m(p). Sinan other ‘Corresponding ‘nequence by combining the current and next states in | =Lepteptep sp spt ents pt spe {= 0011) (= (100111) =, = (110001), ‘output polynomials and sequences for m(p)=1 +p? +p™ ‘To multiplex x;, x/, and x,®: Final output sequence eae ‘sequence equal. The sipped che SandeLP. University-(B.Tech.)-AB Publisher 2017-25, ‘nich generates a given feature vector, is independent of the shapes of neighboring ‘haracters and is therefore dependent only on the character in question, @- Sosntete Hoe Penta) ‘The MAP sequence estimation problem previously stated can also be viewed as the oblem of finding the shortest rout through a certain graph. By thinking i Ue way of finding the most likely state sense of 8 process assumed to beaEND TERM EXAMINATION {MAY-JUNE 2018] SIXTH SEMESTER [B.TECH] INFORMATION THEORY AND CODDING [ETEtLP. University-(BTech]-Akash Books 2018-13 12-2018 HOO = 3 PEplog Pex) a = a loga + (1a) log(.—a)) HY) = ZR Paapiarey) ‘After setting the joint probability matrix Ran) Bad) POY) = | Posy) Plan) Py) = Pogy)+ Pay) Py) = Pouy,)+Poyy,) Hence HCY) can be obtained as :sixth Semester, Information Theory and Coding ‘he Viteri pth. You cam see this when you get truct the block diagram for this RSC encoder, “he parity-check equation as associated with the encodeLP, Univernity-{B-Tach}Ak 7 nae eas 2019-11 it an igen fi og of ting rn ani ‘whom it text ame ees ese for END TERM EXAMINATION [MAY-20 c SIXTH SEMESTER {B.TECH] ORMATION THEORY AND CODIN [ETEC-3 7 @Sixth Seioster, Information Theory and Codinga) Find the parity check matrix. (©) Pind the minimum distance of the code, (©) Draw the encoder and syndrome computation cireuit,