UNIT 1 - INFORMATION THEORY

For M equally likely messages, the average amount of information H is

• H = log₁₀M

• H = log₂M

• H = log₁₀M²

• H = 2log₁₀M

The channel capacity is

• The maximum information transmitted by one symbol over the channel

• Information contained in a signal

• The amplitude of the modulated signal

• All of the above

Tags

NGSS.HS-PS4-5

According to Shannon Hartley theorem,

• The channel capacity becomes infinite with infinite bandwidth

• The channel capacity does not become infinite with infinite bandwidth

• Has a tradeoff between bandwidth and Signal to noise ratio

• The channel capacity does not become infinite with infinite bandwidth and has a tradeoff between bandwidth and Signal to noise ratio

The channel capacity according to Shannon's equation is

• Maximum error free communication

• Defined for optimum system

• Information transmitted

• All of the above

Tags

NGSS.HS-PS4-5

The technique that may be used to increase average information per bit is

• Shannon-Fano algorithm

• ASK

• FSK

• Digital modulation techniques

Tags

NGSS.HS-PS4-2

Code rate r, k information bits and n as total bits, is defined as

• r = k/n

• k = n/r

• r = k * n

• n = r * k

Information rate is defined as

• Information per unit time

• Average number of bits of information per second

• rH

• All of the above

Tags

NGSS.HS-PS4-2

NGSS.HS-PS4-5

The mutual information

• Is symmetric

• Always non negative

• Is symmetric & Always non negative

• None of the above

Entropy is

• Average information per message

• Information in a signal

• Amplitude of signal

• All of the above

The memory less source refers to

• No previous information

• No message storage

• Emitted message is independent of previous message

• None of the above