15 citations · 37 across the 14 of their papers we have counts for
15 papers
Capacity Limits of Full-Duplex Cellular Network
Kaiming Shen, Reza K. Farsani, Wei Yu
This paper aims to characterize the capacity limits of a wireless cellular network with a full-duplex (FD) base-station (BS) and half-duplex user terminals, in which three independ…
Novel Techniques to Derive Capacity Results for Multi-User Interference Channels
Reza K. Farsani, Amir K. Khandani
The Interference Channels (ICs) represent fundamental building blocks of wireless communication networks. Despite considerable progress in network information theory, available cap…
On the Capacity Region of the Two-User Interference Channel
Reza K. Farsani
One of the key open problems in network information theory is to obtain the capacity region for the two-user Interference Channel (IC). In this paper, new results are derived for t…
How Much Rate Splitting Is Required for a Random Coding Scheme? A new Achievable Rate Region for the Broadcast Channel with Cognitive Relays
Reza K. Farsani
In this paper, it is shown that for any given single-hop communication network with two receivers, splitting messages into more than two sub-messages in a random coding scheme is r…
The K-User Interference Channel: Strong Interference Regime
Reza K. Farsani
This paper gives a solution to one of the long-standing open problems in network information theory: "What is the generalization of the strong interference regime to the K-user int…
Fundamental Limits of Communications in Interference Networks-Part IV: Networks with a Sequence of Less-Noisy Receivers
Reza K. Farsani
In this fourth part of our multi-part papers, classes of interference networks with a sequence of less-noisy receivers are identified for which a successive decoding scheme achieve…
Fundamental Limits of Communications in Interference Networks-Part III: Information Flow in Strong Interference Regime
Reza K. Farsani
This third part of the paper is related to the study of information flow in networks with strong interference. First, the two-receiver networks are considered. A unified outer boun…
Fundamental Limits of Communications in Interference Networks-Part II: Information Flow in Degraded Networks
Reza K. Farsani
In this second part of our multi-part papers, the information flow in degraded interference networks is studied. A full characterization of the sum-rate capacity for the degraded n…
Fundamental Limits of Communications in Interference Networks-Part I: Basic Structures
Reza K. Farsani
In these series of multi-part papers, a systematic study of fundamental limits of communications in interference networks is established. Here, interference network is referred to…
Interference Networks with General Message Sets: A Random Coding Scheme
Reza K. Farsani, Farokh Marvasti
In this paper, the Interference Network with General Message Sets (IN-GMS) is introduced in which several transmitters send messages to several receivers: Each subset of transmitte…
The Capacity Region of p-Transmitter/q-Receiver Multiple-Access Channels with Common Information
Ali Haghi, Reza K. Farsani, Mohammad Reza Aref +1
This paper investigates the capacity problem for some multiple-access scenarios with cooperative transmitters. First, a general Multiple-Access Channel (MAC) with common informatio…
Capacity Bounds for Multiuser Channels with Non-Causal Channel State Information at the Transmitters
Reza K. Farsani, Farokh Marvasti
In this paper, capacity inner and outer bounds are established for the multiuser channels with Channel State Information (CSI) known non-causally at the transmitters: The Multiple…
Multiple Access Channels with Cooperative Encoders and Channel State Information
Reza K. Farsani, Farokh Marvasti
The two-user Multiple Access Channel (MAC) with cooperative encoders and Channel State Information (CSI) is considered where two different scenarios are investigated: A two-user MA…
Two-Way Writing on Dirty Paper
Reza K. Farsani
In this paper, the Two-Way Channel (TWC) with Cannel State Information (CSI) is investigated. First, an achievable rate region is derived for the discrete memoryless channel. Then…
Achievable Rate Regions for Dirty Tape Channels and "Joint Writing on Dirty Paper and Dirty Tape"
Reza K. Farsani, Bahareh Akhbari, Mohammad Reza Aref
We consider the Gaussian Dirty Tape Channel (DTC) Y=X+S+Z, where S is an additive Gaussian interference known causally to the transmitter. The general expression [max]\_top(P_U,f(.…