A survey of multi-way channels in information theory: 1961-1976

Meulen, E. van der

doi:10.1109/tit.1977.1055652

Cited by 251 publications

(118 citation statements)

References 53 publications

Supporting

Mentioning

113

Contrasting

Unclassified

Order By: Relevance

“…As in Appendix D-A, we may assume without loss of generality that ρ in (12) is given by (3). With this choice, (46) becomes (recalling P 1 = P 2 ),…”

Section: B the Upper Boundmentioning

confidence: 99%

On Maximizing Coverage in Gaussian Relay Networks

Aggarwal

Bennatan

Calderbank

2007

2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks

View full text Add to dashboard Cite

Abstract-Results for Gaussian relay channels typically focus on maximizing transmission rates for given locations of the source, relay and destination. We introduce an alternative perspective, where the objective is maximizing coverage for a given rate. The new objective captures the problem of how to deploy relays to provide a given level of service to a particular geographic area, where the relay locations become a design parameter that can be optimized. We evaluate the decode and forward (DF) and compress and forward (CF) strategies for the relay channel with respect to the new objective of maximizing coverage. When the objective is maximizing rate, different locations of the destination favor different strategies. When the objective is coverage for a given rate, and the relay is able to decode, DF is uniformly superior in that it provides coverage at any point served by CF. When the channel model is modified to include random fading, we show that the monotone ordering of coverage regions is not always maintained. While the coverage provided by DF is sensitive to changes in the location of the relay and the path loss exponent, CF exhibits a more graceful degradation with respect to such changes. The techniques used to approximate coverage regions are new and may be of independent interest.

show abstract

“…As in Appendix D-A, we may assume without loss of generality that ρ in (12) is given by (3). With this choice, (46) becomes (recalling P 1 = P 2 ),…”

Section: B the Upper Boundmentioning

confidence: 99%

On Maximizing Coverage in Gaussian Relay Networks

Aggarwal

Bennatan

Calderbank

2007

2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks

View full text Add to dashboard Cite

show abstract

“…Multiway communication was investigated in [7] as early as in 1977, where the achievable rate region was studied. Recently, multi-way communication has been suggested to be implemented with the aid of relays, forming the multiway relay communication [2][3][4][5][6].…”

Section: Introductionmentioning

confidence: 99%

Performance of Multiway Relay DS-CDMA Systems over Nakagami-m Fading Channels

Shi

Yang

2011

2011 IEEE 73rd Vehicular Technology Conference (VTC Spring)

View full text Add to dashboard Cite

Abstract-A multiway relay direct-sequence code-division multiple-access (MR-DS-CDMA) system is proposed for exchanging information among a group of distributed mobile terminals (MTs). In order to implement information exchange, a MT having similar distances from the other MTs is chosen to act as a relay, which assists the whole group of MTs to achieve their information exchange within two time-slots. In our proposed MR-DS-CDMA system, the relay is operated in detection-and-forward (DF) relaying strategy. Signals at the relay and the MTs are detected in the principles of minimum mean-square error multiuser detection (MMSE-MUD) or of the receiver multiuser diversity assisted multi-stage MMSE MUD (RMD/MS-MMSE MUD). The error performance of the MR-DS-CDMA is investigated, when communicating over Nakagami-m fading channels. Our studies show that the MR-DS-CDMA employing the RMD/MS-MMSE MUD at both the relay and MTs constitutes a high-efficiency information exchange system. It has low delay, promising error performance and low-complexity. Furthermore, it is robust to system overloading, where the number of MTs supported is higher than the spreading factor of the DS-CDMA system.

show abstract

“…Yet, serious design challenges exist for wireless ad hoc networks including effectively combating the impairments of the wireless channel. Relay assisted communications, where intermediate nodes help forward traffic from source nodes to their destinations, exploits spatial diversity without needing to deploy physical antenna arrays [3]- [12]. Relay assistance also mitigates the effects of path loss, provides the source nodes with extended battery life [7]- [10], and helps extending coverage [10], [13], [14].…”

Section: Introductionmentioning

confidence: 99%

“…Results related to the capacity of the full duplex relay channel go back to [3], [4]. Since it is difficult to have the nodes transmit and receive simultaneously in the same frequency, much of the recent research effort is towards investigating orthogonal relay transmission schemes where the source and relay nodes transmit in orthogonal channels [5], [7]- [10], [12].…”

Section: Introductionmentioning

confidence: 99%

Power Allocation and Hybrid Relaying Strategies for F/TDMA Ad Hoc Networks

Serbetli

Yener

2006

2006 IEEE International Conference on Communications

View full text Add to dashboard Cite

Abstract-In this paper, we study the power allocation problem at the relay nodes for two-hop F/TDMA networks with multiple sources and destinations. Each relay node is assumed to be capable of assisting multiple source nodes and of selecting one of regenerative decode-and-forward (RDF), nonregenerative decode-and-forward (NDF), amplify-and-forward (AF) and compress-and-forward (CF) relaying strategies to assist each source node. Considering the sum capacity as the performance metric, we solve the problem of optimally allocating the total power of each relay node between the transmissions it is assisting. We first obtain the optimum power allocation policies for the relay nodes when the relaying strategies of all source nodes are given. Next, to obtain higher sum capacities, we investigate the optimum power allocation problem jointly with relaying strategy selection. We observe that optimum power allocation with the appropriate hybrid relaying strategies provides higher sum capacity than pure RDF, NDF, AF or CF relaying strategies.

show abstract

A survey of multi-way channels in information theory: 1961-1976

Cited by 251 publications

References 53 publications

On Maximizing Coverage in Gaussian Relay Networks

On Maximizing Coverage in Gaussian Relay Networks

Performance of Multiway Relay DS-CDMA Systems over Nakagami-m Fading Channels

Power Allocation and Hybrid Relaying Strategies for F/TDMA Ad Hoc Networks

Contact Info

Product

Resources

About