Minor changes to conclusion
This commit is contained in:
@@ -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
|
matrix when detectors are defined as the difference of consecutive
|
||||||
syndrome measurement rounds.
|
syndrome measurement rounds.
|
||||||
We draw a comparison to windowed decoding for \ac{sc}-\ac{ldpc}
|
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
|
decoding discard the soft information produced inside one window
|
||||||
before moving to the next.
|
before moving to the next.
|
||||||
Building on this observation, we proposed warm-start sliding-window
|
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
|
We formulate the warm start for standard \ac{bp} and for
|
||||||
\ac{bpgd}.
|
\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
|
addresses the convergence problems caused by short cycles and
|
||||||
degeneracy in \ac{qldpc} Tanner graphs.
|
degeneracy in \ac{qldpc} Tanner graphs.
|
||||||
The decoders are evaluated by conducting Monte Carlo simulations on the
|
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
|
improvement over cold-start that followed the same qualitative
|
||||||
behaviour as for standard \ac{bp}: larger overlap, achieved by larger
|
behaviour as for standard \ac{bp}: larger overlap, achieved by larger
|
||||||
$W$ or smaller $F$, yielded a larger gain, and the
|
$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
|
% Implications from experimental results
|
||||||
|
|
||||||
|
|||||||
Reference in New Issue
Block a user