English
Related papers

Related papers: Coding Versus ARQ in Fading Channels: How reliable…

200 papers

Motivated by streaming applications with stringent delay constraints, we consider the design of online network coding algorithms with timely delivery guarantees. Assuming that the sender is providing the same data to multiple receivers over…

Information Theory · Computer Science 2016-11-15 Joao Barros , Rui A. Costa , Daniele Munaretto , Joerg Widmer

In this paper, the performance of signaling strategies with high peak-to-average power ratio is analyzed over both coherent and noncoherent fading channels. Two modulation schemes, namely on-off phase-shift keying (OOPSK) and on-off…

Information Theory · Computer Science 2007-12-21 Mustafa Cenk Gursoy

This paper analyzes Type I hybrid automatic repeat request (HARQ) over time-correlated Rayleigh fading channels. Due to the presence of channel time correlation, the analysis is more challenging than the prior analysis in the literature.…

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

A new channel coding approach was proposed in [1] for random multiple access communication over the discrete-time memoryless channel. The coding approach allows users to choose their communication rates independently without sharing the…

Information Theory · Computer Science 2016-11-15 Zheng Wang , Jie Luo

A new random linear network coding scheme for reliable communications for time division duplexing channels is proposed. The setup assumes a packet erasure channel and that nodes cannot transmit and receive information simultaneously. The…

Information Theory · Computer Science 2008-09-16 Daniel E. Lucani , Milica Stojanovic , Muriel Médard

The existing ARQ schemes (including a hybrid ARQ) have a throughput depending on packet error probability. In this paper we describe a strategy for delay tolerant applications which provide a constant throughput until the algorithm…

Information Theory · Computer Science 2007-07-13 Alexander Zhdanov

Consider a lossy communication channel for unicast with zero-delay feedback. For this communication scenario, a simple retransmission scheme is optimum with respect to delay. An alternative approach is to use random linear coding in…

Information Theory · Computer Science 2016-11-18 Mohammad Ravanbakhsh , Angela I. Barbero Diez , Oyvind Ytrehus

The focus of this paper is an information-theoretic study of retransmission protocols for reliable packet communication under a secrecy constraint. The hybrid automatic retransmission request (HARQ) protocol is revisited for a block-fading…

Information Theory · Computer Science 2016-11-17 Xiaojun Tang , Ruoheng Liu , Predrag Spasojevic , H. Vincent Poor

We consider communication over Automatic Repeat reQuest (ARQ) memoryless channels with deadlines. In particular, an upper bound L is imposed on the maximum number of ARQ transmission rounds. In this setup, it is shown that incremental…

Information Theory · Computer Science 2016-11-17 Praveen Kumar Gopala , Young-Han Nam , Hesham El Gamal

In this work, we propose a coding strategy designed to enhance the throughput of hybrid ARQ (HARQ) transmissions over i.i.d. block-fading channels with the channel state information (CSI) unknown at the transmitter. We use a joint packet…

Information Theory · Computer Science 2016-07-26 Mohammed Jabi , Etienne Pierre-Doray , Leszek Szczecinski , Mustapha Benjillali

In this paper, we investigate the performance of the Viterbi decoding algorithm with/without Automatic Repeat reQuest (ARQ) over a Rician flat fading channel with unlimited interleaving. We show that the decay rate of the average bit error…

Information Theory · Computer Science 2018-10-05 Lan V. Truong

The throughput achievable in truncated Hybrid ARQ protocol (HARQ) using incremental redundancy (IR) in analyzed when transmitting over a block-fading channel whose state is unknown at the transmitter. We allow the transmission lengths to…

Information Theory · Computer Science 2012-07-03 Leszek Szczecinski , Ciro Correa , Luciano Ahumada

We propose two schemes for selective-repeat ARQ protocols over packet erasure channels with unreliable feedback: (i) a hybrid ARQ protocol with soft combining at the receiver, and (ii) a coded ARQ protocol, by building on the uncoded…

Information Theory · Computer Science 2018-02-01 Derya Malak , Muriel Médard , Edmund M. Yeh

We present nonasymptotic bounds on the maximum coding rate achievable over a Rician block-fading channel for a fixed packet size and a fixed packet error probability. Our bounds, which apply to the scenario where no a priori channel state…

Information Theory · Computer Science 2017-05-24 Johan Östman , Giuseppe Durisi , Erik G. Ström

In this paper, the performance of signaling strategies with high peak-to-average power ratio is analyzed in both coherent and noncoherent fading channels. Two recently proposed modulation schemes, namely on-off binary phase-shift keying and…

Information Theory · Computer Science 2007-07-13 Mustafa Cenk Gursoy

This paper studies the throughput performance of HARQ (hybrid automatic repeat request) protocols over block fading Gaussian channels. It proposes new protocols that use the available feedback bit(s) not only to request a retransmission,…

Information Theory · Computer Science 2016-11-17 Daniela Tuninetti

A status updating system is considered in which a variable length code is used to transmit messages to a receiver over a noisy channel. The goal is to optimize the codewords lengths such that successfully-decoded messages are timely. That…

Information Theory · Computer Science 2021-02-16 Ahmed Arafa , Richard D. Wesel

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

To ensure reliable communication in randomly varying and error-prone channels, wireless systems use adaptive modulation and coding (AMC) as well as hybrid ARQ (HARQ). In order to elucidate their compatibility and interaction, we compare the…

Information Theory · Computer Science 2016-06-17 Redouane Sassioui , Mohammed Jabi , Leszek Szczecinski , Long Bao Le , Mustapha Benjillali , Benoit Pelletier

On a fading channel with no channel state information at the receiver, calculating true log-likelihood ratios (LLR) is complicated. Existing work assume that the power of the additive noise is known and use the expected value of the fading…

Information Theory · Computer Science 2012-04-17 Raman Yazdani , Masoud Ardakani