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

Multihop Analog Network Coding via Amplify-and-Forward: The 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

3 Author(s)
Maric, I. ; Dept. of Electr. Eng., Stanford Univ., Stanford, CA, USA ; Goldsmith, A. ; Medard, M.

In the simplest relaying strategy, a network node amplifies and forwards a received signal over a wireless channel. Multihop amplify-and-forward allows for a (noisy) linear combination of signals simultaneously sent from multiple sources to be propagated through the network over multiple layers of relays. The performance of multihop amplify-and-forward is limited by noise propagated to the destination over multiple hops, and we expect this strategy to perform well only in high SNR. In this paper, this intuition is formalized and high-SNR conditions under which multihop amplify-and-forward approaches capacity in a layered relay network are determined. By relating the received signal power and the received power of the propagated noise at the nodes, the rate achievable with multihop amplify-and-forward is determined. In particular, when all received powers are lower bounded by 1/δ, the noise power propagated to the destination over L layers is of the order Lδ. The result demonstrates that multihop amplify-and-forward approaches the cut-set bound as received powers at relays increase. As all powers in the network increase at the same rate, the multihop amplify-and-forward rate and the upper bound are within a gap that is independent of channel gains. This gap grows linearly with the number of nodes.

Published in:

Information Theory, IEEE Transactions on  (Volume:58 ,  Issue: 2 )

Date of Publication:

Feb. 2012

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.