Imperial College London > Talks@ee.imperial > CAS Talks > Sampling and Controlling Faster than the Computational Delay

Sampling and Controlling Faster than the Computational Delay

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

If you have a question about this talk, please contact George A Constantinides.

For a sampled-data control system, we propose to choose the time between samples to be shorter than the computational delay involved in computing the control signal, an approach we call fast sampling. It is shown that, utilising a parallel computing architecture, this is indeed feasible and that fast sampling schemes yield better performance than their slower sampling counterparts.

This talk is part of the CAS Talks series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Changes to Talks@imperial | Privacy and Publicity