Controlling the critical path in time adaptive QR-1 recursions

In signal processing, it is customary to reduce critical computation paths by introducing delays in the signal flow graph. Sometimes this is easy. More often, it is not that easy. In this paper it is shown-by example-that critical paths can be controlled systematically in the algorithmic domain, that is prior to the derivation of the flow graph. The example presented here is the adaptive inverse QR algorithm. The method, though, is not restricted to this example. It applies to all algorithms where associativity and commutativity properties can be exploited