Technology & Networking in Silicon Valley & the SF Bay Area: Upcoming Meetings, Courses and Conferences
WEDNESDAY April 25, 2012
SCV Information Theory Chapter
Speaker: Robert M. Gray, Stanford University
Time: Networking and food at 5:30 PM; Presentation at 6:00 PM
Cost: none
Place: Room 202 in Packard Bldg, Stanford University, Stanford
RSVP: not required
Web: ewh.ieee.org/r6/scv/its
It is not possible to generate a Gaussian sequence by coding coin flips with one output symbol being produced for every flip. How close an approximation is possible, and how can it be achieved? Unsurprisingly, the problem is a variation on Shannon’s rate-distortion theory. The simulation problem provides a distinct viewpoint, however, and leads to several interesting relations among stationary or sliding-block codes, Shannon entropy rate, and the transportation (Monge-Kantorovitch-Wasserstein-Ornstein etc.) distance measure on random processes. This talk is a survey of several of these ideas.
[IEEE S.F. Bay Area Council - www.e-grid.net] [powered by WordPress .]
SUBSCRIBE: Get the e-GRID twice a month by email - upcoming IEEE SF Bay Area meetings, conferences.
Subscribe to our RSS Feed.
PUBLICIZE your event to IEEE's membership.
35 queries. 0.368 seconds