ext-State Functions for Finite-
Nasser M. Nasrabadi, Syed A. Rizvi · 1995
Absa therefore, several reordering procedures are introduced and their performances are evaluated in this paper. The reordering procedures that are investigated, are based on the conditional histogram of the codevectors, index prediction, vector prediction, nearest neighbor design, and frequency usage of the code-vectors. The performances of the reordering procedures are evaluated by comparing their hit ratios (the number of blocks encoded by the subcodebook) and their computational complexity. Experimental results are presented and it is found that the reordering procedure based on the vector prediction performs the best when compared with the other reordering procedures.