Joint Algorithm/Architecture Design of Communication Systems

Add to your list(s) Download to your calendar using vCal

• Prof. Emmanuel Boutillon, Universite Bretagne-Sud
• Friday 29 October 2010, 11:00-12:00
• Oatley Meeting Room 1, Engineering, Department of.

If you have a question about this talk, please contact Rachel Fogg.

In this tutorial, we wants to illustrate the fact that efficient implementation of the computation part of an algorithm should go further than the simple question “how” the algorithm works and understand “why” the algorithm works. In fact, once the “why” is understood, the algorithm can be modified, either in a lossy of lossless way, in order to be implemented more efficiently. To illustrate this idea, 3 examples are given. The first two examples correspond to a “lossy” implementation (conception of a binary correlator, conception of a parallel turbo-decoder). The last example presents a formalism, named Taylor Expansion Diagram, that allows a lossless transformations of some algorithm specifications.

This talk is part of the Signal Processing and Communications Lab Seminars series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge Centre for Data-Driven Discovery (C2D3)
• Cambridge University Engineering Department Talks
• Cambridge talks
• Centre for Smart Infrastructure & Construction
• Chris Davis' list
• Featured lists
• Information Engineering Division seminar list
• Interested Talks
• Oatley Meeting Room 1, Engineering, Department of
• School of Technology
• Signal Processing and Communications Lab Seminars
• Trust & Technology Initiative - interesting events
• bld31
• ndk22's list
• rp587

Note that ex-directory lists are not shown.