English
Related papers

Related papers: Adaptive Linear Programming Decoding of Polar Code…

200 papers

In this paper, we study polar codes from a practical point of view. In particular, we study concatenated polar codes and rate-compatible polar codes. First, we propose a concatenation scheme including polar codes and Low-Density…

Information Theory · Computer Science 2011-07-28 Ali Eslami , Hossein Pishro-Nik

Inspired by compressive sensing principles, we propose novel error control coding techniques for communication systems. The information bits are encoded in the support and the non-zero entries of a sparse signal. By selecting a dictionary…

Information Theory · Computer Science 2021-02-09 Madhusudan Kumar Sinha , Arun Pachai Kannu

Besides the determined construction of polar codes in BEC channels, different construction techniques have been proposed for AWGN channels. The current state-of-the-art algorithm starts with a design-SNR (or an operating SNR) and then…

Information Theory · Computer Science 2016-03-09 Rui Deng , Liping Li , Yanjun Hu

Polar codes are able to achieve the capacity of memoryless channels under successive cancellation (SC) decoding. Soft Cancellation (SCAN) is a soft-output decoder based on the SC schedule, useful in iterative decoding and concatenation of…

Information Theory · Computer Science 2020-04-09 Charles Pillet , Carlo Condo , Valerio Bioglio

This article introduces a novel concatenated coding scheme called sparse regression LDPC (SR-LDPC) codes. An SR-LDPC code consists of an outer non-binary LDPC code and an inner sparse regression code (SPARC) whose respective field size and…

Information Theory · Computer Science 2024-10-28 Jamison R. Ebert , Jean-Francois Chamberland , Krishna R. Narayanan

We propose a new family of polar coding which realizes high coding gain, low complexity, and high throughput by introducing a protograph-based design. The proposed technique called as quasi-cyclic (QC) polar codes can be highly parallelized…

Information Theory · Computer Science 2021-02-26 Toshiaki Koike-Akino , Ye Wang

Minimum weight codewords play a crucial role in the error correction performance of a linear block code. In this work, we establish an explicit construction for these codewords of polar codes as a sum of the generator matrix rows, which can…

Information Theory · Computer Science 2023-09-21 Mohammad Rowshan , Son Hoang Dau , Emanuele Viterbo

Polar codes have received growing attention in the past decade and have been selected as the coding scheme for the control channel in the fifth generation (5G) wireless communication systems. However, the conventional polar codes have only…

Information Theory · Computer Science 2023-01-26 Hossein Rezaei , Nandana Rajatheva , Matti Latva-aho

Polar codes are capacity achieving error correcting codes that can be decoded through the successive-cancellation algorithm. To improve its error-correction performance, a list-based version called successive-cancellation list (SCL) has…

Information Theory · Computer Science 2017-01-30 Seyyed Ali Hashemi , Carlo Condo , Warren J. Gross

Successive-cancellation list (SCL) decoding is an algorithm that provides very good error-correction performance for polar codes. However, its hardware implementation requires a large amount of memory, mainly to store intermediate results.…

Hardware Architecture · Computer Science 2017-03-28 Seyyed Ali Hashemi , Alexios Balatsoukas-Stimming , Pascal Giard , Claude Thibeault , Warren J. Gross

Different polar coding schemes are proposed for the memoryless degraded broadcast channel under different reliability and secrecy requirements: layered decoding and/or layered secrecy. In this setting, the transmitter wishes to send…

Information Theory · Computer Science 2018-06-19 Jaume del Olmo , Javier R. Fonollosa

In this paper, we propose a method to obtain the optimal metric function at each depth of the polarization tree through a process we call polarization of the metric function. This polarization process generates an optimal metric at…

Information Theory · Computer Science 2025-09-08 Mohsen Moradi , Hessam Mahdavifar

A latest coding scheme named polarization-adjusted convolutional (PAC) codes is shown to approach the dispersion bound for the code (128,64) under list decoding. However, to achieve the near-bound performance, the list size of list decoding…

Information Theory · Computer Science 2020-12-29 Hongfei Zhu , Zhiwei Cao , Yuping Zhao , Dou Li , Yanjun Yang

ABS+ polar codes are a generalization of Arikan polar codes that provides much faster polarization. We present an LLR-domain version of the SCL decoder of ABS+ polar codes. Furthermore, we optimize the SCL algorithm in order to reduce the…

Information Theory · Computer Science 2026-04-28 Mikhail Chernikov , Peter Trifonov

A low-density parity-check (LDPC) code is a linear block code described by a sparse parity-check matrix, which can be efficiently represented by a bipartite Tanner graph. The standard iterative decoding algorithm, known as belief…

Information Theory · Computer Science 2016-05-17 Sachini Jayasooriya , Sarah J. Johnson , Lawrence Ong , Regina Berretta

Short packets make channel learning expensive. In pilot-aided transmission (PAT), a non-negligible fraction of the packet is consumed by pilots, creating a direct pre-log loss and tightening the reliability margin needed for ultra-reliable…

Signal Processing · Electrical Eng. & Systems 2026-02-23 Geon Choi , Namyoon Lee

In Linear Programming (LP) decoding of a Low-Density-Parity-Check (LDPC) code one minimizes a linear functional, with coefficients related to log-likelihood ratios, over a relaxation of the polytope spanned by the codewords \cite{03FWK}. In…

Information Theory · Computer Science 2007-07-13 Michael Chertkov , Mikhail G. Stepanov

Quantum reading provides a general framework where to formulate the statistical discrimination of quantum channels. Several paths have been taken for such a problem. However, there is much to be done in the avenue of optimizing channel…

Information Theory · Computer Science 2022-06-22 Francisco Revson F. Pereira , Stefano Mancini

A deep-learning-aided successive-cancellation list (DL-SCL) decoding algorithm for polar codes is introduced with deep-learning-aided successive-cancellation (DL-SC) decoding being a specific case of it. The DL-SCL decoder works by allowing…

Information Theory · Computer Science 2019-12-04 Seyyed Ali Hashemi , Nghia Doan , Thibaud Tonnellier , Warren J. Gross

A successive cancellation list (SCL) decoder with limited list size for polar codes can not be analyzed as a successive cancellation (SC) decoder, nor as a maximum likelihood (ML) decoder, due to the complicated decoding errors caused by…

Information Theory · Computer Science 2019-03-25 Tao Wang , Daiming Qu , Tao Jiang
‹ Prev 1 8 9 10 Next ›