An Optimized Method for Polar Code Construction

Polar codes are traditionally constructed by calculating the reliability of channels, then sorting them intensive calculations to select most reliable channels. However, these operations can be complicated especially when, polar code length, N becomes great. This paper proposes a new low-complexity procedure for construction over binary erasure and additive white Gaussian noise (AWGN) Using proposed algorithm, complexity is reduced from O(Nlog N) O(N), where N=2n (n≥1). The approach involves storing classification channels reliabilities in vector length L, deriving M every M<=L. method consistent with Bhattacharya parameter based Construction Density Evolution Approximation (DEGA) construction. In this paper, Successive Cancellation Decoding algorithm (SCDA) used. Thanks its low high error-correction capability.