Referenced Items are not available for this document.
Recently, tree algorithms have been combined with successive interference cancellation to achieve a substantially higher maximum stable throughput (MST). All previous work assumed either a single or an unbounded number of signal memory locations, with MSTs of 0.662 and 0.693, respectively. In this paper, we address the gap between these two algorithms by designing and analyzing two novel general k-signal memory location algorithms.
Published in:
Communications, IEEE Transactions on
(Volume:58
,
Issue:
11
)
Date of Publication: November 2010
- Page(s):
- 3056 - 3061
- ISSN :
- 0090-6778
- INSPEC Accession Number:
- 11638739
- Digital Object Identifier :
- 10.1109/TCOMM.2010.093010.090222
- Date of Publication :
- 11 October 2010
- Date of Current Version :
- 11 November 2010
- Issue Date :
- November 2010
- Sponsored by :
- IEEE Communications Society
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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
