English
Related papers

Related papers: Distributed MIMO receiver - Achievable rates and u…

200 papers

A novel class of achievable rate regions is obtained for the K-receiver broadcast channel with two groupcast messages. The associated achievability schemes are parameterized by an expansion of the message set which then determines how…

Information Theory · Computer Science 2020-01-28 Mohamed Salman , Mahesh K. Varanasi

We analyze the achievable rate in interference-free wireless networks with physical layer fading channels and orthogonal multiple access. As a starting point, the point-to-point channel is considered. We find the optimal physical and…

Information Theory · Computer Science 2016-11-18 Tao Cui , Tracey Ho , Joerg Kliewer

The point-to-point multiple-antenna channel is investigated in uncorrelated block fading environment with Rayleigh distribution. The maximum throughput and maximum expected-rate of this channel are derived under the assumption that the…

Information Theory · Computer Science 2012-01-17 Mahdi Zamani , Amir K. Khandani

In this paper, a two-user discrete memoryless multiple-access channel (DM-MAC) with correlated channel states, each known at one of the encoders is considered, in which each encoder transmits independent messages and tries to cooperate with…

Information Theory · Computer Science 2011-02-08 Mahdi Zamanighomi , Mohammad Javad Emadi , Farhad Shirani Chaharsooghi , Mohammad Reza Aref

We consider transmission over the ergodic fading multi-antenna broadcast (MIMO-BC) channel with partial channel state information at the transmitter and full information at the receiver. Over the equivalent {\it non}-fading channel,…

Information Theory · Computer Science 2007-10-14 Amir Bennatan , David Burshtein

We consider a relay network with two relays and a feedback link from the receiver to the sender. To obtain the achievability result, we use compress-and-forward and random binning techniques combined with deterministic binning and…

Information Theory · Computer Science 2011-09-08 Mohammad Ali Tebbi , Mahtab Mirmohseni , Mahmoud Ahmadian Attari , Mohammad Reza Aref

We investigate the achievable rate of data transmission from sources to sinks through a multiple-relay network. We study achievable rates for omniscient coding, in which all nodes are considered in the coding design at each node. We find…

Information Theory · Computer Science 2010-04-15 Lawrence Ong , Mehul Motani

This paper considers a deterministic physical model of massive multiple-input multiple-output (MIMO) systems with uniform linear antenna arrays. It is known that the maximum spatial degrees of freedom is achieved by spacing antenna elements…

Information Theory · Computer Science 2016-01-22 Keigo Takeuchi

Effective capacity, which provides the maximum constant arrival rate that a given service process can support while satisfying statistical delay constraints, is analyzed in a multiuser scenario. In particular, we study the achievable…

Information Theory · Computer Science 2009-10-22 Deli Qiao , Mustafa Cenk Gursoy , Senem Velipasalar

The benefit of multi-antenna receivers is investigated in wireless ad hoc networks, and the main finding is that network throughput can be made to scale linearly with the number of receive antennas nR even if each transmitting node uses…

Information Theory · Computer Science 2016-11-17 Nihar Jindal , Jeffrey G. Andrews , Steven Weber

The use of 1-bit analog-to-digital converters (ADCs) is seen as a promising approach to significantly reduce the power consumption and hardware cost of multiple-input multiple-output (MIMO) receivers. However, the nonlinear distortion due…

Information Theory · Computer Science 2022-10-12 Neil Irwin Bernardo , Jingge Zhu , Yonina C. Eldar , Jamie Evans

In this work, we consider a discrete-time stationary Rayleigh flat-fading channel with unknown channel state information at transmitter and receiver. The law of the channel is presumed to be known to the receiver. In addition, we assume the…

Information Theory · Computer Science 2011-03-03 Meik Dörpinghaus , Heinrich Meyr

The multiple access channel (MAC) with many-user is a general model for massive machine type communications. In this paradigm, the number of users may be comparable or even larger than the coding blocklength $n$. In contrast, classical MAC…

Information Theory · Computer Science 2019-08-12 Fan Wei , Yongpeng Wu , Wen Chen , Yanlin Geng , Giuseppe Caire

In this paper, achievable rates regions are derived for power constrained Gaussian broadcast channel of two users using finite dimension constellations. Various transmission strategies are studied, namely superposition coding (SC) and…

Information Theory · Computer Science 2014-03-24 Zeina Mheich , Florence Alberge , Pierre Duhamel

For a multi-user interference channel with multi-antenna transmitters and single-antenna receivers, by restricting each transmitter to Gaussian input and each receiver to a single-user detector, computing the largest achievable rate region…

Information Theory · Computer Science 2009-07-06 Xiaohu Shang , Biao Chen , H. Vincent Poor

In this paper, we study the achievable rate region of Gaussian multiuser channels with the messages transmitted being from finite input alphabets and the outputs being {\em quantized at the receiver}. In particular, we focus on the…

Information Theory · Computer Science 2011-02-15 Suresh Chandrasekaran , Saif K. Mohammed , A. Chockalingam

We study the compound multi-input multi-output (MIMO) broadcast channel with confidential messages (BCC), where one transmitter sends a common message to two receivers and two confidential messages respectively to each receiver. The channel…

Information Theory · Computer Science 2016-11-18 Mari Kobayashi , Yingbin Liang , Shlomo Shamai , Merouane Debbah

We consider a single-antenna Gaussian multiple-access channel (MAC) with a multiple-antenna amplify-and-forward (AF) relay, where, contrary to many previous works, also the direct links between transmitters and receiver are taken into…

Information Theory · Computer Science 2012-07-09 Frederic Knabe , Omar Mohamed , Carolin Huppert

An upper bound on the capacity of multiple-input multiple-output (MIMO) Gaussian fading channels is derived under peak amplitude constraints. The upper bound is obtained borrowing concepts from convex geometry and it extends to MIMO…

Information Theory · Computer Science 2021-11-29 Antonino Favano , Marco Ferrari , Maurizio Magarini , Luca Barletta

In this paper, we study a general additive state-dependent Gaussian interference channel (ASD-GIC) where we consider two-user interference channel with two independent states known non-causally at both transmitters, but unknown to either of…

Information Theory · Computer Science 2013-01-24 Shahab Ghasemi-Goojani , Hamid Behroozi