English
Related papers

Related papers: The Optimal Input Distribution for Partial Decode-…

200 papers

We study the optimality of linear precoding for the two-receiver multiple-input multiple-output (MIMO) Gaussian broadcast channel (BC) with confidential messages. Secret dirty-paper coding (SDPC) is optimal under an input covariance…

Information Theory · Computer Science 2013-04-18 Ali Fakoorian andA. Lee Swindlehurst

The capacity of a relay channel with inter-symbol interference (ISI) and additive colored Gaussian noise is examined under an input power constraint. Prior results are used to show that the capacity of this channel can be computed by…

Information Theory · Computer Science 2011-03-02 Chiranjib Choudhuri , Urbashi Mitra

Multiple-input multiple-output (MIMO) or multi-antenna communication is a key technique to achieve high spectral efficiency in wireless systems. For the point-to-point MIMO channel, it is a well-known result that the channel singular value…

Information Theory · Computer Science 2016-11-17 Liang Liu , Rui Zhang

For every Gaussian network, there exists a corresponding deterministic network called the discrete superposition network. We show that this discrete superposition network provides a near-optimal digital interface for operating a class…

Information Theory · Computer Science 2015-03-17 M. Anand , P. R. Kumar

This paper considers the problem of secret communication over a two-receiver multiple-input multiple-output (MIMO) Gaussian broadcast channel. The transmitter has two independent, confidential messages and a common message. Each of the…

Information Theory · Computer Science 2016-11-17 Ruoheng Liu , Tie Liu , H. Vincent Poor , Shlomo Shamai

We consider the problem of finding secrecy rate of a multiple-input multiple-output (MIMO) wire-tap channel. A transmitter, a legitimate receiver, and an eavesdropper are all equipped with multiple antennas. The channel states from the…

Information Theory · Computer Science 2014-11-04 Arash Khabbazibasmenj , Maksym A. Girnyk , Sergiy A. Vorobyov , Mikko Vehkaperä , Lars K. Rasmussen

We consider massive multiple-input multiple-output (MIMO) systems in the presence of Cauchy noise. First, we focus on the channel estimation problem. In the standard massive MIMO setup, the users transmit orthonormal pilots during the…

Information Theory · Computer Science 2023-07-07 Ziya Gulgun , Erik G. Larsson

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

We consider a secure communication scenario through the two-user Gaussian interference channel: each transmitter (user) has a confidential message to send reliably to its intended receiver while keeping it secret from the other receiver.…

Information Theory · Computer Science 2016-04-26 Parisa Babaheidarian , Somayeh Salimi , Panos Papadimitratos

In this paper, we study the interference relay-without-delay channel which is an interference channel with a relay helping the communication. We assume the relay's transmit symbol depends not only on its past received symbols but also on…

Information Theory · Computer Science 2011-08-16 Hyunseok Chang , Sae-Young Chung

The L-user additive white Gaussian noise multiway relay channel is investigated, where L users exchange information at the same rate through a single relay. A new achievable rate region, based on the functional-decode-forward coding…

Information Theory · Computer Science 2012-09-10 Lawrence Ong , Christopher M. Kellett , Sarah J. Johnson

In this paper, we show that the capacity of the three-node Gaussian relay channel can be achieved to within 1 and 2 bit/sec/Hz using compress-and-forward and amplify-and-forward relaying, respectively.

Information Theory · Computer Science 2010-11-24 Woohyuk Chang , Sae-Young Chung , Yong H. Lee

An approach is established for maximizing the Lower bound on the Mismatch capacity (hereafter abbreviated as LM rate), a key performance bound in mismatched decoding, by optimizing the channel input probability distribution. Under a fixed…

Information Theory · Computer Science 2024-05-02 Lingyi Chen , Shitong Wu , Xinwei Li , Huihui Wu , Hao Wu , Wenyi Zhang

In this paper we study and analyze coverage region for half-duplex multiple-input multiple-output (MIMO) relay channel with amplify-and-forward (AF) strategy at the relay station. By assuming mixed Rayleigh and Rician fading channels with…

Information Theory · Computer Science 2014-10-14 Behrooz Razeghi , Ghosheh Abed Hodtani , Seyed Alireza Seyedin

For every Gaussian relay network with a single source-destination pair, it is known that there exists a corresponding deterministic network called the discrete superposition network that approximates its capacity uniformly over all SNR's to…

Information Theory · Computer Science 2016-11-17 M. Anand , P. R. Kumar

We present a deterministic channel model which captures several key features of multiuser wireless communication. We consider a model for a wireless network with nodes connected by such deterministic channels, and present an exact…

Information Theory · Computer Science 2007-10-23 A. S. Avestimehr , S. N. Diggavi , D. N. C. Tse

We consider slow fading relay channels with a single multi-antenna source-destination terminal pair. The source signal arrives at the destination via N hops through N-1 layers of relays. We analyze the diversity of such channels with fixed…

Information Theory · Computer Science 2007-08-03 Sheng Yang , Jean-Claude Belfiore

This paper adds to the understanding of the capacity region of the Gaussian interference channel. To this end, the capacity region of the one-sided Gaussian interference channel is first fully characterized. This is accomplished by…

Information Theory · Computer Science 2015-09-22 Mojtaba Vaezi , H. Vincent Poor

This paper describes an approach for half-duplex cooperative transmission in a classical three-node relay channel. Assuming availability of channel state information at nodes, the approach makes use of this information to optimize distinct…

Information Theory · Computer Science 2011-11-09 Tan F. Wong , Tat M. Lok , John M. Shea

We use stochastic geometry to analyze the performance of a partial decode-and-forward (PDF) relaying scheme applied in a user-assisted relaying setting, where an active user relays data through another idle user in uplink cellular…

Information Theory · Computer Science 2015-07-07 Hussain Elkotby , Mai Vu