Scholarlink

<p>This paper focuses on a low-complexity precoding weight suitable for multi-user massive multiple-input multiple-output (MU-mMIMO) in user equipments’ (UEs’) mobility environment. Null-space expansion (NSE) method achieves better inter-user interference (IUI) suppression performance than channel prediction schemes by steering several nulls for interfering UTs in the high mobility environment. However, NSE faces challenges in effectively managing the computation complexity of the weight design. In this work, we incorporate a Richardson iteration (RI) in zero-forcing (ZF)-based NSE method to reduce computation burden. Moreover, deep-unfolding (DU) is utilized to further accelerate the convergence of RI-based NSE method. Computer simulation demonstrates the superiority of the proposed scheme in terms of IUI suppression performance and computation complexity.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Efficient Richardson iteration of null-space expansion for multi-user massive MIMO in time-varying channel

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年4月2日

查看全文
  • Yuki Sasaki,
  • Salah Berra,
  • Sourav Chakraborty,
  • Jin Nakazato,
  • Rui Dinis,
  • Kazuki Maruta

摘要

This paper focuses on a low-complexity precoding weight suitable for multi-user massive multiple-input multiple-output (MU-mMIMO) in user equipments’ (UEs’) mobility environment. Null-space expansion (NSE) method achieves better inter-user interference (IUI) suppression performance than channel prediction schemes by steering several nulls for interfering UTs in the high mobility environment. However, NSE faces challenges in effectively managing the computation complexity of the weight design. In this work, we incorporate a Richardson iteration (RI) in zero-forcing (ZF)-based NSE method to reduce computation burden. Moreover, deep-unfolding (DU) is utilized to further accelerate the convergence of RI-based NSE method. Computer simulation demonstrates the superiority of the proposed scheme in terms of IUI suppression performance and computation complexity.