From 36d2692a590385363714f24a2c5ca709bae15461 Mon Sep 17 00:00:00 2001 From: Lasse Date: Sat, 19 Apr 2025 16:17:10 +0200 Subject: [PATCH 1/2] fix: typo control plane 01_ch_basics - Slide 69 Fix: "control place" -> "control plane" --- glossary.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/glossary.tex b/glossary.tex index 36d178d..739f841 100644 --- a/glossary.tex +++ b/glossary.tex @@ -47,7 +47,7 @@ \newglossaryentry{dataplane}{name={data plane}, description={Concept to collect all functionality concerned with transporting data per se; not concerned with decisions}} -\newglossaryentry{controlplane}{name={control place}, description={Concept to collect all functionality concerned with taking decisions to control data-plane functionality.}} +\newglossaryentry{controlplane}{name={control plane}, description={Concept to collect all functionality concerned with taking decisions to control data-plane functionality.}} \newglossaryentry{mac}{name={Medium Access Control (MAC)}, description={A control function that decides which entity is allowed to transmit, at which point in time, using which multiplexing option.}} From 4cadaa3eb0357b6ed659972a03158e7cf025844c Mon Sep 17 00:00:00 2001 From: Lasse <207553449+lasse-oo@users.noreply.github.com> Date: Fri, 9 May 2025 14:46:02 +0200 Subject: [PATCH 2/2] fix: some typos in link layer --- ch_link/ch_link_content.org | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) diff --git a/ch_link/ch_link_content.org b/ch_link/ch_link_content.org index 3f48f1b..95a7847 100644 --- a/ch_link/ch_link_content.org +++ b/ch_link/ch_link_content.org @@ -683,7 +683,7 @@ A good code should have large distance and large rate – but arbitrary combinat - E.g.: $o = x_1 \,\mathrm{XOR}\, x_5 \,\mathrm{XOR}\, x_7 \,\mathrm{XOR}\, x_8$ \pause - Equivalent: Sum of these payload bits, modulo 2 - - E.g., $o = (x_1 + _x5 + x_7 + x_8) \, \mathrm{MOD}\, 2$ + - E.g., $o = (x_1 + x_5 + x_7 + x_8) \, \mathrm{MOD}\, 2$ \pause - Which payload bits: multiply by zero or one - E.g., $o = (0\cdot x_0 + 1\cdot x_1 + 0 \cdot x_2 + 0 \cdot x_3 + 0 \cdot x_4 + 1 \cdot x_5 + 0 \cdot x_6 + 1 \cdot x_7 + 1\cdot x_8) \, \mathrm{MOD}\, 2$ @@ -1101,7 +1101,7 @@ Gives rise to notion of *coding gain* \] **** CRC – Overview -#+caption: OVerview of CRC at transmitter, channel, and receiver +#+caption: Overview of CRC at transmitter, channel, and receiver #+attr_latex: :width 0.95\textwidth :height 0.6\textheight :options keepaspectratio,page=\getpagerefnumber{page:ll:crc} #+NAME: fig:ll:crc [[./standalone/econtrol.pdf]] @@ -1114,12 +1114,12 @@ Gives rise to notion of *coding gain* - If $G(x)$ divides $E(x)\not=0$ without remainder, an error slips through! \pause -- Single bit error: $E(x) = x_i$ for error at position $i$ +- Single bit error: $E(x) = x^i$ for error at position $i$ - $G(x)$ needs two or more terms to ensure that $E(x)$ is not a multiple of it \pause -- Two bit errors: $E(x) = x_i + x_j = x_j \cdot (x_{i-j} +1)$ for some $i>j$ +- Two bit errors: $E(x) = x^i + x^j = x^j \cdot (x^{i-j} +1)$ for some $i>j$ - $x$ must not divide $G(x)$ - - $G(x)$ must not divide $(x_k + 1)$ for all $k$ up to, e.g., maximum frame length + - $G(x)$ must not divide $(x^k + 1)$ for all $k$ up to, e.g., maximum frame length \pause - Odd number of errors: $E(x)$ has an odd number of terms - $E(x)$ will NOT have $(x+1)$ as a factor (simple proof by contradiction)