Location of Repository

1 Interference Cancellation Tree Algorithms with k-Signal Memory Locations

By G. T. Peeters and B. Van Houdt

Abstract

Abstract—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. A ABC

Year: 2014
OAI identifier: oai:CiteSeerX.psu:10.1.1.413.3426
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.pats.ua.ac.be/conte... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.