ﻻ يوجد ملخص باللغة العربية
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 characterize the ergodic sum capacity to within a constant number of bits/sec/Hz, independent of signal-to-noise ratio. The achievability follows from the analysis of an interference neutralization scheme where the relays are partitioned into $M$ pairs, and interference is neutralized separately by each pair of relays. When $M=1$, the proposed ergodic interference neutralization characterizes the ergodic sum capacity to within $4$ bits/sec/Hz for i.i.d. uniform phase fading and approximately $4.7$ bits/sec/Hz for i.i.d. Rayleigh fading. We further show that this gap can be tightened to $4log pi-4$ bits/sec/Hz (approximately $2.6$) for i.i.d. uniform phase fading and $4-4log( frac{3pi}{8})$ bits/sec/Hz (approximately $3.1$) for i.i.d. Rayleigh fading in the limit of large $M$.
This paper presents an analytical characterization of the ergodic capacity of amplify-and-forward (AF) MIMO dual-hop relay channels, assuming that the channel state information is available at the destination terminal only. In contrast to prior resul
A class of diamond networks are studied where the broadcast component is modelled by two independent bit-pipes. New upper and low bounds are derived on the capacity which improve previous bounds. The upper bound is in the form of a max-min problem, w
In this paper, we investigate upper and lower bounds on the capacity of two-user fading broadcast channels where one of the users has a constant (non-fading) channel. We use the Costa entropy power inequality (EPI) along with an optimization framewor
Discrete-time Rayleigh fading single-input single-output (SISO) and multiple-input multiple-output (MIMO) channels are considered, with no channel state information at the transmitter or the receiver. The fading is assumed to be stationary and correl
The fading broadcast channel with confidential messages (BCC) is investigated, where a source node has common information for two receivers (receivers 1 and 2), and has confidential information intended only for receiver 1. The confidential informati