EC2252 COMMUNICATION THEORY UNIT 5 INFORMATION THEORY

Size: px

Start display at page:

Download "EC2252 COMMUNICATION THEORY UNIT 5 INFORMATION THEORY"

Martha Aleesha French
5 years ago
Views:

1 EC2252 COMMUNICATION THEORY UNIT 5 INFORMATION THEORY Discrete Messages and Information Content, Concept of Amount of Information, Average information, Entropy, Information rate, Source coding to increase average information per bit, Shannon-Fano coding, Huffman coding, Lempel-Ziv (LZ) coding, Shannon s Theorem, Channel Capacity, Bandwidth- S/N tradeoff, Mutual information and channel capacity, rate distortion theory, Lossy Source coding. 1. What is information theory? Information theory deals with the mathematical modeling and analysis of a communication system rather than with physical sources and physical channels. 2. Define lossless channel. The channel described by a channel matrix with only one nonzero element in each column is called a lossless channel. In the lossless channel no sources information is lost in transmission. 3. Define Deterministic channel (NOV/DEC-2009) A channel described by a channel matrix with only one nonzero element in each row is called a deterministic channel and this element must be unity. 4. Define noiseless channel. Channel is called noiseless if it is both lossless and deterministic. The channel matrix has only one element in each row and in each column and this element is unity. The input and output alphabets are of the same size. 5. What is channel redundancy?[april-04] Redundancy is given as, Redundancy (g) =1-Code efficiency Redundancy (g) =1-h The redundancy should be as low as possible. 6. Write about channel capacity? The channel capacity of the discrete memoryless channel is given as maximum average mutual information. The maximization is taken with respect to input probabilities P(xi) C=max I(x; y) {P (xi)} 7. What is the channel capacity of a BSC and BEC? For BSC the channel capacity C=1+plog2 p + (1-p) log2 (1-p). For BEC the channel capacity C= (1-p) 8. State the channel coding theorem for a discrete memoryless Channel. [Dec-03] Given a source of M equally likely messages, with M>>1,which is generating information at a rate R.Given channel with capacity C.Then if, R C There exists a coding technique such that the output of the source may be transmitted over the channel with a probability of error in the received message which may be made arbitrarily small. 9. What is the channel capacity of a discrete signal? (APRIL/MAY-2004) (NOV/DEC-2006), (April/May-2008) The channel capacity of a discrete signal C= max I(X,Y) P(xi) I(X,Y)-mutual information.

2 10. What is the channel capacity of binary symmetric channel with error probability of 0.2?[Nov-03] W.K.T P=0.2, Hence 1-P=0.8 Channel capacity for binary symmetric channel C=1+Plog2P+ (1-P) log2 (1-P) =1+ 0.2log log2 0.8 = C=0.278 bits/message. 11. What happens when the number of coding alphabet increases? When the number of coding alphabet increases the efficiency of the coding technique decreases. 12. Prove that I (x i x j ) = I(x i ) + I(x j ) if x i and x j are independent. If x i and x j are independent. P (x i x j ) = P(x i ) P(x j ) I (x i x j ) = log1/p(x i x j ) =log 1/ P(x i ) P(x j ) =I(x i ) + I(x j ) 13. Prove that the following, I(X; Y) =H(X) +H(Y)-H(X, Y) We know the relation H(X, Y) =H(X/Y) +H(Y) There fore H(X/Y) =H(X, Y) -H(Y) (1) Mutual information is given by I(X; Y) =H(X) - H(X/ Y) (2) Substituting equation (1) in (2) I(X; Y) =H(X) + H(Y) - H(X/ Y) Thus the required relation is proved. 14. What is channel diagram and channel matrix? The transition probability diagram of the channel is called the channel diagram and its matrix representation is called the channel matrix. 15. What is meant by Source encoding? The efficient representation of data generated by a discrete source. This process is called Source coding. The device that performs the representation is called a source encoder. 16. Write Source encoding theorem? Given a discrete memoryless source of entropy H(x),the average code word length for any distortion less source encoding is bounded as H(x) Here the entropy H(x) represents the fundamental limit on the average number of bits per source symbol (). 17. Name the source coding techniques.[nov-04] Prefix coding or instantaneous coding Shannon fano coding Huffman coding.

