Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
