English
Related papers

Related papers: Polar Coded HARQ Scheme with Chase Combining

200 papers

In this paper, a power-constrained hybrid automatic repeat request (HARQ) transmission strategy is developed to support ultra-reliable low-latency communications (URLLC). In particular, we aim to minimize the delivery latency of HARQ…

Information Theory · Computer Science 2023-08-07 Yi Chen , Zheng Shi , Hong Wang , Yaru Fu , Guanghua Yang , Shaodan Ma , Haichuan Ding

In this paper, we propose \textit{selectively precoded polar (SPP) code}, built on top of Arikan's capacity achieving polar codes. We provide the encoding and decoding scheme for SPP code. Simulation results show that for a target frame…

Information Theory · Computer Science 2024-10-30 Samir Kumar Mishra , KwangChul Kim

Polar codes are a class of channel capacity achieving codes that has been selected for the next generation of wireless communication standards. Successive-cancellation (SC) is the first proposed decoding algorithm, suffering from mediocre…

Information Theory · Computer Science 2018-10-09 Furkan Ercan , Carlo Condo , Seyyed Ali Hashemi , Warren J. Gross

This work presents a polar coding scheme for fading channels, focusing primarily on fading binary symmetric and additive exponential noise channels. For fading binary symmetric channels, a hierarchical coding scheme is presented, utilizing…

Information Theory · Computer Science 2014-08-19 Hongbo Si , O. Ozan Koyluoglu , Sriram Vishwanath

In this paper we propose the introduction of adaptive hybrid automatic repeat request (HARQ) in the context of mobile satellite communications. HARQ schemes which are commonly used in terrestrial links, can be adapted to improve the…

Networking and Internet Architecture · Computer Science 2015-03-17 Rami Ali Ahmad , Jérôme Lacan , Fabrice Arnal , Mathieu Gineste , Laurence Clarac

Hybrid-ARQ protocols have become common in many packet transmission systems due to their incorporation in various standards. Hybrid-ARQ combines the normal automatic repeat request (ARQ) method with error correction codes to increase…

Information Theory · Computer Science 2015-05-27 Mayur Agrawal , Zachary Chance , David J. Love , Venkataramanan Balakrishnan

Polar codes is promising because they can provably achieve the channel capacity while having an explicit construction method. Lots of work have been done for the bit-based decoding algorithm for polar codes. In this paper, generalized…

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

In this paper, performance of hybrid automatic repeat request with incremental redundancy (HARQ-IR) over Rayleigh fading channels is investigated. Different from prior analysis, time correlation in the channels is considered. Under…

Information Theory · Computer Science 2022-09-30 Zheng Shi , Haichuan Ding , Shaodan Ma , Kam-Weng Tam

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

This paper first presents a new approach to evaluating the descriptive complexity of finite-length binary sequences. Specifically, we investigate the sequence-wise recovery behavior induced by polar compression and successive cancellation…

Information Theory · Computer Science 2026-05-15 Xinyuanmeng Yao , Xiao Ma

Polar codes are a class of capacity-achieving codes for the binary-input discrete memoryless channels (B-DMCs). However, when applied in channels with intersymbol interference (ISI), the codes may perform poorly with BCJR equalization and…

Information Theory · Computer Science 2014-04-14 Runxin Wang , Rongke Liu , Yi Hou

Row-merged polar codes are a family of pre-transformed polar codes (PTPCs) with little precoding overhead. Providing an improved distance spectrum over plain polar codes, they are capable to perform close to the finite-length capacity…

Information Theory · Computer Science 2023-12-25 Andreas Zunker , Marvin Geiselhart , Lucas Johannsen , Claus Kestel , Stephan ten Brink , Timo Vogt , Norbert Wehn

-We develop a polar coding scheme for empirical coordination in a two-node network with a noisy link in which the input and output signals have to be coordinated with the source and the reconstruction. In the case of non-causal encoding and…

Information Theory · Computer Science 2016-09-22 Giulia Cervia , Laura Luzzi , Matthieu Bloch , Maël Le Treust

Hybrid Automatic ReQuest (HARQ) protocol enables reliable communications in wireless systems. Usually, several parallel streams are sent in successive timeslots following a time-sharing approach. Recently, multi-layer HARQ has been proposed…

Information Theory · Computer Science 2020-04-03 Alla Khreis , Francesca Bassi , Philippe Ciblat , Pierre Duhamel

This paper deals with two main issues regarding the short polar codes: the potential of FEC-assisted decoding and optimal code concatenation strategies under various design scenarios. Code concatenation and FEC-assisted decoding are…

Information Theory · Computer Science 2016-07-26 Mohammad Sadegh Mohammadi , Eryk Dutkiewicz , Qi Zhang

This paper focuses on an improved Gaussian approximation (GA) based construction of polar codes with successive cancellation (SC) decoding over an additive white Gaussian noise (AWGN) channel. Arikan has proven that polar codes with…

Information Theory · Computer Science 2020-10-08 Hideki Ochiai , Patrick Mitran , H. Vincent Poor

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…

Information Theory · Computer Science 2023-05-16 Yun Liao , Seyyed Ali Hashemi , Hengjie Yang , John M. Cioffi

A scheme for concatenating the recently invented polar codes with interleaved block codes is considered. By concatenating binary polar codes with interleaved Reed-Solomon codes, we prove that the proposed concatenation scheme captures the…

Information Theory · Computer Science 2013-02-01 Hessam Mahdavifar , Mostafa El-Khamy , Jungwon Lee , Inyup Kang

In this paper, we present an efficient method to construct a good rate-compatible punctured polar (RCPP) code. One of the major challenges on the construction of a RCPP code is to design a common information set which is good for all the…

Information Theory · Computer Science 2018-07-03 Song-Nam Hong , Min-Oh Jeong

In this paper, we investigate the effectiveness of the hybrid automatic repeat request (HARQ) technique in providing high-reliability and low-latency in the finite blocklength (FBL) regime in a single user uplink scenario. We characterize…

Information Theory · Computer Science 2021-10-06 Faisal Nadeem , Yonghui Li , Branka Vucetic , Mahyar Shirvanimoghaddam
‹ Prev 1 3 4 5 6 7 10 Next ›