Difference between revisions of "Aufgaben:Exercise 4.09: Decision Regions at Laplace"

From LNTwww
Line 69: Line 69:
 
===Questions===
 
===Questions===
 
<quiz display=simple>
 
<quiz display=simple>
{Welche der Entscheidungsregeln sind richtig? Entscheide für&nbsp; $m_0$, falls
+
{Which of the decision rules are correct? Decide for&nbsp; $m_0$, if
 
|type="[]"}
 
|type="[]"}
 
+ $p_{\it r\hspace{0.03cm}|\hspace{0.03cm}m}(\rho_1, \ \rho_2\hspace{0.03cm}|\hspace{0.03cm}m_0) > p_{\it r\hspace{0.03cm}|\hspace{0.03cm}m}(\rho_1, \ \rho_2\hspace{0.03cm}|\hspace{0.03cm}m_1)$,
 
+ $p_{\it r\hspace{0.03cm}|\hspace{0.03cm}m}(\rho_1, \ \rho_2\hspace{0.03cm}|\hspace{0.03cm}m_0) > p_{\it r\hspace{0.03cm}|\hspace{0.03cm}m}(\rho_1, \ \rho_2\hspace{0.03cm}|\hspace{0.03cm}m_1)$,
Line 75: Line 75:
 
- $L(\rho_1, \ \rho_2) = \rho_1 + \rho_2 &#8805; 0$.
 
- $L(\rho_1, \ \rho_2) = \rho_1 + \rho_2 &#8805; 0$.
  
{Wie lässt sich der Ausdruck&nbsp; $|x+1| \ -|x \ -1|$&nbsp; umformen?
+
{How can the expression&nbsp; $|x+1| \ -|x \ -1|$&nbsp; be transformed?
 
|type="[]"}
 
|type="[]"}
+ Für&nbsp; $x &#8805; +1$&nbsp; ist&nbsp; $|x + 1| \, -|x -1| = 2$.
+
+ For&nbsp; $x &#8805; +1$,&nbsp; &nbsp; $|x + 1| \, -|x -1| = 2$.
+ Für&nbsp; $x &#8804; \, -1$&nbsp; ist&nbsp; $|x+1| \,-|x \, -1| = \, -2$.
+
+ For&nbsp; $x &#8804; \, -1$,&nbsp; &nbsp; $|x+1| \,-|x \, -1| = \, -2$.
+ Für&nbsp; $-1 &#8804; x &#8804; +1$&nbsp; ist&nbsp; $|x+1| \, -|x \, -1| = 2x$.
+
+ For&nbsp; $-1 &#8804; x &#8804; +1$,&nbsp; &nbsp; $|x+1| \, -|x \, -1| = 2x$.
  
{Wie lautet die Entscheidungsregel im Bereich&nbsp; $-1 &#8804; \rho_1 &#8804; +1$,&nbsp; $-1 &#8804; \rho_2 &#8804; +1$?
+
{What is the decision rule in the range&nbsp; $-1 &#8804; \rho_1 &#8804; +1$,&nbsp; $-1 &#8804; \rho_2 &#8804; +1$?
 
|type="()"}
 
|type="()"}
+ Entscheidung für&nbsp; $m_0$, falls&nbsp; $\rho_1 + \rho_2 < 0$.
+
+ Decision for&nbsp; $m_0$, if&nbsp; $\rho_1 + \rho_2 < 0$.
- Entscheidung für&nbsp; $m_1$, falls&nbsp; $\rho_1 + \rho_2 < 0$.
+
- Decision for&nbsp; $m_1$, if&nbsp; $\rho_1 + \rho_2 < 0$.
  
{Wie lautet die Entscheidungsregel im Bereich&nbsp; $\rho_1 > +1$?
+
{What is the decision rule in the range&nbsp; $\rho_1 > +1$?
 
|type="()"}
 
|type="()"}
- Entscheidung für&nbsp; $m_0$&nbsp; im gesamten Bereich.
+
- Decision for&nbsp; $m_0$&nbsp; in the whole range.
+ Entscheidung für&nbsp; $m_1$&nbsp; im gesamten Bereich.
+
+ Decision for&nbsp; $m_1$&nbsp; in the whole range.
- Entscheidung für&nbsp; $m_0$&nbsp; nur, falls&nbsp; $\rho_1 + \rho_2 < 0$.
+
- Decision for&nbsp; $m_0$&nbsp; only if&nbsp; $\rho_1 + \rho_2 < 0$.
  
{Wie lautet die Entscheidungsregel im Bereich&nbsp; $\rho_1 < \, -1$?
+
{What is the decision rule in the range&nbsp; $\rho_1 < \, -1$?
 
|type="()"}
 
|type="()"}
+ Entscheidung für&nbsp; $m_0$&nbsp; im gesamten Bereich.
+
+ Decision for&nbsp; $m_0$&nbsp; in the whole range.
- Entscheidung für&nbsp; $m_1$&nbsp; im gesamten Bereich.
+
- Decision for&nbsp; $m_1$&nbsp; in the whole range.
- Entscheidung für&nbsp; $m_0$&nbsp; nur, falls&nbsp; $\rho_1 + \rho_2 < 0$.
+
- Decision for&nbsp; $m_0$&nbsp; only if&nbsp; $\rho_1 + \rho_2 < 0$.
  
