An Improved Concatenation Scheme of BCH-Polar Codes with Low-Latency Decoding Architecture

8Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Wang, Y., Chen, L., Liu, C., & Xing, Z. (2019). An Improved Concatenation Scheme of BCH-Polar Codes with Low-Latency Decoding Architecture. IEEE Access, 7, 95867–95877. https://doi.org/10.1109/ACCESS.2019.2929188

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free