BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Multiple access with finite payloads and many users.
DTSTART:20191022T161500
DTEND:20191022T171500
DTSTAMP:20260415T011214Z
UID:501f374addff9e72e94fe4fd2d7947bbc480463c7813ad8f45c54242
CATEGORIES:Conferences - Seminars
DESCRIPTION:Prof. Yury Polyanskiy\, MIT (currently visiting IPG in EPFL)\n
 \n\n\n\n\nOne of the next frontiers in communication technology is to re-t
 hink methods of sharing spectrum among wireless transmitters. In this talk
 \, I will discuss recent results on characterizing the fundamental tradeof
 f between the density of users  (ratio of active users and the number of 
 degrees of freedom available  per frame) and the minimal required energy-
 per-bit (Eb/N0). In the regime of interest for the Internet-of-Things\, th
 e payload of each user is about 100 data bits. This is too small for  the
  asymptotic Shannon theory to provide any guidance and thus we needed  to
  develop new tools for analysis. A surprising discovery is existence of co
 ded-access schemes that are able to almost perfectly reject the multi-user
  interference\, so that increasing the density of users (without increasin
 g space-time-frequency resources) does not lead to any deterioration of se
 rvice. Practically important is that known MAC architectures are not capab
 le of attaining this effect. A similar analysis and effects arise in the p
 roblem of (unsourced) random-access over the AWGN channel\, which we will 
 discuss as well.\n\n\n\n\n\n\n 
LOCATION:INF 213 https://plan.epfl.ch/?room==INF%20213
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR