Codebook segment merging
Provided are, among other things, systems, methods and techniques for merging entropy codebook application ranges within an audio signal. According to one embodiment, an audio signal is obtained, the audio signal including quantization indexes, identification of segments of said quantization indexes, and indexes of entropy codebooks that have been assigned to such segments, with a single entropy codebook index having been assigned to each said segment; potential merging operations in which specified segments potentially would be merged with each other are identified; bit penalties are estimated for the potential merging operations; then, the potential merging operation having the lowest estimated the penalty is performed.
1. A method of merging entropy codebook application ranges within an audio signal, comprising:
obtaining an audio signal that includes quantization indexes, identification of segments of said quantization indexes, and indexes of entropy codebooks that have been assigned to said segments, with a single entropy codebook index having been assigned to each said segment;
identifying potential merging operations in which specified segments potentially would be merged with each other;
estimating bit penalties for the potential merging operations; and
performing the potential merging operation having the lowest estimated bit penalty.
2. A method according to claim 1 , further comprising a step of repeating said identifying, estimating and performing steps until a specified criterion is satisfied.
3. A method according to claim 2 , wherein said specified criterion comprises reducing the segments to a specified number of segments that has been fixed in advance.
4. A method according to claim 2 , wherein said specified criterion comprises reducing the segments to different specified numbers of segments and then selecting the number of segments resulting in the greatest bit efficiency.
5. A method according to claim 2 , wherein said specified criterion comprises a bit-saving criterion.
6. A method according to claim 5 , wherein said specified criterion comprises that actual net bit savings from eliminating segments remains positive.
7. A method according to claim 2 , wherein said specified criterion comprises that estimated net bit savings from eliminating segments remains positive.
8. A method according to claim 1 , wherein said identifying step comprises evaluating, for each of a plurality of the segments, whether said segment potentially should be merged with its immediate left neighbor or its immediate right neighbor.
9. A method according to claim 8 , wherein: (1) if said segment has an entropy codebook that is smaller than both of its neighbors, a merger between said segment and its neighbor having the smaller entropy codebook is identified as a potential merging operation; (2) if said segment has an entropy codebook that is between those of its neighbors, a merger between said segment and its neighbor having the larger entropy codebook is identified as a potential merging operation; and (3) if said segment has an entropy codebook that is larger than both of its neighbors, no potential merging operation is identified.
10. A method according to claim 1 , wherein at least one of said identified potential merging operations comprises merging more than two segments.
11. A method according to claim 10 , wherein the estimated bit penalty for said at least one of said identified potential merging operations that comprises merging more than two segments is adjusted to account for elimination of an additional segment.
12. A method according to claim 11 , wherein said at least one of said identified potential merging operations comprises merging three segments and the adjustment of its bit penalty is a halving of what its bit penalty otherwise would be.
13. A method according to claim 10 , wherein said at least one of said identified potential merging operations comprises merging three segments and for purposes of said performing step, its bit penalty is compared against the combined lowest bit penalties for a current and a next iteration.
14. A method according to claim 10 , wherein the potential merging operations are identified through the use of a comprehensive search.
15. A method according to claim 10 , wherein the potential merging operations are identified through the use of a linear programming technique.
16. A computer-readable medium storing computer executable process steps for merging entropy codebook application ranges within an audio signal, said process steps comprising:
obtaining an audio signal that includes quantization indexes, identification of segments of said quantization indexes, and indexes of entropy codebooks that have been assigned to said segments, with a single entropy codebook index having been assigned to each said segment;
identifying potential merging operations in which specified segments potentially would be merged with each other;
estimating bit penalties for the potential merging operations; and
performing the potential merging operation having the lowest estimated bit penalty.
17. An apparatus for merging entropy codebook application ranges within an audio signal, comprising:
means for obtaining an audio signal that includes quantization indexes, identification of segments of said quantization indexes, and indexes of entropy codebooks that have been assigned to said segments, with a single entropy codebook index having been assigned to each said segment;
means for identifying potential merging operations in which specified segments potentially would be merged with each other;
means for estimating bit penalties for the potential merging operations; and
means for performing the potential merging operation having the lowest estimated bit penalty.