CSIP Seminar

*********************************
There is now a CONTENT FREEZE for Mercury while we switch to a new platform. It began on Friday, March 10 at 6pm and will end on Wednesday, March 15 at noon. No new content can be created during this time, but all material in the system as of the beginning of the freeze will be migrated to the new platform, including users and groups. Functionally the new site is identical to the old one. webteam@gatech.edu
*********************************

Event Details
  • Date/Time:
    • Friday December 6, 2013 - Saturday December 7, 2013
      2:00 pm - 2:59 pm
  • Location: Centergy One 5186 (CSIP Library)
  • Phone:
  • URL:
  • Email:
  • Fee(s):
    N/A
  • Extras:
Contact

Ahmad Beirami

beirami@ece.gatech.edu

Summaries

Summary Sentence: No summary sentence submitted.

Full Summary: Role of Structured Codes in Network Information Theory

Speaker:  Dr. Krishna Narayanan

Title:
Role of Structured Codes in Network Information Theory

Abstract:
For several problems in source and channel coding, the best known rates (and often, capacity) can be achieved using random codes. In several of these cases, the best known rates can also be achieved using structured codes such as linear codes or lattice codes; however, structure in the codebook is not essential if implementation complexity is not considered. There are some interesting problems where structured codebooks provide higher achievable rates than random codebooks. While such examples have been known to exist at least as early as 1979, only in the last few years has interest in this area surged. In the first part of this talk, we will present an overview of the developments in this area and discuss example problems where structured codes outperform random codes. In the second part, we will focus on one of the examples - namely, that of physical layer network coding or compute and forward. In this example, we consider a wireless network where intermediate nodes in the network attempt to directly decode or, compute functions of the data transmitted by many transmitters. The question we address is - how to build codes with algebraic structure that are good for decoding linear combinations of the data over a finite field from the received signal which is a linear combination of the transmitted signals over the complex field.

Bio:
Krishna Narayanan is a Ramblin' Wreck from Georgia Tech having graduated with a Ph.D. in 1998. Since then, he has been with the Department of Electrical and Computer Engineering at Texas A&M University, where he is currently a professor. His research interests are coding theory, information theory and signal processing with applications to wireless communications, and data storage. He was the recipient of the 2001 National Science Foundation CAREER Award and 2006 IEEE Signal Processing for Data Storage Best Paper Award.  He was the recipient of the Association of Former Students College Level Teaching Award at Texas A&M University in 2012.  He served as the area editor for coding theory and applications for the IEEE Transactions on Communications from 2007-2011. 

Additional Information

In Campus Calendar
No
Groups

School of Electrical and Computer Engineering

Invited Audience
Undergraduate students, Faculty/Staff, Graduate students
Categories
Seminar/Lecture/Colloquium
Keywords
No keywords were submitted.
Status
  • Created By: Ashlee Gardner
  • Workflow Status: Published
  • Created On: Nov 20, 2013 - 11:12am
  • Last Updated: Apr 13, 2017 - 5:23pm