{Wie lautet die Entscheidungsregel im Bereich&nbsp; $\rho_2 > +1$?
+
{What is the decision rule in the range&nbsp; $\rho_2 > +1$?
 
|type="()"}
 
|type="()"}
- Entscheidung für&nbsp; $m_0$&nbsp; im gesamten Bereich.
+
- Decision for&nbsp; $m_0$&nbsp; in the whole range.
+ Entscheidung für&nbsp; $m_1$&nbsp; im gesamten Bereich.
+
+ Decision for&nbsp; $m_1$&nbsp; in the whole range.
- Entscheidung für&nbsp; $m_0$&nbsp; nur, falls&nbsp; $\rho_1 + \rho_2 < 0$.
+
- Decision for&nbsp; $m_0$&nbsp; only if&nbsp; $\rho_1 + \rho_2 < 0$.
  
{Wie lautet die Entscheidungsregel im Bereich&nbsp; $\rho_2 <  -1$?
+
{What is the decision rule in the range&nbsp; $\rho_2 <  -1$?
 
|type="()"}
 
|type="()"}
+ Entscheidung für&nbsp; $m_0$&nbsp; im gesamten Bereich.
+
+ Decision for&nbsp; $m_0$&nbsp; in the whole range.
- Entscheidung für&nbsp; $m_1$&nbsp; im gesamten Bereich.
+
- Decision for&nbsp; $m_1$&nbsp; in the whole range.
- Entscheidung für&nbsp; $m_0$&nbsp; nur, falls&nbsp; $\rho_1 + \rho_2 < 0$.
+
- Decision for&nbsp; $m_0$&nbsp; only if&nbsp; $\rho_1 + \rho_2 < 0$.
  
{Welche der folgenden Aussagen sind zutreffend?
+
{Which of the following statements are true?
 
|type="[]"}
 
|type="[]"}
+ Die Variante &nbsp;$\rm A$&nbsp; führt zur minimalen Fehlerwahrscheinlichkeit.
+
+ Variant &nbsp;$\rm A$&nbsp; leads to the minimum error probability.
+ Die Variante &nbsp;$\rm B$&nbsp; führt zur minimalen Fehlerwahrscheinlichkeit.
+
+ Variant &nbsp;$\rm B$&nbsp; leads to the minimum error probability.
- Die Variante &nbsp;$\rm C$&nbsp; führt zur minimalen Fehlerwahrscheinlichkeit.
+
- Variant &nbsp;$\rm C$&nbsp; leads to the minimum error probability.
 
</quiz>
 
</quiz>
  
===Musterlösung===
+
===Solution===
 
{{ML-Kopf}}
 
{{ML-Kopf}}
'''(1)'''&nbsp; Richtig sind die <u>Lösungsvorschläge 1 und 2</u>:
+
'''(1)'''&nbsp; <u>Solutions 1 and 2</u> are correct:
*Die Verbundwahrscheinlichkeitsdichten unter den Bedingungen $m_0$ bzw. $m_1$ lauten:
+
*The joint probability densities under conditions $m_0$ and $m_1$, respectively, are:
 
:$$p_{\boldsymbol{ r} \hspace{0.05cm}|\hspace{0.05cm}m } ( \rho_{1},\rho_{2} |m_0 )  
 
:$$p_{\boldsymbol{ r} \hspace{0.05cm}|\hspace{0.05cm}m } ( \rho_{1},\rho_{2} |m_0 )  
 
\hspace{-0.1cm} \ = \ \hspace{-0.1cm} {1}/{4} \cdot  {\rm exp}\left [- | \rho_1 +1|- | \rho_2 +1| \hspace{0.05cm} \right ]\hspace{0.05cm},$$
 
\hspace{-0.1cm} \ = \ \hspace{-0.1cm} {1}/{4} \cdot  {\rm exp}\left [- | \rho_1 +1|- | \rho_2 +1| \hspace{0.05cm} \right ]\hspace{0.05cm},$$
 
:$$p_{\boldsymbol{ r} \hspace{0.05cm}|\hspace{0.05cm}m } ( \rho_{1},\rho_{2} |m_1 )  
 
:$$p_{\boldsymbol{ r} \hspace{0.05cm}|\hspace{0.05cm}m } ( \rho_{1},\rho_{2} |m_1 )  
 
\hspace{-0.1cm} \ = \ \hspace{-0.1cm} {1}/{4} \cdot  {\rm exp}\left [- | \rho_1 -1|- | \rho_2 -1| \hspace{0.05cm} \right ]\hspace{0.05cm}.$$
 
