Sphere polar decoding can achieve the maximum likelihood (ML) bound. Existing sphere polar decoding ignores that the Euclidean distance of the frozen bits can be determined at earlier decoding levels. In this article, efficient sphere polar decoding is proposed to reduce the complexity. The set-by-set decoding process via synchronous determination is applied to the sphere polar decoding with fixed lower bounds and its multiple-searches version. Numeric results show the proposed decoding reduces much complexity on the low-rate codes compared with the existing sphere decoding while maintaining the same performance. At high signal-to-noise ratios, the latency of the proposed decoding is comparable with the successive cancellation list decoding.

中文翻译：

---

通过同步测定进行高效球面极性解码


球极坐标解码可以实现最大似然（ML）界限。现有的球极坐标解码忽略了可以在较早的解码级别确定冻结比特的欧几里得距离。在本文中，提出了高效的球极解码来降低复杂度。通过同步确定的逐组解码过程应用于具有固定下界的球极坐标解码及其多搜索版本。数值结果表明，与现有的球形解码相比，所提出的解码在保持相同性能的同时大大降低了低速率代码的复杂性。在高信噪比下，所提出的解码的延迟与连续消除列表解码相当。