Title
Interference cancellation tree algorithms with k-signal memory locationsInterference cancellation tree algorithms with k-signal memory locations
Author
Faculty/Department
Faculty of Sciences. Mathematics and Computer Science
Research group
Modeling Of Systems and Internet Communication (MOSAIC)
Publication type
article
Publication
New York, N.Y.,
Subject
Mathematics
Source (journal)
IEEE transactions on communications. - New York, N.Y.
Volume/pages
58(2010):11, p. 3056-3061
ISSN
0090-6778
ISI
000284222600004
Carrier
E
Target language
English (eng)
Full text (Publishers DOI)
Affiliation
University of Antwerp
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.
Full text (open access)
https://repository.uantwerpen.be/docman/irua/1eb141/4460.pdf
E-info
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000284222600004&DestLinkType=RelatedRecords&DestApp=ALL_WOS&UsrCustomerID=ef845e08c439e550330acc77c7d2d848
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000284222600004&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=ef845e08c439e550330acc77c7d2d848
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000284222600004&DestLinkType=CitingArticles&DestApp=ALL_WOS&UsrCustomerID=ef845e08c439e550330acc77c7d2d848
Handle