\hspace{-0.1cm} \ = \ \hspace{-0.1cm} {1}/{4} \cdot  {\rm exp}\left [- | \rho_1 -1|- | \rho_2 -1| \hspace{0.05cm} \right ]\hspace{0.05cm}.$$
*Bei gleichwahrscheinlichen Symbolen &nbsp;&#8658;&nbsp; ${\rm Pr}(m_0) = {\rm Pr}(m_1) = 0.5$ lautet die MAP&ndash;Entscheidungsregel: &nbsp; Entscheide für das Symbol $m_0$ &nbsp;&#8660;&nbsp; Signal $s_0$, falls
+
*For equally probable symbols &nbsp;&#8658;&nbsp; ${\rm Pr}(m_0) = {\rm Pr}(m_1) = 0.5$, the MAP decision rule is: &nbsp; Decide for symbol $m_0$ &nbsp;&#8660;&nbsp; signal $s_0$, if
 
:$$p_{\boldsymbol{ r} \hspace{0.05cm}|\hspace{0.05cm}m } ( \rho_{1},\rho_{2} |m_0 ) >  
 
:$$p_{\boldsymbol{ r} \hspace{0.05cm}|\hspace{0.05cm}m } ( \rho_{1},\rho_{2} |m_0 ) >  
 
p_{\boldsymbol{ r} \hspace{0.05cm}|\hspace{0.05cm}m } (\rho_{1},\rho_{2} |m_1 ) \hspace{0.05cm}\hspace{0.3cm}
 
p_{\boldsymbol{ r} \hspace{0.05cm}|\hspace{0.05cm}m } (\rho_{1},\rho_{2} |m_1 ) \hspace{0.05cm}\hspace{0.3cm}
Line 136: Line 136:
  
  
'''(2)'''&nbsp; <u>Alle Aussagen treffen zu</u>: Für $x &#8805; 1$ ist
+
'''(2)'''&nbsp; <u>All statements are true</u>: For $x &#8805; 1$
 
:$$| x +1|- | x -1| = x +1 -x +1 =2 \hspace{0.05cm}.$$
 
:$$| x +1|- | x -1| = x +1 -x +1 =2 \hspace{0.05cm}.$$
  
*Ebenso gilt für $x &#8804; \, &ndash;1$, zum Beispiel $x = \, &ndash;3$:
+
*Similarly, for $x &#8804; \, &ndash;1$, for example, $x = \, &ndash;3$:
 
:$$| x +1|- | x -1| = | -3 +1|- | -3 -1| = 2-4 = -2 \hspace{0.05cm}.$$
 
:$$| x +1|- | x -1| = | -3 +1|- | -3 -1| = 2-4 = -2 \hspace{0.05cm}.$$
  
*Dagegen gilt im mittleren Bereich $&ndash;1 &#8804; x &#8804; +1$:
+
*On the other hand, in the middle range $&ndash;1 &#8804; x &#8804; +1$:
 
:$$| x+1|- | x -1| = x +1 -1 +x =2x \hspace{0.05cm}.$$
 
:$$| x+1|- | x -1| = x +1 -1 +x =2x \hspace{0.05cm}.$$
  
  
'''(3)'''&nbsp; Richtig ist der <u>Lösungsvorschlag 1</u>:
+
'''(3)'''&nbsp; <u>Solution 1</u> is correct:
*Das Ergebnis von Teilaufgabe (1) lautete: Entscheide für das Symbol $m_0$, falls
+
*The result of subtask (1) was: Decide for the symbol $m_0$, if
 
:$$L (\rho_1, \rho_2) = | \rho_1 +1| -
 
:$$L (\rho_1, \rho_2) = | \rho_1 +1| -
 
   | \rho_1 -1|+ | \rho_2 +1| - | \rho_2 -1| < 0 \hspace{0.05cm}.$$
 
   | \rho_1 -1|+ | \rho_2 +1| - | \rho_2 -1| < 0 \hspace{0.05cm}.$$
*Im betrachteten (inneren) Bereich $-1 &#8804; \rho_1 &#8804; +1$, $-1 &#8804; \rho_2 &#8804; +1$ gilt mit dem Ergebnis der Teilaufgabe (2):
+
*In the considered (inner) range $-1 &#8804; \rho_1 &#8804; +1$, $-1 &#8804; \rho_2 &#8804; +1$ holds with the result of subtask (2):
 
:$$| \rho_1+1| - | \rho_1 -1| = 2\rho_1 \hspace{0.05cm}, \hspace{0.2cm} | \rho_2+1| - | \rho_2 -1| = 2\rho_2 \hspace{0.05cm}.$$
 
:$$| \rho_1+1| - | \rho_1 -1| = 2\rho_1 \hspace{0.05cm}, \hspace{0.2cm} | \rho_2+1| - | \rho_2 -1| = 2\rho_2 \hspace{0.05cm}.$$
  
