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

Wording changes to LP decoding

Browse Source
This commit is contained in:
Andreas Tsouchlos 2023-02-20 08:54:52 +01:00
parent 8b3c322ade
commit 0d9a40e894
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -173,7 +173,7 @@ representation.
To solve the resulting linear program, various optimization methods can be
used.
Feldman et al. begin by looking at the \ac{ML} decoding problem%
They begin by looking at the \ac{ML} decoding problem%
\footnote{They assume that all codewords are equally likely to be transmitted,
making the \ac{ML} and \ac{MAP} decoding problems equivalent.}%
%
@ -220,8 +220,8 @@ Especially for the continuous variable in LP decoding}
As solving integer linear programs is generally NP-hard, this decoding problem
has to be approximated by one with looser constraints.
A technique called \textit{relaxation} is applied:
modifying the constraints in order to broaden the considered
domain (e.g. by lifting the integer requirement).
relaxing the constraints, thereby broadening the considered domain
(e.g. by lifting the integer requirement).
First, the authors present an equivalent \ac{LP} formulation of exact \ac{ML}
decoding, redefining the constraints in terms of the \text{codeword polytope}
%
@ -275,7 +275,7 @@ feasible solutions.
Figure \ref{fig:dec:poly:local} shows the local codeword polytope of each check
node.
Their intersection, the relaxed codeword polytope $\overline{Q}$, is shown in
figure \ref{fig:dec:poly:relaxed}.
figure \ref{fig:dec:poly:relaxed}.%
%
%
%