<P style="TEXT-ALIGN: center; MARGIN: 0in 0in 10pt" class=MsoNormal align=center><SPAN style="LINE-HEIGHT: 115%; FONT-SIZE: 20pt; mso-bidi-font-size: 11.0pt"><FONT face=Calibri>Title: Quadratic Gaussian multiterminal source coding<?xml:namespace prefix = o ns = "urn:schemas-microsoft-com:office:office" /><o:p></o:p></FONT></SPAN></P>
<P style="TEXT-ALIGN: center; MARGIN: 0in 0in 10pt" class=MsoNormal align=center><FONT face=Calibri>4/23, 11am, W-122D3, </FONT></P>
<P style="TEXT-ALIGN: center; MARGIN: 0in 0in 10pt" class=MsoNormal align=center><FONT face=Calibri>Professor Zixiang Xiong, IEEE Fellow</FONT></P>
<P style="TEXT-ALIGN: center; MARGIN: 0in 0in 10pt" class=MsoNormal align=center><FONT face=Calibri>ECE, TAMU</FONT></P>
<P style="TEXT-ALIGN: center; MARGIN: 0in 0in 10pt" class=MsoNormal align=center><FONT face=Calibri>Host: Zhu Han</FONT></P>
<P style="TEXT-ALIGN: center; MARGIN: 0in 0in 10pt" class=MsoNormal align=center><o:p><FONT face=Calibri> </FONT></o:p></P>
<P style="TEXT-ALIGN: justify; MARGIN: 0in 0in 10pt" class=MsoNormal><FONT face=Calibri>Abstract: Driven by a host of emerging applications, distributed source coding has assumed renewed interest in the past decade. Although the Slepian-Wolf theorem has been known for almost 40 years and progresses have been made <SPAN style="mso-spacerun: yes"> </SPAN>recently on the rate region of quadratic Gaussian two-terminal source coding, finding the sum-rate bound of quadratic Gaussian multiterminal (MT) source coding with more than two terminals is still an open problem. In this talk, I'll briefly go over existing results on distributed source coding problems before describing a set of new results we obtained recently.</FONT></P>
<P style="TEXT-ALIGN: justify; MARGIN: 0in 0in 10pt" class=MsoNormal><o:p><FONT face=Calibri> </FONT></o:p></P>
<P style="TEXT-ALIGN: justify; MARGIN: 0in 0in 10pt" class=MsoNormal><FONT face=Calibri>Bio: Dr. Zixiang Xiong received the Ph.D. degree in Electrical Engineering in 1996 from the </FONT><A href="http://www.ece.uiuc.edu/" target=1><SPAN style="COLOR: windowtext; TEXT-DECORATION: none; text-underline: none"><FONT face=Calibri>University of Illinois at Urbana-Champaign</FONT></SPAN></A><FONT face=Calibri>. From 1995 to 1997, he was with </FONT><A href="http://www.ee.princeton.edu/" target=1><SPAN style="COLOR: windowtext; TEXT-DECORATION: none; text-underline: none"><FONT face=Calibri>Princeton University</FONT></SPAN></A><FONT face=Calibri>, first as a visiting student, then as a research associate. From 1997 to 1999, he was with the </FONT><A href="http://www-ee.eng.hawaii.edu/" target=1><SPAN style="COLOR: windowtext; TEXT-DECORATION: none; text-underline: none"><FONT face=Calibri>University of Hawaii</FONT></SPAN></A><FONT face=Calibri>. Since 1999, he has been with the Department of Electrical and Computer Engineering at Texas A&M University, where he is a professor. During Spring 2010, he spent his sabbatical leave at </FONT><A href="http://ee.stanford.edu/" target=1><SPAN style="COLOR: windowtext; TEXT-DECORATION: none; text-underline: none"><FONT face=Calibri>Stanford University</FONT></SPAN></A><FONT face=Calibri>. He received an NSF Career Award in 1999, an ARO Young Investigator Award in 2000 and an ONR Young Investigator Award in 2001. He also received the 2006 IEEE Signal Processing Magazine best paper award. He served as associate editor for the IEEE Trans. on Circuits and Systems for Video Technology (1999-2005), the IEEE Trans. on Image Processing (2002-2005), the IEEE Trans. on Signal Processing (2002-2006), and the IEEE Trans. on Systems, Man, and Cybernetics (part B) (2005-2009). He is currently an associate editor for the IEEE Trans. on Communications. He is a fellow of the IEEE. </FONT></P>
<P style="TEXT-ALIGN: justify; MARGIN: 0in 0in 10pt" class=MsoNormal><o:p><FONT face=Calibri> </FONT></o:p></P>
<DIV></DIV>