IEEE Communications Letters · 2023 · 10 citations · 17 references
ComputingComputer EngineeringComputer ScienceAlgorithmsParallel AlgorithmsParallel ComputingChannel CodingCoding TheoryError-correcting CodesCode RateConvolutional CodesDecoding AlgorithmsDecoding SpeedDecoding StrategiesList DecodingPolar Codes
A latest coding scheme named polarization-adjusted convolutional (PAC) codes is shown to provide dramatic improvement in performance as compared to polar codes under list decoding. However, to achieve this performance gain, the list size needs to be excessively large, which may cause insufferable latency. For PAC codes, utilizing special nodes can reduce the time complexity. In this letter, we propose an extension of the sequence repetition (SR) nodes to PAC codes to further reduce the decoding latency. First, we define the notion of convolution-effected repetition sequences, which helps us to decode a specific SR node. Then, we propose a fast list decoding algorithm by taking the SR nodes into consideration. Simulation results indicate that the performance of the proposed decoding algorithm is almost identical to the original list decoding algorithm while achieving a higher degree of parallelism. In particular, for a PAC code of length 128 with code rate 1/4, the decoding latency can be reduced by over 35% as compared to the state-of-the-art fast list decoder.
17
Ido Tal, Alexander Vardy · IEEE Transactions on Information Theory · 2015 · 1.8K citations
CRC-Aided Decoding of Polar Codes
Kai Niu, Kai Chen · IEEE Communications Letters · 2012 · 894 citations