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

Added todo

Browse Source
This commit is contained in:
Andreas Tsouchlos 2023-04-04 18:16:08 +02:00
parent a4bbe794f2
commit 2ade886191
1 changed files with 2 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
latex/thesis/chapters/theoretical_background.tex
View File

@ -252,6 +252,8 @@ For the code depicted in figure \ref{fig:theo:tanner_graph}, for example,
$N_c\left( 1 \right) = \left\{ 1, 3, 5, 7 \right\}$ and $N_c\left( 1 \right) = \left\{ 1, 3, 5, 7 \right\}$ and
$N_v\left( 3 \right) = \left\{ 1, 2 \right\}$. $N_v\left( 3 \right) = \left\{ 1, 2 \right\}$.
\todo{Define $d_i$ and $d_j$}
Message passing algorithms are based on the notion of passing messages between Message passing algorithms are based on the notion of passing messages between
\acp{CN} and \acp{VN}. \acp{CN} and \acp{VN}.
\Ac{BP} is one such algorithm that is commonly used to decode \ac{LDPC} codes. \Ac{BP} is one such algorithm that is commonly used to decode \ac{LDPC} codes.