English
Related papers

Related papers: Approximately Universal Codes over Slow Fading Cha…

200 papers

We establish the optimal diversity-multiplexing (DM) tradeoff of coherent selective-fading multiple-access multiple-input multiple-output (MIMO) channels and provide corresponding code design criteria. As a byproduct, on the conceptual…

Information Theory · Computer Science 2008-05-02 Pedro Coronel , Markus Gärtner , Helmut Bölcskei

We establish the optimal diversity-multiplexing (DM) tradeoff for coherent selective-fading multiple-access MIMO channels and provide corresponding code design criteria. As a byproduct, on the conceptual level, we find an interesting…

Information Theory · Computer Science 2009-06-26 Pedro Coronel , Markus Gärtner , Helmut Bölcskei

A message composed of packets is transmitted using erasure and channel coding over a fading channel with no feedback. For this scenario, the paper explores the trade-off between the redundancies allocated to the packet-level erasure code…

Information Theory · Computer Science 2016-02-03 Sudarsan V. S. Ranganathan , Tong Mu , Richard D. Wesel

Explicit codes are constructed that achieve the diversity-multiplexing gain tradeoff of the cooperative-relay channel under the dynamic decode-and-forward protocol for any network size and for all numbers of transmit and receive antennas at…

Information Theory · Computer Science 2007-07-13 Petros Elia , P. Vijay Kumar

We establish the optimal diversity-multiplexing (DM) tradeoff of coherent time, frequency, and time-frequency selective-fading multiple-input multiple-output (MIMO) channels and provide a code design criterion for DM tradeoff optimality.…

Information Theory · Computer Science 2009-07-15 Pedro Coronel , Helmut Bölcskei

A finite blocklenth analysis of the diversity-multiplexing tradeoff is presented, based on nonasymptotic bounds on the maximum channel coding rate of multiple-antenna block-memoryless Rayleigh-fading channels.The bounds in this paper allow…

Information Theory · Computer Science 2016-11-17 Johan Östman , Wei Yang , Giuseppe Durisi , Tobias Koch

We consider coded caching over the fading broadcast channel, where the users, equipped with a memory of finite size, experience asymmetric fading statistics. It is known that a naive application of coded caching over the channel at hand…

Information Theory · Computer Science 2018-01-16 Richard Combes , Asma Ghorbel , Mari Kobayashi , Sheng Yang

Motivated by the current interest in ultra-reliable, low-latency, machine-type communication systems, we investigate the tradeoff between reliability, throughput, and latency in the transmission of information over multiple-antenna Rayleigh…

Information Theory · Computer Science 2016-11-17 Giuseppe Durisi , Tobias Koch , Johan Östman , Yury Polyanskiy , Wei Yang

Rate and diversity impose a fundamental tradeoff in communications. This tradeoff was investigated for Intersymbol Interference (ISI) channels in [4]. A different point of view was explored in [1] where high-rate codes were designed so that…

Information Theory · Computer Science 2007-09-25 S. Dusad , S. N. Diggavi

This paper studies the tradeoff between channel coding and ARQ (automatic repeat request) in Rayleigh block-fading channels. A heavily coded system corresponds to a low transmission rate with few ARQ re-transmissions, whereas lighter coding…

Information Theory · Computer Science 2015-03-13 Peng Wu , Nihar Jindal

We establish the optimal diversity-multiplexing (DM) tradeoff of coherent time, frequency and time-frequency selective-fading MIMO channels and provide a code design criterion for DM-tradeoff optimality. Our results are based on the…

Information Theory · Computer Science 2007-07-13 Pedro Coronel , Helmut Bölcskei

A recent result of Zheng and Tse states that over a quasi-static channel, there exists a fundamental tradeoff, referred to as the diversity-multiplexing gain (D-MG) tradeoff, between the spatial multiplexing gain and the diversity gain that…

Information Theory · Computer Science 2007-07-13 Petros Elia , K. Raj Kumar , Sameer A. Pawar , P. Vijay Kumar , Hsiao-feng Lu

We develop a framework to optimize the tradeoff between diversity, multiplexing, and delay in MIMO systems to minimize end-to-end distortion. We first focus on the diversity-multiplexing tradeoff in MIMO systems, and develop analytical…

Information Theory · Computer Science 2008-04-09 Tim Holliday , Andrea J. Goldsmith , H. Vincent Poor

An index coding scheme in which the source (transmitter) transmits binary symbols over a wireless fading channel is considered. Index codes with the transmitter using minimum number of transmissions are known as optimal index codes.…

Information Theory · Computer Science 2015-04-14 Anoop Thomas , Kavitha R. , Chandramouli A. , B. Sundar Rajan

Most communication systems use some form of feedback, often related to channel state information. In this paper, we study diversity multiplexing tradeoff for both FDD and TDD systems, when both receiver and transmitter knowledge about the…

Information Theory · Computer Science 2014-07-15 Vaneet Aggarwal , Ashutosh Sabharwal

Rate and diversity impose a fundamental trade-off in communications. This trade-off was investigated for flat-fading channels in [15] as well as for Inter-symbol Interference (ISI) channels in [1]. A different point of view was explored in…

Information Theory · Computer Science 2009-12-24 S. Dusad , S. N. Diggavi

This paper investigates the performance of wireless systems that employ finite-blocklength channel codes for transmission and operate under queueing constraints in the form of limitations on buffer overflow probabilities. A block fading…

Information Theory · Computer Science 2010-10-01 Deli Qiao , Mustafa Cenk Gursoy , Senem Velipasalar

The outage probability limit is a fundamental and achievable lower bound on the word error rate of coded communication systems affected by fading. This limit is mainly determined by two parameters: the diversity order and the coding gain.…

Information Theory · Computer Science 2012-10-05 Dieter Duyck , Joseph Jean Boutros , Marc Moeneclaey

In this paper, the theoretical limits on the robustness of MIMO joint source channel codes is investigated. The case in which a single joint source channel code is used for the entire range of SNRs and for all levels of required fidelity is…

Information Theory · Computer Science 2009-11-02 Mahmoud Taherzadeh , H. Vincent Poor

In real-world applications, users often favor structurally diverse design choices over one high-quality solution. It is hence important to consider more solutions that decision makers can compare and further explore based on additional…

Machine Learning · Computer Science 2025-04-02 Maria Laura Santoni , Elena Raponi , Aneta Neumann , Frank Neumann , Mike Preuss , Carola Doerr
‹ Prev 1 2 3 10 Next ›