*Setzt man dieses Ergebnis oben ein, so ist genau dann für $m_0$ zu entscheiden, falls
+
*If we insert this result above, we have to decide for $m_0$ exactly if
 
:$$L (\rho_1, \rho_2) = 2 \cdot ( \rho_1+\rho_2) < 0   
 
:$$L (\rho_1, \rho_2) = 2 \cdot ( \rho_1+\rho_2) < 0   
 
  \hspace{0.3cm} \Rightarrow \hspace{0.3cm} \rho_1+\rho_2 < 0\hspace{0.05cm}.$$
 
  \hspace{0.3cm} \Rightarrow \hspace{0.3cm} \rho_1+\rho_2 < 0\hspace{0.05cm}.$$
  
  
'''(4)'''&nbsp; Richtig ist hier der <u>Lösungsvorschlag 2</u>:
+
'''(4)'''&nbsp; Correct is here <u>solution 2</u>:
*Für $\rho_1 > 1$ ist $|\rho_1+1| \, -|\rho_1 \, -1| = 2$, während für $D_2 = |\rho_2+1| \,-|\rho_2 \, -1|$ alle Werte zwischen $-2$ und $+2$ möglich sind.  
+
*For $\rho_1 > 1$, $|\rho_1+1| \, -|\rho_1 \, -1| = 2$, while for $D_2 = |\rho_2+1| \,-|\rho_2 \, -1|$ all values between $-2$ and $+2$ are possible.
*Die Entscheidungsgröße ist somit $L(\rho_1, \rho_2) = 2 + D_2 &#8805; 0$. In diesem Fall führt die Regel zu einer $m_1$&ndash;Entscheidung.  
+
*Thus, the decision variable is $L(\rho_1, \rho_2) = 2 + D_2 &#8805; 0$. In this case, the rule leads to an $m_1$ decision.
  
  
  
'''(5)'''&nbsp; Richtig ist hier der <u>Lösungsvorschlag 1</u>:   
+
'''(5)'''&nbsp; <u>Solution 1</u> is correct:   
*Nach ähnlicher Rechnung wie in der Teilaufgabe (3) kommt man zum Ergebnis:
+
*After similar calculation as in subtask (3), one arrives at the result:
 
:$$L (\rho_1, \rho_2) = -2 + D_2 \le 0  \hspace{0.3cm} \Rightarrow \hspace{0.3cm}
 
:$$L (\rho_1, \rho_2) = -2 + D_2 \le 0  \hspace{0.3cm} \Rightarrow \hspace{0.3cm}
   {\rm Entscheidung\hspace{0.15cm} auf\hspace{0.15cm}} m_0\hspace{0.05cm}.$$
+
   {\rm decision\hspace{0.15cm} on\hspace{0.15cm}} m_0\hspace{0.05cm}.$$
  
  
'''(6)'''&nbsp; Richtig ist der <u>Lösungsvorschlag 2</u>: Entscheidung auf $m_1$.
+
'''(6)'''&nbsp; <u>Solution 2</u> is correct: decision on $m_1$.
*Ähnlich der Teilaufgabe (4) gilt hier:
+
*Similar to subtask (4), the following holds here:
 
:$$D_1 = | \rho_1 +1| -    | \rho_1 -1| \in \{-2, ... \hspace{0.05cm} , +2 \}  
 
:$$D_1 = | \rho_1 +1| -    | \rho_1 -1| \in \{-2, ... \hspace{0.05cm} , +2 \}  
 
   \hspace{0.3cm} \Rightarrow \hspace{0.3cm}L (\rho_1, \rho_2) = 2 + D_1 \ge 0
 
   \hspace{0.3cm} \Rightarrow \hspace{0.3cm}L (\rho_1, \rho_2) = 2 + D_1 \ge 0
Line 177: Line 177:
  
  
'''(7)'''&nbsp; Richtig ist der <u>Lösungsvorschlag 1</u>: Entscheidung auf $m_0$.
+
'''(7)'''&nbsp; <u>Solution 1</u> is correct: decision on $m_0$.
*Nach ähnlicher Überlegung wie in der letzten Teilaufgabe kommt man zum Ergebnis:
+
*After similar reasoning as in the last subtask, we arrive at the result:
 
:$$L (\rho_1, \rho_2) = -2 + D_1 \le 0  \hspace{0.3cm} \Rightarrow \hspace{0.3cm}
 
:$$L (\rho_1, \rho_2) = -2 + D_1 \le 0  \hspace{0.3cm} \Rightarrow \hspace{0.3cm}
   {\rm Entscheidung\hspace{0.15cm} auf\hspace{0.15cm}} m_0\hspace{0.05cm}.$$
+
   {\rm decision\hspace{0.15cm} on\hspace{0.15cm}} m_0\hspace{0.05cm}.$$
  
  
