next >

Number of matching criteria evaluated by Greedy Algorithm D.

MSE of sequences coded using Greedy Algorithm D with various maximum displacements.

This graph shows that the behaviour of the MSE for Greedy Algorithm D was very similar to that for Greedy Algorithm C, with low points at the same displacements. Algorithm D was more successful at coding with small displacements than Algorithm C however.

[Return to Greedy Algorithm results]

[Greedy Algorithm D results]

© Colin E. Manning 1996