Corpus ID: 211132478

# Polarization-adjusted Convolutional (PAC) Codes: Fano Decoding vs List Decoding

@article{Rowshan2020PolarizationadjustedC,
title={Polarization-adjusted Convolutional (PAC) Codes: Fano Decoding vs List Decoding},
author={Mohammad Rowshan and Andreas Peter Burg and Emanuele Viterbo},
journal={ArXiv},
year={2020},
volume={abs/2002.06805}
}
• Published 2020
• Computer Science, Mathematics
• ArXiv
In the Shannon lecture at the 2019 International Symposium on Information Theory (ISIT), Arikan proposed to employ a one-to-one convolutional transform as a pre-coding step before polar transform. The resulting codes of this concatenation are called {\em polarization-adjusted convolutional (PAC) codes}. In this scheme, a pair of polar mapper and demapper as pre- and post-processing devices are deployed around a memoryless channel, which provides polarized information to an outer decoder leading… Expand
13 Citations
Complexity-efficient Fano Decoding of Polarization-adjusted Convolutional (PAC) Codes
• Computer Science
• 2020 International Symposium on Information Theory and Its Applications (ISITA)
• 2020
An adaptive heuristic metric is proposed that improves the comparability of the variable-length paths and adjusts itself in response to the channel noise level and can significantly reduce the number of nodes visited on average in tree-traversal. Expand
List Viterbi Decoding of PAC Codes
• Computer Science
• 2020
This work implements the parallel list Viterbi algorithm (LVA) and shows how the error correction performance moves from the poor performance of the Viterba algorithm (VA) to the superior performance of list decoding by changing the constraint length, list size, and the sorting strategy in the LVA. Expand
List Viterbi Decoding of PAC Codes
• Computer Science, Mathematics
• ArXiv
• 2020
This work implements the parallel list Viterbi algorithm (LVA) and shows how the error correction performance moves from the poor performance of the Viterba algorithm (VA) to the superior performance of list decoding by changing the constraint length, list size, and the sorting strategy in the LVA. Expand
Fast List Decoders for Polarization-Adjusted Convolutional (PAC) Codes
• Computer Science, Mathematics
• ArXiv
• 2020
Simulation results present that fast list decoding with three types of constituent nodes can yield exactly the same error-correction performance as list decoding, and reduce more than 50% time steps for the code (128,64). Expand
List Decoding of Arıkan’s PAC Codes
• Computer Science
• 2020 IEEE International Symposium on Information Theory (ISIT)
• 2020
The main goals in this paper are to answer the following question: is sequential decoding essential for the superior performance of PAC codes and to suggest that the goal of rate-profiling may be to optimize the weight distribution at low weights. Expand
List Decoding of Arıkan’s PAC Codes †
• Computer Science, Mathematics
• Entropy
• 2021
This paper observes that both sequential decoding and list decoding of PAC codes closely match ML decoding thereof, and estimates the number of low weight codewords in PAC codes, and indicates that PAC codes are superior to both polar codes and Reed–Muller codes. Expand
Genetic optimization of short block-length PAC codes for high capacity PHz communications
• Engineering, Computer Science
• International Conference on Optoelectronic and Microelectronic Technology and Application
• 2020
A genetic algorithm (GenAlg) based optimization scheme of PAC codes evaluated by list decoding is proposed, which shows that a (512, 256) PAC code optimized by the proposed GenAlg scheme can achieve a noticeable performance gain. Expand
A Modified Q-Learning Algorithm for Rate-Profiling of Polarization Adjusted Convolutional (PAC) Codes
• Samir Kumar Mishra
• Computer Science, Mathematics
• ArXiv
• 2021
A reinforcement learning based algorithm for rate-profile construction of Arikan’s Polarization Assisted Convolutional (PAC) codes is proposed and a set of new reward and update strategies are presented which help the reinforcement learning agent discover much better rate-profiles than those present in existing literature. Expand
Selectively Precoded Polar Codes
• Physics, Computer Science
• ArXiv
• 2020
Simulation results show that for a target frame erasure rate (FER) of $10^{-5}$, a (128, 64) SPP code is just 0.23 dB away from the information theoretic limit at this blocklength. Expand
Performance and Complexity of Sequential Decoding of PAC Codes
• Computer Science, Mathematics
• ArXiv
• 2020
A method for bounding the complexity of sequential decoding of PAC codes is proposed, and a performance and computational complexity comparison ofPAC codes with 5G polar codes and convolutional codes is given. Expand

