2 research outputs found
Comparison of Windowed-Decoder Configurations for Spatially Coupled LDPC Codes Under Equal-Complexity Constraints
Spatially Coupled Low-Density Parity-Check (SC-LDPC) codes offer excellent
decoding performance and can be elegantly decoded with a Windowed Decoder (WD).
We determine an efficient WD configuration with low control overhead. For fair
comparisons, we normalize all configurations to the same maximal computational
complexity, which is an important measure of the decoding effort in
packet-based data communication systems. We determine an optimized
configuration from a joint evaluation of the window size, the window update
strategy, and parity check-based Early Termination (ET). Firstly, we use a
variable node-centered update strategy, which omits updates of messages in some
parts of the decoding window. With the complexity normalization, the window
size can be increased compared to a check node-centered update strategy, which
uniformly updates all messages in the decoding window. Secondly, we only
require the satisfaction of the top-most parity-check equations in each window
to move to the next position more quickly. Using a surprisingly large window
size, the resulting WD halves the average decoding complexity of the block
decoder while maintaining a rather small gap in the decoding performance.Comment: 13 pages, 5 figures, to be submitted to Elsevier AE\"U -
International Journal of Electronics and Communication
Multi-Dimensional Spatially-Coupled Code Design: Enhancing the Cycle Properties
A circulant-based spatially-coupled (SC) code is constructed by partitioning
the circulants in the parity-check matrix of a block code into several
components and piecing copies of these components in a diagonal structure. By
connecting several SC codes, multi-dimensional SC (MD-SC) codes are
constructed. In this paper, we present a systematic framework for constructing
MD-SC codes with notably better cycle properties than their one-dimensional
counterparts. In our framework, the multi-dimensional coupling is performed via
an informed relocation of problematic circulants. This work is general in the
terms of the number of constituent SC codes that are connected together, the
number of neighboring SC codes that each constituent SC code is connected to,
and the length of the cycles whose populations we aim to reduce. Finally, we
present a decoding algorithm that utilizes the structures of the MD-SC code to
achieve lower decoding latency. Compared to the conventional SC codes, our
MD-SC codes have a notably lower population of small cycles, and a dramatic BER
improvement. The results of this work can be particularly beneficial in data
storage systems, e.g., 2D magnetic recording and 3D Flash systems, as
high-performance MD-SC codes are robust against various channel impairments and
non-uniformity.Comment: 34 pages, 10 figures, submitted to IEEE Transactions on
Communications (TCOM