English

应用科学学报 ›› 2007, Vol. 25 ›› Issue (1): 16-20.

• 论文 • 上一篇    下一篇

非同步CDMA系统的低复杂度迭代多用户检测算法

梅中辉, 殷玮玮, 吴乐南   

  1. 东南大学无线电系, 江苏南京 210096
  • 收稿日期:2005-10-08 修回日期:2005-12-19 出版日期:2007-01-31 发布日期:2007-01-31
  • 作者简介:梅中辉,博士生,研究方向:无线通信中低复杂度迭代检测技术、LDPC码技术,E-mail:mei-hui@sohu.com;吴乐南,教授,博导,研究方向:多媒体信号处理技术等,E-mail:wuln@seu.edu.cn
  • 基金资助:

    国家自然科学基金资助项目(60472054)

Low-Complexity Iterative Multiuser Detection Algorithm for Asynchronous CDMA Systems

MEI Zhong-hui, YIN Wei-wei, WU Le-nan   

  1. Department of Radio Engineering, Southeast University, Nanjing 210096, China
  • Received:2005-10-08 Revised:2005-12-19 Online:2007-01-31 Published:2007-01-31

PDF

110

摘要：

研究了基于非同步CDMA系统的低复杂度迭代多用户检测算法,给出了并行‘软’干扰消除随机数据联合(P-SC-PDA)和串行‘软’干扰消除随机数据联合(S-SC-PDA)两种算法,它们的计算复杂度均为o(K3)(K表示用户数).计算机仿真结果显示S-SC-PDA算法的性能明显优于P-SC-PDA算法.如果利用S-SC-PDA算法对被检测用户进行排序检测(根据译码器提供的信息先检测具有较高检测可靠度的用户,然后检测具有较低检测可靠度的用户),则系统的性能能进一步提高.

关键词: 随机数据联合算法, 迭代多用户检测算法, 低密度奇偶校验码

Abstract:

This paper presents two low-complexity iterative multiuser algorithms:parallel soft cancellation probabilistic data association (P-SC-PDA) and successive soft cancellation probabilistic data association (S-SC-PDA) for asynchronous CDMA systems.The computational complexity of the proposed algorithms is just o(K3) where K is the number of active users.Simulation results show that performance of the S-SC-PDA algorithm is significantly better than P-SC-PDA.With information delivered by the decoder, if the user signals to be detected is arranged such that signals of users with high detection reliabilities are detected first, and those with low detection reliabilities are detected later, even better performance can be obtained with S-SC-PDA.

Key words: iterative multiuser detection algorithm, probabilistic data association (PDA), low-density parity check codes (LDPC)

中图分类号: