Cart (Loading....) | Create Account
Close category search window

Analog network coding mappings in Gaussian multiple-access two-hop channels

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
$31 $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 ; ACCESS Linnaeus Center, R. Inst. of Technol., Stockholm, Sweden ; Skoglund, M.

We consider the multiple-access two-hop channel where two source nodes transmit to a destination node via a relay node. The relaying function is memoryless, in contrast to the conventional schemes based on coding with long codewords. That is, we model the operation of the relay as a two-to-one deterministic mapping, which combines the two received analog signals from the sources. This procedure resembles the concept of network coding where information combining is applied in the intermediate nodes. However, as our mapping directly combines the received analog signals without decoding, we coin the term (memoryless) analog network coding mapping. In this paper, both linear and non-linear mappings are studied. In particular, the Archimedean spiral is used for the non-linear 2:1 mapping, inspired by similar work in the context of joint source-channel coding. We discuss both the achievable rate regions and sum rates and demonstrate significant gains of applying the proposed analog mappings in the relay.

Published in:

Networking and Information Theory, 2009. ITW 2009. IEEE Information Theory Workshop on

Date of Conference:

12-10 June 2009

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.