Scalable Polar Code Construction for Successive Cancellation List Decoding: A Graph Neural Network-Based Approach

• URL: http://arxiv.org/abs/2207.01105v4
• Date: Sat, 13 May 2023 21:58:58 GMT
• Title: Scalable Polar Code Construction for Successive Cancellation List Decoding: A Graph Neural Network-Based Approach
• Authors: Yun Liao, Seyyed Ali Hashemi, Hengjie Yang, John M. Cioffi
• Abstract summary: This paper first maps a polar code to a heterogeneous graph called the polar-code-construction message-passing graph. Next, a graph-neural-network-based iterative message-passing algorithm is proposed which aims to find a PCCMP graph that corresponds to the polar code. Numerical experiments show that IMP-based polar-code constructions outperform classical constructions under CA-SCL decoding.
• Score: 11.146177972345138
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: While constructing polar codes for successive-cancellation decoding can be implemented efficiently by sorting the bit-channels, finding optimal polar codes for cyclic-redundancy-check-aided successive-cancellation list (CA-SCL) decoding in an efficient and scalable manner still awaits investigation. This paper first maps a polar code to a unique heterogeneous graph called the polar-code-construction message-passing (PCCMP) graph. Next, a heterogeneous graph-neural-network-based iterative message-passing (IMP) algorithm is proposed which aims to find a PCCMP graph that corresponds to the polar code with minimum frame error rate under CA-SCL decoding. This new IMP algorithm's major advantage lies in its scalability power. That is, the model complexity is independent of the blocklength and code rate, and a trained IMP model over a short polar code can be readily applied to a long polar code's construction. Numerical experiments show that IMP-based polar-code constructions outperform classical constructions under CA-SCL decoding. In addition, when an IMP model trained on a length-128 polar code directly applies to the construction of polar codes with different code rates and blocklengths, simulations show that these polar code constructions deliver comparable performance to the 5G polar codes.

Related papers

• List Decodable Quantum LDPC Codes [49.2205789216734]
  We give a construction of Quantum Low-Density Parity Check (QLDPC) codes with near-optimal rate-distance tradeoff. We get efficiently list decodable QLDPC codes with unique decoders.
  arXiv  Detail & Related papers  (2024-11-06T23:08:55Z)
• Decoding Quantum LDPC Codes Using Graph Neural Networks [52.19575718707659]
  We propose a novel decoding method for Quantum Low-Density Parity-Check (QLDPC) codes based on Graph Neural Networks (GNNs) The proposed GNN-based QLDPC decoder exploits the sparse graph structure of QLDPC codes and can be implemented as a message-passing decoding algorithm.
  arXiv  Detail & Related papers  (2024-08-09T16:47:49Z)
• Factor Graph Optimization of Error-Correcting Codes for Belief Propagation Decoding [62.25533750469467]
  Low-Density Parity-Check (LDPC) codes possess several advantages over other families of codes. The proposed approach is shown to outperform the decoding performance of existing popular codes by orders of magnitude.
  arXiv  Detail & Related papers  (2024-06-09T12:08:56Z)
• Nested Construction of Polar Codes via Transformers [3.2841640957249285]
  We propose using a sequence modeling framework to iteratively construct a polar code for any given length and rate under various channel conditions. Simulations show that polar codes designed via sequential modeling using transformers outperform both 5G-NR sequence and Density Evolution based approaches for both AWGN and Rayleigh fading channels.
  arXiv  Detail & Related papers  (2024-01-30T17:17:43Z)
• Testing the Accuracy of Surface Code Decoders [55.616364225463066]
  Large-scale, fault-tolerant quantum computations will be enabled by quantum error-correcting codes (QECC) This work presents the first systematic technique to test the accuracy and effectiveness of different QECC decoding schemes.
  arXiv  Detail & Related papers  (2023-11-21T10:22:08Z)
• Deep Polar Codes [19.265010348250897]
  We introduce a novel class of pre-transformed polar codes, termed as deep polar codes. We first present a deep polar encoder that harnesses a series of multi-layered polar transformations with varying sizes. Our encoding method offers flexibility in rate-profiling, embracing a wide range of code rates and blocklengths.
  arXiv  Detail & Related papers  (2023-08-06T03:29:18Z)
• For One-Shot Decoding: Self-supervised Deep Learning-Based Polar Decoder [1.4964546566293881]
  We propose a self-supervised deep learning-based decoding scheme that enables one-shot decoding of polar codes. In the proposed scheme, rather than using the information bit vectors as labels for training the neural network (NN), the NN is trained to function as a bounded distance decoder.
  arXiv  Detail & Related papers  (2023-07-16T11:12:58Z)
• Improved Logical Error Rate via List Decoding of Quantum Polar Codes [8.122270502556372]
  We show that the successive cancellation list decoder (SCL) is an efficient decoder for classical polar codes with low decoding error. We apply SCL decoding to a novel version of quantum polar codes based on the polarization weight method. Both SCL-E and SCL-C maintain the complexity O(LN logN) of SCL for code size N and list size L.
  arXiv  Detail & Related papers  (2023-04-10T17:56:10Z)
• Neural Belief Propagation Decoding of Quantum LDPC Codes Using Overcomplete Check Matrices [60.02503434201552]
  We propose to decode QLDPC codes based on a check matrix with redundant rows, generated from linear combinations of the rows in the original check matrix. This approach yields a significant improvement in decoding performance with the additional advantage of very low decoding latency.
  arXiv  Detail & Related papers  (2022-12-20T13:41:27Z)
• A Scalable Graph Neural Network Decoder for Short Block Codes [49.25571364253986]
  We propose a novel decoding algorithm for short block codes based on an edge-weighted graph neural network (EW-GNN) The EW-GNN decoder operates on the Tanner graph with an iterative message-passing structure. We show that the EW-GNN decoder outperforms the BP and deep-learning-based BP methods in terms of the decoding error rate.
  arXiv  Detail & Related papers  (2022-11-13T17:13:12Z)
• Construction of Polar Codes with Reinforcement Learning [13.977646909897796]
  This paper formulates the polar-code construction problem for the successive-cancellation list (SCL) decoder as a maze-traversing game. The proposed method provides a novel technique for polar-code construction that no longer depends on sorting and selecting bit-channels by reliability.
  arXiv  Detail & Related papers  (2020-09-19T17:59:02Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.