开通博客赚积分
发布资源赚积分
分类

源码开发语言/平台
当前位置：首页 > 源码/资料 > 通讯/手机编程 > 语音压缩 > 查看源码
QUA_GAIN.C
资源名称：G711-729.rar　[点击查看]
上传用户：meifeng08
上传日期：2013-06-18
资源大小：5304k
文件大小：19k
源码类别：

语音压缩

开发平台：

C/C++

QUA_GAIN.C：源码内容
  1. /* Version 3.3    Last modified: December 26, 1995 */
  3. #include "typedef.h"
  4. #include "basic_op.h"
  5. #include "oper_32b.h"
  7. #include "ld8k.h"
  8. #include "tab_ld8k.h"
  10. static void Gbk_presel(
  11.    Word16 best_gain[],     /* (i) [0] Q9 : unquantized pitch gain     */
  12.                            /* (i) [1] Q2 : unquantized code gain      */
  13.    Word16 *cand1,          /* (o)    : index of best 1st stage vector */
  14.    Word16 *cand2,          /* (o)    : index of best 2nd stage vector */
  15.    Word16 gcode0           /* (i) Q4 : presearch for gain codebook    */
  16. );
  19. /*---------------------------------------------------------------------------*
  20.  * Function  Qua_gain                                                        *
  21.  * ~~~~~~~~~~~~~~~~~~                                                        *
  22.  * Inputs:                                                                   *
  23.  *   code[]     :Innovative codebook.                                        *
  24.  *   g_coeff[]  :Correlations compute for pitch.                             *
  25.  *   L_subfr    :Subframe length.                                            *
  26.  *                                                                           *
  27.  * Outputs:                                                                  *
  28.  *   gain_pit   :Quantized pitch gain.                                       *
  29.  *   gain_cod   :Quantized code gain.                                        *
  30.  *                                                                           *
  31.  * Return:                                                                   *
  32.  *   Index of quantization.                                                  *
  33.  *                                                                           *
  34.  *--------------------------------------------------------------------------*/
  35. Word16 Qua_gain(
  36.    Word16 code[],       /* (i) Q13 :Innovative vector.             */
  37.    Word16 g_coeff[],    /* (i)     :Correlations <xn y1> -2<y1 y1> */
  38.                         /*            <y2,y2>, -2<xn,y2>, 2<y1,y2> */
  39.    Word16 exp_coeff[],  /* (i)     :Q-Format g_coeff[]             */
  40.    Word16 L_subfr,      /* (i)     :Subframe length.               */
  41.    Word16 *gain_pit,    /* (o) Q14 :Pitch gain.                    */
  42.    Word16 *gain_cod,    /* (o) Q1  :Code gain.                     */
  43.    Word16 tameflag      /* (i)     : set to 1 if taming is needed  */
  44. )
  45. {
  46.    Word16  i, j, index1, index2;
  47.    Word16  cand1, cand2;
  48.    Word16  exp, gcode0, exp_gcode0, gcode0_org, e_min ;
  49.    Word16  nume, denom, inv_denom;
  50.    Word16  exp1,exp2,exp_nume,exp_denom,exp_inv_denom,sft,tmp;
  51.    Word16  g_pitch, g2_pitch, g_code, g2_code, g_pit_cod;
  52.    Word16  coeff[5], coeff_lsf[5];
  53.    Word16  exp_min[5];
  54.    Word32  L_gbk12;
  55.    Word32  L_tmp, L_dist_min, L_temp, L_tmp1, L_tmp2, L_acc, L_accb;
  56.    Word16  best_gain[2];
  58.         /* Gain predictor, Past quantized energies = -14.0 in Q10 */
  60.  static Word16 past_qua_en[4] = { -14336, -14336, -14336, -14336 };
  62.   /*---------------------------------------------------*
  63.    *-  energy due to innovation                       -*
  64.    *-  predicted energy                               -*
  65.    *-  predicted codebook gain => gcode0[exp_gcode0]  -*
  66.    *---------------------------------------------------*/
  68.    Gain_predict( past_qua_en, code, L_subfr, &gcode0, &exp_gcode0 );
  70.   /*-----------------------------------------------------------------*
  71.    *  pre-selection                                                  *
  72.    *-----------------------------------------------------------------*/
  73.   /*-----------------------------------------------------------------*
  74.    *  calculate best gain                                            *
  75.    *                                                                 *
  76.    *  tmp = -1./(4.*coeff[0]*coeff[2]-coeff[4]*coeff[4]) ;           *
  77.    *  best_gain[0] = (2.*coeff[2]*coeff[1]-coeff[3]*coeff[4])*tmp ;  *
  78.    *  best_gain[1] = (2.*coeff[0]*coeff[3]-coeff[1]*coeff[4])*tmp ;  *
  79.    *  gbk_presel(best_gain,&cand1,&cand2,gcode0) ;                   *
  80.    *                                                                 *
  81.    *-----------------------------------------------------------------*/
  83.   /*-----------------------------------------------------------------*
  84.    *  tmp = -1./(4.*coeff[0]*coeff[2]-coeff[4]*coeff[4]) ;           *
  85.    *-----------------------------------------------------------------*/
  86.    L_tmp1 = L_mult( g_coeff[0], g_coeff[2] );
  87.    exp1   = add( add( exp_coeff[0], exp_coeff[2] ), 1-2 );
  88.    L_tmp2 = L_mult( g_coeff[4], g_coeff[4] );
  89.    exp2   = add( add( exp_coeff[4], exp_coeff[4] ), 1 );
  91.    if( sub(exp1, exp2)>0 ){
  92.       L_tmp = L_sub( L_shr( L_tmp1, sub(exp1,exp2) ), L_tmp2 );
  93.       exp = exp2;
  94.    }
  95.    else{
  96.       L_tmp = L_sub( L_tmp1, L_shr( L_tmp2, sub(exp2,exp1) ) );
  97.       exp = exp1;
  98.    }
  99.    sft = norm_l( L_tmp );
  100.    denom = extract_h( L_shl(L_tmp, sft) );
  101.    exp_denom = sub( add( exp, sft ), 16 );
  103.    inv_denom = div_s(16384,denom);
  104.    inv_denom = negate( inv_denom );
  105.    exp_inv_denom = sub( 14+15, exp_denom );
  107.   /*-----------------------------------------------------------------*
  108.    *  best_gain[0] = (2.*coeff[2]*coeff[1]-coeff[3]*coeff[4])*tmp ;  *
  109.    *-----------------------------------------------------------------*/
  110.    L_tmp1 = L_mult( g_coeff[2], g_coeff[1] );
  111.    exp1   = add( exp_coeff[2], exp_coeff[1] );
  112.    L_tmp2 = L_mult( g_coeff[3], g_coeff[4] );
  113.    exp2   = add( add( exp_coeff[3], exp_coeff[4] ), 1 );
  115.    if( sub(exp1, exp2)>0 ){
  116.       L_tmp = L_sub( L_shr( L_tmp1, add(sub(exp1,exp2),1 )), L_shr( L_tmp2,1 ) );
  117.       exp = sub(exp2,1);
  118.    }
  119.    else{
  120.       L_tmp = L_sub( L_shr( L_tmp1,1 ), L_shr( L_tmp2, add(sub(exp2,exp1),1 )) );
  121.       exp = sub(exp1,1);
  122.    }
  123.    sft = norm_l( L_tmp );
  124.    nume = extract_h( L_shl(L_tmp, sft) );
  125.    exp_nume = sub( add( exp, sft ), 16 );
  127.    sft = sub( add( exp_nume, exp_inv_denom ), (9+16-1) );
  128.    L_acc = L_shr( L_mult( nume,inv_denom ), sft );
  129.    best_gain[0] = extract_h( L_acc );             /*-- best_gain[0]:Q9 --*/
  131.    if (tameflag == 1){ 
  132.      if(sub(best_gain[0], GPCLIP2) > 0) best_gain[0] = GPCLIP2;
  133.    }
  135.   /*-----------------------------------------------------------------*
  136.    *  best_gain[1] = (2.*coeff[0]*coeff[3]-coeff[1]*coeff[4])*tmp ;  *
  137.    *-----------------------------------------------------------------*/
  138.    L_tmp1 = L_mult( g_coeff[0], g_coeff[3] );
  139.    exp1   = add( exp_coeff[0], exp_coeff[3] ) ;
  140.    L_tmp2 = L_mult( g_coeff[1], g_coeff[4] );
  141.    exp2   = add( add( exp_coeff[1], exp_coeff[4] ), 1 );
  143.    if( sub(exp1, exp2)>0 ){
  144.       L_tmp = L_sub( L_shr( L_tmp1, add(sub(exp1,exp2),1) ), L_shr( L_tmp2,1 ) );
  145.       exp = sub(exp2,1);
  146.    }
  147.    else{
  148.       L_tmp = L_sub( L_shr( L_tmp1,1 ), L_shr( L_tmp2, add(sub(exp2,exp1),1) ) );
  149.       exp = sub(exp1,1);
  150.    }
  151.    sft = norm_l( L_tmp );
  152.    nume = extract_h( L_shl(L_tmp, sft) );
  153.    exp_nume = sub( add( exp, sft ), 16 );
  155.    sft = sub( add( exp_nume, exp_inv_denom ), (2+16-1) );
  156.    L_acc = L_shr( L_mult( nume,inv_denom ), sft );
  157.    best_gain[1] = extract_h( L_acc );             /*-- best_gain[1]:Q2 --*/
  159.    /*--- Change Q-format of gcode0 ( Q[exp_gcode0] -> Q4 ) ---*/
  160.    if( sub(exp_gcode0,4) >= 0 ){
  161.       gcode0_org = shr( gcode0, sub(exp_gcode0,4) );
  162.    }
  163.    else{
  164.       L_acc = L_deposit_l( gcode0 );
  165.       L_acc = L_shl( L_acc, sub( (4+16), exp_gcode0 ) );
  166.       gcode0_org = extract_h( L_acc );              /*-- gcode0_org:Q4 --*/
  167.    }
  169.   /*----------------------------------------------*
  170.    *   - presearch for gain codebook -            *
  171.    *----------------------------------------------*/
  173.    Gbk_presel(best_gain, &cand1, &cand2, gcode0_org );
  175. /*---------------------------------------------------------------------------*
  176.  *                                                                           *
  177.  * Find the best quantizer.                                                  *
  178.  *                                                                           *
  179.  *  dist_min = MAX_32;                                                       *
  180.  *  for ( i=0 ; i<NCAN1 ; i++ ){                                             *
  181.  *    for ( j=0 ; j<NCAN2 ; j++ ){                                           *
  182.  *      g_pitch = gbk1[cand1+i][0] + gbk2[cand2+j][0];                       *
  184.  *      g_code = gcode0 * (gbk1[cand1+i][1] + gbk2[cand2+j][1]);             *
  185.  *      dist = g_pitch*g_pitch * coeff[0]                                    *
  186.  *           + g_pitch         * coeff[1]                                    *
  187.  *           + g_code*g_code   * coeff[2]                                    *
  188.  *           + g_code          * coeff[3]                                    *
  189.  *           + g_pitch*g_code  * coeff[4] ;                                  *
  190.  *                                                                           *
  191.  *      if (dist < dist_min){                                                *
  192.  *        dist_min = dist;                                                   *
  193.  *        indice1 = cand1 + i ;                                              *
  194.  *        indice2 = cand2 + j ;                                              *
  195.  *      }                                                                    *
  196.  *    }                                                                      *
  197.  *  }                                                                        *
  198.  *                                                                           *
  199.  * g_pitch         = Q13                                                     *
  200.  * g_pitch*g_pitch = Q11:(13+13+1-16)                                        *
  201.  * g_code          = Q[exp_gcode0-3]:(exp_gcode0+(13-1)+1-16)                *
  202.  * g_code*g_code   = Q[2*exp_gcode0-21]:(exp_gcode0-3+exp_gcode0-3+1-16)     *
  203.  * g_pitch*g_code  = Q[exp_gcode0-5]:(13+exp_gcode0-3+1-16)                  *
  204.  *                                                                           *
  205.  * term 0: g_pitch*g_pitch*coeff[0] ;exp_min0 = 13             +exp_coeff[0] *
  206.  * term 1: g_pitch        *coeff[1] ;exp_min1 = 14             +exp_coeff[1] *
  207.  * term 2: g_code*g_code  *coeff[2] ;exp_min2 = 2*exp_gcode0-21+exp_coeff[2] *
  208.  * term 3: g_code         *coeff[3] ;exp_min3 = exp_gcode0  - 3+exp_coeff[3] *
  209.  * term 4: g_pitch*g_code *coeff[4] ;exp_min4 = exp_gcode0  - 4+exp_coeff[4] *
  210.  *                                                                           *
  211.  *---------------------------------------------------------------------------*/
  213.    exp_min[0] = add( exp_coeff[0], 13 );
  214.    exp_min[1] = add( exp_coeff[1], 14 );
  215.    exp_min[2] = add( exp_coeff[2], sub( shl( exp_gcode0, 1 ), 21 ) );
  216.    exp_min[3] = add( exp_coeff[3], sub( exp_gcode0, 3 ) );
  217.    exp_min[4] = add( exp_coeff[4], sub( exp_gcode0, 4 ) );
  219.    e_min = exp_min[0];
  220.    for(i=1; i<5; i++){
  221.       if( sub(exp_min[i], e_min) < 0 ){
  222.          e_min = exp_min[i];
  223.       }
  224.    }
  226.    /* align coeff[] and save in special 32 bit double precision */
  228.    for(i=0; i<5; i++){
  229.      j = sub( exp_min[i], e_min );
  230.      L_tmp = L_deposit_h( g_coeff[i] );
  231.      L_tmp = L_shr( L_tmp, j );          /* L_tmp:Q[exp_g_coeff[i]+16-j] */
  232.      L_Extract( L_tmp, &coeff[i], &coeff_lsf[i] );          /* DPF */
  233.    }
  235.    /* Codebook search */
  237.    L_dist_min = MAX_32;
  239.    /* initialization used only to suppress Microsoft Visual C++  warnings */
  240.    index1 = cand1;
  241.    index2 = cand2;
  243. if(tameflag == 1){
  244.    for(i=0; i<NCAN1; i++){
  245.       for(j=0; j<NCAN2; j++){
  246.          g_pitch = add( gbk1[cand1+i][0], gbk2[cand2+j][0] );     /* Q14 */
  247.          if(g_pitch < GP0999) {
  248.          L_acc = L_deposit_l( gbk1[cand1+i][1] );
  249.          L_accb = L_deposit_l( gbk2[cand2+j][1] );                /* Q13 */
  250.          L_tmp = L_add( L_acc,L_accb );
  251.          tmp = extract_l( L_shr( L_tmp,1 ) );                     /* Q12 */
  253.          g_code   = mult( gcode0, tmp );         /*  Q[exp_gcode0+12-15] */
  254.          g2_pitch = mult(g_pitch, g_pitch);                       /* Q13 */
  255.          g2_code  = mult(g_code,  g_code);       /* Q[2*exp_gcode0-6-15] */
  256.          g_pit_cod= mult(g_code,  g_pitch);      /* Q[exp_gcode0-3+14-15] */
  258.          L_tmp = Mpy_32_16(coeff[0], coeff_lsf[0], g2_pitch);
  259.          L_tmp = L_add(L_tmp, Mpy_32_16(coeff[1], coeff_lsf[1], g_pitch) );
  260.          L_tmp = L_add(L_tmp, Mpy_32_16(coeff[2], coeff_lsf[2], g2_code) );
  261.          L_tmp = L_add(L_tmp, Mpy_32_16(coeff[3], coeff_lsf[3], g_code) );
  262.          L_tmp = L_add(L_tmp, Mpy_32_16(coeff[4], coeff_lsf[4], g_pit_cod) );
  264.          L_temp = L_sub(L_tmp, L_dist_min);
  266.          if( L_temp < 0L ){
  267.             L_dist_min = L_tmp;
  268.             index1 = add(cand1,i);
  269.             index2 = add(cand2,j);
  270.          }
  271.         }
  272.       }
  273.    }
  275. }
  276. else{
  277.    for(i=0; i<NCAN1; i++){
  278.       for(j=0; j<NCAN2; j++){
  279.          g_pitch = add( gbk1[cand1+i][0], gbk2[cand2+j][0] );     /* Q14 */
  280.          L_acc = L_deposit_l( gbk1[cand1+i][1] );
  281.          L_accb = L_deposit_l( gbk2[cand2+j][1] );                /* Q13 */
  282.          L_tmp = L_add( L_acc,L_accb );
  283.          tmp = extract_l( L_shr( L_tmp,1 ) );                     /* Q12 */
  285.          g_code   = mult( gcode0, tmp );         /*  Q[exp_gcode0+12-15] */
  286.          g2_pitch = mult(g_pitch, g_pitch);                       /* Q13 */
  287.          g2_code  = mult(g_code,  g_code);       /* Q[2*exp_gcode0-6-15] */
  288.          g_pit_cod= mult(g_code,  g_pitch);      /* Q[exp_gcode0-3+14-15] */
  290.          L_tmp = Mpy_32_16(coeff[0], coeff_lsf[0], g2_pitch);
  291.          L_tmp = L_add(L_tmp, Mpy_32_16(coeff[1], coeff_lsf[1], g_pitch) );
  292.          L_tmp = L_add(L_tmp, Mpy_32_16(coeff[2], coeff_lsf[2], g2_code) );
  293.          L_tmp = L_add(L_tmp, Mpy_32_16(coeff[3], coeff_lsf[3], g_code) );
  294.          L_tmp = L_add(L_tmp, Mpy_32_16(coeff[4], coeff_lsf[4], g_pit_cod) );
  296.          L_temp = L_sub(L_tmp, L_dist_min);
  298.          if( L_temp < 0L ){
  299.             L_dist_min = L_tmp;
  300.             index1 = add(cand1,i);
  301.             index2 = add(cand2,j);
  302.          }
  304.       }
  305.    }
  306. }
  307.    /* Read the quantized gain */
  309.   /*-----------------------------------------------------------------*
  310.    * *gain_pit = gbk1[indice1][0] + gbk2[indice2][0];                *
  311.    *-----------------------------------------------------------------*/
  312.    *gain_pit = add( gbk1[index1][0], gbk2[index2][0] );      /* Q14 */
  314.   /*-----------------------------------------------------------------*
  315.    * *gain_code = (gbk1[indice1][1]+gbk2[indice2][1]) * gcode0;      *
  316.    *-----------------------------------------------------------------*/
  317.    L_acc = L_deposit_l( gbk1[index1][1] );
  318.    L_accb = L_deposit_l( gbk2[index2][1] );
  319.    L_gbk12 = L_add( L_acc, L_accb );                          /* Q13 */
  320.    tmp = extract_l( L_shr( L_gbk12,1 ) );                     /* Q12 */
  321.    L_acc = L_mult(tmp, gcode0);                /* Q[exp_gcode0+12+1] */
  323.    L_acc = L_shl(L_acc, add( negate(exp_gcode0),(-12-1+1+16) ));
  324.    *gain_cod = extract_h( L_acc );                             /* Q1 */
  326.   /*----------------------------------------------*
  327.    * update table of past quantized energies      *
  328.    *----------------------------------------------*/
  329.    Gain_update( past_qua_en, L_gbk12 );
  331.    return( add( map1[index1]*(Word16)NCODE2, map2[index2] ) );
  333. }
  334. /*---------------------------------------------------------------------------*
  335.  * Function Gbk_presel                                                       *
  336.  * ~~~~~~~~~~~~~~~~~~~                                                       *
  337.  *   - presearch for gain codebook -                                         *
  338.  *---------------------------------------------------------------------------*/
  339. static void Gbk_presel(
  340.    Word16 best_gain[],     /* (i) [0] Q9 : unquantized pitch gain     */
  341.                            /* (i) [1] Q2 : unquantized code gain      */
  342.    Word16 *cand1,          /* (o)    : index of best 1st stage vector */
  343.    Word16 *cand2,          /* (o)    : index of best 2nd stage vector */
  344.    Word16 gcode0           /* (i) Q4 : presearch for gain codebook    */
  345. )
  346. {
  347.    Word16    acc_h;
  348.    Word16    sft_x,sft_y;
  349.    Word32    L_acc,L_preg,L_cfbg,L_tmp,L_tmp_x,L_tmp_y;
  350.    Word32 L_temp;
  352.  /*--------------------------------------------------------------------------*
  353.    x = (best_gain[1]-(coef[0][0]*best_gain[0]+coef[1][1])*gcode0) * inv_coef;
  354.   *--------------------------------------------------------------------------*/
  355.    L_cfbg = L_mult( coef[0][0], best_gain[0] );        /* L_cfbg:Q20 -> !!y */
  356.    L_acc = L_shr( L_coef[1][1], 15 );                  /* L_acc:Q20     */
  357.    L_acc = L_add( L_cfbg , L_acc );
  358.    acc_h = extract_h( L_acc );                         /* acc_h:Q4      */
  359.    L_preg = L_mult( acc_h, gcode0 );                   /* L_preg:Q9     */
  360.    L_acc = L_shl( L_deposit_l( best_gain[1] ), 7 );    /* L_acc:Q9      */
  361.    L_acc = L_sub( L_acc, L_preg );
  362.    acc_h = extract_h( L_shl( L_acc,2 ) );              /* L_acc_h:Q[-5] */
  363.    L_tmp_x = L_mult( acc_h, INV_COEF );                /* L_tmp_x:Q15   */
  365.  /*--------------------------------------------------------------------------*
  366.    y = (coef[1][0]*(-coef[0][1]+best_gain[0]*coef[0][0])*gcode0
  367.                                       -coef[0][0]*best_gain[1]) * inv_coef;
  368.   *--------------------------------------------------------------------------*/
  369.    L_acc = L_shr( L_coef[0][1], 10 );                  /* L_acc:Q20   */
  370.    L_acc = L_sub( L_cfbg, L_acc );                     /* !!x -> L_cfbg:Q20 */
  371.    acc_h = extract_h( L_acc );                         /* acc_h:Q4    */
  372.    acc_h = mult( acc_h, gcode0 );                      /* acc_h:Q[-7] */
  373.    L_tmp = L_mult( acc_h, coef[1][0] );                /* L_tmp:Q10   */
  375.    L_preg = L_mult( coef[0][0], best_gain[1] );        /* L_preg:Q13  */
  376.    L_acc = L_sub( L_tmp, L_shr(L_preg,3) );            /* L_acc:Q10   */
  378.    acc_h = extract_h( L_shl( L_acc,2 ) );              /* acc_h:Q[-4] */
  379.    L_tmp_y = L_mult( acc_h, INV_COEF );                /* L_tmp_y:Q16 */
  381.    sft_y = (14+4+1)-16;         /* (Q[thr1]+Q[gcode0]+1)-Q[L_tmp_y] */
  382.    sft_x = (15+4+1)-15;         /* (Q[thr2]+Q[gcode0]+1)-Q[L_tmp_x] */
  384.    if(gcode0>0){
  385.       /*-- pre select codebook #1 --*/
  386.       *cand1 = 0 ;
  387.       do{
  388.          L_temp = L_sub( L_tmp_y, L_shr(L_mult(thr1[*cand1],gcode0),sft_y));
  389.          if(L_temp >0L  ){
  390.         (*cand1) =add(*cand1,1);
  391.      }
  392.          else               break ;
  393.       } while(sub((*cand1),(NCODE1-NCAN1))<0) ;
  394.       /*-- pre select codebook #2 --*/
  395.       *cand2 = 0 ;
  396.       do{
  397.         L_temp = L_sub( L_tmp_x , L_shr(L_mult(thr2[*cand2],gcode0),sft_x));
  398.          if( L_temp >0L) {
  399.         (*cand2) =add(*cand2,1);
  400.      }
  401.          else               break ;
  402.       } while(sub((*cand2),(NCODE2-NCAN2))<0) ;
  403.    }
  404.    else{
  405.       /*-- pre select codebook #1 --*/
  406.       *cand1 = 0 ;
  407.       do{
  408.         L_temp = L_sub(L_tmp_y ,L_shr(L_mult(thr1[*cand1],gcode0),sft_y));
  409.          if( L_temp <0L){
  410.         (*cand1) =add(*cand1,1);
  411.      }
  412.          else               break ;
  413.       } while(sub((*cand1),(NCODE1-NCAN1))) ;
  414.       /*-- pre select codebook #2 --*/
  415.       *cand2 = 0 ;
  416.       do{
  417.          L_temp =L_sub(L_tmp_x ,L_shr(L_mult(thr2[*cand2],gcode0),sft_x));
  418.          if( L_temp <0L){
  419.         (*cand2) =add(*cand2,1);
  420.      }
  421.          else               break ;
  422.       } while(sub( (*cand2),(NCODE2-NCAN2))) ;
  423.    }
  425.    return ;
  426. }