HomepageAbout me, short resume.Short technical survey of my own work.download publications, get a copy of my phd thesis.Free computer code to download.A weekly updated set of links to internet sites.The end page, credits...
WWW.BALMELLI.NET - contact

COMMUNICATION PIC SEMINARS

>home>seminars
Seminar topics

CONTENT-ADDRESSABLE NETWORKS
CONTENT-DISTRIBUTION NETWORKS
NETWORK CALCULUS
TURBO CODES 
MULTIPLE DESCRIPTION CODING
QoS PATHS WITH RESTORATION
AD-HOC WIRELESS NETWORKS 
IP TRACEBACK


Organizing committee
Laurent Balmelli 
Dinesh Verma 
Olivier Verscheure
Pascal Frossard 
Dakshi Agrawal 
Anees A Shaikh 
Parviz Kermani 

 

IBM T.J. Watson Center - Seminars in Communications - Announcement

Turbo Codes

Speaker

Dakshi Agrawal
IBM Research

 
In this talk, I would present a brief overview of what channel codes are and how the recently discovered channel codes achieve theoretical limits on transmission over a wide variety of channel. I will introduce several new channel codes, most notably turbo codes. The decoding of these new channel codes would be explained as a belief propagation algorithm on a bipartite graph with one set of vertices representing variables and another set of vertices representing the constraints. If the time permits, I will show connections of these with the Tornado codes which are proposed by Digital Fountain to make faster downloads of large files.
Material

 papers: 

  • Near Optimum Error Correcting Coding and Decoding: Turbo-Codes by Claude Berrou and Alain Glavieux published in IEEE Transactions on Communications, Vol 44, No 10, October 1996.
  • Factor Graphs and the Sum-Product Algorithm by F R Kschischang, B J Frey, H.-A. Loeliger published in IEEE Transactions on Information Theory, Vol47, February 2001.

  •