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

Minor changes to conclusion

Browse Source
This commit is contained in:
Andreas Tsouchlos
2026-05-04 16:08:56 +02:00
parent 09893d527e
commit 23828b671a
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
src/thesis/chapters/5_conclusion_and_outlook.tex
View File

@@ -20,7 +20,7 @@ This manifests as a block-diagonal structure in the detector error
matrix when detectors are defined as the difference of consecutive
syndrome measurement rounds.
We draw a comparison to windowed decoding for \ac{sc}-\ac{ldpc}
codes, but noted that the existing realizations of sliding-window
codes, but note that the existing realizations of sliding-window
decoding discard the soft information produced inside one window
before moving to the next.
Building on this observation, we proposed warm-start sliding-window
@@ -31,7 +31,7 @@ standard cold-start initialisation.
We formulate the warm start for standard \ac{bp} and for
\ac{bpgd}.
In particular the latter being attractive as an inner decoder because it
The latter is particularly attractive as an inner decoder because it
addresses the convergence problems caused by short cycles and
degeneracy in \ac{qldpc} Tanner graphs.
The decoders are evaluated by conducting Monte Carlo simulations on the
@@ -68,7 +68,7 @@ The resulting message-only warm start recovered a consistent
improvement over cold-start that followed the same qualitative
behaviour as for standard \ac{bp}: larger overlap, achieved by larger
$W$ or smaller $F$, yielded a larger gain, and the
performance difference was most pronounced at low numbers of maximum iterations.
performance difference is most pronounced at low numbers of maximum iterations.
% Implications from experimental results