Advanced coding has been widely used to accomplish the high-performance requirements of wireless communications. While adhering to the perspective on energy-spectral efficiency, channel coding is still promising. To deal with such challenge, research initiatives on the linear block error correcting codes have gained accelerating momentum. In this paper we introduce polar codes which have proven...

We present the first family of binary codes that attains optimal scaling and quasi-linear complexity, at least for the binary erasure channel (BEC). In other words, for any fixed δ > 0, we provide codes that ensure reliable communication at rates within ε > 0 of the Shannon capacity with block length n = O(1/ε2+δ), construction complexity Θ(n), and encoding/decoding complexity Θ(n log n). Furth...

We consider the problem of using polar codes over slow fading wireless channels. For design, we focus on a parallel slow fading channel with 2 blocks, and polar codes with rate ≤ 1 2 . Motivated by Arikan’s systematic polar code construction, we propose an interleaver design for a general polar code. The interleaver comprises of using the bit reversal of the order of polarized bit channels. Thi...

Polar codes have become the channel coding scheme for control of enhanced mobile broadband in 5G communication systems. Belief propagation (BP) decoding polar has advantages low latency and high parallelism but achieves worse bit error ratio (BER) performance compared with successive cancellation list (SCL) scheme. In this paper, an improved BP (IBPL) algorithm is proposed comparable BER to SCL...