#### References

SHOWING 1-10 OF 30 REFERENCES
SC-Fano Decoding of Polar Codes
• Computer Science, Engineering
• IEEE Access
• 2019
The proposed SC-Fano decoding can provide better performance-complexity tradeoff than the existing decoding methods and address the major drawback of SC decoding by enabling moving-backward when the reliability of an on-going path is not good enough. Expand
Supercode heuristics for tree search decoding
• Computer Science
• 2008 IEEE Information Theory Workshop
• 2008
A novel two-pass decoder is presented which incorporates features of both these techniques but can achieve decoding complexities lower than either of them, and it is demonstrated that such a decoder can be made equivalent to a sequential decoder with the Fano metric, a sequentialDecoder with an ML metric, or a Viterbi decoder (run backwards). Expand
List decoding of polar codes
• Mathematics, Computer Science
• 2011 IEEE International Symposium on Information Theory Proceedings
• 2011
It appears that the proposed list decoder bridges the gap between successive-cancellation and maximum-likelihood decoding of polar codes, and devise an efficient, numerically stable, implementation taking only O(L · n log n) time and O( L · n) space. Expand
Stepped List Decoding for Polar Codes
• Computer Science
• 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC)
• 2018
This paper investigates the list decoding process by introducing a new parameter named path metric range (PMR) to elucidate the properties of the evolution of the path metrics (PMs) within the list throughout the decoding process, and advocates that the list size can change stepwise depending on PMR. Expand
A Low-Complexity Improved Progressive Bit-Flipping Decoding for Polar Codes
• Computer Science
• 2018 IEEE 4th International Conference on Computer and Communications (ICCC)
• 2018
An improved progressive bit-flipping (IPBF) decoding algorithm is proposed that not only significantly reduces the average decoding complexity, but also has a slight improvement in decoding performance. Expand
A low-complexity improved successive cancellation decoder for polar codes
• Computer Science, Mathematics
• 2014 48th Asilomar Conference on Signals, Systems and Computers
• 2014
A new flavor of the SC decoder is described, called the SC flip decoder, which preserves the low memory requirements of the basic SC decoding and adjusts the required decoding effort to the signal quality. Expand
Hardware Implementation of Successive-Cancellation Decoders for Polar Codes
• Computer Science, Mathematics
• J. Signal Process. Syst.
• 2012
This work proposes a family of efficient hardware implementations for successive cancellation (SC) polar decoders and shows that SC decoding can be implemented in the logarithmic domain, thereby eliminating costly multiplication and division operations, and reducing the complexity of each processing element greatly. Expand
Improved List Decoding of Polar Codes by Shifted-pruning
• Computer Science
• 2019 IEEE Information Theory Workshop (ITW)
• 2019
A modified pruning scheme named shifted-pruning over a set of low-reliability bit-channels named critical bits is proposed aiming to avoid the elimination of the correct path in additional decoding attempts after a decoding failure occurs. Expand
On the Origin of Polar Coding
• E. Arıkan
• Mathematics, Computer Science
• IEEE Journal on Selected Areas in Communications
• 2016
This paper explains the cutoff rate considerations that motivated the development of polar coding, a low-complexity recursive channel combining and splitting operation of this type. Expand
CRC Code Design for List Decoding of Polar Codes
• Computer Science
• IEEE Communications Letters
• 2017
Simulation results show that the performance of optimal CRC-aided SCLD significantly outperforms the standard one, especially at high code rate. Expand