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

Cancelling known interference in multiple access 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

4 Author(s)
Philosof, T. ; Dept. of EE - Syst., Tel-Aviv Univ., Tel-Aviv, Israel ; Zamir, R. ; Erez, U. ; Khisti, A.

We study two generalizations of the writing on dirty paper problem. The first scenario is the cross interference multiple access channel, where each user knows the interference that accompanies the transmission of the other user. In the second scenario we consider a two-user multiple access chancel with a common interference known to both transmitters. For the first scenario, we provide new inner and outer bounds for the capacity region. While the capacity region for the second problem was previously known, we provide a constructive coding scheme which attains it.

Published in:

Electrical and Electronics Engineers in Israel, 2008. IEEEI 2008. IEEE 25th Convention of

Date of Conference:

3-5 Dec. 2008

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.