A half-duplex cooperative scheme with partial decode-forward relaying

@article{Haija2011AHC,
  title={A half-duplex cooperative scheme with partial decode-forward relaying},
  author={Ahmad Abu Al Haija and Mai H. Vu},
  journal={2011 IEEE International Symposium on Information Theory Proceedings},
  year={2011},
  pages={1886-1890}
}
  • Ahmad Abu Al HaijaM. Vu
  • Published 2 June 2011
  • Computer Science
  • 2011 IEEE International Symposium on Information Theory Proceedings
In this paper, we present a new cooperative communication scheme consisting of two users in half-duplex mode communicating with one destination over a discrete memoryless channel. The users encode messages in independent blocks and divide the transmission of each block into 3 time slots with variable durations. Cooperation is performed by partial decode-forward relaying over these 3 time slots. During the first two time slots, each user alternatively transmits and decodes, while during the last… 

Figures and Tables from this paper

Throughput-Optimal Half-Duplex Cooperative Scheme with Partial Decode-Forward Relaying

A cooperative communication system consisting of two users in half duplex mode communicating with one destination over additive white Gaussian noise shows significant improvement of the rates when the inter-user channel quality is better than that between each user and the destination.

Achievable Rates and Outer Bound for the Half-Duplex MAC with Generalized Feedback

Numerical results for the Gaussian channel shows significant rate region improvement over the classical MAC and that the outer bound becomes increasingly tight as the inter-user link quality increases.

Rate Maximization for Half-Duplex Multiple Access with Cooperating Transmitters

Results show that as the inter-user link qualities increase, the optimal scheme moves from no cooperation to partial then to full cooperation, in which the users fully exchange their information and cooperatively send it to the destination.

Joint typicality analysis for half-duplex cooperative communication

This work proposes a half-duplex cooperative scheme for a discrete memoryless channel (DMC) consisting of two users communicating with one destination that uses joint typicality instead of maximum likelihood (ML) decoding to derive the rate region.

Outage analysis for half-duplex partial decode-forward relaying over fading channels

It is shown that PDF relaying achieves the full diversity order of 2 at high SNR and the advantage of the considered PDF scheme, with coherent transmission and joint decoding at the destination, over the existing DF and PDF schemes is shown.

Spectral Efficiency and Outage Performance for Hybrid D2D-Infrastructure Uplink Cooperation

A time-division uplink transmission scheme that is applicable to future-generation cellular systems by introducing hybrid device-to-device (D2D) and infrastructure cooperation significantly reduces outage probabilities and achieves the full diversity order despite additional outages at the UEs.

Efficient use of joint source-destination cooperation in the Gaussian multiple access channel

The condition on channel and power parameters such that involving destination cooperation is strictly better than just having source cooperation is analyzed, which provides guideline for practical systems such as cellular networks in determining when it is beneficial for the base station to cooperate with mobile users in the uplink communication.

Uplink User-Assisted Relaying in Cellular Networks

It is shown that user-assisted relaying can significantly improve per-user transmission rate despite of increased intercell interference, and this transmission rate gain is significant for active users near the cell edge and further increases with higher idle user density, supporting user- assisted relaying as a viable solution to crowded population areas.

Uplink User-Assisted Relaying Deployment in Cellular Networks

It is shown that user-assisted relaying can significantly improve per-user transmission rate despite of increased inter-cell interference, and is supported as a viable solution to crowded population areas.

Outage Analysis for Coherent Decode-Forward Relaying Over Rayleigh Fading Channels

This work analyzes the outage performance of coherent partial decode-forward (pDF) relaying over Rayleigh fading channels in both half- and full-duplex transmissions to provide a fundamental understanding of the reliability of coherent pDF relaying.

References

SHOWING 1-10 OF 13 REFERENCES

Throughput-Optimal Half-Duplex Cooperative Scheme with Partial Decode-Forward Relaying

A cooperative communication system consisting of two users in half duplex mode communicating with one destination over additive white Gaussian noise shows significant improvement of the rates when the inter-user channel quality is better than that between each user and the destination.

Capacity bounds of half-duplex gaussian cooperative interference channel

  • Yong PengD. Rajan
  • Computer Science
    2009 IEEE International Symposium on Information Theory
  • 2009
It is shown that by using the transmitter cooperation scheme, there is significant capacity improvement compared to the previous results, and if the cooperation channel gain is infinity, both the transmitter and receiver cooperation rates achieve their respective outer bound.

Cooperative strategies and capacity theorems for relay networks

The capacity results generalize broadly, including to multiantenna transmission with Rayleigh fading, single-bounce fading, certain quasi-static fading problems, cases where partial channel knowledge is available at the transmitters, and cases where local user cooperation is permitted.

Cooperative diversity in wireless networks: Efficient protocols and outage behavior

Using distributed antennas, this work develops and analyzes low-complexity cooperative diversity protocols that combat fading induced by multipath propagation in wireless networks and develops performance characterizations in terms of outage events and associated outage probabilities, which measure robustness of the transmissions to fading.

Half-duplex relays: cooperative communication strategies and outer bounds

Find lower and upper bounds on the capacity limits on general discrete memoryless half-duplex relays following a decode-and-forward policy and for the Gaussian case, the achievable region obtained employs a dirty-paper precoding strategy.

A coding theorem for multiple access channels with correlated sources

This paper shows that e, which depends only on the channel, is convex and gives formulas to determine it exactly and is the natural generalization of channel capacity to this situation.

User cooperation diversity. Part I. System description

Results show that, even though the interuser channel is noisy, cooperation leads not only to an increase in capacity for both users but also to a more robust system, where users' achievable rates are less susceptible to channel variations.

Effects of cooperation on the secrecy of multiple access channels with generalized feedback

  • E. EkremS. Ulukus
  • Computer Science
    2008 42nd Annual Conference on Information Sciences and Systems
  • 2008
It is shown that cooperation can increase the achievable secrecy region, and achievable schemes which use compress-and-forward (CAF) based transmission strategies are proposed which allow users to increase their rates up to levels which are not decodable by the cooperating partners, consequently improving the secrecy of the users.

The discrete memoryless multiple access channel with partially cooperating encoders

  • F. Willems
  • Computer Science
    IEEE Trans. Inf. Theory
  • 1983
It turns out that the optimal conference is very simple: by proving a converse and giving an achievability proof, the capacity region of the multiple access channel with partially cooperating encoders is established.

Capacity of a class of relay channels with orthogonal components

The capacity of a class of discrete-memoryless relay channels with orthogonal channels from the sender to the relay receiver and from the sender and relay to the receiver is shown to be equal to the