3 18. What is meant by prefix code?[dec-03] Prefix coding is variable length coding algorithm. It assigns binary digits to the messages as per their probabilities of occurance.prefix of the codeword means any sequence which is initial part of the code word. A prefix code is defined as a code in which no code word is the prefix of any other code word. 19. Explain Shannon-Fano coding. (NOV/DEC-2003) An efficient code can be obtained by the following simple procedure, known as Shannon- Fano algorthim. List the source symbols in order of decreasing probability. Partition the set into two sets that are as close to equiprobable as possible, and sign 0 to the upper set and 1 to the lower set. Continue this process, each time partitioning the sets with as nearly equal probabilities as possible until further partitioning is not possible. 20. What are the types of Correlation? The types of Correlation are Cross Correlation and Auto Correlation 21. What is the difference between Correlation and Convolution? (Apr/May2010) In Correlation physical time t is dummy variable and it disappears after solution of an integral. But in convolution ι is a dummy variable. Convolution is a function of delay parameter t but convolution is a function of t. Convolution is commutative but correlation is noncom mutative. 22. Define Signal. Signal is defined as any physical quantity carrying information that varies with time. The value of signal may be real or complex. The types of signal are continuous signal and discrete time signal. 23. Define entropy. (APRIL/MAY-2004) (NOV/DEC-2006) (APRIL/MAY-2012) Entropy is the measure of the average information content per source symbol in a particular interval. It is given by the Expression H(X)= I P(xi)log 2 P(xi) bits/sample. Here P is the probability of occurrence of Kth message. 24. A Source is emitting symbols x1, x2 and x3 with probabilities, respectively 0.6, 0.3, and 0.1.What is the entropy of the source?[nov-03] Let p1=0.6, p2=0.3, p3=0.1 H(X)= I P(xi)log 2 P(xi) = 0.6 log 2 (0.6) log 2 (0.3) +0.3 log 2 (0.3) 25. Define mutual information. (April/May-2008) The mutual information is defined as the amount of information transferred when Xi is transmitted and YJ is received. It is represented by I(Xi, YJ) and given as, I(X,Y)=H(X)-H(X/Y) bits/symbol H(X)- entropy of the source H(X/Y)- conditional entropy of Y. 26. State the properties of mutual information. (APRIL/MAY-2005), (May/June-2010) I(X,Y)=I(Y,X) I(X,Y)>=0 I(X,Y)=H(Y)-H(Y/X) I(X,Y)=H(X)+H(Y)-H(X,Y).

