...
首页> 外文期刊>IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences >Tree Search Detection Based on LLR Using M Algorithm in MC-CDMA Systems
【24h】

Tree Search Detection Based on LLR Using M Algorithm in MC-CDMA Systems

机译:MC-CDMA系统中基于M算法的LLR树搜索检测

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

In this paper, we propose a new multiuser detection scheme using Maximum Likelihood (ML) criterion and the M algorithm for Multi Carrier (MC)-Code Division Multiple Access (CDMA) systems in the down-link channel. We first describe an implementation of ML detection separating In- and Quadrature-phase components and using well-known linear filters. In the proposed algorithm, we produce hypothesis symbol vectors in a tree structure by partly changing the sub-optimum hard decisions based on the linear filter output. At each stage, we adopt the best M likely paths with respect to the true log likelihood or distance function as survivors. We determine the symbol vector which minimizes the distance function at the final stage. Although the complexity of ML detector is exponentially increasing as a function of the number of users, the proposed scheme requires by far less complexity. We demonstrate that the proposed scheme achieves equivalent Bit Error Rate (BER) performance with lower complexity in comparison with ML detector by computer simulations. Moreover we compare the proposed detection scheme with QRD-M algorithm which is based on QR decomposition combined with M algorithm.
机译:在本文中,我们针对下行链路信道中的多载波(MC)码分多址(CDMA)系统,使用最大似然(ML)准则和M算法提出了一种新的多用户检测方案。我们首先描述一种将同相和正交分量分离并使用众所周知的线性滤波器的ML检测实现。在提出的算法中,我们通过部分更改基于线性滤波器输出的次优硬决策来生成树结构中的假设符号向量。在每个阶段,相对于真实对数似然或距离函数,我们采用M条最佳路径作为幸存者。我们确定在最后阶段最小化距离函数的符号向量。尽管ML检测器的复杂度随用户数量呈指数增长,但提出的方案所需的复杂度要低得多。通过计算机仿真,我们证明了该方案与ML检测器相比具有较低的复杂度,可实现等效的误码率(BER)性能。此外,我们将提出的检测方案与基于QR分解和M算法的QRD-M算法进行了比较。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号