English
Related papers

Related papers: Approximate Capacity of Gaussian Relay Networks

200 papers

In this paper, we study the capacity of the diamond channel. We focus on the special case where the channel between the source node and the two relay nodes are two separate links with finite capacities and the link from the two relay nodes…

Information Theory · Computer Science 2015-01-23 Wei Kang , Nan Liu , Weiwei Chong

Results for Gaussian relay channels typically focus on maximizing transmission rates for given locations of the source, relay and destination. We introduce an alternative perspective, where the objective is maximizing coverage for a given…

Information Theory · Computer Science 2017-08-04 Vaneet Aggarwal , Amir Bennatan , A. Robert Calderbank

We establish an achievable rate region for discrete memoryless interference relay channels that consist of two source-destination pairs and one or more relays. We develop an achievable scheme combining Han-Kobayashi and noisy network coding…

Information Theory · Computer Science 2013-03-06 Byungjun Kang , Si-Hyeon Lee , Sae-Young Chung , Changho Suh

The capacity of a class of multi-way relay channels, where L users communicate via a relay (at possibly different rates), is derived for the case where the channel outputs are modular sums of the channel inputs and the receiver noise. The…

Information Theory · Computer Science 2011-11-16 Lawrence Ong , Sarah J. Johnson , Christopher M. Kellett

In the half-duplex single relay selection network, comprised of a source, $M$ half-duplex relays, and a destination, only one relay is active at any given time, i.e., only one relay receives or transmits, and the other relays are inactive,…

Information Theory · Computer Science 2015-04-10 Nikola Zlatanov , Vahid Jamali , Robert Schober

We consider the Gaussian interference channel with an intermediate relay as a main building block for cooperative interference networks. On the achievability side, we consider compress-and-forward based strategies. Specifically, a…

Information Theory · Computer Science 2015-03-18 Ye Tian , Aylin Yener

In this paper, we derive the information theoretic capacity of a special class of mesh networks. A mesh network is a heterogeneous wireless network in which the transmission among power limited nodes is assisted by powerful relays, which…

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

Recent outer bounds on the capacity region of Gaussian interference channels are generalized to $m$-user channels with $m>2$ and asymmetric powers and crosstalk coefficients. The bounds are again shown to give the sum-rate capacity for…

Information Theory · Computer Science 2008-01-16 Xiaohu Shang , Gerhard Kramer , Biao Chen

This paper investigates the approximation power of three types of random neural networks: (a) infinite width networks, with weights following an arbitrary distribution; (b) finite width networks obtained by subsampling the preceding…

Machine Learning · Computer Science 2019-10-21 Bolton Bailey , Ziwei Ji , Matus Telgarsky , Ruicheng Xian

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

We study the distribution of a fully connected neural network with random Gaussian weights and biases in which the hidden layer widths are proportional to a large constant $n$. Under mild assumptions on the non-linearity, we obtain…

Machine Learning · Computer Science 2024-06-18 Stefano Favaro , Boris Hanin , Domenico Marinucci , Ivan Nourdin , Giovanni Peccati

The deterministic capacity of a relay network is the capacity of a network when relays are restricted to transmitting \emph{reliable} information, that is, (asymptotically) deterministic function of the source message. In this paper it is…

Information Theory · Computer Science 2016-11-18 Anders Host-Madsen

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

We consider the General Gaussian Multiple Access Wire-Tap Channel (GGMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed eavesdropper who is as capable as the…

Information Theory · Computer Science 2007-07-13 Ender Tekin , Aylin Yener

In this paper, we consider full-duplex and half-duplex Gaussian relay channels where the noises at the relay and destination are arbitrarily correlated. We first derive the capacity upper bound and the achievable rates with three existing…

Information Theory · Computer Science 2016-11-17 Lili Zhang , Jinhua Jiang , Andrea J. Goldsmith , Shuguang Cui

We derive closed-form expressions for the achievable rates of a buffer-aided full-duplex (FD) multiple-input multiple-output (MIMO) Gaussian relay channel. The FD relay still suffers from residual self-interference (RSI) after the…

Information Theory · Computer Science 2017-08-03 Ahmed El Shafie , Ahmed Sultan , Ioannis Krikidis , Naofal Al-Dhahir , Ridha Hamila

Noisy network coding, which elegantly combines the conventional compress-and-forward relaying strategy and ideas from network coding, has recently drawn much attention for its simplicity and optimality in achieving to within constant gap of…

Information Theory · Computer Science 2011-12-13 Lei Zhou , Wei Yu

This paper studies incremental relay strategies for a two-user Gaussian relay-interference channel with an in-band-reception and out-of-band-transmission relay, where the link between the relay and the two receivers is modelled as a…

Information Theory · Computer Science 2012-12-13 Lei Zhou , Wei Yu

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

Feedback holds a pivotal role in practical communication schemes, even though it does not enhance channel capacity. Its main attribute includes adaptability in transmission that allows for a higher rate of convergence of the error…

Information Theory · Computer Science 2024-03-22 Ioannis Papoutsidakis , Robert J. Piechocki , Angela Doufexi
‹ Prev 1 3 4 5 6 7 10 Next ›