English
Related papers

Related papers: Achievable Rates for a Distributed Antenna System …

200 papers

We discuss the problem of designing channel access architectures for enabling fast, low-latency, grant-free and uncoordinated uplink for densely packed wireless nodes. Specifically, we study random-access codes, previously introduced for…

Information Theory · Computer Science 2019-07-23 Suhas S Kowshik , Kirill Andreev , Alexey Frolov , Yury Polyanskiy

The two-user Gaussian interference channel with a shared out-of-band relay is considered. The relay observes a linear combination of the source signals and broadcasts a common message to the two destinations, through a perfect link of fixed…

Information Theory · Computer Science 2016-11-18 Peyman Razaghi , Song Nam Hong. Lei Zhou , Wei Yu , Giuseppe Caire

We study the transmission over a network in which users send information to a remote destination through relay nodes that are connected to the destination via finite-capacity error-free links, i.e., a cloud radio access network. The relays…

Information Theory · Computer Science 2019-01-31 Inaki Estella Aguerri , Abdellatif Zaidi , Giuseppe Caire , Shlomo Shamai

A restricted two-way communication problem in a small fully-connected network is investigated. The network consists of three nodes, all having access to a common channel with half-duplex constraint. Two nodes want to establish a dialog…

Information Theory · Computer Science 2014-09-05 Manuel Stein

In this paper, we study the state-dependent two-user interference channel, where the state information is non-causally known at both transmitters but unknown to either of the receivers. We propose two coding schemes for the discrete…

Information Theory · Computer Science 2010-06-29 Lili Zhang , Jinhua Jiang , Shuguang Cui

One of the main goals of the upcoming sixth-generation (6G) wireless networks is the ability to support higher network density, while ensuring a high quality of service for each user. In this paper, we introduce distributed uplink…

Information Theory · Computer Science 2024-12-11 Apostolos A. Tegos , Yue Xiao , Sotiris A. Tegos , George K. Karagiannidis , Panagiotis D. Diamantoulakis

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

We consider the discrete memoryless symmetric primitive relay channel, where, a source $X$ wants to send information to a destination $Y$ with the help of a relay $Z$ and the relay can communicate to the destination via an error-free…

Information Theory · Computer Science 2016-03-31 Xiugang Wu , Ayfer Ozgur , Liang-Liang Xie

In cell-free massive multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems, user equipments (UEs) are served by many distributed access points (APs), where channels are correlated due to finite…

Information Theory · Computer Science 2020-11-04 Junyuan Gao , Yongpeng Wu , Yongjian Wang , Wenjun Zhang , Fan Wei

As a basic information-theoretic model for fading relay channels, the parallel relay channel is first studied, for which lower and upper bounds on the capacity are derived. For the parallel relay channel with degraded subchannels, the…

Information Theory · Computer Science 2007-07-13 Yingbin Liang , Venugopal V. Veeravalli , H. Vincent Poor

This paper considers a general Gaussian relay network where a source transmits a message to a destination with the help of N half-duplex relays. It proves that the information theoretic cut-set upper bound to the capacity can be achieved to…

Information Theory · Computer Science 2016-11-15 Martina Cardone , Daniela Tuninetti , Raymond Knopp , Umer Salim

In this two part paper we consider a wireless network in which a source terminal communicates with a destination and a relay terminal is occasionally present in close proximity to the source without source's knowledge, suggesting oblivious…

Information Theory · Computer Science 2010-07-27 Evgeniy Braginskiy , Avi Steiner , Shlomo Shamai

We consider a MIMO fading broadcast channel and compute achievable ergodic rates when channel state information is acquired at the receivers via downlink training and it is provided to the transmitter by channel state feedback. Unquantized…

Information Theory · Computer Science 2016-11-17 Giuseppe Caire , Nihar Jindal , Mari Kobayashi , Niranjay Ravindran

We consider a three-terminal state-dependent relay channel with the channel state available non-causally at only the source. Such a model may be of interest for node cooperation in the framework of cognition, i.e., collaborative signal…

Information Theory · Computer Science 2016-11-17 Abdellatif Zaidi , Shlomo Shamai , Pablo Piantanida , Luc Vandendorpe

A two-user discrete memoryless compound multiple access channel with a common message and conferencing decoders is considered. The capacity region is characterized in the special cases of physically degraded channels and unidirectional…

Information Theory · Computer Science 2016-11-18 O. Simeone , D. Gunduz , H. V. Poor , A. Goldsmith , S. Shamai

We investigate the uplink throughput achievable by a multiple-user (MU) massive multiple-input multiple-output (MIMO) system in which the base station is equipped with a large number of low-resolution analog-to-digital converters (ADCs).…

Information Theory · Computer Science 2017-04-18 Sven Jacobsson , Giuseppe Durisi , Mikael Coldrey , Ulf Gustavsson , Christoph Studer

We consider a state-dependent full-duplex relay channel with the state of the channel non-causally available at only the relay. In the framework of cooperative wireless networks, some specific terminals can be equipped with cognition…

Information Theory · Computer Science 2016-11-17 Abdellatif Zaidi , Shivaprasad Kotagiri , J. Nicholas Laneman , Luc Vandendorpe

Our traditional notion of a cell is changing dramatically given the increasing degree of heterogeneity in 4G and emerging 5G systems. Rather than belonging to a specific cell, a device would choose the most suitable connection from the…

Networking and Internet Architecture · Computer Science 2014-10-28 Katerina Smiljkovikj , Hisham Elshaer , Petar Popovski , Federico Boccardi , Mischa Dohler , Liljana Gavrilovska , Ralf Irmer

In this paper, transmission over time-selective, flat fading relay channels is studied. It is assumed that channel fading coefficients are not known a priori. Transmission takes place in two phases: network training phase and data…

Information Theory · Computer Science 2008-12-09 Sami Akin , Mustafa Cenk Gursoy

A general class of wireless relay networks with a single source-destination pair is considered. Intermediate nodes in the network employ an amplify-and-forward scheme to relay their input signals. In this case the overall input-output…

Information Theory · Computer Science 2011-06-02 Samar Agnihotri , Sidharth Jaggi , Minghua Chen