Polar coded grayscale image communication over additive white Gaussian noise (AWGN) channels using orthogonal frequency division multiplexing (OFDM) system is demonstrated in this paper. The OFDM technique is effective multicarrier technique used in the high-speed transmission system. Polar codes are recently applied to the binary memoryless channel and binary erasure channels for achieving nea...

We discuss the performance of polar codes, the capacity-achieving channel codes, on wireless communication channel in this paper. By generalizing the definition of Bhattacharyya Parameter in discrete memoryless channel, we present the special expression of the parameter for Gaussian and Rayleigh fading the two continuous channels, including the recursive formulas and the initial values. We anal...

Systematic polar codes are shown to outperform non-systematic polar codes in terms of the bit-error-rate (BER) performance. However theoretically the mechanism behind the better performance of systematic polar codes is not yet clear. In this paper, we set the theoretical framework to analyze the performance of systematic polar codes. The exact evaluation of the BER of systematic polar codes con...

Polar codes were introduced by Arikan [1] in 2008 and are the first family of error-correcting codes achieving the symmetric capacity of an arbitrary binary-input discrete memoryless channel under low complexity encoding and using an efficient successive cancellation decoding strategy. Recently, non-binary polar codes have been studied, in which one can use different algebraic geometry codes to...

Polar codes are considered the latest major breakthrough in coding theory. Polar codes were introduced by Arıkan in 2008. In this letter, we show that the binary polar codes are the same as the optimized codes for bitwise multistage decoding (OCBM), which have been discovered before by Stolte in 2002. The equivalence between the techniques used for the constructions and decodings of both codes ...

In this article, we introduce a new family of polar codes from evaluation codes, called decreasing monomial-Cartesian and prove that families with multiple kernels over certain symmetric channels can be viewed as codes. This offers unified treatment for such any finite field. We define obtained set monomials closed under divisibility Cartesian product determine their parameters (length, dimensi...