Computer Science – Information Theory
Scientific paper
2010-05-11
Computer Science
Information Theory
14 pages, 7 figures, submitted to IEEE Transactions on Information Theory
Scientific paper
We study a Gaussian relay network in which multiple source--destination (S--D) pairs communicate through relays without direct links between the sources and the destinations. We observe that the time-varying nature of wireless channels or fading can be used to mitigate the interference. The proposed block Markov amplify-and-forward relaying scheme exploits such channel variations and works for a wide class of channel distributions including Rayleigh fading. We completely characterize the degrees of freedom (DoF) region of the Gaussian relay network. Specifically, the DoF region of the $K$-user $M$-hop Gaussian relay network with $K_m$ nodes in the $m^{\mbox{th}}$ layer is the set of all $(d_1,\cdots,d_K)$ such that $d_i\leq 1$ for all $i$ and $\sum_{i=1}^K d_i\leq \min\{K_1,\cdots,K_{M+1}\}$, where $d_i$ is the DoF of the $i^{\mbox{th}}$ S--D pair and $K=K_1=K_{M+1}$ is the number of S--D pairs. We further characterize the DoF region of the Gaussian relay network with multi-antenna nodes and general message sets. The resulting DoF regions coincide with the DoF regions assuming perfect cooperation between the relays in each layer.
Chung Sae-Young
Jafar Syed A.
Jeon Sang-Woon
No associations
LandOfFree
Approximate Capacity of a Class of Multi-source Gaussian Relay Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Approximate Capacity of a Class of Multi-source Gaussian Relay Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximate Capacity of a Class of Multi-source Gaussian Relay Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-383457