Method and system for searching for an optimal codevector

A system for searching for an optimal codevector from a plurality of codevectors in a codebook for data modeling of input signals to the system, including speech signals, the optimal codevector having a minimum distance to a given vector, the codevectors comprising a plurality of components, the system comprising:

• storage medium storing the codebook;
• and
• a central processing unit (CPU) coupled to the storage medium and capable of coordinating the searching including determining, for an input signal to the system to convert the input signal from an analog representation to a digital representation, a partial distance between a current vector component of a current codevector and of a corresponding component of the given vector, comparing the partial distance to a saved renormalized minimum partial distance, and proceeding to a next codevector when the saved renormalized minimum partial distance is smaller than the partial distance, whereby an optimal representation of the input signal as a digital signal in the system is efficiently achieved.

The system of 11 wherein the CPU further coordinates proceeding to a next vector component when the partial distance is smaller than the saved renormalized minimum partial distance.

The system of 12 wherein the CPU further coordinates calculating a full weighted distance value by summing together the partial distance computed with each next vector component after multiplication with corresponding weights when the partial distance computed with each next vector component is smaller than the saved renormalized minimum partial distance.

The system of 13 wherein the CPU further coordinates comparing the full weighted distance to a saved minimum full weighted distance.

The system of 14 wherein the CPU further coordinates updating an optimal index to an index of the current codevector, updating the saved minimum full weighted distance to the full weighted distance, and updating the saved renormalized minimum partial distance when the full weighted distance is smaller than the saved minimum full weighted distance.

The system of 15 wherein the CPU further coordinates continuing with a next codevector until all of the plurality of codevectors have been used.

The system of 14 wherein the CPU further coordinates continuing with a next codevector when the saved minimum full weighted distance is smaller than the full distance until all of the plurality of codevectors have been used.

The system of 16 wherein the CPU further coordinates returning the optimal index to identify the optimal codevector when all of the plurality of codevectors in the codebook have been used.

A system for searching for an optimal codevector from a plurality of codevectors in a codebook, for data modeling of input signals to the system, including speech signals, the optimal codevector having a minimum distance to a given vector, the codevectors comprising a plurality of components, the system comprising:

• means for storing the codebook;
• and
• means for utilizing the codebook, the means for utilizing coupled to the storing means and coordinating the searching, including determining, for an input signal to the system to convert the input signal from an analog representation to a digital representation, a partial distance between a current vector component of a current codevector and of a corresponding component of the given vector, comparing the partial distance to a saved renormalized minimum partial distance, and proceeding to a next codevector when the saved renormalized minimum partial distance is smaller than the partial distance, whereby an optimal representation of the input signal as a digital signal in the system is efficiently achieved.

The system of 19 wherein the means for utilizing further coordinates proceeding to a next vector component when the partial distance is smaller than the saved renormalized minimum partial distance.

The system of 20 wherein the means for utilizing further coordinates calculating a full weighted distance value by summing together the partial distance computed with each next vector component after multiplication with corresponding weights when the partial distance computed with each next vector component is smaller than the saved renormalized minimum partial distance, and comparing the full weighted distance to a saved minimum full weighted distance.

The system of 21 wherein the means for utilizing further coordinates updating an optimal index to an index of the current codevector, updating the saved minimum full weighted distance to the full weighted distance, and updating the saved renormalized minimum partial distance when the full weighted distance is smaller than the saved minimum full weighted distance, and continuing with a next codevector until all of the plurality of codevectors have been used.

The system of 22 wherein the means for utilizing further coordinates returning the optimal index to identify the optimal codevector when all of the plurality of codevectors in the codebook have been used.