an.tsouchlos/ba-thesis
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases 1 Wiki Activity

Renamed tikzmarknew to tikzbracemark

Browse Source
This commit is contained in:
Andreas Tsouchlos 2023-01-23 20:12:24 +01:00
parent 5b863188c3
commit d99694efba
1 changed files with 7 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
latex/presentations/midterm/sections/examination_results.tex
View File

@ -234,7 +234,8 @@ Output $\boldsymbol{\hat{x}}$
\end{frame} \end{frame}
\newcommand{\tikzmarknew}[1]{\tikz[overlay,remember picture] \node (#1) {};} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\newcommand{\tikzbracemark}[1]{\tikz[overlay,remember picture] \node (#1) {};}
\newcommand*{\AddNote}[4]{% \newcommand*{\AddNote}[4]{%
\begin{tikzpicture}[overlay, remember picture] \begin{tikzpicture}[overlay, remember picture]
@ -245,6 +246,7 @@ Output $\boldsymbol{\hat{x}}$
\end{tikzpicture} \end{tikzpicture}
}% }%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\begin{frame}[t, fragile] \begin{frame}[t, fragile]
\frametitle{Proximal Decoding: Improvement using ``ML-on-List''} \frametitle{Proximal Decoding: Improvement using ``ML-on-List''}
\setcounter{footnote}{0} \setcounter{footnote}{0}
@ -263,18 +265,18 @@ Output $\boldsymbol{\hat{x}}$
\begin{algorithm}[caption={}, label={}, \begin{algorithm}[caption={}, label={},
basicstyle=\fontsize{6.5}{7.5}\selectfont basicstyle=\fontsize{6.5}{7.5}\selectfont
] ]
$\boldsymbol{s}^{\left( 0 \right)} = \boldsymbol{0}$$\hspace{4.185cm}\tikzmarknew{prox-start}$ $\boldsymbol{s}^{\left( 0 \right)} = \boldsymbol{0}$$\hspace{4.185cm}\tikzbracemark{prox-start}$
for $k=0$ to $K-1$ do for $k=0$ to $K-1$ do
$\boldsymbol{r}^{\left( k+1 \right)} = \boldsymbol{s}^{(k)} - \omega \nabla L \left( \boldsymbol{s}^{(k)}; \boldsymbol{y} \right) $ $\boldsymbol{r}^{\left( k+1 \right)} = \boldsymbol{s}^{(k)} - \omega \nabla L \left( \boldsymbol{s}^{(k)}; \boldsymbol{y} \right) $
Compute $\nabla h\left( \boldsymbol{r}^{\left( k+1 \right) } \right)$ Compute $\nabla h\left( \boldsymbol{r}^{\left( k+1 \right) } \right)$
$\boldsymbol{s}^{\left( k+1 \right)} = \boldsymbol{r}^{(k+1)} - \gamma \nabla h\left( \boldsymbol{r}^{\left( k+1 \right) } \right) $ $\boldsymbol{s}^{\left( k+1 \right)} = \boldsymbol{r}^{(k+1)} - \gamma \nabla h\left( \boldsymbol{r}^{\left( k+1 \right) } \right) $
$\boldsymbol{\hat{x}} = \text{sign}\left( \boldsymbol{s}^{\left( k+1 \right) } \right) $ $\boldsymbol{\hat{x}} = \text{sign}\left( \boldsymbol{s}^{\left( k+1 \right) } \right) $
If $\boldsymbol{\hat{x}}$ passes the parity check condition, output $\boldsymbol{\hat{x}}$ If $\boldsymbol{\hat{x}}$ passes the parity check condition, output $\boldsymbol{\hat{x}}$
end for $\tikzmarknew{prox-end}$ end for $\tikzbracemark{prox-end}$
Find $N$ most probably wrong bits $\hspace{2cm}\tikzmarknew{ml-start}$ Find $N$ most probably wrong bits $\hspace{2cm}\tikzbracemark{ml-start}$
Generate variations $\boldsymbol{\tilde{x}}_n$ of $\boldsymbol{\hat{x}}$ with the $N$ bits modified Generate variations $\boldsymbol{\tilde{x}}_n$ of $\boldsymbol{\hat{x}}$ with the $N$ bits modified
Compute $d\left( \boldsymbol{ \tilde{x}}_n, \boldsymbol{\hat{x}} \right) \forall n \in \left[ 1 : N-1 \right] $ Compute $d\left( \boldsymbol{ \tilde{x}}_n, \boldsymbol{\hat{x}} \right) \forall n \in \left[ 1 : N-1 \right] $
Output $\boldsymbol{\tilde{x}}_n$ with lowest $d\left( \boldsymbol{ \tilde{x}}_n, \boldsymbol{\hat{x}} \right)$ $\tikzmarknew{ml-end}$ Output $\boldsymbol{\tilde{x}}_n$ with lowest $d\left( \boldsymbol{ \tilde{x}}_n, \boldsymbol{\hat{x}} \right)$ $\tikzbracemark{ml-end}$
\end{algorithm} \end{algorithm}
\AddNote{prox-start}{prox-end}{prox-start}{\small Proximal\\Decoding} \AddNote{prox-start}{prox-end}{prox-start}{\small Proximal\\Decoding}