[nastava:2006] - Fw: Sutra i preksutra - Predavanja Dr Gerharda Kramera, Bell Laboratories, Lucent Technologies (ETF Beograd) by "Ana Jankovic" <studentprodekan@galeb.etf.bg.ac.yu>

)


> Dragi svi,
>
>
> U organizaciji ETF BAFA, pozivamo vas na dva izuzetno zanimljiva 
> predavanja
> Dr Gerharda Kramera, Bell Laboratories, Lucent Technologies, Murray Hill,
> NJ, USA, koja ce se odrzati 26 i 27 septembra u ucionici IC-a u Racunskom
> centru Elektrotehnickog fakulteta (Bul. Kralja Aleksandra 73), sa pocetkom 
> u
> 13 casova. Slede abstrakti predavanja (najpre prvi, a zatim drugi dan), 
> kao
> i biografija predavaca. Predavanja ce biti na engleskom jeziku.
>
> Vise informacija dole ili na www.etf.bg.ac.yu
>
> 27.09.2006 13:00  Information Theory for Interference Channels
> Dr Gerhard Kramer, Bell Laboratories, Lucent Technologies, Murray Hill, 
> NJ,
> USA
>
> 26.09.2006 13:00 Network Coding Rates and Edge-Cut Bounds
> Dr Gerhard Kramer, Bell Laboratories, Lucent Technologies, Murray Hill, 
> NJ,
> USA
>
> Srdacan pozdrav,
> Dusan Matic
> sekretar ETF BAFA
>
> ------------------------------
> BIO:
>
> Gerhard Kramer received the B.Sc. and M.Sc. degrees in electrical
> engineering from the University of Manitoba, Winnipeg, MB, Canada, in 1991
> and 1992, respectively, and the Dr. sc. techn. (Doktor der Technischen
> Wissenschaften) degree from the Swiss Federal Institute of Technology 
> (ETH),
> Zurich, Switzerland, in 1998.
>
> > From July 1998 to March 2000, he was with Endora Tech AG, Basel,
> Switzerland, as a communications engineering consultant. Since May 2000 he
> has been with the Communications and Statistical Sciences Department
> (formerly the Mathematics of Communications Research Department), Bell
> Laboratories, Lucent Technologies, Murray Hill, NJ, USA. His research has
> been focused on information theory, communications theory, iterative
> decoding, and source coding.
>
>
> --------------------------------------------------
> Information Theory for Interference Channels
>
> Dr Gerhard Kramer, Bell Laboratories, Lucent Technologies, Murray Hill, 
> NJ,
> USA
>
>
> Datum 27.09.2006
> Vreme 13:00
> Mesto ucionica IC u Racunskom centru ETF
>
> Interference affects many types of communication channels including 
> digital
> subscriber lines and wireless links. A basic model for studying coding for
> such scenarios is known as the interference channel (IC). Several of the
> fundamental results known about ICs are reviewed with special emphasis on
> Gaussian channels. We further discuss several recent results including an
> "improvement" of astandard achievable rate region.
> -------------------
>
> Network Coding Rates and Edge-Cut Bounds
>
> Dr Gerhard Kramer, Bell Laboratories, Lucent Technologies, Murray Hill, 
> NJ,
> USA
>
> Datum 26.09.2006
> Vreme 13:00
> Mesto ucionica IC u Racunskom centru ETF
>
> Network coding has recently become a rapidly evolving area in Information
> Theory. We will begin by examining the basic concept behind network coding
> and contrast it to the conventional routing approach in existing networks.
> We highlight the capacity gain by allowing each node in a network to
> re-encode its input information instead of simply storing and forwarding
> data. We then discuss some recent progress in network coding. A bound on
> network coding rates is presented that generalizes an edge-cut bound on
> routing rates. The bound, called a progressive d-separating edge set (or
> PdE) bound, involves progressively removing edges from a network graph and
> checking whether certain strengthened d-separation conditions are 
> satisfied.
> We show that the PdE bound and one of its extensions proves that routing 
> is
> rate-optimal for multiple unicast sessions on bidirectional ring networks.
> We further show that the PdE bound improves on a standard cut-set bound 
> for
> networks with broadcasting, interference, and noise.
>
> This work was done jointly with Serap A. Savari from the University of
> Michigan, Ann Arbor.