English
Related papers

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

200 papers

The performance of integer-forcing equalization for communication over the compound multiple-input multipleoutput channel is investigated. An upper bound on the resulting outage probability as a function of the gap to capacity has been…

Information Theory · Computer Science 2017-12-05 Elad Domanovitz , Uri Erez

The Pearson distance has been advocated for improving the error performance of noisy channels with unknown gain and offset. The Pearson distance can only fruitfully be used for sets of $q$-ary codewords, called Pearson codes, that satisfy…

Information Theory · Computer Science 2016-11-17 Jos H. Weber , Kees A. Schouhamer Immink , Simon R. Blackburn

We consider the problem of optimally decoding a quantum error correction code -- that is to find the optimal recovery procedure given the outcomes of partial "check" measurements on the system. In general, this problem is NP-hard. However,…

Quantum Physics · Physics 2009-11-13 David Poulin

The performance of existing coded caching schemes is sensitive to the worst channel quality, a problem which is exacerbated when communicating over fading channels. In this paper, we address this limitation in the following manner: in…

Information Theory · Computer Science 2020-02-11 Apostolos Destounis , Asma Ghorbel , Georgios S. Paschos , Mari Kobayashi

We study short-packet communications, subject to latency and reliability constraints, under the premises of limited frequency diversity and no time diversity. The question addressed is whether, and when, hybrid automatic repeat request…

Information Theory · Computer Science 2018-09-19 Johan Östman , Rahul Devassy , Guido C. Ferrante , Giuseppe Durisi

In this study, a cross-layer design which combines adaptive modulation and coding (AMC) and hybrid automatic repeat request (HARQ) techniques for a cooperative wireless network is investigated analytically. Previous analyses of such systems…

Signal Processing · Electrical Eng. & Systems 2019-11-13 Ibrahim Ozkan

Given the possibility of communication systems failing catastrophically, we investigate limits to communicating over channels that fail at random times. These channels are finite-state semi-Markov channels. We show that communication with…

Information Theory · Computer Science 2015-03-24 Lav R. Varshney , Sanjoy K. Mitter , Vivek K Goyal

We propose a cumulative feedback-based ARQ (CF ARQ) protocol for a sliding window of size 2 over packet erasure channels with unreliable feedback. We exploit a matrix signal-flow graph approach to analyze probability-generating functions of…

Information Theory · Computer Science 2018-08-10 Derya Malak , Muriel Medard , Edmund M. Yeh

Unlike the AWGN (additive white gaussian noise) channel, fading channels suffer from random channel gains besides the additive Gaussian noise. As a result, the instantaneous channel capacity varies randomly along time, which makes it…

Information Theory · Computer Science 2014-07-18 Yunquan Dong , Pingyi Fan

We study analogue source transmission over MIMO block-fading channels with receiver-only channel state information. Unlike previous work which considers the end-to-end expected distortion as a figure of merit, we study the distortion outage…

Information Theory · Computer Science 2016-11-15 Li Peng , Albert Guillen i Fabregas

This paper proposes a new method for optimizing frequency-hopping ad hoc networks in the presence of Rayleigh fading. It is assumed that the system uses a capacity-approaching code (e.g., turbo or LDPC) and noncoherent binary…

Information Theory · Computer Science 2012-07-17 Salvatore Talarico , Matthew C. Valenti , Don Torrieri

In this paper, a downlink scenario in which a single-antenna base station communicates with K single antenna users, over a time-correlated fading channel, is considered. It is assumed that channel state information is perfectly known at…

Information Theory · Computer Science 2007-07-13 Mehdi Ansari Sadrabadi , Alireza Bayesteh , Amir K. Khandani

Interleaving is a mechanism universally used in wireless access technologies to alleviate the effect of channel correlation. In spite of its wide adoption, to the best of our knowledge, there are no analytical models proposed so far. In…

Information Theory · Computer Science 2018-01-31 Dmitri Moltchanov , Pavel Kustarev , Yevgeni Kucharyavy

A rate-dependent upper bound of the best achievable block error probability of polar codes with successive-cancellation decoding is derived.

Information Theory · Computer Science 2010-01-14 Toshiyuki Tanaka , Ryuhei Mori

Entanglement assistance can improve communication rates significantly. Yet, its generation is susceptible to failure. The unreliable assistance model accounts for those challenges. Previous work provided an asymptotic formula that outlines…

Quantum Physics · Physics 2023-10-04 Uzi Pereg

The optimal diversity-multiplexing-delay tradeoff for the multi-input multi-output (MIMO) automatic repeat request (ARQ) channel can be achieved using incremental redundancy lattice space-time codes coupled with a list decoder for joint…

Information Theory · Computer Science 2016-11-17 Walid Abediseid , Mohamed Oussama Damen

This work investigates the probability that the delay and the peak-age of information exceed a desired threshold in a point-to-point communication system with short information packets. The packets are generated according to a stationary…

Information Theory · Computer Science 2019-02-04 Rahul Devassy , Giuseppe Durisi , Guido Carlo Ferrante , Osvaldo Simeone , Elif Uysal

It has been recently brought into spotlight that through the exploitation of network coding concepts at physical-layer, the interference property of the wireless media can be proven to be a blessing in disguise. Nonetheless, most of the…

Networking and Internet Architecture · Computer Science 2010-09-21 M. Amin Rahimian , Ali Ayremlou , Farokh Marvasti

Communication over the i.i.d. Rayleigh slow-fading MAC is considered, where all terminals are equipped with a single antenna. Further, a communication protocol is considered where all users transmit at (just below) the symmetric capacity…

Information Theory · Computer Science 2024-10-30 Elad Domanovitz , Uri Erez

Channel simulation algorithms can efficiently encode random samples from a prescribed target distribution $Q$ and find applications in machine learning-based lossy data compression. However, algorithms that encode exact samples usually have…

Information Theory · Computer Science 2024-05-16 Gergely Flamich , Lennie Wells