Keynote Speakers

Keynote Speakers

Prof. Zixiang Xiong

IEEE Fellow

ISS group leader Department of Electrical and Computer Engineering

Texas A&M University, USA


Zixiang Xiong received his Ph.D. degree in electrical engineering from the University of Illinois at Urbana-Champaign in 1996. He is a professor in the ECE department of Texas A&M University. His main research interest lies in image/video processing, networked multimedia, and multi-user information theory.

Dr. Xiong received an NSF Career Award in 1999, an ARO Young Investigator Award in 2000, and an ONR Young Investigator Award in 2001. He is co-recipient of the 2006 IEEE Signal Processing Magazine best paper award, top 10% paper awards at the 2011 and 2015 IEEE Multimedia Signal Processing Workshops, and an IBM best student paper award at the 2016 IEEE International Conference on Pattern Recognition. He was the Publications Chair of ICASSP 2007, the Technical Program Committee Co-Chair of ITW 2007, the Tutorial Chair of ISIT 2010, the Awards Chair of Globecom 2014, and a General Co-Chair of MMSP'17. He served as an Associate Editor for five IEEE Transactions. He is currently an associate editor for the IEEE Trans. on Multimedia. He has been a fellow of the IEEE since 2007.


Speech Title: On the Energy-delay Tradeoff in Streaming Data


Abstract: We study basic tradeoffs between energy and delay in wireless communication systems using finite blocklength theory. We first assume that data arrive in constant stream of bits, which are put into packets and transmitted over a communications link. We show that depending on exactly how energy is measured, in general energy depends on \sqrt(d^{-1}) or \sqrt(d^{-1}*logd), where d is the delay. This means that the energy decreases quite slowly with increasing delay. Furthermore, to approach the absolute minimum of -1.59 dB on energy, bandwidth has to increase very rapidly, much more than what is predicted by infinite blocklength theory. We then consider the scenario when data arrive stochastically in packets and can be queued. We devise a scheduling algorithm based on finite blocklength theory and develop bounds for the energy-delay performance. Our results again show that the energy decreases quite slowly with increasing delay.