Code-Weight Sphere Decoding

Ultra-reliable low-latency communications (URLLC) demand high-performance error-correcting codes and decoders in the finite blocklength regime. This letter introduces a novel two-stage near-maximum likelihood (near-ML) decoding framework applicable to any linear block code. Our approach first employs a low-complexity initial decoder. If this initial stage fails a cyclic redundancy check, it triggers a second stage: the proposed code-weight sphere decoding (WSD). WSD iteratively refines the codeword estimate by exploring a localized sphere of candidates constructed from pre-computed low-weight codewords. This strategy adaptively minimizes computational overhead at high signal-to-noise ratios while achieving near-ML performance, especially for low-rate codes. Extensive simulations demonstrate that our two-stage decoder provides an excellent trade-off between decoding reliability and complexity, establishing it as a promising solution for next-generation URLLC systems.

💡 Research Summary

The paper addresses the stringent requirements of ultra‑reliable low‑latency communications (URLLC), where short blocklengths and low code rates demand decoders that are both computationally light and near‑maximum‑likelihood (near‑ML) in performance. To meet this need, the authors propose a generic two‑stage decoding framework that can be applied to any linear block code.

Stage 1 – Low‑complexity initial decoding.
An arbitrary low‑complexity sub‑optimal decoder (e.g., OSD‑1, belief propagation, or a simple hard‑decision decoder) first produces a tentative codeword estimate (\hat c^{(-1)}). If a cyclic redundancy check (CRC) is present, the decoder validates the extracted message; a successful CRC leads to immediate termination, thereby saving latency and computation. When the CRC fails—or when no CRC is used—the process proceeds to the second stage.

Stage 2 – Code‑Weight Sphere Decoding (WSD).
The core novelty is the “code‑weight sphere” concept. For a linear code (C(N,K)), all codewords are partitioned into Hamming shells (C_{d_\ell}(c)) of equal Hamming distance (d_\ell) from a reference codeword (c). A sphere of radius (r) is defined as the union of the first (r) shells: \