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

Added lautern citation

Browse Source
This commit is contained in:
Andreas Tsouchlos 2023-01-26 17:51:18 +01:00
parent 0e84d596c0
commit 5efdea242c
2 changed files with 13 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
latex/presentations/midterm/presentation.bib
View File

@ -110,3 +110,14 @@
doi={10.1109/TIT.2004.842696} doi={10.1109/TIT.2004.842696}
} }
@ARTICLE{lautern,
author={Gensheimer, Florian and Dietz, Tobias and Kraft, Kira and Ruzika, Stefan and Wehn, Norbert},
journal={IEEE Transactions on Information Theory},
title={A Reduced-Complexity Projection Algorithm for ADMM-Based LP Decoding},
year={2020},
volume={66},
number={8},
pages={4819-4833},
doi={10.1109/TIT.2020.2984247}
}

2
latex/presentations/midterm/sections/forthcoming_examination.tex
View File

@ -13,6 +13,8 @@
\item Test the (Alternating Direction Method of Multipliers) ADMM \item Test the (Alternating Direction Method of Multipliers) ADMM
as an optimization method for LP Decoding as an optimization method for LP Decoding
\begin{itemize} \begin{itemize}
\item In LP decoding, the ML decoding problem is reduced to a linear program,
which can be solved in polynomial time \cite{lautern}
\item ADMM is intended to blend the decomposability \item ADMM is intended to blend the decomposability
of dual ascent with the superior convergence properties of the method of dual ascent with the superior convergence properties of the method
of multipliers \cite{distr_opt_book} of multipliers \cite{distr_opt_book}