English
Related papers

Related papers: Sum-Capacity of Ergodic Fading Interference and Co…

200 papers

The capacity region of the Finite-State Multiple Access Channel (FS-MAC) with feedback that may be an arbitrary time-invariant function of the channel output samples is considered. We provided a sequence of inner and outer bounds for this…

Information Theory · Computer Science 2008-02-12 Haim H. Permuter , Tsachy Weissman , Jun Chen

A multi-input multi-output (MIMO) Gaussian channel with two transmit antennas and two receive antennas is studied that is subject to an input peak-power constraint. The capacity and the capacity-achieving input distribution are unknown in…

Information Theory · Computer Science 2024-01-31 Alex Dytso , Luca Barletta , Gerhard Kramer

We consider a Gaussian multiple-access channel (MAC) with an amplify-and-forward (AF) relay, where all nodes except the receiver have multiple antennas and the direct links between transmitters and receivers are neglected. Thus, spatial…

Information Theory · Computer Science 2015-03-20 Frederic Knabe , Omar Mohamed , Carolin Huppert

Consider the problem of a Multiple-Input Multiple-Output (MIMO) Multiple-Access Channel (MAC) at the limit of large number of users. Clearly, in practical scenarios, only a small subset of the users can be scheduled to utilize the channel…

Information Theory · Computer Science 2018-01-16 Joseph Kampeas , Asaf Cohen , Omer Gurewitz

The fading wire-tap channel is investigated, where the source-to-destination channel and the source-to-wire-tapper channel are corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel…

Information Theory · Computer Science 2007-08-22 Yingbin Liang , H. Vincent Poor

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 letter analyses the effective capacity of communications system using unified models. In order to obtain a simple closed-form mathematically tractable expression, two different unified approximate models have been used. The mixture…

Information Theory · Computer Science 2018-04-26 H. Al-Hmood , H. S. Al-Raweshidy

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

A single-letter characterization is provided for the capacity region of finite-state multiple access channels. The channel state is a Markov process, the transmitters have access to delayed state information, and channel state information…

Information Theory · Computer Science 2015-03-17 Uria Basher , Avihay Shirazi , Haim Permuter

A broadcast strategy for multiple access communication over slowly fading channels is introduced, in which the channel state information is known to only the receiver. In this strategy, the transmitters split their information streams into…

Information Theory · Computer Science 2017-12-27 Samia Kazemi , Ali Tajer

We consider the problem of transmission of several distributed sources over a multiple access channel (MAC) with side information at the sources and the decoder. Source-channel separation does not hold for this channel. Sufficient…

Information Theory · Computer Science 2008-03-11 R. Rajesh , Vinod Sharma

For ergodic fading, a lattice coding and decoding strategy is proposed and its performance is analyzed for the single-input single-output (SISO) and multiple-input multiple-output (MIMO) point-to-point channel as well as the multiple-access…

Information Theory · Computer Science 2017-02-28 Ahmed Hindy , Aria Nosratinia

We consider that a transmitter covertly communicates with multiple receivers under the help of a friendly jammer. The messages intended for different receivers are transmitted in mutually orthogonal frequency bands. An adversary observes…

Information Theory · Computer Science 2021-03-03 Ke-Wen Huang , Hao Deng , Hui-Ming Wang

This paper addresses point-to-point communication over block-fading channels with independent fading blocks. When both channel state information at the transmitter (CSIT) and receiver (CSIR) are available, most achievable schemes use…

Information Theory · Computer Science 2018-08-28 Ahmed Hindy , Aria Nosratinia

This is the second part of a two-part paper that studies the problem of jamming in a fixed-rate transmission system with fading. In the first part, we studied the scenario with a fast fading channel, and found Nash equilibria of mixed…

Information Theory · Computer Science 2008-08-27 George T. Amariucai , Shuangqing Wei , Rajgopal Kannan

A multiple access channel (MAC) consists of multiple senders simultaneously transmitting their messages to a single receiver. For the classical-quantum case (cq-MAC), achievable rates are known assuming that all the messages are decoded, a…

Quantum Physics · Physics 2022-04-26 Masahito Hayashi , Angeles Vazquez-Castro

In this paper, we consider a two-hop amplify-and-forward (AF) relaying system, where the relay node is energy-constrained and harvests energy from the source node. In the literature, there are three main energy-harvesting (EH) protocols,…

Information Theory · Computer Science 2018-03-12 Galymzhan Nauryzbayev , Khaled M. Rabie , Mohamed Abdallah , Bamidele Adebisi

In this paper, capacity bounds for the two-user Interference Channel (IC) with cooperative receivers via conferencing links of finite capacities is investigated. The capacity results known for this communication scenario are limited to a…

Information Theory · Computer Science 2015-12-17 Reza K. Farsani , Amir K. Khandani

In this paper we introduce a novel performance analysis of the ${\eta}$-${\mu}$ generalized radio fading channels with integer value of the ${\mu}$ fading parameter, i.e. with even number of multipath clusters. This fading model includes…

Information Theory · Computer Science 2017-03-14 Ehab Salahat , Murad Qasaimeh

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