Abstract
Polar codes have drawn much research attention in the last ten years for their capacity-achieving property. However, their conventional successive cancellation decoding method performs not well at a short or moderate length. In order to improve the performance, concatenation with other error-correction codes has been proved an effective approach, whereas current concatenation schemes using rate-optimized method are too complex to implement with long decoding latency. In this paper, we propose a critical set protected BCH-Polar code with its corresponding decoding architecture. In the proposed concatenation scheme, we only provide extra protection to partial information bits in the critical set, which is constructed based on the channel reliability. For its corresponding decoding architecture, we redesign some components and adopt the Look-up table decoding method for BCH codes, resulting in much degradation of decoding latency. Compared with existing decoders, the hardware implementation shows low decoding latency and high throughput-area efficiency.
Highlights
Polar codes have attracted much attention since their invention [1] for their capacity-achieving property and have been selected for the control channel in the 5G enhanced Mobile BroadBand scenario [2]
One reason for this phenomenon is that the successive cancellation (SC) decoding is susceptible to the error propagation, while the other reason is that the polar codes themselves are weak for its incomplete polarization at these lengths
We propose to construct a set Sc that includes the subchannels having a high probability of being interfered by channel noise, based on the observation of channel-induced error distributions
Summary
Polar codes have attracted much attention since their invention [1] for their capacity-achieving property and have been selected for the control channel in the 5G enhanced Mobile BroadBand (eMBB) scenario [2]. For the URLLC scenario, its criteria focus on channel codes with high reliability at small to moderate code lengths and low decoding latency At these interest lengths, the conventional successive cancellation (SC) decoding of polar codes falls short in error-correction performance when compared with the Turbo or the low-density parity-check (LDPC) codes. Aiming at improving the performance of polar codes with low complexity, the successive cancellation flip (SCF) decoding was proposed in [11] with the capability of providing error-correction performance close to that of SCL decoding with small list size. Its decoding latency is uncertain, which is not suitable for the time-sensitive scenarios Another approach to improve performance is to concatenate polar codes with other error-correction codes.
Sign-in/Register to view highlights & summary 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.
