One-bit DACs precoding for massive MU-MIMO systems based on antenna selection architecture

被引:2
作者
Liang, Rui [1 ]
Li, Hui [1 ]
Zhang, Wenjie [2 ]
Xue, Guodong [1 ]
机构
[1] Northwestern Polytech Univ, Sch Elect & Informat, Xian 710129, Peoples R China
[2] Changsha Univ Sci & Technol, Sch Comp & Commun Engn, Changsha 410114, Peoples R China
关键词
Massive MU-MIMO; Antenna selection; One-bit DACs; Nonlinear precoding; ADMM; EFFICIENT; DESIGN;
D O I
10.1016/j.dsp.2022.103548
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In massive multi-user multiple-input multiple-output (MU-MIMO) communication systems, the utiliza-tion of one-bit digital-to-analog converters (DACs) in the base station (BS) radio frequency (RF) chains can significantly reduce the power consumption of the system. This study proposes a low-cost precod-ing architecture for massive MU-MIMO systems to alleviate multi-user interference (MUI). By including a selection structure, the architecture decreases the power consumption of typical one-bit precoding ar-chitecture. Based on this structure, we investigate the antenna selection-aided one-bit DACs precoding problem. However, jointly identifying the precoding factor and the precoding vector of the proposed pre-coding architectures is intractable because they are coupled together. We address this issue by utilizing an alternating direction multiplication method (ADMM) framework. The antenna selection strategy and the implementation of the non-convex approximate projection operator are given in detail. In addition, the power consumption of the proposed system architecture is analyzed. Simulation results reveal that the proposed precoding algorithm can successfully activate the antenna subset and ensure the performance of the system. Moreover, the hardware complexity and power consumption of the proposed precoding architectures are considerably lower than those of previous one-bit DACs precoding architectures. (C) 2022 Elsevier Inc. All rights reserved.
引用
收藏
页数:12
相关论文
共 38 条
[1]   Distributed optimization and statistical learning via the alternating direction method of multipliers [J].
Boyd S. ;
Parikh N. ;
Chu E. ;
Peleato B. ;
Eckstein J. .
Foundations and Trends in Machine Learning, 2010, 3 (01) :1-122
[2]   1-bit Massive MU-MIMO Precoding in VLSI [J].
Castaneda, Oscar ;
Jacobsson, Sven ;
Durisi, Giuseppe ;
Coldrey, Mikael ;
Goldstein, Tom ;
Studer, Christoph .
IEEE JOURNAL ON EMERGING AND SELECTED TOPICS IN CIRCUITS AND SYSTEMS, 2017, 7 (04) :508-522
[3]   Intelligent Massive MIMO Antenna Selection Using Monte Carlo Tree Search [J].
Chen, Jienan ;
Chen, Siyu ;
Qi, Yunlong ;
Fu, Shengli .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2019, 67 (20) :5380-5390
[4]   Alternating Minimization Algorithms for One-Bit Precoding in Massive Multiuser MIMO Systems [J].
Chen, Jung-Chieh .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2018, 67 (08) :7394-7406
[5]   Efficient Nonlinear Precoding for Massive MIMO Downlink Systems With 1-bit DACs [J].
Chu, Lei ;
Wen, Fei ;
Li, Lily ;
Qiu, Robert .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2019, 18 (09) :4213-4224
[6]   Challenges and Enabling Technologies for Energy Aware Mobile Radio Networks [J].
Correia, Luis M. ;
Zeller, Dietrich ;
Blume, Oliver ;
Ferling, Dieter ;
Godor, Ylva Jading Istvan ;
Auer, Gunther ;
Van der Perre, Liesbet .
IEEE COMMUNICATIONS MAGAZINE, 2010, 48 (11) :66-72
[7]  
Das VR, 2014, MIDWEST SYMP CIRCUIT, P535, DOI 10.1109/MWSCAS.2014.6908470
[8]  
Demir ÖT, 2018, EUR SIGNAL PR CONF, P652, DOI 10.23919/EUSIPCO.2018.8553104
[9]   Joint Symbol Level Precoding and Combining for MIMO-OFDM Transceiver Architectures Based on One-Bit DACs and ADCs [J].
Domouchtsidis, Stavros ;
Tsinos, Christos G. ;
Chatzinotas, Symeon ;
Ottersten, Bjorn .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2021, 20 (07) :4601-4613
[10]   Symbol-Level Precoding for Low Complexity Transmitter Architectures in Large-Scale Antenna Array Systems [J].
Domouchtsidis, Stavros ;
Tsinos, Christos G. ;
Chatzinotas, Symeon ;
Ottersten, Bjorn .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2019, 18 (02) :852-863