4 27. What is amount of information? The amount of information gained after observing the event S=S K, which occurs with probability P K, as the logarithmic function. Amount of information I(S K )=Log(1/P K ) Unit of information is bit. 28. What is mean by one bit? One bit is the amount of information that use we gain, when one of two possible and equally likely (equal-probability) events occurs. 29. Give the relation between the different entropies. H(X,Y)=H(X)+H(Y/X)=H(Y)+H(X/Y) H(X)- entropy of the source,h(y/x),h(x/y)-conditional entropy H(Y)-entropy of destination H(X,Y)- Joint entropy of the source and destination 30. Define information rate. (NOV/DEC-2006) (APRIL/MAY-2007) It is the time rate at which source X emits symbols is r symbols per second (or) the average number of bits of information per second. The information rate R of the source is given by R=r H(X) bits/second H(X)- entropy of the source, r is rate at which messages are generated. 31. What is data compaction? For efficient signal transmission the redundant information must be removed from the signal prior to transmission.this operation with no loss of information is ordinarily performed on a signal in digital form and is referred to as data compaction or lossless data compression. 32. State the property of entropy. 1.0< H(X) < log 2 K, is the radix of the alphabet X of the source. 33. What is differential entropy? The average amount of information per sample value of x(t) is measured by H(X)= - f x (x)log f x (x)dx bit/sample H(X) differential entropy of X. 34. What is source coding and entropy coding? (NOV/DEC-2004, Apr2010) The conversion of the output of a DMS into a sequence of binary symbols is called source coding. he design of a variable length code such that its average cod word length approaches the entropy of the DMS is often referred to as entropy coding. 35. State Shannon Hartley theorem or Channel capacity theorem for a continuous channel. (Apr/May2012) The capacity C of a additive Gaussian noise channel is C=B log 2 (1+S/N) B= channel bandwidth,s/n=signal to noise ratio. 36. What is the entropy of a binary memory-less source? (APRIL/MAY-2009), (Nov/Dec-2010) The entropy of a binary memory-less source H(X)=-p 0 log 2 p 0 -(1-p 0 )log 2 (1-p 0 ) p 0- probability of symbol 0,p1=(1- p 0 ) =probability of transmitting symbol Give the relation between the different entropies. H(X; Y) =H(X) +H(Y/X) =H(Y) +H(X/Y) H(X) - entropy of the source(y/x), H(X/Y)-conditional entropy H(Y)-entropy of destination H(X, Y) - Joint entropy of the source and destination.

5 38. How is the efficiency of the coding technique measured? Efficiency of the code =H(X) /L 39. What is discrete memory less source? The symbols emitted by the source during successive signaling intervals are statistically independent. That source is called discrete memory less source. Here memoryless, means that the symbol emitted any time is independent of previous choices. 40. Define rate of information transmission across the channel. Rate of information transmission across the channel is given as, Dt= [H(X)-H(X/Y)] r bits/sec Here H(X) is the entropy of the source. H(X/Y) is the conditional entropy. 41. For an AWGN channel with 4 KHz band width and noise Power Spectral Density,the signal power required at the Receiver is 0.1 mw.calculate capacity of this channel. The equation of the channel capacity C=B log 2 (1+S/N)Bits/sec. B= 4000 Hz S=0.1x10-3 W And noise power can be obtained as, But N=N0B=10-12x2x4000=8x10-9 W PART-B 1. Explain the procedure of Shannon Fano Coding Algorithm and Huffman Coding algorithm.(april/may-2004),(april/may-2005),(nov/dec-2006),(may/june- 2010),(Nov/Dec-2009) P.No T Source coding definition Types of source coding Shannon Fano coding Algorithm - steps Huffman Coding algorithm steps 2. State and prove the properties of mutual information. P.No T Mutual Information definition Properties of mutual information with proof. 3. Explain the different types of channel. P.No T Calculate the capacity of a Gaussian channel.(april/may-2005),(april/may-2004). P.No T Gaussian Channel Capacity Explanation

6 5. Find the channel capacity of binary erasure channel P (x1 ) = αα (April/May-2008), (May/June-2010), (Nov/Dec-2007). P.No T Binary Erasure Channel Capacity Explanation 6. Draw the channel diagram of the binary Erasure channel and get the channel matrix. P.No T Binary Erasure Channel Capacity Explanation Draw the channel diagram Obtain channel matrix 7. Explain the information capacity theorem(april/may-2005). P.No T Information Capacity theorem Statement Proof 8. Explain BSC,BEC(Nov/Dec-2008). P.No T Binary erasure channel definition Binary symmetric channel definition REFERENCE BOOKS: Communication systems Simon Haykin T1

MAHALAKSHMI ENGINEERING COLLEGE-TRICHY QUESTION BANK UNIT V PART-A. 1. What is binary symmetric channel (AUC DEC 2006)

MAHALAKSHMI ENGINEERING COLLEGE-TRICHY QUESTION BANK SATELLITE COMMUNICATION DEPT./SEM.:ECE/VIII UNIT V PART-A 1. What is binary symmetric channel (AUC DEC 2006) 2. Define information rate? (AUC DEC 2007)