利用缓慢时变AP-AP信道抑制动态TDD中的干扰
Leveraging Slowly Time-Varying AP-AP Channels for Interference Mitigation in Dynamic TDD
查看机构详情
- Linköping University（林雪平大学）
- Western Sydney University（西悉尼大学）
- Ericsson Research（爱立信研究）
机构由 AI 辅助整理，请以论文原文为准。
浏览论文内容
中文总结 AI 辅助
针对动态TDD中的交叉链路干扰，利用AP-AP信道缓慢时变特性，通过最小二乘联合估计上行数据和信道，并处理唯一可解性，实现显著干扰抑制。
中文摘要 AI 辅助
我们解决了动态时分双工（TDD）系统中的交叉链路干扰挑战。具体而言，我们专注于减轻由下行链路接入点（AP）对上行链路AP造成的干扰。为此，我们利用AP之间信道随时间变化通常比用户与AP之间信道慢得多的特性。这一观察使我们能够通过最小二乘公式在多个相干间隔内联合估计上行链路用户数据和AP-AP信道，在此期间AP-AP信道保持恒定。通过分析回归矩阵的秩，我们推导了该最小二乘问题唯一可解的条件。对于不存在唯一解的情况，我们提出通过牺牲上行链路数据样本的子集将问题转化为唯一可解的问题。数值结果表明，我们提出的方法相比基线算法取得了显著增益。此外，我们观察到，当AP-AP信道随时间变化非常缓慢时，我们提出的算法之一实现了近乎完美的AP-AP干扰抑制。
英文摘要
We address the challenge of cross-link interference in dynamic time-division duplexing (TDD) systems. Specifically, we focus on mitigating the interference caused by access points (APs) operating in downlink to APs operating in uplink. To this end, we exploit that channels between APs typically vary much more slowly over time than channels between users and APs. This observation allows us to jointly estimate the uplink user data and the AP-AP channels using a least-squares formulation over multiple coherence intervals, during which the AP-AP channels stay constant. We derive conditions for unique solvability of this least-squares problem by analyzing the rank of the regression matrix. For cases where a unique solution does not exist, we propose to transform the problem into a uniquely solvable one by sacrificing a subset of the uplink data samples. Numerical results demonstrate that our proposed methods achieve substantial gains over baseline algorithms. Further, we observe that one of our proposed algorithms achieves almost perfect AP-AP interference mitigation when the AP-AP channels vary very slowly over time.
