跳到主要内容

京都大学 情報学研究科 通信情報システム専攻 2024年8月実施 専門基礎A [A-3]

Author

SUN, 祭音Myyura (assisted by ChatGPT 5.4 Thinking)

Description

Answer all the following questions.

(1)

Consider a weather forecast which predicts the weather with two values: sunny and rainy. Let XX and YY denote random variables which represent the actual weather and the forecasted weather, respectively. The joint probability distribution of XX and YY, PXYP_{XY}, is given as shown in Table 1. Answer the following questions. Use Table 2 to calculate the logarithm.

Table 1: Joint probability distribution of XX and YY

Actual weather XX / Forecasted weather YYSunnyRainy
Sunny0.450.20
Rainy0.150.20

Table 2: Logarithm table

ExpressionValue
log23\log_2 31.58
log25\log_2 52.32
log27\log_2 72.81
log211\log_2 113.46
log213\log_2 133.70
log217\log_2 174.09
log219\log_2 194.25

(a) Find the entropy of XX, H(X)H(X), and the entropy of YY, H(Y)H(Y).

(b) Find the conditional entropy H(XY)H(X|Y).

(c) Find the joint entropy H(X,Y)H(X,Y).

(d) Find the mutual information of XX and YY, I(X;Y)I(X;Y).

(e) Explain whether the above weather forecast is useful compared to the case of always predicting sunny, by using the forecast accuracy and the mutual information.

(2)

Answer the following questions on additive binary communication channels. The entropy function H(x)\mathcal{H}(x) may be used.

(a) Find the transition probability matrix of the Markov information source represented by the state transition diagram using probabilities PP, QQ and states s0s_0, s1s_1 below. This state transition diagram shows, for example, that the probability of transition from state s0s_0 to state s1s_1 is PP and that 1 is output at that time.

The state transition diagram corresponds to:

  • s0s0s_0 \to s_0: output 00, probability 1P1-P
  • s0s1s_0 \to s_1: output 11, probability PP
  • s1s0s_1 \to s_0: output 00, probability QQ
  • s1s1s_1 \to s_1: output 11, probability 1Q1-Q

(b) Find the stationary distribution of the Markov information sources in Question (a).

(c) Find the bit error rate of the additive binary communication channel whose error source SES_E is the Markov information source in Question (a).

(d) Find the communication channel capacity of the additive binary communication channel in Question (c).

题目描述

回答全部问题。

  1. 天气预报只取晴、雨两值。随机变量 X,YX,Y 分别表示实际天气和预报天气,其联合分布为:

    实际 XX / 预报 YY
    0.450.20
    0.150.20

    可使用:

    表达式
    log23\log_2 31.58
    log25\log_2 52.32
    log27\log_2 72.81
    log211\log_2 113.46
    log213\log_2 133.70
    log217\log_2 174.09
    log219\log_2 194.25
    1. H(X)H(X)H(Y)H(Y)
    2. 求条件熵 H(XY)H(X\mid Y)
    3. 求联合熵 H(X,Y)H(X,Y)
    4. 求互信息 I(X;Y)I(X;Y)
    5. 从预测准确率与互信息两个角度,说明该预报相较于“总是预报晴天”是否有用。
  2. 关于加性二元通信信道,可使用熵函数 H(x)\mathcal H(x)

    1. 某 Markov 错误源有状态 s0,s1s_0,s_1,转移/输出为:

      • s0s0s_0\to s_0:输出 0,概率 1P1-P
      • s0s1s_0\to s_1:输出 1,概率 PP
      • s1s0s_1\to s_0:输出 0,概率 QQ
      • s1s1s_1\to s_1:输出 1,概率 1Q1-Q

      写出其转移概率矩阵。

    2. 求该 Markov 信息源的平稳分布。

    3. 若它作为加性二元信道的错误源 SES_E,求比特错误率。

    4. 求该加性二元通信信道的信道容量。

Kai

(1)

Given the joint distribution:

  • P(X=Sunny,Y=Sunny)=0.45P(X=\text{Sunny},Y=\text{Sunny})=0.45
  • P(X=Sunny,Y=Rainy)=0.20P(X=\text{Sunny},Y=\text{Rainy})=0.20
  • P(X=Rainy,Y=Sunny)=0.15P(X=\text{Rainy},Y=\text{Sunny})=0.15
  • P(X=Rainy,Y=Rainy)=0.20P(X=\text{Rainy},Y=\text{Rainy})=0.20

So the marginals are:

P(X=Sunny)=0.65,P(X=Rainy)=0.35P(X=\text{Sunny})=0.65,\quad P(X=\text{Rainy})=0.35
P(Y=Sunny)=0.60,P(Y=Rainy)=0.40P(Y=\text{Sunny})=0.60,\quad P(Y=\text{Rainy})=0.40

(a)

