Reduced Complexity Precoding for One-Bit Signaling
Reduced Complexity Precoding for One-Bit Signaling
复制标题
DOI：
10.1109/tvt.2021.3052113
复制
发表时间：
2021-02
影响因子：
6.8
通讯作者：
Azadeh Tabeshnezhad;A. L. Swindlehurst;T. Svensson
中科院分区：
文献类型：
--
作者：
Azadeh Tabeshnezhad;A. L. Swindlehurst;T. Svensson
最近提出了许多用于大规模MIMO场景的预编码方法，这些场景假设使用1位数模转换器，或者将信号限制为恒定模量。提供最佳性能的方法采用非线性预编码技术，需要搜索与天线数量相同维度的参数向量，这对于大规模MIMO应用来说是非常昂贵的。在本文中，我们提出了一种基于线性规划和建设性干扰的降低复杂度的预编码方法，该方法利用初始近似解来显着降低搜索维数。特别地，该方法使用初始量化线性预编码器的输出，只更新那些不满足一定可靠性条件的元素。仿真结果表明，在选择足够大的降维时，采用简化方法所造成的性能损失微不足道，但仍远小于天线数量。
A number of precoding methods have recently been proposed for massive MIMO scenarios that assume the use of one-bit digital-to-analog converters, or that constrain the signal to be of constant modulus. The methods that provide the best performance employ non-linear precoding techniques that require a search for a parameter vector of the same dimension as the number of antennas, which is prohibitively expensive for massive MIMO applications. In this paper, we propose a reduced complexity precoding method based on linear programming and constructive interference that exploits an initial approximate solution to significantly reduce the dimension of the search. In particular, the method uses the output of an initial quantized linear precoder and updates only those elements that do not satisfy a certain reliability condition. Simulations show that the resulting loss in performance due to the use of the simplified approach is insignificant provided that the reduced dimension is chosen to be large enough, but still much smaller than the number of antennas.