BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Joint Algorithm/Architecture Design of Communication Systems - Pro
 f. Emmanuel Boutillon\, Universite Bretagne-Sud
DTSTART:20101029T100000Z
DTEND:20101029T110000Z
UID:TALK27748@talks.cam.ac.uk
CONTACT:Rachel Fogg
DESCRIPTION:In this tutorial\, we wants to illustrate the fact that effici
 ent implementation of the computation part of an algorithm should go furth
 er than the simple question "how" the algorithm works and understand "why"
  the algorithm works. In fact\, once the "why" is understood\, the algorit
 hm can be modified\, either in a lossy of lossless way\, in order to be im
 plemented more efficiently. To illustrate this idea\, 3 examples are given
 . The first two examples correspond to a "lossy" implementation (conceptio
 n of a binary correlator\, conception of a parallel turbo-decoder). The la
 st example presents a formalism\, named Taylor Expansion Diagram\, that al
 lows a lossless transformations of some algorithm specifications.\n
LOCATION:Oatley Meeting Room 1\,  Engineering\, Department of
END:VEVENT
END:VCALENDAR