Related papers: Achievable Rates and Optimal Resource Allocation f…
In this paper, achievable rates and optimal resource allocation strategies for imperfectly-known fading relay channels are studied. It is assumed that communication starts with the network training phase in which the receivers estimate the…
In this paper, transmission over time-selective, flat fading relay channels is studied. It is assumed that channel fading coefficients are not known a priori. Transmission takes place in two phases: network training phase and data…
In this paper, communication over imperfectly-known fading channels with different degrees of cooperation is studied. The three-node relay channel is considered. It is assumed that communication starts with the network training phase in…
The bidirectional relay channel, in which two users communicate with each other through a relay node, is a simple but fundamental and practical network architecture. In this paper, we consider the block fading bidirectional relay channel…
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…
Motivated by fading channels and erasure channels, the problem of reliable communication over deterministic relay networks is studied, in which relay nodes receive a function of the incoming signals and a random network state. An achievable…
Despite considerable progress on the information-theoretic broadcast channel, the capacity region of fading broadcast channels with channel state known at the receivers but unknown at the transmitter remains unresolved. We address this…
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…
In a bi-directional relay channel, two nodes wish to exchange independent messages over a shared wireless half-duplex channel with the help of a relay. In this paper, we derive achievable rate regions for four new half-duplex protocols and…
The capacity of noncoherent fading relay channels is studied where all terminals are aware of the fading statistics but not of their realizations. It is shown that if the fading coefficient of the channel between the transmitter and the…
Achievable rate regions for cooperative relay broadcast channels with rate-limited feedback are proposed. Specifically, we consider two-receiver memoryless broadcast channels where each receiver sends feedback signals to the transmitter…
The use of existing network devices as relays has a potential to improve the overall network performance. In this work, we consider a two-hop wireless relay setting, where the channels between the source and relay nodes to the destination…
We consider the wireless Rayleigh fading relay channel with finite complex input constellations. Assuming global knowledge of the channel state information and perfect synchronization, upper and lower bounds on the achievable rate, for the…
The goal of this paper is to obtain a better knowledge of the achievable data rate over noncoherent Rician fading channel with time and frequency memory. We assume that the average-power as well as the peak-power of the input signal are…
We consider the problem of rate and power allocation in a multiple-access channel. Our objective is to obtain rate and power allocation policies that maximize a general concave utility function of average transmission rates on the…
In a multi-user wireless network equipped with multiple relay nodes, some relays are more intelligent than other relay nodes. The intelligent relays are able to gather channel state information, perform linear processing and forward signals…
Machine learning is used to compute achievable information rates (AIRs) for a simplified fiber channel. The approach jointly optimizes the input distribution (constellation shaping) and the auxiliary channel distribution to compute AIRs…
The problem of resource allocation is studied for a two-user fading orthogonal multiaccess relay channel (MARC) where both users (sources) communicate with a destination in the presence of a relay. A half-duplex relay is considered that…
The problem of optimal resource allocation is studied for ergodic fading orthogonal multiaccess relay channels (MARCs) in which the users (sources) communicate with a destination with the aid of a half-duplex relay that transmits on a…
We consider the problem of rate and power allocation in a fading multiple-access channel. Our objective is to obtain rate and power allocation policies that maximize a utility function defined over average transmission rates. In contrast…