【24h】

Power Allocation for Iterative Multiuser Decoding Based on Large System Analysis

机译:基于大系统分析的迭代多用户解码功率分配

获取原文

摘要

In this paper, we consider a power allocation problem for iterative multiuser decoding in a coded code-division multiple access (CDMA) system. Subject to given bit error rate performance targets for all users, the power allocation problem is formulated based on previously proposed large system analysis results for iterative multiuser decoding. The resulting power allocation problem is in general nonconvex and cannot be solved efficiently. However, under certain assumptions the problem can be reformulated into a quasiconvex optimization problem, which in turn can be solved efficiently by a sequence of convex feasibility problems. The approach is applied to a complexity reduced belief propagation multiuser detector as well as to popular interference cancellation based detectors. Numerical results are presented to demonstrate the performance of the proposed power allocation algorithm in finite-size systems. It is found that the belief propagation detector is more power and complexity efficient than the interference cancellation based detectors.
机译:在本文中,我们考虑在编码码分多址(CDMA)系统中的迭代多用户解码的功率分配问题。对于所有用户的给定误码率性能目标,基于先前提出的迭代多用户解码的大型系统分析结果制定了电力分配问题。得到的功率分配问题一般非凸起,不能有效地解决。然而,在某些假设下,问题可以重新重新重整为QuasicOnvex优化问题,这又可以通过凸形可行性问题有效地解决。该方法应用于复杂性降低的信仰传播多用户检测器以及流行的干扰消除的基于探测器。提出了数值结果以证明有限尺寸系统中提出的功率分配算法的性能。发现信仰传播检测器比基于干扰消除的探测器更高的功率和复杂性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号