Related papers: Ergodic Fading Interference Channels: Sum-Capacity…

The problem of resource allocation is studied for two-sender two-receiver fading Gaussian interference channels (IFCs) and compound multiaccess channels (C-MACs). The senders in an IFC communicate with their own receiver (unicast) while…

A Han-Kobayashi based achievable scheme is presented for ergodic fading two-user Gaussian interference channels (IFCs) with perfect channel state information at all nodes and Gaussian codebooks with no time-sharing. Using max-min…

Sufficient conditions required to achieve the interference-free capacity region of ergodic fading K-user interference channels (IFCs) are obtained. In particular, this capacity region is shown to be achieved when every receiver decodes all…

In this paper, the ergodic sum-rate of a fading cognitive multiple access channel (C-MAC) is studied, where a secondary network (SN) with multiple secondary users (SUs) transmitting to a secondary base station (SBS) shares the spectrum band…

Fundamental capacity limits are studied for the two-user wireless ergodic fading IC with partial Channel State Information at the Transmitters (CSIT) where each transmitter is equipped with an arbitrary deterministic function of the channel…

This work studies the capacity region of a two-user ergodic interference channel with fading, where only one of the users is subject to interference from the other user, and the channel state information (CSI) is only available at the…

This paper studies the information-theoretic limits of a secondary or cognitive radio (CR) network under spectrum sharing with an existing primary radio network. In particular, the fading cognitive multiple-access channel (C-MAC) is first…

We consider a fading AWGN 2-user 2-hop network where the channel coefficients are independent and identically distributed (i.i.d.) drawn from a continuous distribution and vary over time. For a broad class of channel distributions, we…

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…

We identify the role of equal strength interference links as bottlenecks on the ergodic sum capacity of a $K$ user phase-fading interference network, i.e., an interference network where the fading process is restricted primarily to…

A two-user symmetric Gaussian Interference Channel (IC) is considered in which a noiseless unidirectional link connects one encoder to the other. Having a constant capacity, the additional link provides partial cooperation between the…

This paper is motivated by a sensor network on a correlated field where nearby sensors share information, and can thus assist rather than interfere with one another. A special class of two-user Gaussian interference channels (IFCs) is…

The two-user wireless ergodic fading Broadcast Channel (BC) with partial Channel State Information at the Transmitter (CSIT) is considered. The CSIT is given by an arbitrary deterministic function of the channel state. This characteristic…

This paper is motivated by a sensor network on a correlated field where nearby sensors share information, and can thus assist rather than interfere with one another. We consider a special class of two-user Gaussian interference channels…

A spectrum-sharing communication system where the secondary user is aware of the instantaneous channel state information (CSI) of the secondary link, but knows only the statistics and an estimated version of the secondary…

We consider the problem of finding optimal, fair and distributed power-rate strategies to achieve the sum capacity of the Gaussian multiple-access block-fading channel. In here, the transmitters have access to only their own fading…

Compute-forward multiple access (CFMA) is a transmission strategy which allows the receiver in a multiple access channel (MAC) to first decode linear combinations of the transmitted signals and then solve for individual messages. Compared…

Approximate capacity regions are established for a class of interfering multiple access channels consisting of two multiple-access channels (MACs), each with an arbitrary number of transmitters, with one transmitter in each MAC causing…

This paper develops a new communication strategy, ergodic interference alignment, for the K-user interference channel with time-varying fading. At any particular time, each receiver will see a superposition of the transmitted signals plus…

The sum capacity of a class of layered erasure one-sided interference channels is developed under the assumption of no channel state information at the transmitters. Outer bounds are presented for this model and are shown to be tight for…