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

Added notes about motivation for ADMM and LP decoding in general

Browse Source
This commit is contained in:
Andreas Tsouchlos 2023-03-12 21:02:15 +01:00
parent e38af48845
commit c4dfcfbb24
2 changed files with 13 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
latex/thesis/chapters/decoding_techniques.tex
View File

@ -689,6 +689,13 @@ The resulting formulation of the relaxed optimization problem becomes:%
\begin{itemize}
\item Why ADMM?
\begin{itemize}
\item Distributed nature, making it a competitor to BP
(which can also be implemented in a distributed manner)
(See original ADMM paper)
\item Computational performance similar to BP has been demnonstrated
(See original ADMM paper)
\end{itemize}
\item Adaptive linear programming?
\item How ADMM is adapted to LP decoding
\end{itemize}

6
latex/thesis/chapters/introduction.tex
View File

@ -5,6 +5,12 @@
\begin{itemize}
\item Problem definition
\item Motivation
\begin{itemize}
\item Error floor when decoding with BP (seems to not be persent with LP decoding -
see original ADMM paper introduction)
\item Strong theoretical guarantees that allow for better and better approximations
for ML decoding (See original ADMM peper introduction)
\end{itemize}
\item Results summary
\end{itemize}