You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
311 lines
7.8 KiB
311 lines
7.8 KiB
/* Copyright (C) 2002 Jean-Marc Valin |
|
File: quant_lsp.c |
|
LSP vector quantization |
|
|
|
Redistribution and use in source and binary forms, with or without |
|
modification, are permitted provided that the following conditions |
|
are met: |
|
|
|
- Redistributions of source code must retain the above copyright |
|
notice, this list of conditions and the following disclaimer. |
|
|
|
- Redistributions in binary form must reproduce the above copyright |
|
notice, this list of conditions and the following disclaimer in the |
|
documentation and/or other materials provided with the distribution. |
|
|
|
- Neither the name of the Xiph.org Foundation nor the names of its |
|
contributors may be used to endorse or promote products derived from |
|
this software without specific prior written permission. |
|
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
|
``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
|
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
|
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR |
|
CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, |
|
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
|
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR |
|
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF |
|
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING |
|
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS |
|
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
|
*/ |
|
|
|
#include "quant_lsp.h" |
|
#include <math.h> |
|
|
|
extern int lsp_nb_vqid[64]; |
|
static float quant_weight[MAX_LSP_SIZE]; |
|
|
|
/* Note: x is modified*/ |
|
static int lsp_quant(float *x, signed char *cdbk, int nbVec, int nbDim) |
|
{ |
|
int i,j; |
|
float dist, tmp; |
|
float best_dist=0; |
|
int best_id=0; |
|
signed char *ptr=cdbk; |
|
for (i=0;i<nbVec;i++) |
|
{ |
|
dist=0; |
|
for (j=0;j<nbDim;j++) |
|
{ |
|
tmp=(x[j]-*ptr++); |
|
dist+=tmp*tmp; |
|
} |
|
if (dist<best_dist || i==0) |
|
{ |
|
best_dist=dist; |
|
best_id=i; |
|
} |
|
} |
|
|
|
for (j=0;j<nbDim;j++) |
|
x[j] -= cdbk[best_id*nbDim+j]; |
|
|
|
return best_id; |
|
} |
|
|
|
/* Note: x is modified*/ |
|
static int lsp_weight_quant(float *x, float *weight, signed char *cdbk, int nbVec, int nbDim) |
|
{ |
|
int i,j; |
|
float dist, tmp; |
|
float best_dist=0; |
|
int best_id=0; |
|
signed char *ptr=cdbk; |
|
for (i=0;i<nbVec;i++) |
|
{ |
|
dist=0; |
|
for (j=0;j<nbDim;j++) |
|
{ |
|
tmp=(x[j]-*ptr++); |
|
dist+=weight[j]*tmp*tmp; |
|
} |
|
if (dist<best_dist || i==0) |
|
{ |
|
best_dist=dist; |
|
best_id=i; |
|
} |
|
} |
|
|
|
for (j=0;j<nbDim;j++) |
|
x[j] -= cdbk[best_id*nbDim+j]; |
|
return best_id; |
|
} |
|
|
|
|
|
void lsp_quant_nb(float *lsp, float *qlsp, int order, SpeexBits *bits) |
|
{ |
|
int i; |
|
float tmp1, tmp2; |
|
int id; |
|
|
|
for (i=0;i<order;i++) |
|
qlsp[i]=lsp[i]; |
|
|
|
quant_weight[0] = 1/(qlsp[1]-qlsp[0]); |
|
quant_weight[order-1] = 1/(qlsp[order-1]-qlsp[order-2]); |
|
for (i=1;i<order-1;i++) |
|
{ |
|
#if 1 |
|
tmp1 = 1/((.15+qlsp[i]-qlsp[i-1])*(.15+qlsp[i]-qlsp[i-1])); |
|
tmp2 = 1/((.15+qlsp[i+1]-qlsp[i])*(.15+qlsp[i+1]-qlsp[i])); |
|
#else |
|
tmp1 = 1/(qlsp[i]-qlsp[i-1]); |
|
tmp2 = 1/(qlsp[i+1]-qlsp[i]); |
|
#endif |
|
quant_weight[i] = tmp1 > tmp2 ? tmp1 : tmp2; |
|
} |
|
for (i=0;i<order;i++) |
|
qlsp[i]-=(.25*i+.25); |
|
for (i=0;i<order;i++) |
|
qlsp[i]*=256; |
|
|
|
id = lsp_quant(qlsp, cdbk_nb, NB_CDBK_SIZE, order); |
|
speex_bits_pack(bits, id, 6); |
|
|
|
for (i=0;i<order;i++) |
|
qlsp[i]*=2; |
|
|
|
id = lsp_weight_quant(qlsp, quant_weight, cdbk_nb_low1, NB_CDBK_SIZE_LOW1, 5); |
|
speex_bits_pack(bits, id, 6); |
|
|
|
for (i=0;i<5;i++) |
|
qlsp[i]*=2; |
|
|
|
id = lsp_weight_quant(qlsp, quant_weight, cdbk_nb_low2, NB_CDBK_SIZE_LOW2, 5); |
|
speex_bits_pack(bits, id, 6); |
|
|
|
id = lsp_weight_quant(qlsp+5, quant_weight+5, cdbk_nb_high1, NB_CDBK_SIZE_HIGH1, 5); |
|
speex_bits_pack(bits, id, 6); |
|
|
|
for (i=5;i<10;i++) |
|
qlsp[i]*=2; |
|
|
|
id = lsp_weight_quant(qlsp+5, quant_weight+5, cdbk_nb_high2, NB_CDBK_SIZE_HIGH2, 5); |
|
speex_bits_pack(bits, id, 6); |
|
|
|
for (i=0;i<order;i++) |
|
qlsp[i]*=.00097656; |
|
|
|
for (i=0;i<order;i++) |
|
qlsp[i]=lsp[i]-qlsp[i]; |
|
} |
|
|
|
void lsp_unquant_nb(float *lsp, int order, SpeexBits *bits) |
|
{ |
|
int i, id; |
|
for (i=0;i<order;i++) |
|
lsp[i]=.25*i+.25; |
|
|
|
|
|
id=speex_bits_unpack_unsigned(bits, 6); |
|
for (i=0;i<10;i++) |
|
lsp[i] += 0.0039062*cdbk_nb[id*10+i]; |
|
|
|
id=speex_bits_unpack_unsigned(bits, 6); |
|
for (i=0;i<5;i++) |
|
lsp[i] += 0.0019531 * cdbk_nb_low1[id*5+i]; |
|
|
|
id=speex_bits_unpack_unsigned(bits, 6); |
|
for (i=0;i<5;i++) |
|
lsp[i] += 0.00097656 * cdbk_nb_low2[id*5+i]; |
|
|
|
id=speex_bits_unpack_unsigned(bits, 6); |
|
for (i=0;i<5;i++) |
|
lsp[i+5] += 0.0019531 * cdbk_nb_high1[id*5+i]; |
|
|
|
id=speex_bits_unpack_unsigned(bits, 6); |
|
for (i=0;i<5;i++) |
|
lsp[i+5] += 0.00097656 * cdbk_nb_high2[id*5+i]; |
|
} |
|
|
|
|
|
void lsp_quant_lbr(float *lsp, float *qlsp, int order, SpeexBits *bits) |
|
{ |
|
int i; |
|
float tmp1, tmp2; |
|
int id; |
|
|
|
for (i=0;i<order;i++) |
|
qlsp[i]=lsp[i]; |
|
|
|
quant_weight[0] = 1/(qlsp[1]-qlsp[0]); |
|
quant_weight[order-1] = 1/(qlsp[order-1]-qlsp[order-2]); |
|
for (i=1;i<order-1;i++) |
|
{ |
|
#if 1 |
|
tmp1 = 1/((.15+qlsp[i]-qlsp[i-1])*(.15+qlsp[i]-qlsp[i-1])); |
|
tmp2 = 1/((.15+qlsp[i+1]-qlsp[i])*(.15+qlsp[i+1]-qlsp[i])); |
|
#else |
|
tmp1 = 1/(qlsp[i]-qlsp[i-1]); |
|
tmp2 = 1/(qlsp[i+1]-qlsp[i]); |
|
#endif |
|
quant_weight[i] = tmp1 > tmp2 ? tmp1 : tmp2; |
|
} |
|
|
|
for (i=0;i<order;i++) |
|
qlsp[i]-=(.25*i+.25); |
|
for (i=0;i<order;i++) |
|
qlsp[i]*=256; |
|
|
|
id = lsp_quant(qlsp, cdbk_nb, NB_CDBK_SIZE, order); |
|
speex_bits_pack(bits, id, 6); |
|
|
|
for (i=0;i<order;i++) |
|
qlsp[i]*=2; |
|
|
|
id = lsp_weight_quant(qlsp, quant_weight, cdbk_nb_low1, NB_CDBK_SIZE_LOW1, 5); |
|
speex_bits_pack(bits, id, 6); |
|
|
|
id = lsp_weight_quant(qlsp+5, quant_weight+5, cdbk_nb_high1, NB_CDBK_SIZE_HIGH1, 5); |
|
speex_bits_pack(bits, id, 6); |
|
|
|
for (i=0;i<order;i++) |
|
qlsp[i]*=0.0019531; |
|
|
|
for (i=0;i<order;i++) |
|
qlsp[i]=lsp[i]-qlsp[i]; |
|
} |
|
|
|
void lsp_unquant_lbr(float *lsp, int order, SpeexBits *bits) |
|
{ |
|
int i, id; |
|
for (i=0;i<order;i++) |
|
lsp[i]=.25*i+.25; |
|
|
|
|
|
id=speex_bits_unpack_unsigned(bits, 6); |
|
for (i=0;i<10;i++) |
|
lsp[i] += 0.0039062*cdbk_nb[id*10+i]; |
|
|
|
id=speex_bits_unpack_unsigned(bits, 6); |
|
for (i=0;i<5;i++) |
|
lsp[i] += 0.0019531*cdbk_nb_low1[id*5+i]; |
|
|
|
id=speex_bits_unpack_unsigned(bits, 6); |
|
for (i=0;i<5;i++) |
|
lsp[i+5] += 0.0019531*cdbk_nb_high1[id*5+i]; |
|
|
|
} |
|
|
|
|
|
extern signed char high_lsp_cdbk[]; |
|
extern signed char high_lsp_cdbk2[]; |
|
|
|
|
|
void lsp_quant_high(float *lsp, float *qlsp, int order, SpeexBits *bits) |
|
{ |
|
int i; |
|
float tmp1, tmp2; |
|
int id; |
|
for (i=0;i<order;i++) |
|
qlsp[i]=lsp[i]; |
|
|
|
quant_weight[0] = 1/(qlsp[1]-qlsp[0]); |
|
quant_weight[order-1] = 1/(qlsp[order-1]-qlsp[order-2]); |
|
for (i=1;i<order-1;i++) |
|
{ |
|
tmp1 = 1/(qlsp[i]-qlsp[i-1]); |
|
tmp2 = 1/(qlsp[i+1]-qlsp[i]); |
|
quant_weight[i] = tmp1 > tmp2 ? tmp1 : tmp2; |
|
} |
|
|
|
for (i=0;i<order;i++) |
|
qlsp[i]-=(.3125*i+.75); |
|
for (i=0;i<order;i++) |
|
qlsp[i]*=256; |
|
|
|
id = lsp_quant(qlsp, high_lsp_cdbk, 64, order); |
|
speex_bits_pack(bits, id, 6); |
|
|
|
for (i=0;i<order;i++) |
|
qlsp[i]*=2; |
|
|
|
id = lsp_weight_quant(qlsp, quant_weight, high_lsp_cdbk2, 64, order); |
|
speex_bits_pack(bits, id, 6); |
|
|
|
for (i=0;i<order;i++) |
|
qlsp[i]*=0.0019531; |
|
|
|
for (i=0;i<order;i++) |
|
qlsp[i]=lsp[i]-qlsp[i]; |
|
} |
|
|
|
void lsp_unquant_high(float *lsp, int order, SpeexBits *bits) |
|
{ |
|
|
|
int i, id; |
|
for (i=0;i<order;i++) |
|
lsp[i]=.3125*i+.75; |
|
|
|
|
|
id=speex_bits_unpack_unsigned(bits, 6); |
|
for (i=0;i<order;i++) |
|
lsp[i] += 0.0039062*high_lsp_cdbk[id*order+i]; |
|
|
|
|
|
id=speex_bits_unpack_unsigned(bits, 6); |
|
for (i=0;i<order;i++) |
|
lsp[i] += 0.0019531*high_lsp_cdbk2[id*order+i]; |
|
}
|
|
|