Precoder Design for Simultaneous Wireless Information and Power Transfer Systems With Finite-Alphabet Inputs

Existing research on a simultaneous wireless information and power transfer (SWIPT) system is based on the assumption of Gaussian inputs. However, the optimal design on Gaussian inputs may lead to dramatic performance loss for practical systems with finite-alphabet inputs. This paper focuses on the...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on vehicular technology Ročník 66; číslo 10; s. 9085 - 9097
Hlavní autoři: Zhu, Xiaodong, Zeng, Weiliang, Xiao, Chengshan
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.10.2017
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithm design and analysis
Algorithms
Codes
Computer simulation
Design optimization
Energy harvesting
Energy transmission
Finite-alphabet inputs
MIMO
Mutual information
Optimization
Polynomials
Power management
Power transfer
precoder design
Receivers
Semidefinite programming
simultaneous wireless information and power transfer (SWIPT)
Software radio
Transmitters
ISSN:0018-9545, 1939-9359
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Existing research on a simultaneous wireless information and power transfer (SWIPT) system is based on the assumption of Gaussian inputs. However, the optimal design on Gaussian inputs may lead to dramatic performance loss for practical systems with finite-alphabet inputs. This paper focuses on the precoder design for a SWIPT system with finite-alphabet inputs and instantaneous channel state information over a multiple-input multiple-output channel. We formulate the optimal precoder design as an optimization problem, in which the objective is to maximize the mutual information over the channel from the transmitter to the information receiver under the constraints of transmit power and harvested energy threshold. The formulated problem is NP-hard, so a global optimal solution cannot be found within the polynomial time. The main contributions of this paper are as follows: 1) By using its structure, the NP-hard problem is relaxed to a semidefinite programming problem. Then, a general solving framework for both co-located and separated receiver cases, based on the semidefinite relaxation (SDR) technique, is developed to achieve a near optimal precoder. 2) For the case of co-located receivers, we show that the optimal precoder design is a concave problem with respect to power allocation; then, a specific algorithm for co-located receivers is proposed. Compared with the general SDR-based method, the specific algorithm for co-located receivers exhibits almost the same performance but much lower complexity. 3) The performance of several practical co-located receiver designs is analyzed in SWIPT systems with finite-alphabet inputs. Finally, we provide simulation results to show the efficacy of the proposed algorithms.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-9545
1939-9359
DOI:10.1109/TVT.2017.2712774