首页> 外文期刊>IEEE Transactions on Communications >Fast optimal and suboptimal any-time algorithms for CDMA multiuser detection based on branch and bound
【24h】

Fast optimal and suboptimal any-time algorithms for CDMA multiuser detection based on branch and bound

机译:基于分支和边界的CDMA多用户检测的快速最优和次优任意时间算法

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

A fast optimal algorithm based on the branch-and-bound (BBD) method is proposed for the joint detection of binary symbols of K users in a synchronous code-division multiple-access channel with Gaussian noise. Relationships between the proposed algorithms (depth-first BBD and fast BBD) and both the decorrelating decision-feedback (DF) detector and sphere-decoding algorithm are clearly drawn. It turns out that decorrelating DF detector corresponds to a "one-pass" depth-first BBD; sphere decoding is, in fact, a type of depth-first BBD, but one that can be improved considerably via tight upper bounds and user ordering, as in the fast BBD. A fast "any-time" suboptimal algorithm is also available by simply picking the "current-best" solution in the BBD method. Theoretical results are given on the computational complexity and the performance of the "current-best" suboptimal solution.
机译:针对高斯噪声的同步码分多址信道中的K个用户的二进制符号联合检测问题,提出了一种基于分支定界法的快速最优算法。清楚地画出了所提出的算法(深度优先BBD和快速BBD)与去相关决策反馈(DF)检测器和球体解码算法之间的关系。事实证明,去相关DF检测器对应于“单次通过”深度优先BBD。实际上,球形解码是深度优先BBD的一种,但是可以像快速BBD那样通过严格的上限和用户排序来显着改善球形解码。通过简单地选择BBD方法中的“当前最佳”解决方案,还可以使用快速的“任何时间”次优算法。给出了关于计算复杂性和“当前最佳”次优解决方案性能的理论结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号