[[File:P_ID2050__Dig_A_4_9h.png|right|frame|Zusammenfassung der Ergebnisse]]
+
[[File:P_ID2050__Dig_A_4_9h.png|right|frame|Summary of the results]]
'''(8)'''&nbsp; Die Ergebnisse der Teilaufgaben (3) bis (7) sind in der Grafik zusammengefasst:
+
'''(8)'''&nbsp; The results of subtasks (3) to (7) are summarized in the graph:
* Teilgebiet $T_0$: &nbsp;  Entscheidung auf $m_0$ bzw. $m_1$ gemäß Aufgabe (3).
+
* Subarea $T_0$: &nbsp;  decision on $m_0$ or $m_1$ according to task (3).
* Teilgebiet $T_1$: &nbsp;  Entscheidung auf $m_1$ gemäß Aufgabe (4).
+
* Subarea $T_1$: &nbsp;  decision on $m_1$ according to task (4).
* Teilgebiet $T_2$: &nbsp;  Entscheidung auf $m_0$ gemäß Aufgabe (5).
+
* Subarea $T_2$: &nbsp;  decision on $m_0$ according to task (5).
* Teilgebiet $T_3$: &nbsp;  Entscheidung auf $m_1$ gemäß Aufgabe (6).
+
* Subarea $T_3$: &nbsp;  decision on $m_1$ according to task (6).
* Teilgebiet $T_4$: &nbsp;  Entscheidung auf $m_0$ gemäß Aufgabe (7).
+
* Subarea $T_4$: &nbsp;  decision on $m_0$ according to task (7).
* Teilgebiet $T_5$: &nbsp;  Nach Aufgabe (5) sollte man auf $m_0$ entscheiden, nach Aufgabe (6) auf $m_1$ <br>&rArr; &nbsp; Bei Laplace&ndash;Rauschen ist es egal, ob man $T_5$ der Region $I_0$ oder $I_1$ zuordnet.
+
* Subarea $T_5$: &nbsp;  Decision on $m_0$ according to task (5), and on $m_1$ according to task (6) <br>&rArr; &nbsp; For Laplace noise, it does not matter whether one assigns $T_5$ to region $I_0$ or $I_1$.
* Teilgebiet $T_6$: &nbsp; Auch dieses Gebiet kann man aufgrund der Ergebnisse von Aufgabe (4) und (7) sowohl der Region $I_0$ als auch der Region $I_1$ zuordnen.
+
* Subarea $T_6$: &nbsp; Again, based on the results of task (4) and (7), one can assign this region to both region $I_0$ and region $I_1$.
  
  
Man erkennt:
+
It can be seen:
*Für die Teilaufgabe $T_0$,  ... $T_4$ gibt es eine feste Zuordnung zu den Entscheidungsregionen $I_0$ (rot) bzw. $I_1$ (blau).  
+
*For subtask $T_0$,  ... $T_4$ there is a fixed assignment to the decision regions $I_0$ (red) and $I_1$ (blue).
*Dagegen können die beiden gelb markierten Bereiche $T_5$ und $T_6$ ohne Verlust an Optimalität sowohl $I_0$ als auch $I_1$ zugeordnet werden.
+
*In contrast, the two regions $T_5$ and $T_6$ marked in yellow can be assigned to both $I_0$ and $I_1$ without loss of optimality.
  
  
Vergleicht man diese Grafik mit den Varianten '''A''', '''B''' und '''C''' auf der Angabenseite, so erkennt man,  dass die <u>Vorschläge 1 und 2</u> richtig sind:
+
Comparing this graph with variants '''A''', '''B''' and '''C''' on the specification page, we see that <u>suggestions 1 and 2</u> are correct:
* Die Varianten '''A''' und '''B''' sind gleich gut. Beide sind optimal. Die Fehlerwahrscheinlichkeit ergibt sich in beiden Fällen zu $p_{\rm min} = {\rm e}^{\rm -2}$.
+
* Variants '''A''' and '''B''' are equally good. Both are optimal. The error probability in both cases is $p_{\rm min} = {\rm e}^{\rm -2}$.
* Die Variante '''C''' ist nicht optimal; bezüglich der Teilgebiete $T_1$ und $T_2$ gibt es Fehlzuordnungen. Die Fehlerwahrscheinlichkeit ist demzufolge größer als $p_{\rm min}$.  
+
* Variant '''C''' is not optimal; with respect to the subareas $T_1$ and $T_2$ there are mismatches. The error probability is therefore greater than $p_{\rm min}$.  
 
{{ML-Fuß}}
 
{{ML-Fuß}}
  

Revision as of 08:54, 18 July 2022

Three decision regions
for Laplace

We consider a transmission system based on the basis functions  $\varphi_1(t)$  and  $\varphi_2(t)$. The two equally probable transmitted signals are given by the signal points

$$\boldsymbol{ s }_0 = (-\sqrt{E}, \hspace{0.1cm}-\sqrt{E})\hspace{0.05cm}, \hspace{0.2cm} \boldsymbol{ s }_1 = (+\sqrt{E}, \hspace{0.1cm}+\sqrt{E})\hspace{0.05cm}$$.

