Aufgaben:Exercise 5.3Z: Analysis of the BSC Model: Difference between revisions
From LNTwww
No edit summary |
Fix interlanguage link: resolve redirect chain |
||
| (14 intermediate revisions by 5 users not shown) | |||
| Line 1: | Line 1: | ||
{{quiz-Header|Buchseite= | {{quiz-Header|Buchseite=Digital_Signal_Transmission/Binary_Symmetric_Channel_(BSC)}} | ||
[[File:P_ID1832__Dig_Z_5_3.png|right|frame| | [[File:P_ID1832__Dig_Z_5_3.png|right|frame|The given error sequence]] | ||
We consider two different BSC models with the following parameters: | |||
* | * Model $M_1 \text{:} \hspace{0.4cm} p = 0.01$, | ||
* | * Model $M_2 \text{:} \hspace{0.4cm} p = 0.02$. | ||
The graph shows an error sequence of length $N = 1000$, but it is not known from which of the two models this sequence originates. | |||
The two models are to be analyzed on the basis of | |||
* | * the '''error distance probabilities''' | ||
:$${\rm Pr}(a = k) = (1-p)^{k-1}\cdot p \hspace{0.05cm},$$ | :$${\rm Pr}(a = k) = (1-p)^{k-1}\cdot p \hspace{0.05cm},$$ | ||
* | * the '''error distance distribution''' $\rm (EDD)$ | ||
:$$V_a(k) = {\rm Pr}(a \ge k) = (1-p)^{k-1}\hspace{0.05cm},$$ | :$$V_a(k) = {\rm Pr}(a \ge k) = (1-p)^{k-1}\hspace{0.05cm},$$ | ||
* | * the '''error correlation function''' $\rm (ECF)$ | ||
:$$\varphi_{e}(k) \hspace{-0.1cm} \ = \ \hspace{-0.1cm} {\rm | :$$\varphi_{e}(k) \hspace{-0.1cm} \ = \ \hspace{-0.1cm} {\rm E}\big[e_{\nu} \cdot e_{\nu + k}\big] \ \ = \ \\left\{ \begin{array}{c} p \\p^2 \end{array} \right.\quad\begin{array}{*{1}c} f{\rm or }\hspace{0.15cm}k = 0 \hspace{0.05cm},\\ f{\rm or }\hspace{0.15cm} k \ne 0 \hspace{0.05cm}.\\ \end{array}$$ | ||
E}[e_{\nu} \cdot e_{\nu + k}] \ \ = \ \ | |||
\begin{array}{*{1}c} f{\rm | |||
\\ f{\rm | |||
Notes: | |||
* | * The exercise belongs to the chapter [[Digital_Signal_Transmission/Binary_Symmetric_Channel_(BSC)| "Binary Symmetric Channel"]]. | ||
*By counting, we would see that the error sequence of length $N = 1000$ contains exactly $22$ "ones". | |||
=== | |||
===Questions=== | |||
<quiz display=simple> | <quiz display=simple> | ||
{ | {Which parameters can be used to infer the mean error probability $p_{\rm M}$ of the BSC model? | ||
|type="[]"} | |type="[]"} | ||
+ | + ECF value $\varphi_e(k = 0)$, | ||
+ | + ECF value $\varphi_e(k = 10)$, | ||
- | - EDD value $V_a(k = 1)$, | ||
+ | + EDD value $V_a(k = 2)$, | ||
+ | + EDD value $V_a(k = 10)$. | ||
{ | {From which model does the given error sequence originate? | ||
|type=" | |type="()"} | ||
- | - Model $M_1$, | ||
+ | + model $M_2$. | ||
{ | {What is the mean error distance of model $M_1$? | ||
|type="{}"} | |type="{}"} | ||
$E[a] \ = \ ${ 10 3% } | ${\rm E}\big[a\big] \ = \ ${ 10 3% } | ||
{ | {What are the following probabilities for model $M_1$? | ||
|type="{}"} | |type="{}"} | ||
${\rm Pr}(a = 1) \ = \ ${ 0.1 3% } | ${\rm Pr}(a = 1) \ = \ ${ 0.1 3% } | ||
${\rm Pr}(a = 2) \ = \ ${ 0.09 3% } | ${\rm Pr}(a = 2) \ = \ ${ 0.09 3% } | ||
${\rm Pr}(a = E[a]) \ = \ ${ 0.0387 3% } | ${\rm Pr}(a = {\rm E}\big[a\big]) \ = \ ${ 0.0387 3% } | ||
{ | {Calculate the following values of the error distance distribution for model $M_1$: | ||
|type="{}"} | |type="{}"} | ||
$V_a(k = 2) \ = \ ${ 0.9 3% } | $V_a(k = 2) \ = \ ${ 0.9 3% } | ||
| Line 64: | Line 60: | ||
</quiz> | </quiz> | ||
=== | ===Solution=== | ||
{{ML-Kopf}} | {{ML-Kopf}} | ||
'''(1)''' | '''(1)''' In the BSC model, the mean error probability $p_{\rm M}$ is always equal to the characteristic probability $p$. | ||
:$$\varphi_{e}(k) = | |||
*For the error correlation function and the error distance distribution are valid | |||
:$$\varphi_{e}(k) =\left\{ \begin{array}{c} p \\p^2 \end{array} \right.\quad\begin{array}{*{1}c} f{\rm or }\hspace{0.15cm}k = 0 \hspace{0.05cm},\\ f{\rm or }\hspace{0.15cm} k \ne 0 \hspace{0.05cm},\\ \end{array}$$ | |||
\begin{array}{*{1}c} f{\rm | :$$V_a(k) = (1-p)^{k-1}\hspace{0.05cm}.$$ | ||
\\ f{\rm | |||
*$p$ can be determined from all the given characteristics, except $V_a(k = 1)$. This EDD value is independent of $p$ equal to $(1–p)^0 = 1$. | |||
*Therefore, the <u>solutions 1, 2, 4 and 5</u> are correct. | |||
'''(2)''' The relative error frequency of the given sequence is equal to $h_{\rm F} = 22/1000 \approx 0.022$. | |||
*It is quite obvious that the error sequence was generated by the model $M_2$ ⇒ $p_{\rm M} = 0.02$. | |||
*Because of the short sequence, $h_{\rm F}$ does not match $p_{\rm M}$ exactly, but at least approximates ⇒ <u>solution 2</u>. | |||
'''( | '''(3)''' The mean error distance – that is, the expected value of the random variable $a$ – is equal to the inverse of the mean error probability ⇒ | ||
:$${\rm E}\big[a\big] = 1/0.1 \ \underline {= 10}.$$ | |||
'''(4)''' According to the equation ${\rm Pr}(a = k) = (1–p)^{k–1} \cdot p$ we obtain: | |||
:$${\rm Pr}(a = 1) \hspace{0.15cm}\underline {=0.1}\hspace{0.05cm},$$ | |||
:$${\rm Pr}(a = 2) = 0.9 \cdot 0.1\hspace{0.15cm}\underline {= 0.09}\hspace{0.05cm},$$ | |||
:$${\rm Pr}(a = {\rm E}[a]) \hspace{-0.1cm} \ = \ \hspace{-0.1cm}{\rm Pr}(a = 10)= 0.9^9 \cdot 0.1 \hspace{0.15cm}\underline {= 0.0387}\hspace{0.05cm}.$$ | |||
'''(5)''' | '''(5)''' From the relation $V_a(k) = (1–p)^{k–1}$ we obtain | ||
:$$V_a(k = 2) \hspace{-0.1cm} \ = \ \hspace{-0.1cm} 0.9^1 \hspace{0.15cm}\underline {= 0.9 } \hspace{0.3cm} | :$$V_a(k = 2) \hspace{-0.1cm} \ = \ \hspace{-0.1cm} 0.9^1 \hspace{0.15cm}\underline {= 0.9 } \hspace{0.3cm}\Rightarrow \hspace{0.3cm}{\rm Pr}(a = 1) = V_a(k =1) - V_a(k = 2)= 0.1\hspace{0.05cm},$$ | ||
\Rightarrow \hspace{0.3cm}{\rm Pr}(a = 1) = V_a(k = | :$$V_a(k = 10)\hspace{-0.1cm} \ = \ \hspace{-0.1cm} 0.9^9\hspace{0.15cm}\underline {=0.3874}\hspace{0.05cm},\hspace{0.2cm}V_a(k = 11)= 0.9^{10}\hspace{0.15cm}\underline {=0.3487}.$$ | ||
1) - V_a(k = 2) | *To check in comparison with subtask '''(4)''': | ||
= 0.1\hspace{0.05cm},$$ | :$${\rm Pr}(a = 10) = V_a(k = 10) - V_a(k =11) = 0.3874 - 0.3487 {= 0.0387}\hspace{0.05cm}.$$ | ||
:$$V_a(k = 10)\hspace{-0.1cm} \ = \ \hspace{-0.1cm} 0.9^9 | |||
\hspace{0.15cm}\underline {=0.3874}\hspace{0.05cm},\hspace{0.2cm}V_a(k = 11)= 0.9^{10} | |||
\hspace{0.15cm}\underline {=0.3487}.$$ | |||
:$${\rm Pr}(a = 10) = V_a(k = 10) - V_a(k = | |||
11) = 0.3874 - 0.3487 {= 0.0387}\hspace{0.05cm}.$$ | |||
{{ML-Fuß}} | {{ML-Fuß}} | ||
| Line 107: | Line 103: | ||
[[Category: | [[Category:Digital Signal Transmission: Exercises|^5.2 Binary Symmetric Channel^]] | ||
[[de:Aufgaben:Aufgabe 5.3Z: Analyse des BSC-Modells]] | |||
Latest revision as of 17:54, 16 March 2026

We consider two different BSC models with the following parameters:
- Model $M_1 \text{:} \hspace{0.4cm} p = 0.01$,
- Model $M_2 \text{:} \hspace{0.4cm} p = 0.02$.
The graph shows an error sequence of length $N = 1000$, but it is not known from which of the two models this sequence originates.
The two models are to be analyzed on the basis of
- the error distance probabilities
- $${\rm Pr}(a = k) = (1-p)^{k-1}\cdot p \hspace{0.05cm},$$
- the error distance distribution $\rm (EDD)$
- $$V_a(k) = {\rm Pr}(a \ge k) = (1-p)^{k-1}\hspace{0.05cm},$$
- the error correlation function $\rm (ECF)$
- $$\varphi_{e}(k) \hspace{-0.1cm} \ = \ \hspace{-0.1cm} {\rm E}\big[e_{\nu} \cdot e_{\nu + k}\big] \ \ = \ \\left\{ \begin{array}{c} p \\p^2 \end{array} \right.\quad\begin{array}{*{1}c} f{\rm or }\hspace{0.15cm}k = 0 \hspace{0.05cm},\\ f{\rm or }\hspace{0.15cm} k \ne 0 \hspace{0.05cm}.\\ \end{array}$$
Notes:
- The exercise belongs to the chapter "Binary Symmetric Channel".
- By counting, we would see that the error sequence of length $N = 1000$ contains exactly $22$ "ones".
Questions
Solution
(1) In the BSC model, the mean error probability $p_{\rm M}$ is always equal to the characteristic probability $p$.
- For the error correlation function and the error distance distribution are valid
- $$\varphi_{e}(k) =\left\{ \begin{array}{c} p \\p^2 \end{array} \right.\quad\begin{array}{*{1}c} f{\rm or }\hspace{0.15cm}k = 0 \hspace{0.05cm},\\ f{\rm or }\hspace{0.15cm} k \ne 0 \hspace{0.05cm},\\ \end{array}$$
- $$V_a(k) = (1-p)^{k-1}\hspace{0.05cm}.$$
- $p$ can be determined from all the given characteristics, except $V_a(k = 1)$. This EDD value is independent of $p$ equal to $(1–p)^0 = 1$.
- Therefore, the solutions 1, 2, 4 and 5 are correct.
(2) The relative error frequency of the given sequence is equal to $h_{\rm F} = 22/1000 \approx 0.022$.
- It is quite obvious that the error sequence was generated by the model $M_2$ ⇒ $p_{\rm M} = 0.02$.
- Because of the short sequence, $h_{\rm F}$ does not match $p_{\rm M}$ exactly, but at least approximates ⇒ solution 2.
(3) The mean error distance – that is, the expected value of the random variable $a$ – is equal to the inverse of the mean error probability ⇒
- $${\rm E}\big[a\big] = 1/0.1 \ \underline {= 10}.$$
(4) According to the equation ${\rm Pr}(a = k) = (1–p)^{k–1} \cdot p$ we obtain:
- $${\rm Pr}(a = 1) \hspace{0.15cm}\underline {=0.1}\hspace{0.05cm},$$
- $${\rm Pr}(a = 2) = 0.9 \cdot 0.1\hspace{0.15cm}\underline {= 0.09}\hspace{0.05cm},$$
- $${\rm Pr}(a = {\rm E}[a]) \hspace{-0.1cm} \ = \ \hspace{-0.1cm}{\rm Pr}(a = 10)= 0.9^9 \cdot 0.1 \hspace{0.15cm}\underline {= 0.0387}\hspace{0.05cm}.$$
(5) From the relation $V_a(k) = (1–p)^{k–1}$ we obtain
- $$V_a(k = 2) \hspace{-0.1cm} \ = \ \hspace{-0.1cm} 0.9^1 \hspace{0.15cm}\underline {= 0.9 } \hspace{0.3cm}\Rightarrow \hspace{0.3cm}{\rm Pr}(a = 1) = V_a(k =1) - V_a(k = 2)= 0.1\hspace{0.05cm},$$
- $$V_a(k = 10)\hspace{-0.1cm} \ = \ \hspace{-0.1cm} 0.9^9\hspace{0.15cm}\underline {=0.3874}\hspace{0.05cm},\hspace{0.2cm}V_a(k = 11)= 0.9^{10}\hspace{0.15cm}\underline {=0.3487}.$$
- To check in comparison with subtask (4):
- $${\rm Pr}(a = 10) = V_a(k = 10) - V_a(k =11) = 0.3874 - 0.3487 {= 0.0387}\hspace{0.05cm}.$$