University of Cambridge > Talks.cam > Probabilistic Systems, Information, and Inference Group Seminars > Joint Algorithm/Architecture Design of Communication Systems

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Joint Algorithm/Architecture Design of Communication Systems

Download to your calendar using vCal

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 Probabilistic Systems, Information, and Inference Group Seminars series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Seminar Room (Department of Geography, Downing Site) TCM Seminar room, 530 Mott building Hero Alam

Other talks

Claudia Ribeiro Almeida, Group Leader, Babraham Institute Afternoon Break Together Now: Cooperation and Collaboration in Social Art Practice Organiser's Welcome Haematology and Palliative Care Thelocactus
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity