Low-complexity receivers for multiuser detection with an unknown number of active users

被引：4

作者：

Angelosante, Daniele ^{[1
]}

Biglieri, Ezio ^{[2
]}

Lops, Marco ^{[1
]}

机构：

[1] Univ Cassino, DAEIMI, I-03043 Cassino, Italy

[2] Univ Pompeu Fabra, Dept Technologia, Barcelona, Spain

来源：

2008 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING, VOLS 1-12 | 2008年

关键词：

signal detection; complexity theory; Bayes procedures; stochastic processes;

D O I：

10.1109/ICASSP.2008.4518401

中图分类号：

O42 [声学];

学科分类号：

070206 ; 082403 ;

摘要：

In multiuser detection, the set of users active at any time may be unknown to the receiver. A two-step detection procedure, in which multiuser detection is preceded by active-user identification, is suboptimum. The optimum solution consists of detecting simultaneously the set of active users and their data, problem that can be solved exactly by applying Random-Set Theory (RST). However, implementation of optimum detectors can be limited by their complexity, which grows exponentially with the number of potential users. In this paper we illustrate how the complexity of optimum can be reduced. In particular, Sphere Detection (SD) techniques (possibly in an approximate version) are examined.

引用

页码：3481 / +

页数：2

共 8 条

[1]

ANGELOSANTE D, 2007, RECEIVERS MULT UNPUB

[2]

ANGELOSANTE D, 2007, IEEE 2007 ISIT NIC F

[3]

BIGLIERI E, 2007, IEEE T INFORM THEORY

[4]

Goodman I. R., 2013, MATH DATA FUSION, V37