arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1807.09692eess.SP
收藏

一种用于盲多用户分离的自适应CM阵列预处理器

An Adaptive CM Array Preconditioner for Blind Multi-User Separation

Stanislaw Gorlow, João Paulo C. L. da Costa, and Martin Haardt

摘要:

恒模算法族广泛应用于无线通信系统和雷达中。经典的恒模自适应(CMA)算法,然而,无法锁定到一个单一的模式时,与天线阵列。相反,它均衡了整个空间频谱。在本文中,我们充分详细地描述了我们最近提出的方法,在无线电系统中的频率复用,如蜂窝网络,利用CMA算法的多个用户的分离。基于观察到的差分滤波器的权重类似于叠加的阵列导向矢量,我们投原始任务的到达方向估计问题。通过对基于离散空间傅里叶变换的阵列响应进行严格的理论分析,我们详细阐述了一种通过找到多项式方程的根来解决问题的解决方案。我们提供了一个数值例子来证明在高信噪比条件下的方法的有效性。此外,我们提出了一个更一般的预处理器的CMA阵列,它允许调制信号的幅度不同。作为一个副产品,预处理器产生一个低成本的估计并发用户的数量,即模型的顺序,通过简单地计算根与最强的响应。

英文摘要:

The family of constant-modulus algorithms is widely used in wireless communication systems and in radar. The classical constant-modulus adaptive (CMA) algorithm, however, fails to lock onto a single mode when used in conjunction with an antenna array. Instead, it equalizes the entire spatial spectrum. In this paper, we describe in full detail our recently proposed approach for the separation of multiple users in a radio system with frequency reuse, such as a cellular network, making use of the CMA algorithm. Based on the observation that the differential filter weights resemble a superposition of the array steering vectors, we cast the original task to a direction-of-arrival estimation problem. With rigorous theoretical analysis of the array response based on the discrete-space Fourier transform we elaborate a solution that solves the problem by finding the roots of a polynomial equation. We provide a numerical example to demonstrate the validity of the approach under high-SNR conditions. In addition, we propose a more general preprocessor for the CMA array which allows the modulated signals to differ in amplitude. As a byproduct, the preprocessor yields a low-cost estimate of the number of concurrent users, i.e. the model order, by simply counting the roots with the strongest response.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