MIMO Beamforming Designs With Partial CSI Under Energy Harvesting Constraints

In this letter, we investigate multiple-input multiple-output (MIMO) communications under energy harvesting (EH) constraints. In our considered EH system, there is one information transmitting (ITx) node, one traditional information receiving (IRx) node and multiple EH nodes. EH nodes can transform...

Full description

Saved in:
Bibliographic Details
Published in:IEEE signal processing letters 2013-04, Vol.20 (4), p.363-366
Main Authors: Xing, Chengwen, Wang, Niwei, Ni, Jiqing, Fei, Zesong, Kuang, Jingming
Format: Article
Language:English
Subjects:
Array signal processing
Batteries
Beamforming design
Channel estimation
Correlation
Energy harvesting
MIMO
partial CSI
Wireless communication
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this letter, we investigate multiple-input multiple-output (MIMO) communications under energy harvesting (EH) constraints. In our considered EH system, there is one information transmitting (ITx) node, one traditional information receiving (IRx) node and multiple EH nodes. EH nodes can transform the received electromagnetic waves into energy to enlarge the network operation life. When the ITx node sends signals to the destination, it should also optimize the beamforming/precoder matrix to charge the EH nodes efficiently simultaneously. Additionally, the charged energy should be larger than a predefined threshold. Under the EH constraints, in our work both minimum mean-square-error (MMSE) and mutual information are taken as the performance metrics for the beamforming designs at the ITx node. In order to make the proposed algorithms suitable for practical implementation and have affordable overhead, our work focuses on the beamforming designs with partial CSI and this is the distinct contribution of our work. Finally, numerical results are given to show the performance advantages of the proposed algorithms.
ISSN:1070-9908
1558-2361
DOI:10.1109/LSP.2013.2247999