Interference Cancellation Tree Algorithms with k-Signal Memory Locations
G. T. Peeters, Benny Van Houdt · IEEE Transactions on Communications · 2010
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.