Design Optimization for Low-Complexity FPGA Implementation of Symbol-Level Multiuser Precoding
Open Access
- 16 February 2021
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 30698-30711
Abstract
This paper proposes and validates a low-complexity FPGA design for symbol-level precoding (SLP) in multiuser multiple-input single-output (MISO) downlink communication systems. In the optimal case, the symbol-level precoded transmit signal is obtained as the solution to an optimization problem tailored for a given set of users’ data symbols. This symbol-by-symbol design, however, imposes excessive computational complexity on the system. To alleviate this issue, we aim to reduce the per-symbol complexity of the SLP scheme by developing an approximate yet computationally-efficient closed-form solution. The proposed solution allows us to achieve a high symbol throughput in real-time implementations. To develop the FPGA design, we express the proposed solution in an algorithmic way and translate it to hardware description language (HDL). We then optimize the processing to accelerate the performance and generate the corresponding intellectual property (IP) core. We provide the synthesis report for the generated IP core, including performance and resource utilization estimates and interface descriptions. To validate our design, we simulate an uncoded transmission over a downlink multiuser channel using the LabVIEW software, where the SLP IP core is implemented as a clock-driven logic (CDL) unit. Our simulation results show that a throughput of 100 Mega symbols per second per user can be achieved via the proposed SLP design. We further use the MATLAB software to produce numerical results for the conventional zero-forcing (ZF) and the optimal SLP techniques as benchmarks for comparison. Thereby, it is shown that the proposed FPGA implementation of SLP offers an improvement of up to 50 percent in power efficiency compared to the ZF precoding. Remarkably, it enjoys the same per-symbol complexity order as that of the ZF technique. We also evaluate the loss of the real-time SLP design, introduced by the algebraic approximations and arithmetic inaccuracies, with respect to the optimal scheme.Keywords
Funding Information
- Luxembourg National Research Fund (FNR), Enhanced Signal Space opTImization for satellite comMunication Systems (ESSTIMS), under CORE Junior Project (C16/IS/11332341)
- AFR-PPP End-to-End Signal Processing Algorithms for Precoded Satellite Communications (FNR11481283)
- Exploiting Interference for Physical-Layer Security in 5G networks (FNR11607830)
- Cognitive Cohesive Networks of Distributed Units for Active and Passive Space Applications (CORE Junior FNR11689919)
This publication has 30 references indexed in Scilit:
- Symbol-Level Multiuser MISO Precoding for Multi-Level Adaptive ModulationIEEE Transactions on Wireless Communications, 2017
- Exploiting Known Interference as Green Signal Power for Downlink Beamforming OptimizationIEEE Transactions on Signal Processing, 2015
- Constructive Multiuser Interference in Symbol Level Precoding for the MISO Downlink ChannelIEEE Transactions on Signal Processing, 2015
- Projected Gradient Method for Non-Negative Least Square2015
- Optimal Multiuser Transmit Beamforming: A Difficult Problem with a Simple Solution Structure [Lecture Notes]IEEE Signal Processing Magazine, 2014
- Proximal AlgorithmsFoundations and Trends® in Optimization, 2014
- Linear precoding via conic optimization for fixed MIMO receiversIEEE Transactions on Signal Processing, 2005
- A Vector-Perturbation Technique for Near-Capacity Multiantenna Multiuser Communication—Part I: Channel Inversion and RegularizationIEEE Transactions on Communications, 2005
- Maximum ratio transmissionIEEE Transactions on Communications, 1999
- Writing on dirty paper (Corresp.)IEEE Transactions on Information Theory, 1983