In the following we normalize the energy parameter to  $E = 1$  for simplification and thus obtain

$$\boldsymbol{ s }_0 \hspace{-0.1cm} \ = \ \hspace{-0.1cm} (-1, \hspace{0.1cm}-1) \hspace{0.2cm} \Leftrightarrow \hspace{0.2cm} m_0\hspace{0.05cm}, $$
$$ \boldsymbol{ s }_1 \hspace{-0.1cm} \ = \ \hspace{-0.1cm} (+1, \hspace{0.1cm}+1)\hspace{0.2cm} \Leftrightarrow \hspace{0.2cm} m_1\hspace{0.05cm}.$$

The messages  $m_0$  and  $m_1$  are uniquely assigned to the signals  $\boldsymbol{s}_0$  and  $\boldsymbol{s}_1$  defined in this way.

Let the two noise components  $n_1(t)$  and  $n_2(t)$  be independent of each other and each be Laplace distributed with parameter  $a = 1$:

$$p_{n_1} (\eta_1) = {1}/{2} \cdot {\rm e}^{- | \eta_1|} \hspace{0.05cm}, \hspace{0.2cm} p_{n_2} (\eta_2) = {1}/{2} \cdot {\rm e}^{- | \eta_2|} \hspace{0.05cm} \hspace{0.3cm} \Rightarrow \hspace{0.3cm} \boldsymbol{ p }_{\boldsymbol{ n }} (\eta_1, \eta_2) = {1}/{4} \cdot {\rm e}^{- | \eta_1|- | \eta_2|} \hspace{0.05cm}. $$

The properties of such a Laplace noise will be discussed in detail in  "Exercise 4.9Z"

The received signal  $\boldsymbol{r}$  is composed additively of the transmitted signal  $\boldsymbol{s}$  and the  noise signal  $\boldsymbol{n}$:

$$\boldsymbol{ r } \hspace{-0.1cm} \ = \ \hspace{-0.1cm} \boldsymbol{ s } + \boldsymbol{ n } \hspace{0.05cm}, \hspace{0.45cm}\boldsymbol{ r } = ( r_1, r_2) \hspace{0.05cm},\hspace{0.45cm} \boldsymbol{ s } \hspace{-0.1cm} \ = \ \hspace{-0.1cm} ( s_1, s_2) \hspace{0.05cm}, \hspace{0.8cm}\boldsymbol{ n } = ( n_1, n_2) \hspace{0.05cm}. $$

The corresponding realizations are denoted as follows:

$$\boldsymbol{ s }\text{:} \hspace{0.4cm} (s_{01},s_{02}){\hspace{0.15cm}\rm and \hspace{0.15cm}} (s_{11},s_{12}) \hspace{0.05cm},\hspace{0.8cm} \boldsymbol{ r }\text{:} \hspace{0.4cm} (\rho_{1},\rho_{2}) \hspace{0.05cm}, \hspace{0.8cm}\boldsymbol{ n }\text{:} \hspace{0.4cm} (\eta_{1},\eta_{2}) \hspace{0.05cm}.$$

The decision rule of the MAP and ML receivers (both are identical due to the same symbol probabilities) are:

Decide for the symbol  $m_0$, if   $p_{\boldsymbol{ r} \hspace{0.05cm}|\hspace{0.05cm}m } ( \rho_{1},\rho_{2} |m_0 ) > p_{\boldsymbol{ r} \hspace{0.05cm}|\hspace{0.05cm}m } (\rho_{1},\rho_{2} |m_1 ) \hspace{0.05cm}.$

With the further conditions for this $($decision for  $m_0)$  can also be written:

$${1}/{4} \cdot {\rm exp}\left [- | \rho_1 +1|- | \rho_2 +1| \hspace{0.1cm} \right ] > {1}/{4} \cdot {\rm exp}\left [- | \rho_1 -1|- | \rho_2 -1| \hspace{0.1cm} \right ] $$
$$\Rightarrow \hspace{0.3cm} | \rho_1 +1|+ | \rho_2 +1| < | \rho_1 -1|+ | \rho_2 -1|$$
$$\Rightarrow \hspace{0.3cm} L (\rho_1, \rho_2) = | \rho_1 +1|+ | \rho_2 +1| - | \rho_1 -1|- | \rho_2 -1| < 0 \hspace{0.05cm}.$$

This function  $L(\rho_1, \rho_2)$  is frequently referred to in the questions.

The graph shows three different decision regions  $(I_0, \ I_1)$.

  • For AWGN noise, only the upper variant  $\rm A$  would be optimal.
  • Also for the considered Laplace noise, variant  $\rm A$  leads to the smallest possible error probability, see  "Exercise 4.9Z":
$$p_{\rm min} = {\rm Pr}({\cal{E}} \hspace{0.05cm}|\hspace{0.05cm} {\rm optimal\hspace{0.15cm} receiver}) = {\rm e}^{-2} \approx 13.5\,\%\hspace{0.05cm}.$$
  • It is to be examined whether variant  $\rm B$  or variant  $\rm C$  is also optimal, i.e. whether their error probabilities are also as small as possible equal to  $p_{\rm min}$. 



