#### DMCA

## Capacity theorems for the multiple-access relay channel (2004)

Venue: | In Allerton Conference on Communications, Control and Computing |

Citations: | 51 - 3 self |

### Citations

12425 | Elements of Information Theory - Cover, Thomas - 1991 |

2009 | Cooperative diversity in wireless networks: Efficient protocols and outage behavior - Laneman, Tse, et al. - 2004 |

1194 |
Gamal, “Capacity theorems for the relay channel
- Cover, El
- 1979
(Show Context)
Citation Context ... networks by applying and extending several known results from network information theory. The classic single-source relay network was introduced and studied by van der Meulen [2]. Cover and El Gamal =-=[3]-=- developed two fundamental coding strategies for the relay channel and obtained the capacity for the physically degraded case. Recently, there has been an increased focus on networks with one or more ... |

1059 | The rate–distortion function for source coding with side information at the decoder
- Wyner, Ziv
- 1976
(Show Context)
Citation Context ...essages, the relay can also aid the destination by forwarding a compressed version of its received signal [3, theorem 6]. The resulting compress-and-forward (CF) strategy [8] employs Wyner-Ziv coding =-=[15]-=- to exploit the correlation between YM+1 and ¶s.6 .6 S1 d31 d41=1 d31=d32=d d (0,0) Relay Destination S1 ,S2 : (0,0) Relay Destination d42=1 d41=d42=1 S2 d32 Case 1 Case 2 Figure 2: Two geometries for... |

738 | Cooperative strategies and capacity theorems for relay networks
- Kramer, Gastpar, et al.
- 2005
(Show Context)
Citation Context ...hite Gaussian MARC is presented in [1] by extending the code construction in [3, theorem 5] to multiple sources. The strategy, called decode-and-forward, is extended to the d.m. MARC in [6] (see also =-=[8]-=-) using a combination of regular Markov encoding at the sources and relay and backward decoding [14] at the destination. The resulting rate region is the set of M-tuples (R1,R2,...,RM) that, for all G... |

309 |
der Meulen, “Three-terminal communication channels
- van
- 1971
(Show Context)
Citation Context ...2; Y4)+H(X2|V2) − H(X2|Y4,X1,V1,V2) (18) = I(V2; Y4)+I(X2; Y4|X1,V1,V2,X3) (19) where (19) results from the Markov relationship X2 → V2 → X3 and independence of sources. Thus, for the offset order π ==-=[1, 2]-=-, we obtain a corner point where the first source in the offset order is decoded after the second and achieves its maximum rate. For π =[2, 1], we similarly obtain the corner point where source 2 is d... |

72 |
Informationtheoretical Results for the Discrete Memoryless Multiple Access Channel
- Willems
- 1982
(Show Context)
Citation Context ...iple sources. The strategy, called decode-and-forward, is extended to the d.m. MARC in [6] (see also [8]) using a combination of regular Markov encoding at the sources and relay and backward decoding =-=[14]-=- at the destination. The resulting rate region is the set of M-tuples (R1,R2,...,RM) that, for all G ⊆ S,satisfy X ¶ Rm ≤ min m∈G for an input distribution µ I(X(G); YM+1|X(G c ), V(S),XM+1), I(X(G),X... |

58 | Capacity Theorems for Wireless Relay Channels
- Kramer, Gastpar, et al.
- 2003
(Show Context)
Citation Context ...k ∈ [1, 3]. The parameter hjki is the fading experienced by the kth transmit signal at the jth receiver in the ith symbol and is assumed known only at the jth receiver. In this analysis, analogous to =-=[5]-=-, we consider two kinds of fading channels: .q 1. constant fading hjki =1 d γ jk ∀i ∈ [1,n] where djk is the distance between the jth receiver and the kth transmitter and γ is the path-loss exponent. ... |

58 | On the capacity of ‘cheap’ relay networks - Khojastepour, Sabharwal, et al. - 2003 |

53 |
Feedback can at most double Gaussian multiple access channel capacity
- Thomas
- 1987
(Show Context)
Citation Context ... strategies and the outer bound are plotted in Fig. 3 for both cases. The outer bounds for the G-MARC result from ignoring the entropy bounds in theorem 1 and using an entropy maximization theorem in =-=[17]-=- to set the auxiliary r.v.’s as Gaussian. The plots also include the optimal fraction β1 = β2 = β, with the two fractions taking the same value β for the symmetric geometry considered in case 1 and 2 ... |

21 |
New outer bounds to capacity regions of two-way channels
- Zhang, Berger, et al.
- 1986
(Show Context)
Citation Context ...G)i|X(G n c )i, V(Gc )i,XM+1,i) (5) Similarly, we have X Rm ≤ 1 n i=1 nX I(YM+2,i; X(G)i,XM+1,i|X(G c )i, V(G c )i) (6) m∈G i=1 Lastly, we quantify the dependence of Xmi on Vmi in a manner similar to =-=[13]-=- as Rm ≤ 1 n nX H(Xm,i|Vm,i) (7) i=1 The joint distribution of therandomvariables(r.v.’s)Xi,Vi, Yi,andXM+1,i canthenbewritten as µ MQ ¶ p(Xi, Vi,XM+1,i, Yi) = p(Vmi)p(Xmi|Vmi) · p(XM+1,i|Vi)p(Yi|Xi,XM... |

14 |
Hierarchical sensor networks: Capacity theorems and cooperative strategies using the multiple-access relay channel model
- Sankaranarayanan, Kramer, et al.
- 2004
(Show Context)
Citation Context ...ment of any such network lies in its ability to support multiple users simultaneously and not only one. We consider here the MARC model as a specific multi-user relay network. The paper [1] (see also =-=[11]-=-) presents an outer bound on the capacity of the MARC using cut-sets. The paper alsopresentsanachievablerateregionforthe Gaussian MARC that is extended in [6] using block Markov encoding and backward ... |

11 |
Gaussian multiple-access channels with intersymbol interference: Capacity region and multiuser water-filling
- Cheng, Verdú
- 1993
(Show Context)
Citation Context ...E(|XM+1,i| 2 ) ± n ≤ PM+1 . This results in a multipleaccess intersymbol-interference (ISI) channel at the destination, the rate region for which is given by the multi-user water-filling algorithm in =-=[16]-=-. The rates for the three strategies and the outer bound are plotted in Fig. 3 for both cases. The outer bounds for the G-MARC result from ignoring the entropy bounds in theorem 1 and using an entropy... |

8 |
On the white Gaussian multipleacess relay channel
- Kramer, Wijngaarden
- 2000
(Show Context)
Citation Context ... also presented. 1 Introduction The multiple-access relay channel (MARC) is a model for network topologies where multiple sources communicate with a single destination in the presence of a relay node =-=[1]-=-. Examples of such networks include hybrid wireless LAN/WAN networks and sensor and ad hoc networks where cooperation between the nodes is either undesirable or not possible, but one can use an interm... |