Explore chapters and articles related to this topic
Performance Analysis of Polar Codes
Published in Durgesh Kumar Mishra, Nilanjan Dey, Bharat Singh Deora, Amit Joshi, ICT for Competitive Strategies, 2020
M. Valarmathi Saila, Shanthi Prince
Polar codes invented by Erdal Arikan in 2009 are the first ever codes to achieve Shannon capacity asymptotically. Polar codes are based on the idea of channel polarization and have an explicit proof for approaching capacity. Polar codes have a deterministic nature and less encoding and decoding complexity. Polar codes offer good hardware efficiency and are easy to implement. Due to its structural property, polar coding has become a competitive and efficient coding scheme. Over the past few years, the concept of channel polarization as well as polar codes have been stretched to a number of applications and generalizations.
Information Theory
Published in Jerry D. Gibson, Mobile Communications Handbook, 2017
Emmanuel Abbe, Bixio Rimoldi, Rüdiger Urbanke
Invented in 2008 by Erdal Arikan (see Arikan 2009), polar codes constitute a new family of linear codes. The original construction of polar codes relies on a different intuition than the construction of LDPC codes. Rather than focusing on the parity-check matrix, a probabilistic phenomenon called “channel polarization” is used to guide the code construction. We next explain this phenomenon in the source setting, which is also called the “source polarization.”
Network polar coded cooperative GSM scheme based on Plotkin’s construction
Published in International Journal of Electronics, 2023
Chunli Zhao, Fengfan Yang, Daniel Kariuki Waweru, Rahim Umar
Coded-cooperative diversity, which is an integration of channel codes and cooperative schemes like compress-and-forward (CF), decode-and-forward (DF) and amplify-and-forward (AF), has been considered as an effective technique to combat the channel fading. To attain the coded-cooperative diversity, various channel codes like polar code (Umar et al., 2018), LDPC code (Ejaz et al., 2015a) and turbo code (Zhao et al., 2020) have been proposed. In Arikan, 2009, Arikan proposed the capacity-achieving polar codes on the basis of the phenomenon of channel polarisation. In Andersson et al., 2010, the polar coded cooperative scheme via wiretap and relay channels was presented. The polar coded scheme for half-duplex cooperative communication was introduced in Zhan et al., 2014. In Ejaz et al., 2015b, the authors presented a Plotkin’s construction of polar codes for coded cooperative communications. However, the current coded cooperative schemes mostly focus on binary phase shift keying (BPSK) modulation, which results in poor spectral efficiency. In order to solve the problem, the GSM technique with high-order modulation is utilized in coded cooperative communications.
Overview of the challenges and solutions for 5G channel coding schemes
Published in Journal of Information and Telecommunication, 2021
Madhavsingh Indoonundon, Tulsi Pawan Fowdur
Arikan invented a class of linear block codes called Polar codes (2009). Arikan and Telatar (2008) derived equation (3) to calculate the probability of error for polar codes in a binary memoryless symmetric channel (BMSC):