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

Generalized time sharing: a low-complexity capacity-achieving multiple-access technique

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

1 Author(s)
Rimoldi, B. ; Mobile Commun. Lab., Swiss Federal Inst. of Technol., Lausanne, Switzerland

It is shown that the encoding/decoding problem for any asynchronous M-user memoryless multiple-access channel (MAC) can be reduced to corresponding problems for at most 2M-1 single-user memoryless channels. This is done via a method called generalized time sharing that is closely related to a previously developed method called rate-splitting multiple access. These methods reduce the seemingly hard task of finding good multiple-access codes and implementable decoders for such codes to the much better understood task of finding codes and decoders for single-user channels. As a by-product, some interesting properties of the capacity region of M-user asynchronous discrete memoryless channels are derived

Published in:

Information Theory, IEEE Transactions on  (Volume:47 ,  Issue: 6 )

Date of Publication:

Sep 2001

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.