BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Capacity of Compound State-Dependent Channels with State Informati
 on at the Transmitter 
DTSTART:20090729T141500
DTSTAMP:20260504T193626Z
UID:8f268ef3416a416af4f68e6d8cf17e9032b45f031ea330125d41795d
CATEGORIES:Conferences - Seminars
DESCRIPTION:Prof. Pablo Piantanida\, Dept. of Telecommunications\, SUPELEC
  (France)\nIn the recent years\, communications over channels controlled b
 y random parameters\, namely states\, have been greatly developed. Intensi
 ve research was undertaken\, addressing both theoretical and practical asp
 ects. In this talk we focus on the simultaneous (or compound) state-depend
 ent channel with non-causal state information (SI) at the transmitter. Thi
 s channel arises in scenarios where there is uncertainty on the channel st
 atistic. The conditional PD of the channel is parameterized by parameters 
 which  remain constant during the communication and belong to an arbitrary
  set. Neither the sender nor the receiver are recognizant of such paramete
 rs governing the communication. These channels appear in a variety of scen
 arios\, e.g.\, the common-message broadcast (or multicast) channel with no
 n-causal SI at the transmitter\, the emerging field of cognitive radios\, 
 broadcast channels with imperfect CSI\, etc.\nWhile the study of such chan
 nels is of great interest because of their applications\, the problem of d
 etermining its capacity is interesting in itself. In fact\, the inherent d
 ifficulty in proving the converse for this class of channels is also found
  in other multi-user scenarios\, and it seems to be a typical difficulty i
 n channel coding problems. Such difficulty arises in converse proofs when 
 identifying auxiliary (single letter) variables via the conventional appro
 ach (starting from Fano's inequality). In this talk we overcome such diffi
 culty by proving a coding theorem and its strong converse that establishes
  the capacity of these channels. We shall see that the techniques employed
 \, based on image sets\, may be of independent interest since these could 
 be applicable as a powerful tool to prove converses for other multi-user s
 cenarios. An application to AWGN channels corrupted by an additive Gaussia
 n interfering known at the transmitter\, which may be absent on the channe
 l but the transmitter is unaware of this\, is also considered.\nThe talk i
 s based on joint work with Prof. Shlomo Shamai\, EE Dept. Technion\, Haifa
  Israel\, supported by NEWCOM++. 
LOCATION:INR 113
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR