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

Analog network coding in the generalized high-SNR regime

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)
Binyue Liu ; State Key Lab. of ISN, Xidian Univ., Xian, China ; Ning Cai

In a recent paper [4], Maríc et al. analyzed the performance of the analog network coding (ANC) in a layered relay network for the high-SNR regime. They have proved that under the ANC scheme, if each relay transmits the received signals at the upper bound of the power constraint, the transmission rate will approach the network capacity. In this paper, we consider a more general scenario defined as the generalized high-SNR regime, where the relays at layer l in a layered relay network with L layers do not satisfy the high-SNR conditions, and then determine an ANC relay scheme in such network. By relating the received SNR at the nodes with the propagated noise, we derive the rate achievable by the ANC scheme proposed in this paper. The result shows that the achievable ANC rate approaches the upper bound of the ANC capacity as the received powers at relays in high SNR increase. A comparison of the two ANC schemes implies that the scheme proposed in [4] may not always be the optimal one in the generalized high-SNR regime. The result also demonstrates that the upper and lower bounds of the ANC rate coincide in the limit as the number of relays at layer L-1 dissatisfying the high-SNR conditions tends to infinity (to be infinite), yielding an asymptotic capacity result.

Published in:

Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on

Date of Conference:

July 31 2011-Aug. 5 2011

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.