DocumentCode
1347241
Title
Interference Cancellation Tree Algorithms with k-Signal Memory Locations
Author
Peeters, G.T. ; Van Houdt, Benny
Author_Institution
IBBT, Univ. of Antwerp, Antwerp, Belgium
Volume
58
Issue
11
fYear
2010
fDate
11/1/2010 12:00:00 AM
Firstpage
3056
Lastpage
3061
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.
Keywords
interference suppression; trees (mathematics); general k-signal memory location algorithms; interference cancellation tree algorithms; maximum stable throughput; signal memory locations; Algorithm design and analysis; Interference cancellation; Logic gates; Memory management; Radiation detectors; Signal resolution; Throughput; Multiple access; maximum stable throughput; signal interference cancellation; tree algorithms;
fLanguage
English
Journal_Title
Communications, IEEE Transactions on
Publisher
ieee
ISSN
0090-6778
Type
jour
DOI
10.1109/TCOMM.2010.093010.090222
Filename
5599262
Link To Document