Added TODOs to Discussion

This commit is contained in:
Andreas Tsouchlos 2023-04-17 15:20:08 +02:00
parent fdf112c6d9
commit a3f32faa64

View File

@ -10,6 +10,7 @@ exhibit an error floor.
The decoding algorithms could then be assessed for use in very The decoding algorithms could then be assessed for use in very
high reliability applications, where traditional methods like \ac{BP} or the high reliability applications, where traditional methods like \ac{BP} or the
min-sum-algorithm fall short. min-sum-algorithm fall short.
\todo{Doesn't make sense}
As mentioned in section \ref{subsec:prox:conv_properties}, the alternating As mentioned in section \ref{subsec:prox:conv_properties}, the alternating
minimization of the two gradients in the proximal decoding algorithm leads to minimization of the two gradients in the proximal decoding algorithm leads to
@ -49,6 +50,9 @@ This could be usefull, for example, to mitigate the slow convergence of
\ac{ADMM} \cite[3.2.2]{distr_opt_book}. \ac{ADMM} \cite[3.2.2]{distr_opt_book}.
Subsequently introducing additional parity checks might be a way of combining Subsequently introducing additional parity checks might be a way of combining
the best properties of proximal decoding, \ac{LP} decoding using \ac{ADMM} and the best properties of proximal decoding, \ac{LP} decoding using \ac{ADMM} and
\textit{adaptive \ac{LP} decoding} \cite{alp} to obtain a decoder relatively \textit{adaptive \ac{LP} decoding} \cite{alp} to obtain a decoder efficiently
efficiently approximating \ac{ML} performance. approximating \ac{ML} performance.
\todo{It turns out that ADMM is more compuationally efficient than proximal
decoding.
Find a way to combine them that still makes sense (maybe exploiting the
fact that the BER is so much better than the FER, in constrasto to ADMM)}