点击次数：

发布时间：2019-03-11

论文类型：会议论文

发表时间：2011-12-05

收录刊物：Scopus、CPCI-S、EI

页面范围：447-451

摘要：The optimal multiuser detection (OMD) for binary Multiple-Access (MA) system can be posed as a binary quadratic programming (BQP) which belongs to a nondeter-ministic polynomial-time hard (NP-hard) problem unless the systems have some special structures. While, the OMD for PAM real-valued MA system can be posed as an integer quadratic programming (IQP) which is a problem much more difficult than BQP. Furthermore, the most generalized MA system is the M-ary complex-valued system and the OMD for this system can be posed as a complex-valued integer quadratic programming (CIQP). To the best of our knowledge, the optimal detector with polynomial complexity has never been presented for any nonorthogonal M-ary complex-valued MA system. In this paper, we focus our interests on a certain M-ary complex-valued nonorthogonal MA system with a hierarchical structure of the signature waveform set. The OMD for this system can be posed as a CIQP. By using two properties of the hierarchical signature waveform set, we propose a polynomial complexity detector which can solve this CIQP optimally.