|
Title
|
|
|
|
Interference cancellation tree algorithms with k-signal memory locations
|
|
|
Author
|
|
|
|
|
|
|
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. |
|
|
|
Language
|
|
|
|
English
|
|
|
Source (journal)
|
|
|
|
IEEE transactions on communications. - New York, N.Y., 1972, currens
|
|
|
Publication
|
|
|
|
New York, N.Y.
:
Institute of Electrical and Electronics Engineers
,
2010
|
|
|
ISSN
|
|
|
|
0090-6778
[print]
1558-0857
[online]
|
|
|
DOI
|
|
|
|
10.1109/TCOMM.2010.093010.090222
|
|
|
Volume/pages
|
|
|
|
58
:11
(2010)
, p. 3056-3061
|
|
|
ISI
|
|
|
|
000284222600004
|
|
|
Full text (Publisher's DOI)
|
|
|
|
|
|
|
Full text (open access)
|
|
|
|
|
|