paper-with-me

Papers

Polar Decoding on Sparse Graphs with Deep Learning

2018-11-24 · Weihong Xu, Xiaohu You, Chuan Zhang, Yair Be'ery

In this paper, we present a sparse neural network decoder (SNND) of polar codes based on belief propagation (BP) and deep learning. At first, the conventional factor graph of polar BP decoding is converted to the bipartite Tanner graph similar to low-density parity-check (LDPC) codes. Then the Tanner graph is unfolded and translated into the graphical representation of deep neural network (DNN). The complex sum-product algorithm (SPA) is modified to min-sum (MS) approximation with low complexity. We dramatically reduce the number of weight by using single weight to parameterize the networks. Optimized by the training techniques of deep learning, proposed SNND achieves comparative decoding performance of SPA and obtains about $0.5$ dB gain over MS decoding on ($128,64$) and ($256,128$) codes. Moreover, $60 \%$ complexity reduction is achieved and the decoding latency is significantly lower than the conventional polar BP.

📄 PDF Abstract BibTeX arXiv:1811.09801

Code (0)

등록된 구현이 없습니다.

Tasks

DecoderDeep LearningSingle Particle Analysis

Similar Papers 제목 키워드 기반

Adaptive Linear Programming Decoding of Polar Codes

2014-08-14 · IEEE International Symposium on Information Theory 2014 8 · V eeresh Taranalli, Paul H. Siegel

Polar codes are high density parity check codes and hence the sparse factor graph, instead of the parity check matrix, has been used to practically represent an LP polytope for LP decoding. Although LP decoding on thi…

Decoder

POLE: Polarized Embedding for Signed Networks

2021-10-17 · Zexi Huang, Arlei Silva, Ambuj Singh

From the 2016 U.S. presidential election to the 2021 Capitol riots to the spread of misinformation related to COVID-19, many have blamed social media for today's deeply divided society. Recent advances in machine learnin…

Link PredictionMisinformation

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

2022-07-03 · Yun Liao, Seyyed Ali Hashemi, Hengjie Yang, John M. Cioffi

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 (…

Graph Neural Network

Deep Polar Codes

2023-08-06 · Geon Choi, Namyoon Lee

In this paper, 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 size…

Link Polarity Prediction from Sparse and Noisy Labels via Multiscale Social Balance

2024-07-22 · Marco Minici, Federico Cinus, Francesco Bonchi, Giuseppe Manco

Signed Graph Neural Networks (SGNNs) have recently gained attention as an effective tool for several learning tasks on signed networks, i.e., graphs where edges have an associated polarity. One of these tasks is to predi…