...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Selected Topics in Signal Processing, IEEE Journal of >Low-Complexity Iterative Detection for Large-Scale Multiuser MIMO-OFDM Systems Using Approximate Message Passing
【24h】

Low-Complexity Iterative Detection for Large-Scale Multiuser MIMO-OFDM Systems Using Approximate Message Passing

机译：使用近似消息传递的大规模多用户MIMO-OFDM系统的低复杂度迭代检测

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

摘要

One of the challenges in the design of large-scale multiuser MIMO-OFDM systems is developing low-complexity detection algorithms. To achieve this goal, we leverage message passing algorithms over the factor graph that represents the multiuser MIMO-OFDM systems and approximate the original discrete messages with continuous Gaussian messages through the use of the minimum Kullback-Leibler (KL) divergence criterion. Several signal processing techniques are then proposed to achieve near-optimal performance at low complexity. First, the principle of expectation propagation is employed to compute the approximate Gaussian messages, where the symbol belief is approximated by a Gaussian distribution and then the approximate message is calculated from the Gaussian approximate belief. In addition, the approximate symbol belief can be computed by the a posteriori probabilities fed back from channel decoders, which reduces the complexity dramatically. Second, the first-order approximation of the message is utilized to further simplify the message updating, leading to an algorithm that is equivalent to the AMP algorithm proposed by Donoho Finally, the message updating is further simplified using the central-limit theorem. Compared with the single tree search sphere decoder (STS-SD) and the iterative (turbo) minimum mean-square error based soft interference cancellation (MMSE-SIC) in the literature through extensive simulations, the proposed message passing algorithms can achieve a near-optimal performance while the complexity is decreased by tens of times for a 64 $times$ 64 MIMO system. In addition, it is shown that the proposed message passing algorithms exhibit desirable tradeoffs between performance and complexity for a low-dimensional MIMO system.
机译：大规模多用户MIMO-OFDM系统设计中的挑战之一是开发低复杂度检测算法。为了实现此目标，我们在代表多用户MIMO-OFDM系统的因子图上利用消息传递算法，并通过使用最小Kullback-Leibler（KL）散度准则来近似具有连续高斯消息的原始离散消息。然后提出了几种信号处理技术，以低复杂度实现接近最佳的性能。首先，采用期望传播的原理来计算近似高斯消息，其中符号置信度通过高斯分布进行近似，然后根据高斯近似置信度来计算近似消息。另外，可以通过从信道解码器反馈的后验概率来计算近似符号置信度，这大大降低了复杂度。其次，利用消息的一阶逼近来进一步简化消息更新，从而得出一种算法，该算法与Donoho提出的AMP算法等效。最后，使用中心限制进一步简化了消息更新。定理。通过广泛的仿真，与文献中的单树搜索球面解码器（STS-SD）和基于迭代（涡轮）最小均方误差的软干扰消除（MMSE-SIC）相比，本文提出的消息传递算法可以实现近乎最佳性能，而64个MIMO系统的复杂度却降低了数十倍，而 $ times $ 64 MIMO系统。此外，结果表明，所提出的消息传递算法在低维MIMO系统的性能和复杂度之间取得了理想的折衷。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号