English
Related papers

Related papers: Diversity versus Multiplexing at Finite Blocklengt…

200 papers

The goal of this paper is to understand the key merits of multihop relaying techniques jointly in terms of their energy efficiency and spectral efficiency advantages in the presence of multiuser diversity gains from opportunistic (i.e.,…

Information Theory · Computer Science 2008-10-29 Ozgur Oyman , Moe Z. Win

This paper is concerned with the error performance analysis of binary differential phase shift keying with differential detection over the nonselective, Rayleigh fading channel with combining diversity reception. Space antenna diversity…

Information Theory · Computer Science 2010-08-26 Hua Fu , Pooi Yuen Kam

In this paper we consider a channel model that is often used to describe the mobile wireless scenario: multiple-antenna additive white Gaussian noise channels subject to random (fading) gain with full channel state information at the…

Information Theory · Computer Science 2018-06-28 Austin Collins , Yury Polyanskiy

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

This paper studies the performance of transmission schemes that have rate that increases with average SNR while maintaining a fixed outage probability. This is in contrast to the classical Zheng-Tse diversity-multiplexing tradeoff (DMT)…

Information Theory · Computer Science 2007-10-09 Peng Wu , Nihar Jindal

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

We consider the massive Multiple Input Multiple Output (MIMO) diversity channel affected by independent and identically distributed Rayleigh fading, with linear processing at both transmitter and receiver sides, and analyze the outage…

Information Theory · Computer Science 2023-02-08 Marco Martalo , Riccardo Raheli

This paper studies physical-layer secure transmissions from a transmitter to a legitimate receiver against an eavesdropper over slow fading channels, taking into account the impact of finite blocklength secrecy coding. A comprehensive…

Information Theory · Computer Science 2020-02-11 Tong-Xing Zheng , Hui-Ming Wang , Derrick Wing Kwan Ng , Jinhong Yuan

This paper investigates the maximal secrecy rate over a wiretap channel subject to reliability and secrecy constraints at a given blocklength. New achievability and converse bounds are derived, which are shown to be tighter than existing…

Information Theory · Computer Science 2016-01-25 Wei Yang , Rafael F. Schaefer , H. Vincent Poor

We provide nonasymptotic upper and lower bounds on the sum-rate capacity of Rayleigh block-fading multiple-access channels for the setup where a priori channel state information is not available. The upper bound relies on a dual formula for…

Information Theory · Computer Science 2016-11-17 Rahul Devassy , Giuseppe Durisi , Johan Östman , Wei Yang , Tome Eftimov , Zoran Utkovski

The problem of multilevel diversity coding with regeneration is considered in this work. Two new outer bounds on the optimal tradeoffs between the normalized storage capacity and repair bandwidth are established, by which the optimality of…

Information Theory · Computer Science 2015-12-16 Shuo Shao , Tie Liu , Chao Tian

With various time-sensitive tasks to be served, ultra-reliable and low-latency communications (URLLC) has become one of the most important scenarios for the fifth generation (5G) wireless communications. The end-to-end delay from the…

Information Theory · Computer Science 2024-07-18 Yixin Zhang , Wenchi Cheng , Jingqing Wang , Wei Zhang

In this paper, we study the performance of network-coded cooperative diversity systems with practical communication constraints. More specifically, we investigate the interplay between diversity, coding, and multiplexing gain when the relay…

Information Theory · Computer Science 2016-11-17 Michela Iezzi , Marco Di Renzo , Fabio Graziosi

For discrete memoryless multiple-access channels, we propose a general definition of variable length codes with a measure of the transmission rates at the receiver side. This gives a receiver perspective on the multiple-access channel…

Information Theory · Computer Science 2011-02-28 Stephane Musy

We derive bounds on the noncoherent capacity of a very general class of multiple-input multiple-output channels that allow for selectivity in time and frequency as well as for spatial correlation. The bounds apply to peak-constrained…

Information Theory · Computer Science 2008-01-29 Ulrich G. Schuster , Giuseppe Durisi , Helmut Bölcskei , H. Vincent Poor

In this paper, a multiple-relay network in considered, in which $K$ single-antenna relays assist a single-antenna transmitter to communicate with a single-antenna receiver in a half-duplex mode. A new Amplify and Forward (AF) scheme is…

Information Theory · Computer Science 2007-10-01 Shahab Oveis Gharan , Alireza Bayesteh , Amir K. khandani

In this work, a MIMO detection problem is considered. At first, we derive the Generalized Likelihood Ratio Test (GLRT) for arbitrary transmitted signals and arbitrary time-correlation of the disturbance. Then, we investigate design criteria…

Other Computer Science · Computer Science 2022-03-09 Antonio De Maio , Marco Lops , Luca Venturino

In this work, we investigate the diversity-multiplexing tradeoff (DMT) of the multiple-antenna (MIMO) static half-duplex relay channel. A general expression is derived for the DMT upper bound, which can be achieved by a compress-and-forward…

Information Theory · Computer Science 2009-11-09 Olivier Leveque , Christophe Vignat , Melda Yuksel

We consider upper bounds on the error probability in channel coding. We derive an improved maximum-likelihood union bound, which takes into account events where the likelihood of the correct codeword is tied with that of some competitors.…

Information Theory · Computer Science 2013-02-12 Eli Haim , Yuval Kochman , Uri Erez

This work considers space-time block coding for the Rayleigh fading multiple-input multiple-output (MIMO) multiple access channel (MAC). If we suppose that the receiver is performing joint maximum-likelihood (ML) decoding, optimizing a MIMO…

Information Theory · Computer Science 2015-11-16 Toni Ernvall , Jyrki Lahtonen , Hsiao-feng , Lu , Roope Vehkalahti