H(X)=ipilog21pi=0.65log210.65+0.35log210.35=0.9315 bits/symbol\begin{aligned} H(X)&=\sum_i p_i\log_2\frac{1}{p_i} \\ &=0.65\log_2\frac{1}{0.65}+0.35\log_2\frac{1}{0.35} \\ &=0.9315\ \text{bits/symbol} \end{aligned}
H(Y)=ipilog21pi=0.6log210.6+0.4log210.4=0.972 bits/symbol\begin{aligned} H(Y)&=\sum_i p_i'\log_2\frac{1}{p_i'} \\ &=0.6\log_2\frac{1}{0.6}+0.4\log_2\frac{1}{0.4} \\ &=0.972\ \text{bits/symbol} \end{aligned}

(b)

H(XY)=ip(yi)H(XY=yi)H(X|Y)=\sum_i p(y_i)\,H(X|Y=y_i)
P(XY=Sunny)=(0.450.60,0.150.60)=(34,14)P(X|Y=\text{Sunny})=\left(\frac{0.45}{0.60},\frac{0.15}{0.60}\right)=\left(\frac{3}{4},\frac{1}{4}\right)
P(XY=Rainy)=(0.200.40,0.200.40)=(12,12)P(X|Y=\text{Rainy})=\left(\frac{0.20}{0.40},\frac{0.20}{0.40}\right)=\left(\frac{1}{2},\frac{1}{2}\right)
H(XY)=0.6×H(34,14)+0.4×H(12,12)=0.88 bits/symbol\begin{aligned} H(X|Y)&=0.6\times H\left(\frac{3}{4},\frac{1}{4}\right)+0.4\times H\left(\frac{1}{2},\frac{1}{2}\right) \\ &=0.88\ \text{bits/symbol} \end{aligned}

(c)

H(X,Y)=x,yp(x,y)log21p(x,y)=0.45log210.45+0.15log210.15+0.4log210.2=1.861 bits/symbol\begin{aligned} H(X,Y)&=\sum_{x,y}p(x,y)\log_2\frac{1}{p(x,y)} \\ &=0.45\log_2\frac{1}{0.45}+0.15\log_2\frac{1}{0.15}+0.4\log_2\frac{1}{0.2} \\ &=1.861\ \text{bits/symbol} \end{aligned}

(d)

I(X;Y)=H(X)H(XY)=0.0425 bits/symbolI(X;Y)=H(X)-H(X|Y)=0.0425\ \text{bits/symbol}

(e)

Forecast accuracy:

P(X^=X)=P(X=Sunny,Y=Sunny)+P(X=Rainy,Y=Rainy)=0.45+0.20=0.65\begin{aligned} P(\hat X = X)&=P(X=\text{Sunny},Y=\text{Sunny})+P(X=\text{Rainy},Y=\text{Rainy}) \\ &=0.45+0.20=0.65 \end{aligned}

Always-sunny accuracy:

P(X=Sunny)=0.65P(X=\text{Sunny})=0.65
  • Forecast acc: 65%
  • Always sunny acc: 65%

Therefore, the given forecast does not improve the accuracy compared with always predicting sunny.

On the other hand, the mutual information is

I(X;Y)0.04 bits,I(X;Y)\approx 0.04 \text{ bits},

which is positive. This means that the forecast still contains some information about the actual weather. However, the amount of information is very small.

Hence, this forecast is not useful in terms of prediction accuracy, because it is no better than always predicting sunny, and it is only weakly informative in terms of mutual information.

(2)

(a)

[1PPQ1Q]\begin{bmatrix} 1-P & P \\ Q & 1-Q \end{bmatrix}

(b)

{π0=(1P)π0+Qπ1π1=Pπ0+(1Q)π1π0+π1=1{π0=QP+Qπ1=PP+Q\begin{cases} \pi_0 = (1-P)\pi_0 + Q\pi_1 \\ \pi_1 = P\pi_0 + (1-Q)\pi_1 \\ \pi_0 + \pi_1 = 1 \end{cases} \quad\Rightarrow\quad \begin{cases} \pi_0 = \dfrac{Q}{P+Q} \\ \pi_1 = \dfrac{P}{P+Q} \end{cases}

(c)

For the additive channel, the error bit is SE=1S_E=1. In steady state:

Rerror=P(SE=1)=π1=PP+QR_{\text{error}} = P(S_E=1)=\pi_1=\dfrac{P}{P+Q}

(d)

C=1Hˉ(SE),C = 1 - \bar H(S_E),

where Hˉ(SE)\bar H(S_E) is the entropy rate of the Markov noise source.

With stationary probabilities π0=QP+Q\pi_0=\dfrac{Q}{P+Q}, π1=PP+Q\pi_1=\dfrac{P}{P+Q}, the entropy rate is

Hˉ(SE)=π0H(P)+π1H(Q),\bar H(S_E)=\pi_0\,H(P)+\pi_1\,H(Q),

so

C=1(QP+QH(P)+PP+QH(Q)),C = 1-\left(\frac{Q}{P+Q}H(P)+\frac{P}{P+Q}H(Q)\right),