A Finite Input Alphabet Perspective on the Rate-Energy Tradeoff in SWIPT Over Parallel Gaussian Channels
Résumé
Simultaneous wireless information and power transfer (SWIPT) has gained significant popularity in the recent past owing to its applications in a wide range of use-cases. Although SWIPT has been fairly well investigated in the literature, the existing work has mainly focused on attaining the optimal rate energy (RE) trade-off assuming Gaussian input alphabet. However , practical systems operate with finite input alphabets such as QAM/PSK. We characterise the attainable RE trade-off in SWIPT systems employing finite input alphabet for transmission over parallel Gaussian channels of say orthogonal frequency division multiplexing subcarriers or multiple-input multiple-output streams. Some of the key results in the literature that assume Gaussian input alphabet are shown to be special cases of our results. Furthermore, we provide insights into our results with the aid of graphical illustrations, which throw light on the optimal power allocation policy for various energy harvesting constraints. Furthermore, we consider practically relevant time sharing and power splitting schemes operating with finite input alphabet and characterise their RE trade-off. Their optimal solutions in the asymptotic regime are obtained, which serve as low-complexity solutions suitable for practical implementation. Our simulation studies have demonstrated that the Gaussian input assumption significantly overestimates the attainable RE trade-off, especially when the signal set employed is small. Furthermore, it is observed through numerical simulations that the proposed optimal power allocation performs significantly better than the power allocation based on the Gaussian input assumption. Specifically, as much as 30% rate improvement is observed when employing the classic 4-QAM signal set.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...