English
Related papers

Related papers: Diversity versus Multiplexing at Finite Blocklengt…

200 papers

Diversity order is an important measure for the performance of communication systems over MIMO fading channels. In this paper, we prove that in MIMO multiple access systems (or MIMO point-to-point systems with V-BLAST transmission),…

Information Theory · Computer Science 2016-11-15 Mahmoud Taherzadeh , Amin Mobasher , Amir K. Khandani

The multiple-input and multiple-output (MIMO) technique is regarded as a promising approach to boost the throughput and reliability of optical fiber communications. However, the fundamental limits of optical fiber MIMO systems with finite…

Information Theory · Computer Science 2024-04-09 Xin Zhang , Dongfang Xu , Shenghui Song , Mérouane Debbah

Diversity-multiplexing trade-off has been studied extensively to quantify the benefits of different relaying strategies in terms of error and rate performance. However, even in the case of a single half-duplex relay, which seems fully…

Information Theory · Computer Science 2013-05-16 Ritesh Kolte , Ayfer Özgür

We study the tradeoff between reliability, data rate, and delay for half-duplex MIMO multihop networks that utilize the automatic-retransmission-request (ARQ) protocol both in the asymptotic high signal-to-noise ratio (SNR) regime and in…

Information Theory · Computer Science 2016-11-18 Yao Xie , Deniz Gunduz , Andrea J. Goldsmith

We study a fading linear finite-field relay network having multiple source-destination pairs. Because of the interference created by different unicast sessions, the problem of finding its capacity region is in general difficult. We observe…

Information Theory · Computer Science 2009-05-12 Sang-Woon Jeon , Sae-Young Chung

The space-time bit-interleaved coded modulation (ST-BICM) is an efficient technique to obtain high diversity and coding gain on a block-fading MIMO channel. Its maximum-likelihood (ML) performance is computed under ideal interleaving…

Information Theory · Computer Science 2016-11-15 Nicolas Gresset , Loic Brunel , Joseph Boutros

Given a dataset of points in a metric space and an integer $k$, a diversity maximization problem requires determining a subset of $k$ points maximizing some diversity objective measure, e.g., the minimum or the average distance between two…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-01-24 Matteo Ceccarello , Andrea Pietracaprina , Geppino Pucci , Eli Upfal

In this paper, we examine the performance of the decode-and-forward (DF) relaying protocols with finite blocklength (FB). We provide the overall outage probability of three distinct DF relaying protocols, where the channels are assumed to…

Information Theory · Computer Science 2017-06-22 Parisa Nouri , Hirley Alves , Matti Latva-aho

Facing the dramatic increase of real-time applications and time-sensitive services, large-scale ultra-low delay requirements are put forward for the sixth generation (6G) wireless networks. To support massive ultra-reliable and low-latency…

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

Broadcasting systems have to deal with channel variability in order to offer the best spectral efficiency to the receivers. However, the transmission parameters that maximise the spectral efficiency generally leads to a large link…

Information Theory · Computer Science 2014-01-17 Hugo Meric , Jose Miguel Piquer

In this paper, diversity analysis of bit-interleaved coded multiple beamforming (BICMB) is extended to the case of general spatial interleavers, removing a condition on their previously known design criteria and quantifying the resulting…

Information Theory · Computer Science 2009-09-29 Hong Ju Park , Ender Ayanoglu

In this work, the Multiple transmit antennas Multiple Access Channel is considered. A construction of a family of distributed space-time codes for this channel is proposed. No Channel Side Information at the transmitters is assumed and…

Information Theory · Computer Science 2008-04-10 Maya Badr , Jean-Claude Belfiore

The high-SNR capacity of the noncoherent MIMO channel has been derived for the case of independent and identically distributed (IID) Rayleigh block fading by exploiting the Gaussianity of the channel matrix. This implies the optimal degrees…

Information Theory · Computer Science 2021-01-12 Khac-Hoang Ngo , Sheng Yang , Maxime Guillaud

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

The exact closed-form expressions for outage probability and bit error rate of spectrum sharing-based multi-hop decodeand- forward (DF) relay networks in non-identical Rayleigh fading channels are derived. We also provide the approximate…

Information Theory · Computer Science 2013-01-04 Vo Nguyen Quoc Bao , Tran Thien Thanh , Tuan Duc Nguyen , Thanh Dinh Vu

Due to the advantage of capacity-achieving, polar codes have been extended to the block fading channel whereas most constructions involve complex iterative-calculation. In this paper, we establish a systematic framework to analyze the error…

Information Theory · Computer Science 2021-08-11 Kai Niu , Yan Li

We analyze the diversity gain for a distributed antenna subarray employing orthogonal frequency-division multiplexing (OFDM) in millimeter-wave (mm-Wave) massive multiple-input multiple-output (MIMO) systems. We show that the diversity gain…

Information Theory · Computer Science 2021-05-11 Sadjad Sedighi , Ender Ayanoglu

We study the half-duplex multiple-relay channel (HD-MRC) where every node can either transmit or listen but cannot do both at the same time. We obtain a capacity upper bound based on a max-flow min-cut argument and achievable transmission…

Information Theory · Computer Science 2012-12-04 Lawrence Ong , Mehul Motani , Sarah J. Johnson

We study random linear network coding for broadcasting in time division duplexing channels. We assume a packet erasure channel with nodes that cannot transmit and receive information simultaneously. The sender transmits coded data packets…

Information Theory · Computer Science 2009-03-26 Daniel E. Lucani , Muriel Médard , Milica Stojanovic

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

Information Theory · Computer Science 2017-06-14 Wei Yang , Rafael F. Schaefer , H. Vincent Poor