By Topic

Analog network coding mappings for the Gaussian multiple-access relay channel

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Sha Yao ; School of Electrical Engineering and ACCESS Linnaeus Center, Royal Institute of Technology, 100 44 Stockholm, Sweden ; Mikael Skoglund

We consider the multiple-access relay channel with two source nodes, one relay node and one destination node. For practical simplicity, we consider orthogonal transmission of the source messages and half-duplex relaying. Further, we assume that the relay is memoryless and is implemented based on a two-to-one deterministic mapping. Essentially the proposed mappings combine the two incoming analog signals and forward them to the destination, thus we term them analog network coding mappings. We investigate both linear and non-linear mappings. In particular, we propose to use mappings based on the Archimedean spiral for analog non-linear combining. In addition, we also propose to couple spiral mappings with sawtooth-like mappings to exploit the potential side information provided by the direct links. We investigate the resulting achievable rate regions and sum rates, and demonstrate significant gains.

Published in:

2009 IEEE International Symposium on Information Theory

Date of Conference:

June 28 2009-July 3 2009