Scribd
Upload
53 views2 pages

Qbank Test1

This document covers several topics in information theory including: 1. Defining key concepts like entropy, information rate, and Shannon's channel capacity theorem. 2. Calculating the entropy of discrete memoryless sources with given probabilities of messages. 3. Comparing channel coding and line coding for digital communication, with examples of line codes. 4. Discussing linear block codes through examples of parity check matrices, calculating generator matrices, encoding and decoding codewords, and error detection capabilities.

Uploaded by

tejalsshinde
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
53 views2 pages

Qbank Test1

This document covers several topics in information theory including: 1. Defining key concepts like entropy, information rate, and Shannon's channel capacity theorem. 2. Calculating the entropy of discrete memoryless sources with given probabilities of messages. 3. Comparing channel coding and line coding for digital communication, with examples of line codes. 4. Discussing linear block codes through examples of parity check matrices, calculating generator matrices, encoding and decoding codewords, and error detection capabilities.

Uploaded by

tejalsshinde
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

Information Theory

1. Define
Information rate
Entropy
Shannon Theorem on Channel Capacity
Shannon Hartley Theorem.
2. Derive expression for Entropy. Consider 6 messages ith pro!a!ilities ".2# ".2$# ".1$#
".1# ".2# and ".1. Calc%late Entropy of so%rce.
&. ' D(S has an alpha!et of $ sym!ols ith pro!a!ilities shon !elo. Constr%ct Shannon)*ano
and H%ffman code and calc%late entropy code efficiency of code.
Sym!ol (1 (2 (& (+ ($
,ro!a!ility ".+ ".1- ".16 ".1$ ".1$
+. Define Entropy and Information rate of Discrete (emoryless so%rce. Consider a D(S ith a
so%rce alpha!et .s"#s1#s2/ and so%rce statistics .".0#".1$#".1$/.
*ind1
Information content of message
Entropy of D(S
Information rate of D(S if it generates message at rate of +2 messages3second.
$. Define entropy and information rate. Consider 6 messages ith pro!a!ilities ".2# ".2$# ".1$# ".1#
".2# and ".1. Calc%late Entropy of so%rce.
6. ' 4a%ssian channel has 2 (H5 !andidth. Calc%late the channel capacity if signal poer to
noise spectral density ratio is 1"
$
H5. 'lso find the maxim%m information rate.
0. Compare Channel coding and line coding.
6. 7hy line codes are re8%ired in digital comm%nication9 Dra line line codes for
"11"1""1 %sing
a: ,olar ;5 !: ,olar <;5 c: =nipolar ;5 d: =nipolar <;5 e: >ipolar <;5 ?'(I:
f: Differential (anchester
Linear block codes
1. 'n error control code has folloing parity chec@ matrix

a: Determine the generator matrix
!: *ind codeord that !egin ith 1"1
c: Decode the received codeord 1 1 " 1 1 "
d: Comment on error detection capa!ility of this code.
2. The parity chec@ matrix of a partic%lar ?0# +: linear !loc@ code is given !y

a: Determine the generator matrix
!: Aist all code ords.
c: 7hat is minim%m distance !eteen code ords.
d: Ho many errors can !e detected9 Ho many can !e corrected9
&. 7rite a short note on hamming code# Extended Hamming code and Shortened Hamming
code.
+. *or a ?6#&:systematic linear !loc@ code the parity chec@ !its are given as
a: *ind 4enerator and ,arity chec@ matrix
!: B!tain code vectors
c: *ind error detecting and correction capa!ilities of this code
d: Decode received ords """111 and """11".
$. The parity chec@ !its of a ?6# +: !loc@ code are generated !y
a: *ind 4enerator and ,arity chec@ matrix
!: *ind minim%m eight of this code
c: *ind error detecting capa!ility of this code

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy