Concatenating the state-of-the-art codes at moderate rates with repetition has emerged as a practical solution deployed in various standards for ultra-low-power devices such Internet-of-Things (IoT) networks. In this paper, we propose novel concatenation mechanism applications which need to operate very low signal-to-noise ratio (SNR) regime. proposed scheme, outer code is hybrid polar construc...

Upper union bound for the decoding error probability of polar codes with arbitrary binary kernels under the successive cancellation decoding is derived. The proposed approach is based on the representation of polar codes as multilevel ones.

This paper investigates polar codes for the additive white Gaussian noise (AWGN) channel. The scaling exponent μ of polar codes for a memoryless channel qY |X with capacity I(qY |X) characterizes the closest gap between the capacity and non-asymptotic achievable rates in the following way: For a fixed ε ∈ (0, 1), the gap between the capacity I(qY |X) and the maximum non-asymptotic rate R n achi...

It’s known that the bit errors of polar codes with successive cancellation (SC) decoding are coupled. However, existing concatenation schemes of polar codes with other error correction codes rarely take this coupling effect into consideration. To achieve a better BER performance, a concatenation scheme, which divides all Nl bits in a LDPC block into Nl polar blocks to completely de-correlate th...