Intel® Hyperflex™ Architecture High-Performance Design Handbook

ID 683353
Date 10/04/2021
Document Table of Contents Loop Pipelining Theory

The following figure illustrates the definition of a logical loop. The result (Zn ) is a function of input Xn and a delayed version of that input.
Figure 52. Simple Loop Example

If the function f(.) satisfies commutative, associative, and distributive properties (for example, addition, XOR, maximum), the equivalence of the following figures is mathematically provable.

Figure 53. Equivalent Loop After Modification

Did you find the information on this page useful?

Characters remaining:

Feedback Message