When using Pipelined Execution Units, noting clock cycle cost nodes is helpful

X

a0

X@1

a1

X@2

a2

X@3

a3

+

+

+

Y

N2

N3

N4

N5

N6

N7

N8

3 clks

3 clks

3 clks

3 clks

3 clks

Longest path is now 6 clocks

Previous slide

Next slide

Back to first slide

View graphic version