Note:



Questions

1

Which of the decision rules are correct? Decide for  $m_0$, if

$p_{\it r\hspace{0.03cm}|\hspace{0.03cm}m}(\rho_1, \ \rho_2\hspace{0.03cm}|\hspace{0.03cm}m_0) > p_{\it r\hspace{0.03cm}|\hspace{0.03cm}m}(\rho_1, \ \rho_2\hspace{0.03cm}|\hspace{0.03cm}m_1)$,
$L(\rho_1, \ \rho_2) = |\rho_1+1| \, -|\rho_1 \, –1| + |\rho_2+1| \, -|\rho_2 \, –1| < 0$,
$L(\rho_1, \ \rho_2) = \rho_1 + \rho_2 ≥ 0$.

2

How can the expression  $|x+1| \ -|x \ -1|$  be transformed?

For  $x ≥ +1$,    $|x + 1| \, -|x -1| = 2$.
For  $x ≤ \, -1$,    $|x+1| \,-|x \, -1| = \, -2$.
For  $-1 ≤ x ≤ +1$,    $|x+1| \, -|x \, -1| = 2x$.

3

What is the decision rule in the range  $-1 ≤ \rho_1 ≤ +1$,  $-1 ≤ \rho_2 ≤ +1$?

Decision for  $m_0$, if  $\rho_1 + \rho_2 < 0$.
Decision for  $m_1$, if  $\rho_1 + \rho_2 < 0$.

4

What is the decision rule in the range  $\rho_1 > +1$?

Decision for  $m_0$  in the whole range.
Decision for  $m_1$  in the whole range.
Decision for  $m_0$  only if  $\rho_1 + \rho_2 < 0$.

5

What is the decision rule in the range  $\rho_1 < \, -1$?

Decision for  $m_0$  in the whole range.
Decision for  $m_1$  in the whole range.
Decision for  $m_0$  only if  $\rho_1 + \rho_2 < 0$.

6

What is the decision rule in the range  $\rho_2 > +1$?

Decision for  $m_0$  in the whole range.
Decision for  $m_1$  in the whole range.
Decision for  $m_0$  only if  $\rho_1 + \rho_2 < 0$.

7

What is the decision rule in the range  $\rho_2 < -1$?

Decision for  $m_0$  in the whole range.
Decision for  $m_1$  in the whole range.
Decision for  $m_0$  only if  $\rho_1 + \rho_2 < 0$.

8

Which of the following statements are true?

Variant  $\rm A$  leads to the minimum error probability.
Variant  $\rm B$  leads to the minimum error probability.
Variant  $\rm C$  leads to the minimum error probability.


Solution

(1)  Solutions 1 and 2 are correct:

  • The joint probability densities under conditions $m_0$ and $m_1$, respectively, are:
$$p_{\boldsymbol{ r} \hspace{0.05cm}|\hspace{0.05cm}m } ( \rho_{1},\rho_{2} |m_0 ) \hspace{-0.1cm} \ = \ \hspace{-0.1cm} {1}/{4} \cdot {\rm exp}\left [- | \rho_1 +1|- | \rho_2 +1| \hspace{0.05cm} \right ]\hspace{0.05cm},$$
$$p_{\boldsymbol{ r} \hspace{0.05cm}|\hspace{0.05cm}m } ( \rho_{1},\rho_{2} |m_1 ) \hspace{-0.1cm} \ = \ \hspace{-0.1cm} {1}/{4} \cdot {\rm exp}\left [- | \rho_1 -1|- | \rho_2 -1| \hspace{0.05cm} \right ]\hspace{0.05cm}.$$
  • For equally probable symbols  ⇒  ${\rm Pr}(m_0) = {\rm Pr}(m_1) = 0.5$, the MAP decision rule is:   Decide for symbol $m_0$  ⇔  signal $s_0$, if
$$p_{\boldsymbol{ r} \hspace{0.05cm}|\hspace{0.05cm}m } ( \rho_{1},\rho_{2} |m_0 ) > p_{\boldsymbol{ r} \hspace{0.05cm}|\hspace{0.05cm}m } (\rho_{1},\rho_{2} |m_1 ) \hspace{0.05cm}\hspace{0.3cm} \Rightarrow \hspace{0.3cm} {1}/{4} \cdot {\rm exp}\left [- | \rho_1 +1|- | \rho_2 +1| \hspace{0.05cm} \right ] > {1}/{4} \cdot {\rm exp}\left [- | \rho_1 -1|- | \rho_2 -1|\hspace{0.05cm} \right ] $$
$$\Rightarrow \hspace{0.3cm} | \rho_1 +1|+ | \rho_2 +1| < | \rho_1 -1|+ | \rho_2 -1|\hspace{0.3cm} \Rightarrow \hspace{0.3cm} L (\rho_1, \rho_2) = | \rho_1 +1|- | \rho_1 -1|+ | \rho_2 +1| - | \rho_2 -1| < 0 \hspace{0.05cm}.$$


