| 摘要 |
Method and system aspects for searching for an optimal codevector from a plurality of codevectors in a codebook, the optimal codevector having a minimum distance to a given vector, are provided. The aspects determine a partial distance with a current vector component of a current codevector and of the given vector, compare the partial distance to a saved renormalized minimum partial distance, and proceed to a next codevector when the saved renormalized minimum partial distance is smaller than the partial distance.In addition, the present invention proceeds to a next vector component when the partial distance is smaller than the saved renormalized minimum partial distance. When the partial distance computed with each next vector component is smaller than the saved renormalized minimum partial distance, the present invention calculates a full weighted distance value, compares it to a saved minimum full weighted distance, and updates chosen values. The operation then continues with a next codevector until all codevectors have been used. An optimal index to identify the optimal codevector is returned when all codevectors have been used.
|
