利用扩频序列的相关特性降低多用户检测的复杂度
首发时间:2009-11-09
摘要:本文提出了一种在多径衰落信道条件下的基于用户分组和信号分类的降低多用户检测算法复杂度的方法。采用具有特殊相关特性的组间互补码构成扩频序列,扩频序列的相关矩阵结构规则而稀疏。系统中,用这些扩频序列标识的全体用户被划分成多个互不干扰的用户组,并且同组用户的多径信号副本被进一步划分成多个互不干扰的信号子类,多用户检测独立地在各个用户组或是信号子类内进行,从而使多用户检测的复杂度大幅下降。当前已有的各种多用户检测算法都可以通过该途径来降低算法的复杂度。我们以最优多用户检测及多级多用户检测算法为例加以说明,其中,前者能利用用户的分组特性,而后者可同时利用用户的分组和信号副本的分类特性。分析和仿真结果表明,在系统处于低、中和重负载情况下,采用本文提出的低复杂度MUD的系统的误码性能都相近或优于采用gold码扩频和传统多用户检测算法的系统,且复杂度大幅降低。
关键词: CDMA 多用户检测 组间互补码 复杂度降低 信号检测
For information in English, please click here
Complexity Reduction of Multi-user Detection by Exploring Correlation Characteristics of Spreading Sequences
Abstract:In this paper, we propose an approach to reduce the multi-user detection (MUD) complexity based on user grouping and signal replica classification by exploiting the correlation characteristics of spreading sequences in multipath fading channels. The spreading sequences are constructed from inter-group complementary codes with a sparse and regular correlation matrix and inherit its attractive auto/cross-correlation properties. Users are first partitioned into independent user groups according to whether or not there is interference among them, and then the replicas of user signals from the same user group are further classified into independent replica classes. The MUD is carried out within each low-dimensional user group or replica class, respectively, reducing the MUD complexity substantially. This approach can be applied to most of the existing MUD algorithms for complexity reduction, and in this paper optimal MUD and multi-stage MUD are exemplified. The analytical and simulated results demonstrate that this approach can reduce the MUD complexity significantly under any load conditions without performance loss.
Keywords: CDMA Multiuser Detection Inter-group complementary code Complexity reduction Signal Detection
论文图表:
引用
No.3652694111125775****
同行评议
共计0人参与
勘误表
利用扩频序列的相关特性降低多用户检测的复杂度
评论
全部评论