(2)  All statements are true: For $x ≥ 1$

$$| x +1|- | x -1| = x +1 -x +1 =2 \hspace{0.05cm}.$$
  • Similarly, for $x ≤ \, –1$, for example, $x = \, –3$:
$$| x +1|- | x -1| = | -3 +1|- | -3 -1| = 2-4 = -2 \hspace{0.05cm}.$$
  • On the other hand, in the middle range $–1 ≤ x ≤ +1$:
$$| x+1|- | x -1| = x +1 -1 +x =2x \hspace{0.05cm}.$$


(3)  Solution 1 is correct:

  • The result of subtask (1) was: Decide for the symbol $m_0$, if
$$L (\rho_1, \rho_2) = | \rho_1 +1| - | \rho_1 -1|+ | \rho_2 +1| - | \rho_2 -1| < 0 \hspace{0.05cm}.$$
  • In the considered (inner) range $-1 ≤ \rho_1 ≤ +1$, $-1 ≤ \rho_2 ≤ +1$ holds with the result of subtask (2):
$$| \rho_1+1| - | \rho_1 -1| = 2\rho_1 \hspace{0.05cm}, \hspace{0.2cm} | \rho_2+1| - | \rho_2 -1| = 2\rho_2 \hspace{0.05cm}.$$
  • If we insert this result above, we have to decide for $m_0$ exactly if
$$L (\rho_1, \rho_2) = 2 \cdot ( \rho_1+\rho_2) < 0 \hspace{0.3cm} \Rightarrow \hspace{0.3cm} \rho_1+\rho_2 < 0\hspace{0.05cm}.$$


(4)  Correct is here solution 2:

  • For $\rho_1 > 1$, $|\rho_1+1| \, -|\rho_1 \, -1| = 2$, while for $D_2 = |\rho_2+1| \,-|\rho_2 \, -1|$ all values between $-2$ and $+2$ are possible.
  • Thus, the decision variable is $L(\rho_1, \rho_2) = 2 + D_2 ≥ 0$. In this case, the rule leads to an $m_1$ decision.


(5)  Solution 1 is correct:

  • After similar calculation as in subtask (3), one arrives at the result:
$$L (\rho_1, \rho_2) = -2 + D_2 \le 0 \hspace{0.3cm} \Rightarrow \hspace{0.3cm} {\rm decision\hspace{0.15cm} on\hspace{0.15cm}} m_0\hspace{0.05cm}.$$


(6)  Solution 2 is correct: decision on $m_1$.

  • Similar to subtask (4), the following holds here:
$$D_1 = | \rho_1 +1| - | \rho_1 -1| \in \{-2, ... \hspace{0.05cm} , +2 \} \hspace{0.3cm} \Rightarrow \hspace{0.3cm}L (\rho_1, \rho_2) = 2 + D_1 \ge 0 \hspace{0.05cm}.$$


(7)  Solution 1 is correct: decision on $m_0$.

  • After similar reasoning as in the last subtask, we arrive at the result:
$$L (\rho_1, \rho_2) = -2 + D_1 \le 0 \hspace{0.3cm} \Rightarrow \hspace{0.3cm} {\rm decision\hspace{0.15cm} on\hspace{0.15cm}} m_0\hspace{0.05cm}.$$


Summary of the results

(8)  The results of subtasks (3) to (7) are summarized in the graph:

  • Subarea $T_0$:   decision on $m_0$ or $m_1$ according to task (3).
  • Subarea $T_1$:   decision on $m_1$ according to task (4).
  • Subarea $T_2$:   decision on $m_0$ according to task (5).
  • Subarea $T_3$:   decision on $m_1$ according to task (6).
  • Subarea $T_4$:   decision on $m_0$ according to task (7).
  • Subarea $T_5$:   Decision on $m_0$ according to task (5), and on $m_1$ according to task (6)
    ⇒   For Laplace noise, it does not matter whether one assigns $T_5$ to region $I_0$ or $I_1$.
  • Subarea $T_6$:   Again, based on the results of task (4) and (7), one can assign this region to both region $I_0$ and region $I_1$.


It can be seen:

  • For subtask $T_0$, ... $T_4$ there is a fixed assignment to the decision regions $I_0$ (red) and $I_1$ (blue).
  • In contrast, the two regions $T_5$ and $T_6$ marked in yellow can be assigned to both $I_0$ and $I_1$ without loss of optimality.


Comparing this graph with variants A, B and C on the specification page, we see that suggestions 1 and 2 are correct:

  • Variants A and B are equally good. Both are optimal. The error probability in both cases is $p_{\rm min} = {\rm e}^{\rm -2}$.
  • Variant C is not optimal; with respect to the subareas $T_1$ and $T_2$ there are mismatches. The error probability is therefore greater than $p_{\rm min}$.