English
Related papers

Related papers: Polar subcodes for MIMO systems

200 papers

We propose a belief propagation list (BPL) decoder with comparable performance to the successive cancellation list (SCL) decoder of polar codes, which already achieves the maximum likelihood (ML) bound of polar codes for sufficiently large…

Information Theory · Computer Science 2018-08-24 Ahmed Elkelesh , Moustafa Ebada , Sebastian Cammerer , Stephan ten Brink

A hybrid automatic repeat request (HARQ) scheme based on a novel class of rate-compatible polar (\mbox{RCP}) codes are proposed. The RCP codes are constructed by performing punctures and repetitions on the conventional polar codes.…

Information Theory · Computer Science 2016-11-17 Kai Chen , Kai Niu , Jiaru Lin

Long polar codes can achieve the capacity of arbitrary binary-input discrete memoryless channels under a low complexity successive cancelation (SC) decoding algorithm. But for polar codes with short and moderate code length, the decoding…

Information Theory · Computer Science 2016-11-18 Jun Lin , Chenrong Xiong , Zhiyuan Yan

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

In this letter, we propose parallel SC (Successive Cancellation) decoder and parallel SC-List decoder for polar codes. The parallel decoder is composed of M=2^m(m>=1) component decoders working in parallel and each component decoder decodes…

Information Theory · Computer Science 2013-09-05 Bin Li , Hui Shen , David Tse

In this paper, we introduce a new coding and decoding structure for enhancing the reliability and performance of polar codes, specifically at low error rates. We achieve this by concatenating two polar codes in series to create robust…

Information Theory · Computer Science 2023-11-07 Mohammed Mensouri , Mustapha Eddahibi

Previous work showed that polar codes can be decoded using off-the-shelf LDPC decoders by imposing special constraints on the LDPC code structure, which, however, resulted in some performance degradation. In this paper we show that this…

Information Theory · Computer Science 2019-09-27 Moustafa Ebada , Ahmed Elkelesh , Stephan ten Brink

Polar codes have attracted the attention of academia and industry alike in the past decade, such that the 5$^\text{th}$ generation wireless systems (5G) standardization process of the 3$^\text{th}$ generation partnership project (3GPP)…

Information Theory · Computer Science 2020-01-07 Valerio Bioglio , Carlo Condo , Ingmar Land

Polar codes are a class of linear error correction codes which provably attain channel capacity with infinite codeword lengths. Finite length polar codes have been adopted into the 5th Generation 3GPP standard for New Radio, though their…

Information Theory · Computer Science 2019-02-07 Adam Cavatassi , Thibaud Tonnellier , Warren J. Gross

We propose a generalized construction for binary polar codes based on mixing multiple kernels of different sizes in order to construct polar codes of block lengths that are not only powers of integers. This results in a multi kernel polar…

Information Theory · Computer Science 2017-03-13 Frederic Gabry , Valerio Bioglio , Ingmar Land , Jean-Claude Belfiore

We consider practical hardware implementation of Polar decoders. To reduce latency due to the serial nature of successive cancellation (SC), existing optimizations improve parallelism with two approaches, i.e., multi-bit decision or reduced…

Information Theory · Computer Science 2018-08-07 Huazi Zhang , Jiajie Tong , Rong Li , Pengcheng Qiu , Yourui Huangfu , Chen Xu , Xianbin Wang , Jun Wang

In this paper, we propose a decision-aided scheme for parallel SC-List decoding of polar codes. At the parallel SC-List decoder, each survival path is extended based on multiple information bits, therefore the number of split paths becomes…

Information Theory · Computer Science 2015-06-10 Bin Li , Hui Shen , Kai Chen

Due to their provably capacity-achieving performance, polar codes have attracted a lot of research interest recently. For a good error-correcting performance, list successive-cancellation decoding (LSCD) with large list size is used to…

Information Theory · Computer Science 2018-07-02 YouZhe Fan , ChenYang Xia , Ji Chen , Chi-Ying Tsui , Jie Jin , Hui Shen , Bin Li

A challenging problem related to the design of polar codes is "robustness against channel parameter variations" as stated in Ar{\i}kan's original work. In this paper, we describe how the problem of robust polar code design can be viewed as…

Information Theory · Computer Science 2013-05-15 Mine Alsan

Massive multiple-input multiple-output (MIMO) is a key technology for fifth generation (5G) communication system. MIMO symbol detection is one of the most computationally intensive tasks for a massive MIMO baseband receiver. In this paper,…

In the short block length regime, pre-transformed polar codes together with successive cancellation list (SCL) decoding possess excellent error correction capabilities. However, in practice, the list size is limited due to the suboptimal…

Information Theory · Computer Science 2025-04-25 Henning Lulei , Jonathan Mandelbaum , Marvin Rübenacke , Holger Jäkel , Stephan ten Brink , Laurent Schmalen

We explore the relationship between polar and RM codes and we describe a coding scheme which improves upon the performance of the standard polar code at practical block lengths. Our starting point is the experimental observation that RM…

Information Theory · Computer Science 2014-09-04 Marco Mondelli , S. Hamed Hassani , Rüdiger Urbanke

A commonly assumed drawback of multi-level coding, compared to a bit-interleaved coded modulation, is its high latency: Indeed, the levels must be decoded sequentially. In this paper, we consider polar codes to code each level. We show that…

Information Theory · Computer Science 2022-06-02 Vincent Corlay

This paper presents a polarization-driven (PD) shortening technique for the design of rate-compatible polar codes. The proposed shortening strategy consists of reducing the generator matrix by relating its row index with the channel…

Information Theory · Computer Science 2018-08-02 R. M. Oliveira , R. C. de Lamare

The successive cancellation list decoding algorithm for polar codes yields near-optimal decoding performance at the cost of high implementation complexity. The successive cancellation stack algorithm has been shown to provide similar…

Information Theory · Computer Science 2018-09-12 Harsh Aurora , Warren J. Gross
‹ Prev 1 4 5 6 7 8 10 Next ›