From 23828b671a65159ee731e53e0b67229a5cc916f6 Mon Sep 17 00:00:00 2001 From: Andreas Tsouchlos Date: Mon, 4 May 2026 16:08:56 +0200 Subject: [PATCH] Minor changes to conclusion --- src/thesis/chapters/5_conclusion_and_outlook.tex | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/src/thesis/chapters/5_conclusion_and_outlook.tex b/src/thesis/chapters/5_conclusion_and_outlook.tex index 93b1b6a..fdc9408 100644 --- a/src/thesis/chapters/5_conclusion_and_outlook.tex +++ b/src/thesis/chapters/5_conclusion_and_outlook.tex @@ -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