Reallocation of GLA codevectors for evading local minima

The performance of the generalised Lloyd algorithm (GLA) is improved by reallocating the codevectors every time the GLA reaches a local optimum. This is achieved by splitting the largest partition and by merging two small neighbouring partitions, thereby preserving the size of the codebook. The whole procedure is repeated until no improvement is achieved