Performance Analysis Of Polar Codes Research Articles

Performance analysis of Polar Codes in a Visible Light Communication System

One of the vital entity of any communication systems is Channel coding, which leads to the design of high performance codes for future wireless systems having low complexity encoder and decoder design. These systems will have a requirement of operating in highly reliable conditions, maximum throughput, and low and high code rates and to work with short and long information messages. Polar codes are one of the promising error correcting channel codes that can be used in these situations to obtain maximum throughput and coding gain in a communication systems because of their capacity approaching performance and finds interests in Satellite communication and 4G/5G services. These codes uses the concept of channel polarization to be constructed. The work proposed in this paper focusses on the Bit Error Rate evaluation and analysis of the Polar codes using traditional approach and Deep learning approach. The feedforward deep learning networks using different activation functions were used for the Deep learning approach. The Successive Cancellation algorithm and its variant using List decoding were used as traditional decoding methodology. The results obtained using Deep learning approach were satisfactory and was matching as per the traditional decoding.

Performance Analysis of Polar Codes Over Fox’s H-Fading Channels With RHI and IQI Impairments

This study examined the error probability performance of polar codes across Fox’s <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$H$ </tex-math></inline-formula> -fading (FHF) channels while taking into account in-phase and quadrature-phase imbalance (IQI), as well as residual hardware impairments (RHI). This fading model generalizes most of the commonly used fading and turbulence models where Málaga- <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\mathcal {M}$ </tex-math></inline-formula> turbulence is taken into account as a specific case of FHF in this paper. Specifically, an upper bound on block error probability (BLER) for the successive cancellation (SC) decoding method of polar codes is derived in terms of the Fox’s <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$H$ </tex-math></inline-formula> -function. According to numerical results, by lengthening polar codes and changing the properties of fading channels, it is possible to decrease the impact of system impairments on the error probability performance.

Performance analysis of polar codes for one-coincidence-coded OCDM networks

A polar code over One-Coincidence-coded optical code-division multiplexing (OCDM) network is proposed, which is suitable for the multi-access optical fiber network. The excellent error correction ability of Polar code was applied to build a low error rate performance of network system. The proposed architecture not only supports lots of users by OCDM technology with spectral amplitude coding scheme to eliminate multiple-access interference, but also support that burst traffic at the same time of data transmitting by few users. The commutation channels will divide into two opposing channel quality, information channel and frozen channel by channel polarization of polar code. The buffer channel is created to support burst user, and it is build-in in information channel. Simulation results show that the proposed architecture can improve the system performance, compared with uncoded network. The proposed algorithm has better bit error rate performance.

Performance Analysis of Polar Codes and LDPC Codes in Optical Satellite Communication Systems

Performance Analysis of Polar Codes and LDPC Codes in Optical Satellite Communication Systems

A Lower Bound on the Probability of Error of Polar Codes over BMS Channels

Polar codes are a family of capacity-achieving codes that have explicit and low-complexity construction, encoding, and decoding algorithms. Decoding of polar codes is based on the successive-cancellation decoder, which decodes in a bit- wise manner. A decoding error occurs when at least one bit is erroneously decoded. The various codeword bits are correlated, yet performance analysis of polar codes ignores this dependence: the upper bound is based on the union bound, and the lower bound is based on the worst-performing bit. Improvement of the lower bound is afforded by considering error probabilities of two bits simultaneously. These are difficult to compute explicitly due to the large alphabet size inherent to polar codes. In this research we propose a method to lower-bound the error probabilities of bit pairs. We develop several transformations on pairs of synthetic channels that make the resultant synthetic channels amenable to alphabet reduction. Our method yields lower bounds that significantly improve upon currently known lower bounds for polar codes under successive-cancellation decoding.