...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Information Theory >Solving a class of optimum multiuser detection problems with polynomial complexity
【24h】

Solving a class of optimum multiuser detection problems with polynomial complexity

机译：用多项式复杂度解决一类最优的多用户检测问题

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

We identify a class of optimum multiuser detection problems which can be solved with polynomial complexity in the number of users. The identification is based on transforming a quadratic 0-1 programming problem into an equivalent problem in graph theory. For a synchronous direct sequence code-division multiple access (CDMA) system, the result translates to designing a set of pseudorandom codes with the property that the cross correlation between every pair of codes in the set over one symbol period is nonpositive. We give two sets of codes with good correlation properties that fall within this class. Finally, we derive a bound on the cardinality of a signal set in an n-dimensional space, having the property that the cross correlation between every pair of signals in the set is nonpositive.
机译：我们确定了一类最佳的多用户检测问题，可以用用户数量的多项式复杂度来解决。该识别基于将二次0-1编程问题转换为图论中的等效问题。对于同步直接序列码分多址（CDMA）系统，结果转换为设计一组伪随机码，其特性是在一个符号周期内，该组中每对码之间的互相关为非正。我们给出了两类具有良好相关性的代码，它们都属于此类。最终，我们得出n维空间中信号集的基数的界，其性质是该集合中每对信号之间的互相关为非正。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号