Speaker:  Dmitri Truhachev (Dalhousie University)
Title:  Coupling Information Transmission
Date:  Wednesday, Dec. 16, 2015
Time:  2:00 p.m.
Room:  HP 4351, Carleton University

Abstract:  Message passing algorithms on graphs are now frequently utilized in many areas of engineering and science. While such algorithms provide an efficient way to solve complex problems represented by graphs the resulting solutions are often suboptimal. Recently developed theory of spatial graph coupling allows to find optimal solutions for many graphical problems via message passing algorithms operating on chains of spatially coupled graphs. We use the coupling approach to develop a capacity achieving multi-user communication technique called coupling information transmission.