Difference between revisions of "Aufgaben:Exercise 1.16Z: Bounds for the Gaussian Error Function"
(32 intermediate revisions by 7 users not shown) | |||
Line 1: | Line 1: | ||
− | {{quiz-Header|Buchseite= | + | {{quiz-Header|Buchseite=Channel_Coding/Limits_for_Block_Error_Probability}} |
+ | [[File:P_ID2415__KC_A_1_15.png|right|frame|Function Q(x) and approximations;<br>it holds: Qu(x)≤Q(x)≤Qo(x)]] | ||
+ | The probability that a zero-mean Gaussian random variable n with standard deviation σ ⇒ variance σ2 is greater in magnitude than a given value A is equal to | ||
− | }} | + | :$${\rm Pr}(n > A) = {\rm Pr}(n < -A) ={\rm Q}(A/\sigma) \hspace{0.05cm}.$$ |
+ | |||
+ | Here is used one of the most important functions for Communications Engineering (drawn in red in the diagram): <br>the [[Theory_of_Stochastic_Signals/Gaussian_Distributed_Random_Variables#Exceedance_probability|"complementary Gaussian error function"]] | ||
+ | |||
+ | :Q(x)=1√2π∫+∞xe−u2/2du. | ||
+ | |||
+ | Q(x) is a monotonically decreasing function with Q(0)=0.5. For very large values of x ⇒ Q(x) tends →0. | ||
− | |||
− | + | The integral of the ${\rm Q}$–function is not analytically solvable and is usually given in tabular form. From the literature, however, manageable approximations or bounds for positive $x$ values are known: | |
− | :$$ | + | *the "upper bound" ⇒ upper (German: "obere" ⇒ subscript: "o"$)$ blue curve in adjacent graph, valid for $x > 0$: |
− | + | :$$ {\rm Q_o}(x)=\frac{\rm 1}{\sqrt{\rm 2\pi}\cdot x}\cdot {\rm e}^{-x^{\rm 2}/\rm 2}\hspace{0.15cm} \ge \hspace{0.15cm} {\rm Q} (x) \hspace{0.05cm},$$ | |
− | :$$\rm | + | *the "lower bound" ⇒ upper (German: "untere" ⇒ subscript: "u") blue curve in adjacent graph, valid for x>1: |
+ | :$$ {\rm Q_u}(x)=\frac{\rm 1-{\rm 1}/{\it x^{\rm 2}}}{\sqrt{\rm 2\pi}\cdot x}\cdot \rm e^{-x^{\rm 2}/\rm 2} \hspace{0.15cm} \le \hspace{0.15cm} {\rm Q} (x) \hspace{0.05cm},$$ | ||
+ | |||
+ | *the "Chernoff-Rubin bound" (green curve in the graph, drawn for $K = 1)$: | ||
− | ${\rm | + | :$${\rm Q_{CR}}(x)=K \cdot {\rm e}^{-x^{\rm 2}/\rm 2} \hspace{0.15cm} \ge \hspace{0.15cm} {\rm Q} (x) \hspace{0.05cm}.$$ |
− | + | In the exercise it is to be investigated to what extent these bounds can be used as approximations for ${\rm Q}(x)$ and what corruptions result. | |
− | * | + | |
+ | |||
+ | |||
+ | Hints: | ||
+ | * This exercise belongs to the chapter [[Channel_Coding/Bounds_for_Block_Error_Probability|"Bounds for block error probability"]]. | ||
+ | |||
+ | *Reference is also made to the chapter [[Theory_of_Stochastic_Signals/Gaussian_Distributed_Random_Variables|"Gaussian distributed random variables"]] in the book "Stochastic Signal Theory". | ||
− | :$ | + | *The exercise provides some important hints for solving [[Aufgaben:Exercise_1.16:_Block_Error_Probability_Bounds_for_AWGN|"Exercise 1.16"]], in which ${\rm Q}_{\rm CR}(x)$ is used to derive the [[Channel_Coding/Limits_for_Block_Error_Probability#The_upper_bound_according_to_Bhattacharyya|"Bhattacharyya Bound"]] for the AWGN channel. |
− | |||
− | |||
− | : | + | * Further we refer to the interactive HTML5/JavaScript applet [[Applets:Komplementäre_Gaußsche_Fehlerfunktionen| "Complementary Gaussian error functions"]]. |
− | |||
− | |||
− | |||
− | |||
− | |||
− | + | ===Questions=== | |
− | |||
− | |||
− | === | ||
<quiz display=simple> | <quiz display=simple> | ||
− | { | + | {What values do the upper and lower bounds for x=4 provide? |
|type="{}"} | |type="{}"} | ||
− | $ | + | ${\rm Q_{o}}(x = 4) \ = \ { 3.346 3% }\ \cdot 10^{-5} $ |
− | $ | + | ${\rm Q_{u}}(x = 4) \ = \ { 3.137 3% }\ \cdot 10^{-5} $ |
− | + | {What statements hold for the functions ${\rm Q_{o}}(x)$ and ${\rm Q_{u}}(x)$? | |
− | { | ||
|type="[]"} | |type="[]"} | ||
− | + | + | + For x≥2: Both bounds are usable. |
− | + | + | + For x<1: ${\rm Q_{u}}(x)$ is unusable $($because ${\rm Q_{u}}(x)< 0)$. |
− | - | + | - For x<1: ${\rm Q_{o}}(x)$ is unusable $($because ${\rm Q_{o}}(x)> 1)$. |
− | { | + | {By what factor is the Chernoff-Rubin Bound above ${\rm Q_{o}}(x)$? |
− | |||
|type="{}"} | |type="{}"} | ||
− | $ | + | ${\rm Q}_{\rm CR}(x = 2)/{\rm Q_{o}}(x = 2 ) \ = \ $ { 5 3% } |
− | x=4 | + | ${\rm Q}_{\rm CR}(x = 4)/{\rm Q_{o}}(x = 4 ) \ = \ $ { 10 3% } |
− | x=6 | + | ${\rm Q}_{\rm CR}(x = 6)/{\rm Q_{o}}(x = 6 ) \ = \ $ { 15 3% } |
− | { | + | {Determine K such that K⋅QCR(x) is as close as possible to Q(x) and at the same time Q(x)≤K·QCR(x) is observed for all x>0 . |
|type="{}"} | |type="{}"} | ||
− | $\ | + | $K \ = \ $ { 0.5 3% } |
− | |||
− | |||
− | |||
</quiz> | </quiz> | ||
− | === | + | ===Solution=== |
{{ML-Kopf}} | {{ML-Kopf}} | ||
− | '''(1)''' | + | '''(1)''' The upper bound is: |
:Qo(x)=1√2π⋅x⋅e−x2/2⇒Qo(4)=1√2π⋅4⋅e−8≈3.346⋅10−5_. | :Qo(x)=1√2π⋅x⋅e−x2/2⇒Qo(4)=1√2π⋅4⋅e−8≈3.346⋅10−5_. | ||
− | + | *The lower bound can be converted as follows: | |
:Qu(x)=(1−1/x2)⋅Qo(x)⇒Qu(4)≈3.137⋅10−5_. | :Qu(x)=(1−1/x2)⋅Qo(x)⇒Qu(4)≈3.137⋅10−5_. | ||
− | + | *The relative deviations from the actual value Q(4)=3.167·10–5 are $+5\%$ resp. $–1\%$. | |
+ | |||
+ | |||
+ | |||
+ | '''(2)''' Correct are the <u>solutions 1 and 2</u>: | ||
+ | *For x=2, the actual function value Q(x)=2.275⋅10−2 is bounded by ${\rm Q_{o}}(x) = 2.7 \cdot 10^{-2}$ and Qu(x)=2.025⋅10−2, respectively. | ||
+ | |||
+ | *The relative deviations are therefore 18.7% resp. −11%,. | ||
+ | |||
+ | *The last statement is wrong: Only for x<0.37 ⇒ Qo(x)>1 is valid. | ||
− | |||
− | '''(3)''' | + | '''(3)''' For the quotient of QCR(x) and ${\rm Q_o}(x)$, according to the given equations: |
:q(x)=QCR(x)Qo(x)=exp(−x2/2)exp(−x2/2)/(√2π⋅x)=√2π⋅x | :q(x)=QCR(x)Qo(x)=exp(−x2/2)exp(−x2/2)/(√2π⋅x)=√2π⋅x | ||
− | :⇒q(x)≈2.5⋅x⇒q(x=2)=5,q(x=4)=10,q(x=6)=15. | + | :$$\Rightarrow \hspace{0.3cm} q(x) \approx 2.5 \cdot x \hspace{0.3cm} \Rightarrow \hspace{0.3cm} q(x =2) \hspace{0.15cm}\underline{=5}\hspace{0.05cm}, \hspace{0.2cm}q(x =4)\hspace{0.15cm}\underline{=10}\hspace{0.05cm}, \hspace{0.2cm}q(x =6) \hspace{0.15cm}\underline{=15}\hspace{0.05cm}.$$ |
− | + | *The larger the abscissa value $x$ is, the more inaccurately Q(x) is approximated by QCR(x). | |
+ | |||
+ | *When looking at the graph in the information section, I first had the impression that QCR(x) results from Q(x) by shifting to the right or shifting up. | ||
+ | *But this is only an optical illusion and does not correspond to the facts. | ||
− | |||
− | |||
+ | '''(4)''' With K=0.5_ the new bound 0.5⋅QCR(x) for x=0 agrees exactly with Q(x=0)=0.500. | ||
+ | *For larger abscissa values, the falsification q≈1.25⋅x thus also becomes only half as large. | ||
+ | {{ML-Fuß}} | ||
− | |||
− | ^]] | + | [[Category:Channel Coding: Exercises|^1.6 Error Probability Bounds^]] |
Latest revision as of 18:03, 23 January 2023
The probability that a zero-mean Gaussian random variable n with standard deviation σ ⇒ variance σ2 is greater in magnitude than a given value A is equal to
- Pr(n>A)=Pr(n<−A)=Q(A/σ).
Here is used one of the most important functions for Communications Engineering (drawn in red in the diagram):
the "complementary Gaussian error function"
- Q(x)=1√2π∫+∞xe−u2/2du.
Q(x) is a monotonically decreasing function with Q(0)=0.5. For very large values of x ⇒ Q(x) tends →0.
The integral of the Q–function is not analytically solvable and is usually given in tabular form. From the literature, however, manageable approximations or bounds for positive x values are known:
- the "upper bound" ⇒ upper (German: "obere" ⇒ subscript: "o") blue curve in adjacent graph, valid for x>0:
- Qo(x)=1√2π⋅x⋅e−x2/2≥Q(x),
- the "lower bound" ⇒ upper (German: "untere" ⇒ subscript: "u") blue curve in adjacent graph, valid for x>1:
- Qu(x)=1−1/x2√2π⋅x⋅e−x2/2≤Q(x),
- the "Chernoff-Rubin bound" (green curve in the graph, drawn for K=1):
- QCR(x)=K⋅e−x2/2≥Q(x).
In the exercise it is to be investigated to what extent these bounds can be used as approximations for Q(x) and what corruptions result.
Hints:
- This exercise belongs to the chapter "Bounds for block error probability".
- Reference is also made to the chapter "Gaussian distributed random variables" in the book "Stochastic Signal Theory".
- The exercise provides some important hints for solving "Exercise 1.16", in which QCR(x) is used to derive the "Bhattacharyya Bound" for the AWGN channel.
- Further we refer to the interactive HTML5/JavaScript applet "Complementary Gaussian error functions".
Questions
Solution
- Qo(x)=1√2π⋅x⋅e−x2/2⇒Qo(4)=1√2π⋅4⋅e−8≈3.346⋅10−5_.
- The lower bound can be converted as follows:
- Qu(x)=(1−1/x2)⋅Qo(x)⇒Qu(4)≈3.137⋅10−5_.
- The relative deviations from the actual value Q(4)=3.167·10–5 are +5% resp. –1%.
(2) Correct are the solutions 1 and 2:
- For x=2, the actual function value Q(x)=2.275⋅10−2 is bounded by Qo(x)=2.7⋅10−2 and Qu(x)=2.025⋅10−2, respectively.
- The relative deviations are therefore 18.7% resp. −11%,.
- The last statement is wrong: Only for x<0.37 ⇒ Qo(x)>1 is valid.
(3) For the quotient of QCR(x) and Qo(x), according to the given equations:
- q(x)=QCR(x)Qo(x)=exp(−x2/2)exp(−x2/2)/(√2π⋅x)=√2π⋅x
- ⇒q(x)≈2.5⋅x⇒q(x=2)=5_,q(x=4)=10_,q(x=6)=15_.
- The larger the abscissa value x is, the more inaccurately Q(x) is approximated by QCR(x).
- When looking at the graph in the information section, I first had the impression that QCR(x) results from Q(x) by shifting to the right or shifting up.
- But this is only an optical illusion and does not correspond to the facts.
(4) With K=0.5_ the new bound 0.5⋅QCR(x) for x=0 agrees exactly with Q(x=0)=0.500.
- For larger abscissa values, the falsification q≈1.25⋅x thus also becomes only half as large.