User manual

Tutorial: Handel-C advanced optimization
do
{
par
{
C = A * B;
D = A + B;
}
par
{
Output = C + D;
Index++;
}
} while (Index < 10000);
The
while() loop now takes two cycles to execute, but the longest path has been reduced from 31.13ns to
21.81ns (for a grade 4 part), as shown in the new estimation summary below, from the
version2 project in
the
TutorialEstimator workspace (accessible from Start>Programs>Celoxica>Platform Developer's
Kit
>Tutorials>TutorialEstimator). This summary should be compared to that for the the version1 project.
ESTIMATION SUMMARY FROM VERSION2 PROJECT
You can generate this summary yourself by building the version2 project in the TutorialEstimator
workspace. The logic estimator will save its results in the
TutorialEstimator\version2\EDIF
www.celoxica.com
Page 91