English
Related papers

Related papers: Diversity versus Multiplexing at Finite Blocklengt…

200 papers

It is well known that the presence of double scattering degrades the performance of a MIMO channel, in terms of both the multiplexing gain and the diversity gain. In this paper, a closed-form expression of the diversity-multiplexing…

Information Theory · Computer Science 2007-07-16 Sheng Yang , Jean-Claude Belfiore

The scaling of coherent and non-coherent channel capacity is studied in a single-input multiple-output (SIMO) block Rayleigh fading channel as both the bandwidth and the number of receiver antennas go to infinity jointly with the transmit…

Information Theory · Computer Science 2020-02-21 Felipe Gomez-Cuba , Mainak Chowdhury , Alexandros Manolakos , Elza Erkip , Andrea J. Goldsmith

We consider transmission of a continuous amplitude source over an L-block Rayleigh fading $M_t \times M_r$ MIMO channel when the channel state information is only available at the receiver. Since the channel is not ergodic, Shannon's…

Information Theory · Computer Science 2007-11-09 Deniz Gunduz , Elza Erkip

A base-station (BS) equipped with multiple antennas can use its spatial dimensions in three different ways: (1) to serve multiple users, thereby achieving a multiplexing gain, (2) to provide spatial diversity in order to improve user rates…

Information Theory · Computer Science 2018-08-23 Kianoush Hosseini , Caiyi Zhu , Ahmad Khan , Raviraj S. Adve , Wei Yu

We analyze fading relay networks, where a single-antenna source-destination terminal pair communicates through a set of half-duplex single-antenna relays using a two-hop protocol with linear processing at the relay level. A family of…

Information Theory · Computer Science 2016-08-14 Cemal Akçaba , Patrick Kuppinger , Helmut Bölcskei

In the sixth generation (6G), ultra-reliable low-latency communications (URLLC) will be further developed to achieve TKu extreme connectivity. On the premise of ensuring the same rate and reliability, the spatial domain advantage of…

Information Theory · Computer Science 2025-04-02 Feng Ye , Xiaohu You , Jiamin Li , Chen Ji , Chuan Zhang

Unreliable fading wireless channels are the main challenge for strict performance guarantees in mobile communications. Diversity schemes including massive number of antennas, huge spectrum bands and multi-connectivity links are applied to…

Information Theory · Computer Science 2020-09-21 Karl-Ludwig Besser , Eduard A. Jorswieck

User cooperation is a well-known approach to achieve diversity without multiple antennas, however at the cost of inevitable loss of rate mostly due to the need of additional channels for relaying. A new collaborative diversity scheme is…

Information Theory · Computer Science 2011-03-01 Indu Shakya , Falah H. Ali , Elias Stipidis

In this paper, we investigate the necessity of finite blocklength codes in distributed transmission of independent message sets over channels with feedback. Previously, it was shown that finite effective length codes are necessary in…

Information Theory · Computer Science 2018-01-17 Mohsen Heidari , Farhad Shirani , S. Sandeep Pradhan

We establish an upper bound on the noncoherent capacity pre-log of temporally correlated block-fading single-input multiple-output (SIMO) channels. The upper bound matches the lower bound recently reported in Riegler et al. (2011), and,…

Information Theory · Computer Science 2011-09-14 Wei Yang , Giuseppe Durisi , Veniamin I. Morgenshtern , Erwin Riegler

We consider a communication system with multi-access fading channel. Each user in the system requires certain rate guarantee. Our main contribution is to devise a scheduling scheme called "Opportunistic Super-position Coding" that satisfies…

Information Theory · Computer Science 2009-11-24 Prasanna Chaporkar , Kimmo Kansanen , Ralf R. Müller

In the regime of strong mode coupling, the modal gains and losses and the modal group delays of a multimode fiber are known to have well-defined statistical properties. In mode-division multiplexing, mode-dependent gains and losses are…

Optics · Physics 2013-01-15 Keang-Po Ho , Joseph M. Kahn

In this paper, the trade-off between the number of transmissions (or burstiness) $K_n=e^{n\nu}$ of a user, the asynchronism level $A_n=e^{n\alpha}$ in a slotted strongly asynchronous channel, and the ability to distinguish $M_n=e^{nR}$…

Information Theory · Computer Science 2018-07-27 Sara Shahi , Daniela Tuninetti , Natasha Devroye

Correlation across transmit antennas, in multiple antenna systems (MIMO), has been studied in various scenarios and has been shown to be detrimental or provide benefits depending on the particular system and underlying assumptions. In this…

Information Theory · Computer Science 2016-11-18 Junyoung Nam , Giuseppe Caire , Young-Jo Ko , Jeongseok Ha

This paper analyzes the effective capacity of delay constrained machine type communication (MTC) networks operating in the finite blocklength regime. First, we derive a closed-form mathematical approximation for the effective capacity in…

Information Theory · Computer Science 2018-08-23 Mohammad Shehab , Endrit Dosti , Hirley Alves , Matti Latva-aho

This paper develops a diversity-multiplexing tradeoff (DMT) over a bidirectional random relay set in a wireless network where the distribution of all nodes is a stationary Poisson point process. This is a nontrivial extension of the DMT…

Information Theory · Computer Science 2009-09-25 Chun-Hung Liu , Jeffery G. Andrews

This paper addresses the fundamental characteristics of information exchange via multihop network coding over two-way relaying in a wireless ad hoc network. The end-to-end rate regions achieved by time-division multihop (TDMH), MAC-layer…

Information Theory · Computer Science 2009-02-16 Chun-Hung Liu , Feng Xue , Jeffrey G. Andrews

This paper demonstrates the significant gains that multi-access users can achieve from sharing a single amplify-forward relay in slow fading environments. The proposed protocol, namely the multi-access relay amplify-forward, allows for a…

Information Theory · Computer Science 2009-09-29 Deqiang Chen , Kambiz Azarian , J. Nicholas Laneman

Randomized network coding (RNC) greatly reduces the complexity of implementing network coding in large-scale, heterogeneous networks. This paper examines two tradeoffs in applying RNC: The first studies how the performance of RNC varies…

Information Theory · Computer Science 2009-02-18 Yingda Chen , Shalinee Kishore

Individual links in a wireless network may experience unequal fading coherence times due to differences in mobility or scattering environment, a practical scenario where the fundamental limits of communication have been mostly unknown. This…

Information Theory · Computer Science 2016-07-26 Mohamed Fadel , Aria Nosratinia