Add syndrome update equation

This commit is contained in:
2026-05-01 19:31:18 +02:00
parent 3d3556689e
commit 1632f19c47

View File

@@ -376,8 +376,8 @@ explicitly work with the \ac{dem} formalism.
% } % }
%%%%%%%%%%%%%%%% %%%%%%%%%%%%%%%%
\subsection{Algorithm} \subsection{Window Splitting and Sequential Sliding-Window Decoding}
\label{subsec:Algorithm} \label{subsec:Window Splitting and Sequential Sliding-Window Decoding}
In this section, we will examine the methodology by which a detector In this section, we will examine the methodology by which a detector
error matrix is divided into overlapping windows. error matrix is divided into overlapping windows.
@@ -634,32 +634,31 @@ and after decoding all windows we will therefore have committed all \acp{vn}.
\label{fig:vis_rep} \label{fig:vis_rep}
\end{figure} \end{figure}
\Cref{fig:vis_rep} illustrates the meaning of the various sets of nodes.
% Syndrome update % Syndrome update
\content{Why we need to update the syndrome} \Cref{fig:vis_rep} illustrates the meaning of the various sets of nodes.
\content{How we update the syndrome} We can also see a particular point we have to be careful about when
\content{\textbf{General note}: Mathematical definitions where possible} moving on to decode the next window.
While the \acp{vn} in $\mathcal{J}_\text{commit}^{(\ell)}$ have no
% Complete process bearing on the further decoding process, the values commit for the
\acp{vn} in $\mathcal{I}_\text{commit}^{(\ell)}$ do.
\content{(?) Proper algorithm definition?} This is the case because these \acp{vn} have neighboring \acp{cn} in
\content{1. Decode window} the next window.
\content{2. Commit VN estimates} The part of the detector error matrix $\bm{H}_\text{DEM}$ describing
\content{3. Update syndrome} these connections is
\content{4. Decode next window} $\bm{H}_\text{overlap}^{(\ell)} =
\content{(?) Explicitly mention we don't reuse existing messages?} \left(\bm{H}_\text{DEM}\right)_{\mathcal{J}_\text{overlap}^{(\ell)},
\mathcal{I}_\text{commit}^{(\ell)}}$.
\content{Double-check all definitions} We have to account for this fact by updating the syndrome $\bm{s}$
based on the committed bit values.
% TODO: Do I need this? Specifically, if $\bm{e}_\text{commit}^{(\ell)}$ describes the error
% \content{Possibly go into the fact that current sliding-window estimates commited after decoding window $\ell$, we have to set
% approaches don't differentiate clearly between the sliding-window \begin{align*}
% part and the decoder part. This work aims to extend the \bm{s}_{\mathcal{J}_\text{overlap}^{(\ell)}} =
% sliding-window part in a general fashion that is compatible with many \bm{H}_\text{overlap}^{(\ell)}
% different decoder parts. Combine this with QUITS modular structure \left( \bm{e}_\text{commit}^{(\ell)} \right)^\text{T}
% for sliding window decoding} .%
\end{align*}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\section{Warm-Start Sliding-Window Decoding} \section{Warm-Start Sliding-Window Decoding}