Hash-and-Forward Relaying for Two-Way Relay Channel

Details Hash-and-Forward Relaying for Two-Way Relay Channel Hash-and-Forward Relaying for Two-Way Relay Channel

2011-02-15

arxiv.org/abs/1102.3082v2

Computer Science

Information Theory

5 pages, 2 figures, submitted to the IEEE ISIT'11 conference

Scientific paper

This paper considers a communication network comprised of two nodes, which have no mutual direct communication links, communicating two-way with the aid of a common relay node (RN), also known as separated two-way relay (TWR) channel. We first recall a cut-set outer bound for the set of rates in the context of this network topology assuming full-duplex transmission capabilities. Then, we derive a new achievable rate region based on hash-and-forward (HF) relaying where the RN does not attempt to decode but instead hashes its received signal, and show that under certain channel conditions it coincides with Shannon's inner-bound for the two-way channel [1]. Moreover, for binary adder TWR channel with additive noise at the nodes and the RN we provide a detailed capacity achieving coding scheme based on structure codes.

Affiliated with

Also associated with

No associations

Rating

Hash-and-Forward Relaying for Two-Way Relay Channel 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 Hash-and-Forward Relaying for Two-Way Relay Channel, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hash-and-Forward Relaying for Two-Way Relay Channel will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-378509