
doi: 10.1109/29.1533
A covariance-RLS lattice adaptive-filtering algorithm is presented. The algorithm permits nonzero initial conditions and need not 'warn' N-1 iterations in advance of the first iteration to preserve its low computational requirements. These are both improvements over previous lattice algorithms. The algorithm also has a slight computational advantage over previous solutions, rendering it more applicable to adaptive-filtering applications such as fast-starting adaptive equalizers and echo cancellers, where the initial data in the adaptive filter are not, and cannot be assumed to be, zero. >
Computational methods in systems theory
Computational methods in systems theory
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 8 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
