PROJECT TITLE: Complexity and bidirectional information theory: Complexity-Feedback-Performance limits and a new class of ecological information networks
ACKNOWLEDGEMENT: I would like to acknowledge the ANR JCJC project/instrument for acting as a positive catalyst toward a recently awarded ERC Consolidator Grant (DUALITY: 2017-2022). The ANR JCJC carries a variety of funding advantages, and it promotes – just like the ERC – fundamental research. While the topics of the JCJC and the ERC projects are generally different, having the ANR JCJC can play a positive role toward securing an ERC grant.
|PI||Petros ELIA (EURECOM, Sophia-Antipolis)|
|PROJECT TYPE||Jeune chercheuse - jeune chercheur|
|Type of research||Basic research|
|Duration||42 months (2015-2019)|
|Call targets||Défi 7: “Société de l’information et de la communication”|
|Axe||4 “Fondements du numérique”|
|ERC PANEL TARGETED||PE7: Systems and Communications Engineering|
KEYWORDS: statistical signal processing; detection and estimation; complexity theory of computation; information theory; interference; feedback; wireless information networks; power efficiency; ecological information networks.
…….. …….. …….. …….. ……..
This project is in the context of wireless communications, and it aims to tackle the bottleneck of computational complexity corresponding to the need for algorithms that require extreme computing resources, and the bottleneck of feedback corresponding to the need for equally idealistic feedback mechanisms that must disseminate massive amounts of overhead information about the fluctuating states of each link in the network.
Theoretical Vision: These bottlenecks drive our theoretical vision of exploring the interdependencies between computational complexity, feedback and performance in wireless communications.
Technological vision: We will develop algorithms for a new class of mobile-user devices that can participate in properly gathering/disseminating feedback (at the right place and time) as well as in computing solutions to outsourced algorithmic tasks across the network, in an effort which we term as “outsourcing the surgical insertion of bidirectional bits and flops across the network” and which aims to reduce computational complexity and improve performance.
J. Zhang and P. Elia, “Fundamental limits of cache-aided wireless BC: Interplay of coded-caching and CSIT feedback,” IEEE Transactions on Information Theory, Vol. 63, May 2017. http://www.eurecom.fr/fr/publication/5150/download/comsys-publi-5150.pdf
P. de Kerret, D. Gesbert, J. Zhang, and P. Elia, “Optimal sum-dof of the K-user MISO BC with current and delayed feedback,” submitted to IEEE Trans. Inf. Theory, 2016 https://arxiv.org/pdf/1604.01653.pdf
J. Zhang and P. Elia, “Wireless coded caching: a topological perspective,” IEEE International Symposium on Information Theory (ISIT), 2017. http://www.eurecom.fr/en/publication/4953/download/comsys-publi-4953_1.pdf
J. Zhang and P. Elia, “The synergistic gains of coded caching and delayed feedback,” CoRR, vol. abs/1511.03961, 2016. http://www.eurecom.fr/en/publication/4885/download/comsys-publi-4885.pdf
E. Lampiris, J. Zhang and P. Elia, “Cache-aided cooperation with no CSIT,” 2017 IEEE International Symposium on Information Theory (ISIT), Aachen, 2017, pp. 2960-2964. http://www.eurecom.fr/en/publication/5242/download/comsys-publi-5242.pdf
Jingjing Zhang and Petros Elia, “Feedback-Aided Coded Caching for the MISO BC with Small Caches,” IEEE International Conference on Communications (ICC), 2017. http://www.eurecom.fr/en/publication/4932/download/comsys-publi-4932_1.pdf
J. Zhang and P. Elia, “Fundamental limits of cache-aided wireless BC: Interplay of coded-caching and CSIT feedback,” 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton), Monticello, IL, 2016, pp. 924-932. http://www.eurecom.fr/fr/publication/4744/download/comsys-publi-4744.pdf
P. de Kerret, D. Gesbert, J. Zhang and P. Elia, “Optimally bridging the gap from delayed to perfect CSIT in the K-user MISO BC,” 2016 IEEE Information Theory Workshop (ITW), Cambridge, 2016, pp. 300-304. http://www.eurecom.fr/en/publication/4981/download/comsys-publi-4981.pdf