Ecole d'ingénieur et centre de recherche en Sciences du numérique

Optimizing feedback in energy harvesting MISO communication channels

Gangula, Rajeev; Gesbert, David; Gündüz, Deniz

GLOBALSIP 2013, 1st IEEE Global Conference on Signal and Information Processing, December 3-5, 2013, Austin, TX, USA

In this work,1 we consider the optimization of feedback in a point-to-point MISO channel with an energy harvesting (EH) receiver (RX). The RX is interested in feeding back the channel state to the transmitter (TX) to help improve the transmission rate, yet must spend the harvested energy wisely to do so. The objective is to maximize the throughput by a deadline, subject to EH constraints at the RX. The throughput metric considered is an upper bound on the ergodic capacity of beamforming with limited feedback. The optimization problem is shown to be concave and a simple algorithm for obtaining the optimal feedback bit allocation policy is devised. Numerical results show that the optimal feedback policy obtained for the modified problem outperforms the naive scheme for the original problem.

Document Bibtex

Titre:Optimizing feedback in energy harvesting MISO communication channels
Département:Systèmes de Communication
Eurecom ref:4111
Copyright: © 2013 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Bibtex: @inproceedings{EURECOM+4111, year = {2013}, title = {{O}ptimizing feedback in energy harvesting {MISO} communication channels}, author = {{G}angula, {R}ajeev and {G}esbert, {D}avid and {G}{\"u}nd{\"u}z, {D}eniz }, booktitle = {{GLOBALSIP} 2013, 1st {IEEE} {G}lobal {C}onference on {S}ignal and {I}nformation {P}rocessing, {D}ecember 3-5, 2013, {A}ustin, {TX}, {USA}}, address = {{A}ustin, {\'{E}}{TATS}-{UNIS}}, month = {12}, url = {} }
Voir aussi: