33 lines
1.3 KiB
TeX
33 lines
1.3 KiB
TeX
\section{Forthcoming Examinations}%
|
|
\label{sec:Forthcoming Examinations}
|
|
|
|
|
|
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
\subsection{Forth Exam LP Decoding}%
|
|
\label{sub:Forth Exam LP Decoding}
|
|
|
|
\begin{frame}[t]
|
|
\frametitle{Forthcoming Examinations}
|
|
|
|
\begin{itemize}
|
|
\item Test the (Alternating Direction Method of Multipliers) ADMM
|
|
as an optimization method for LP Decoding
|
|
\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
|
|
of dual ascent with the superior convergence properties of the method
|
|
of multipliers \cite{distr_opt_book}
|
|
\item ADMM has been proposed for efficient LP Decoding
|
|
\cite{efficient_lp_dec_admm}
|
|
\end{itemize}
|
|
\item Compare ADMM implementation with Proximal Decoding implementation with respect to
|
|
\begin{itemize}
|
|
\item Decoding performance (BER, FER)
|
|
\item Computational performance (time complexity, actual seconds per frame)
|
|
\end{itemize}
|
|
\end{itemize}
|
|
|
|
\end{frame}
|
|
|