Abstract
Although online identification of low-order industrial processes is straightforward when the time delay is known and fixed, the problem becomes significantly more challenging when the delay is unknown and/or varying. Presented is a fast, exact recursive identification algorithm for this situation with a memory and time complexity that is linearly bound in the unknown delay. Experiments indicate the method significantly improves upon the memory and computation requirements typical of previous online methods, and possesses improved convergence properties.
| Original language | English |
|---|---|
| Pages (from-to) | 152-153 |
| Number of pages | 2 |
| Journal | Electronics Letters |
| Volume | 48 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 2 Feb 2012 |