falkTX
/
FFmpeg
mirror of https://github.com/falkTX/FFmpeg.git
1
0
Fork 0
Code Issues 0 Releases 338 Wiki Activity
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.
8887 Commits
32 Branches
687MB
Tree: 319708da02
Branches Tags
${ item.name }
Create branch ${ searchTerm }
from '319708da02'
${ noResults }
FFmpeg/libavcodec/ac3enc.c

1373 lines
38KB
Raw Blame History 

  1. /*

  2.  * The simplest AC3 encoder

  3.  * Copyright (c) 2000 Fabrice Bellard.

  4.  *

  5.  * This file is part of FFmpeg.

  6.  *

  7.  * FFmpeg is free software; you can redistribute it and/or

  8.  * modify it under the terms of the GNU Lesser General Public

  9.  * License as published by the Free Software Foundation; either

  10.  * version 2.1 of the License, or (at your option) any later version.

  11.  *

  12.  * FFmpeg is distributed in the hope that it will be useful,

  13.  * but WITHOUT ANY WARRANTY; without even the implied warranty of

  14.  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU

  15.  * Lesser General Public License for more details.

  16.  *

  17.  * You should have received a copy of the GNU Lesser General Public

  18.  * License along with FFmpeg; if not, write to the Free Software

  19.  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA

  20.  */

  21. 

  22. /**

  23.  * @file ac3enc.c

  24.  * The simplest AC3 encoder.

  25.  */

  26. //#define DEBUG

  27. //#define DEBUG_BITALLOC

  28. #include "avcodec.h"

  29. #include "bitstream.h"

  30. #include "crc.h"

  31. #include "ac3.h"

  32. 

  33. typedef struct AC3EncodeContext {

  34.     PutBitContext pb;

  35.     int nb_channels;

  36.     int nb_all_channels;

  37.     int lfe_channel;

  38.     int bit_rate;

  39.     unsigned int sample_rate;

  40.     unsigned int bsid;

  41.     unsigned int frame_size_min; /* minimum frame size in case rounding is necessary */

  42.     unsigned int frame_size; /* current frame size in words */

  43.     unsigned int bits_written;

  44.     unsigned int samples_written;

  45.     int halfratecod;

  46.     unsigned int frmsizecod;

  47.     unsigned int fscod; /* frequency */

  48.     unsigned int acmod;

  49.     int lfe;

  50.     unsigned int bsmod;

  51.     short last_samples[AC3_MAX_CHANNELS][256];

  52.     unsigned int chbwcod[AC3_MAX_CHANNELS];

  53.     int nb_coefs[AC3_MAX_CHANNELS];

  54. 

  55.     /* bitrate allocation control */

  56.     int sgaincod, sdecaycod, fdecaycod, dbkneecod, floorcod;

  57.     AC3BitAllocParameters bit_alloc;

  58.     int csnroffst;

  59.     int fgaincod[AC3_MAX_CHANNELS];

  60.     int fsnroffst[AC3_MAX_CHANNELS];

  61.     /* mantissa encoding */

  62.     int mant1_cnt, mant2_cnt, mant4_cnt;

  63. } AC3EncodeContext;

  64. 

  65. static int16_t costab[64];

  66. static int16_t sintab[64];

  67. static int16_t fft_rev[512];

  68. static int16_t xcos1[128];

  69. static int16_t xsin1[128];

  70. 

  71. #define MDCT_NBITS 9

  72. #define N         (1 << MDCT_NBITS)

  73. 

  74. /* new exponents are sent if their Norm 1 exceed this number */

  75. #define EXP_DIFF_THRESHOLD 1000

  76. 

  77. static void fft_init(int ln);

  78. 

  79. static inline int16_t fix15(float a)

  80. {

  81.     int v;

  82.     v = (int)(a * (float)(1 << 15));

  83.     if (v < -32767)

  84.         v = -32767;

  85.     else if (v > 32767)

  86.         v = 32767;

  87.     return v;

  88. }

  89. 

  90. typedef struct IComplex {

  91.     short re,im;

  92. } IComplex;

  93. 

  94. static void fft_init(int ln)

  95. {

  96.     int i, j, m, n;

  97.     float alpha;

  98. 

  99.     n = 1 << ln;

  100. 

  101.     for(i=0;i<(n/2);i++) {

  102.         alpha = 2 * M_PI * (float)i / (float)n;

  103.         costab[i] = fix15(cos(alpha));

  104.         sintab[i] = fix15(sin(alpha));

  105.     }

  106. 

  107.     for(i=0;i<n;i++) {

  108.         m=0;

  109.         for(j=0;j<ln;j++) {

  110.             m |= ((i >> j) & 1) << (ln-j-1);

  111.         }

  112.         fft_rev[i]=m;

  113.     }

  114. }

  115. 

  116. /* butter fly op */

  117. #define BF(pre, pim, qre, qim, pre1, pim1, qre1, qim1) \

  118. {\

  119.   int ax, ay, bx, by;\

  120.   bx=pre1;\

  121.   by=pim1;\

  122.   ax=qre1;\

  123.   ay=qim1;\

  124.   pre = (bx + ax) >> 1;\

  125.   pim = (by + ay) >> 1;\

  126.   qre = (bx - ax) >> 1;\

  127.   qim = (by - ay) >> 1;\

  128. }

  129. 

  130. #define MUL16(a,b) ((a) * (b))

  131. 

  132. #define CMUL(pre, pim, are, aim, bre, bim) \

  133. {\

  134.    pre = (MUL16(are, bre) - MUL16(aim, bim)) >> 15;\

  135.    pim = (MUL16(are, bim) + MUL16(bre, aim)) >> 15;\

  136. }

  137. 

  138. 

  139. /* do a 2^n point complex fft on 2^ln points. */

  140. static void fft(IComplex *z, int ln)

  141. {

  142.     int        j, l, np, np2;

  143.     int        nblocks, nloops;

  144.     register IComplex *p,*q;

  145.     int tmp_re, tmp_im;

  146. 

  147.     np = 1 << ln;

  148. 

  149.     /* reverse */

  150.     for(j=0;j<np;j++) {

  151.         int k;

  152.         IComplex tmp;

  153.         k = fft_rev[j];

  154.         if (k < j) {

  155.             tmp = z[k];

  156.             z[k] = z[j];

  157.             z[j] = tmp;

  158.         }

  159.     }

  160. 

  161.     /* pass 0 */

  162. 

  163.     p=&z[0];

  164.     j=(np >> 1);

  165.     do {

  166.         BF(p[0].re, p[0].im, p[1].re, p[1].im,

  167.            p[0].re, p[0].im, p[1].re, p[1].im);

  168.         p+=2;

  169.     } while (--j != 0);

  170. 

  171.     /* pass 1 */

  172. 

  173.     p=&z[0];

  174.     j=np >> 2;

  175.     do {

  176.         BF(p[0].re, p[0].im, p[2].re, p[2].im,

  177.            p[0].re, p[0].im, p[2].re, p[2].im);

  178.         BF(p[1].re, p[1].im, p[3].re, p[3].im,

  179.            p[1].re, p[1].im, p[3].im, -p[3].re);

  180.         p+=4;

  181.     } while (--j != 0);

  182. 

  183.     /* pass 2 .. ln-1 */

  184. 

  185.     nblocks = np >> 3;

  186.     nloops = 1 << 2;

  187.     np2 = np >> 1;

  188.     do {

  189.         p = z;

  190.         q = z + nloops;

  191.         for (j = 0; j < nblocks; ++j) {

  192. 

  193.             BF(p->re, p->im, q->re, q->im,

  194.                p->re, p->im, q->re, q->im);

  195. 

  196.             p++;

  197.             q++;

  198.             for(l = nblocks; l < np2; l += nblocks) {

  199.                 CMUL(tmp_re, tmp_im, costab[l], -sintab[l], q->re, q->im);

  200.                 BF(p->re, p->im, q->re, q->im,

  201.                    p->re, p->im, tmp_re, tmp_im);

  202.                 p++;

  203.                 q++;

  204.             }

  205.             p += nloops;

  206.             q += nloops;

  207.         }

  208.         nblocks = nblocks >> 1;

  209.         nloops = nloops << 1;

  210.     } while (nblocks != 0);

  211. }

  212. 

  213. /* do a 512 point mdct */

  214. static void mdct512(int32_t *out, int16_t *in)

  215. {

  216.     int i, re, im, re1, im1;

  217.     int16_t rot[N];

  218.     IComplex x[N/4];

  219. 

  220.     /* shift to simplify computations */

  221.     for(i=0;i<N/4;i++)

  222.         rot[i] = -in[i + 3*N/4];

  223.     for(i=N/4;i<N;i++)

  224.         rot[i] = in[i - N/4];

  225. 

  226.     /* pre rotation */

  227.     for(i=0;i<N/4;i++) {

  228.         re = ((int)rot[2*i] - (int)rot[N-1-2*i]) >> 1;

  229.         im = -((int)rot[N/2+2*i] - (int)rot[N/2-1-2*i]) >> 1;

  230.         CMUL(x[i].re, x[i].im, re, im, -xcos1[i], xsin1[i]);

  231.     }

  232. 

  233.     fft(x, MDCT_NBITS - 2);

  234. 

  235.     /* post rotation */

  236.     for(i=0;i<N/4;i++) {

  237.         re = x[i].re;

  238.         im = x[i].im;

  239.         CMUL(re1, im1, re, im, xsin1[i], xcos1[i]);

  240.         out[2*i] = im1;

  241.         out[N/2-1-2*i] = re1;

  242.     }

  243. }

  244. 

  245. /* XXX: use another norm ? */

  246. static int calc_exp_diff(uint8_t *exp1, uint8_t *exp2, int n)

  247. {

  248.     int sum, i;

  249.     sum = 0;

  250.     for(i=0;i<n;i++) {

  251.         sum += abs(exp1[i] - exp2[i]);

  252.     }

  253.     return sum;

  254. }

  255. 

  256. static void compute_exp_strategy(uint8_t exp_strategy[NB_BLOCKS][AC3_MAX_CHANNELS],

  257.                                  uint8_t exp[NB_BLOCKS][AC3_MAX_CHANNELS][N/2],

  258.                                  int ch, int is_lfe)

  259. {

  260.     int i, j;

  261.     int exp_diff;

  262. 

  263.     /* estimate if the exponent variation & decide if they should be

  264.        reused in the next frame */

  265.     exp_strategy[0][ch] = EXP_NEW;

  266.     for(i=1;i<NB_BLOCKS;i++) {

  267.         exp_diff = calc_exp_diff(exp[i][ch], exp[i-1][ch], N/2);

  268. #ifdef DEBUG

  269.         av_log(NULL, AV_LOG_DEBUG, "exp_diff=%d\n", exp_diff);

  270. #endif

  271.         if (exp_diff > EXP_DIFF_THRESHOLD)

  272.             exp_strategy[i][ch] = EXP_NEW;

  273.         else

  274.             exp_strategy[i][ch] = EXP_REUSE;

  275.     }

  276.     if (is_lfe)

  277.         return;

  278. 

  279.     /* now select the encoding strategy type : if exponents are often

  280.        recoded, we use a coarse encoding */

  281.     i = 0;

  282.     while (i < NB_BLOCKS) {

  283.         j = i + 1;

  284.         while (j < NB_BLOCKS && exp_strategy[j][ch] == EXP_REUSE)

  285.             j++;

  286.         switch(j - i) {

  287.         case 1:

  288.             exp_strategy[i][ch] = EXP_D45;

  289.             break;

  290.         case 2:

  291.         case 3:

  292.             exp_strategy[i][ch] = EXP_D25;

  293.             break;

  294.         default:

  295.             exp_strategy[i][ch] = EXP_D15;

  296.             break;

  297.         }

  298.         i = j;

  299.     }

  300. }

  301. 

  302. /* set exp[i] to min(exp[i], exp1[i]) */

  303. static void exponent_min(uint8_t exp[N/2], uint8_t exp1[N/2], int n)

  304. {

  305.     int i;

  306. 

  307.     for(i=0;i<n;i++) {

  308.         if (exp1[i] < exp[i])

  309.             exp[i] = exp1[i];

  310.     }

  311. }

  312. 

  313. /* update the exponents so that they are the ones the decoder will

  314.    decode. Return the number of bits used to code the exponents */

  315. static int encode_exp(uint8_t encoded_exp[N/2],

  316.                       uint8_t exp[N/2],

  317.                       int nb_exps,

  318.                       int exp_strategy)

  319. {

  320.     int group_size, nb_groups, i, j, k, exp_min;

  321.     uint8_t exp1[N/2];

  322. 

  323.     switch(exp_strategy) {

  324.     case EXP_D15:

  325.         group_size = 1;

  326.         break;

  327.     case EXP_D25:

  328.         group_size = 2;

  329.         break;

  330.     default:

  331.     case EXP_D45:

  332.         group_size = 4;

  333.         break;

  334.     }

  335.     nb_groups = ((nb_exps + (group_size * 3) - 4) / (3 * group_size)) * 3;

  336. 

  337.     /* for each group, compute the minimum exponent */

  338.     exp1[0] = exp[0]; /* DC exponent is handled separately */

  339.     k = 1;

  340.     for(i=1;i<=nb_groups;i++) {

  341.         exp_min = exp[k];

  342.         assert(exp_min >= 0 && exp_min <= 24);

  343.         for(j=1;j<group_size;j++) {

  344.             if (exp[k+j] < exp_min)

  345.                 exp_min = exp[k+j];

  346.         }

  347.         exp1[i] = exp_min;

  348.         k += group_size;

  349.     }

  350. 

  351.     /* constraint for DC exponent */

  352.     if (exp1[0] > 15)

  353.         exp1[0] = 15;

  354. 

  355.     /* Decrease the delta between each groups to within 2

  356.      * so that they can be differentially encoded */

  357.     for (i=1;i<=nb_groups;i++)

  358.         exp1[i] = FFMIN(exp1[i], exp1[i-1] + 2);

  359.     for (i=nb_groups-1;i>=0;i--)

  360.         exp1[i] = FFMIN(exp1[i], exp1[i+1] + 2);

  361. 

  362.     /* now we have the exponent values the decoder will see */

  363.     encoded_exp[0] = exp1[0];

  364.     k = 1;

  365.     for(i=1;i<=nb_groups;i++) {

  366.         for(j=0;j<group_size;j++) {

  367.             encoded_exp[k+j] = exp1[i];

  368.         }

  369.         k += group_size;

  370.     }

  371. 

  372. #if defined(DEBUG)

  373.     av_log(NULL, AV_LOG_DEBUG, "exponents: strategy=%d\n", exp_strategy);

  374.     for(i=0;i<=nb_groups * group_size;i++) {

  375.         av_log(NULL, AV_LOG_DEBUG, "%d ", encoded_exp[i]);

  376.     }

  377.     av_log(NULL, AV_LOG_DEBUG, "\n");

  378. #endif

  379. 

  380.     return 4 + (nb_groups / 3) * 7;

  381. }

  382. 

  383. /* return the size in bits taken by the mantissa */

  384. static int compute_mantissa_size(AC3EncodeContext *s, uint8_t *m, int nb_coefs)

  385. {

  386.     int bits, mant, i;

  387. 

  388.     bits = 0;

  389.     for(i=0;i<nb_coefs;i++) {

  390.         mant = m[i];

  391.         switch(mant) {

  392.         case 0:

  393.             /* nothing */

  394.             break;

  395.         case 1:

  396.             /* 3 mantissa in 5 bits */

  397.             if (s->mant1_cnt == 0)

  398.                 bits += 5;

  399.             if (++s->mant1_cnt == 3)

  400.                 s->mant1_cnt = 0;

  401.             break;

  402.         case 2:

  403.             /* 3 mantissa in 7 bits */

  404.             if (s->mant2_cnt == 0)

  405.                 bits += 7;

  406.             if (++s->mant2_cnt == 3)

  407.                 s->mant2_cnt = 0;

  408.             break;

  409.         case 3:

  410.             bits += 3;

  411.             break;

  412.         case 4:

  413.             /* 2 mantissa in 7 bits */

  414.             if (s->mant4_cnt == 0)

  415.                 bits += 7;

  416.             if (++s->mant4_cnt == 2)

  417.                 s->mant4_cnt = 0;

  418.             break;

  419.         case 14:

  420.             bits += 14;

  421.             break;

  422.         case 15:

  423.             bits += 16;

  424.             break;

  425.         default:

  426.             bits += mant - 1;

  427.             break;

  428.         }

  429.     }

  430.     return bits;

  431. }

  432. 

  433. 

  434. static void bit_alloc_masking(AC3EncodeContext *s,

  435.                               uint8_t encoded_exp[NB_BLOCKS][AC3_MAX_CHANNELS][N/2],

  436.                               uint8_t exp_strategy[NB_BLOCKS][AC3_MAX_CHANNELS],

  437.                               int16_t psd[NB_BLOCKS][AC3_MAX_CHANNELS][N/2],

  438.                               int16_t mask[NB_BLOCKS][AC3_MAX_CHANNELS][50])

  439. {

  440.     int blk, ch;

  441.     int16_t bndpsd[NB_BLOCKS][AC3_MAX_CHANNELS][50];

  442. 

  443.     for(blk=0; blk<NB_BLOCKS; blk++) {

  444.         for(ch=0;ch<s->nb_all_channels;ch++) {

  445.             if(exp_strategy[blk][ch] == EXP_REUSE) {

  446.                 memcpy(psd[blk][ch], psd[blk-1][ch], (N/2)*sizeof(int16_t));

  447.                 memcpy(mask[blk][ch], mask[blk-1][ch], 50*sizeof(int16_t));

  448.             } else {

  449.                 ff_ac3_bit_alloc_calc_psd(encoded_exp[blk][ch], 0,

  450.                                           s->nb_coefs[ch],

  451.                                           psd[blk][ch], bndpsd[blk][ch]);

  452.                 ff_ac3_bit_alloc_calc_mask(&s->bit_alloc, bndpsd[blk][ch],

  453.                                            0, s->nb_coefs[ch],

  454.                                            ff_fgaintab[s->fgaincod[ch]],

  455.                                            ch == s->lfe_channel,

  456.                                            2, 0, NULL, NULL, NULL,

  457.                                            mask[blk][ch]);

  458.             }

  459.         }

  460.     }

  461. }

  462. 

  463. static int bit_alloc(AC3EncodeContext *s,

  464.                      int16_t mask[NB_BLOCKS][AC3_MAX_CHANNELS][50],

  465.                      int16_t psd[NB_BLOCKS][AC3_MAX_CHANNELS][N/2],

  466.                      uint8_t bap[NB_BLOCKS][AC3_MAX_CHANNELS][N/2],

  467.                      int frame_bits, int csnroffst, int fsnroffst)

  468. {

  469.     int i, ch;

  470.     int snroffset;

  471. 

  472.     snroffset = (((csnroffst - 15) << 4) + fsnroffst) << 2;

  473. 

  474.     /* compute size */

  475.     for(i=0;i<NB_BLOCKS;i++) {

  476.         s->mant1_cnt = 0;

  477.         s->mant2_cnt = 0;

  478.         s->mant4_cnt = 0;

  479.         for(ch=0;ch<s->nb_all_channels;ch++) {

  480.             ff_ac3_bit_alloc_calc_bap(mask[i][ch], psd[i][ch],

  481.                                           0, s->nb_coefs[ch],

  482.                                       snroffset,

  483.                                       s->bit_alloc.floor, bap[i][ch]);

  484.             frame_bits += compute_mantissa_size(s, bap[i][ch],

  485.                                                  s->nb_coefs[ch]);

  486.         }

  487.     }

  488. #if 0

  489.     printf("csnr=%d fsnr=%d frame_bits=%d diff=%d\n",

  490.            csnroffst, fsnroffst, frame_bits,

  491.            16 * s->frame_size - ((frame_bits + 7) & ~7));

  492. #endif

  493.     return 16 * s->frame_size - frame_bits;

  494. }

  495. 

  496. #define SNR_INC1 4

  497. 

  498. static int compute_bit_allocation(AC3EncodeContext *s,

  499.                                   uint8_t bap[NB_BLOCKS][AC3_MAX_CHANNELS][N/2],

  500.                                   uint8_t encoded_exp[NB_BLOCKS][AC3_MAX_CHANNELS][N/2],

  501.                                   uint8_t exp_strategy[NB_BLOCKS][AC3_MAX_CHANNELS],

  502.                                   int frame_bits)

  503. {

  504.     int i, ch;

  505.     int csnroffst, fsnroffst;

  506.     uint8_t bap1[NB_BLOCKS][AC3_MAX_CHANNELS][N/2];

  507.     int16_t psd[NB_BLOCKS][AC3_MAX_CHANNELS][N/2];

  508.     int16_t mask[NB_BLOCKS][AC3_MAX_CHANNELS][50];

  509.     static int frame_bits_inc[8] = { 0, 0, 2, 2, 2, 4, 2, 4 };

  510. 

  511.     /* init default parameters */

  512.     s->sdecaycod = 2;

  513.     s->fdecaycod = 1;

  514.     s->sgaincod = 1;

  515.     s->dbkneecod = 2;

  516.     s->floorcod = 4;

  517.     for(ch=0;ch<s->nb_all_channels;ch++)

  518.         s->fgaincod[ch] = 4;

  519. 

  520.     /* compute real values */

  521.     s->bit_alloc.fscod = s->fscod;

  522.     s->bit_alloc.halfratecod = s->halfratecod;

  523.     s->bit_alloc.sdecay = ff_sdecaytab[s->sdecaycod] >> s->halfratecod;

  524.     s->bit_alloc.fdecay = ff_fdecaytab[s->fdecaycod] >> s->halfratecod;

  525.     s->bit_alloc.sgain = ff_sgaintab[s->sgaincod];

  526.     s->bit_alloc.dbknee = ff_dbkneetab[s->dbkneecod];

  527.     s->bit_alloc.floor = ff_floortab[s->floorcod];

  528. 

  529.     /* header size */

  530.     frame_bits += 65;

  531.     // if (s->acmod == 2)

  532.     //    frame_bits += 2;

  533.     frame_bits += frame_bits_inc[s->acmod];

  534. 

  535.     /* audio blocks */

  536.     for(i=0;i<NB_BLOCKS;i++) {

  537.         frame_bits += s->nb_channels * 2 + 2; /* blksw * c, dithflag * c, dynrnge, cplstre */

  538.         if (s->acmod == 2) {

  539.             frame_bits++; /* rematstr */

  540.             if(i==0) frame_bits += 4;

  541.         }

  542.         frame_bits += 2 * s->nb_channels; /* chexpstr[2] * c */

  543.         if (s->lfe)

  544.             frame_bits++; /* lfeexpstr */

  545.         for(ch=0;ch<s->nb_channels;ch++) {

  546.             if (exp_strategy[i][ch] != EXP_REUSE)

  547.                 frame_bits += 6 + 2; /* chbwcod[6], gainrng[2] */

  548.         }

  549.         frame_bits++; /* baie */

  550.         frame_bits++; /* snr */

  551.         frame_bits += 2; /* delta / skip */

  552.     }

  553.     frame_bits++; /* cplinu for block 0 */

  554.     /* bit alloc info */

  555.     /* sdcycod[2], fdcycod[2], sgaincod[2], dbpbcod[2], floorcod[3] */

  556.     /* csnroffset[6] */

  557.     /* (fsnoffset[4] + fgaincod[4]) * c */

  558.     frame_bits += 2*4 + 3 + 6 + s->nb_all_channels * (4 + 3);

  559. 

  560.     /* auxdatae, crcrsv */

  561.     frame_bits += 2;

  562. 

  563.     /* CRC */

  564.     frame_bits += 16;

  565. 

  566.     /* calculate psd and masking curve before doing bit allocation */

  567.     bit_alloc_masking(s, encoded_exp, exp_strategy, psd, mask);

  568. 

  569.     /* now the big work begins : do the bit allocation. Modify the snr

  570.        offset until we can pack everything in the requested frame size */

  571. 

  572.     csnroffst = s->csnroffst;

  573.     while (csnroffst >= 0 &&

  574.            bit_alloc(s, mask, psd, bap, frame_bits, csnroffst, 0) < 0)

  575.         csnroffst -= SNR_INC1;

  576.     if (csnroffst < 0) {

  577.         av_log(NULL, AV_LOG_ERROR, "Bit allocation failed, try increasing the bitrate, -ab 384 for example!\n");

  578.         return -1;

  579.     }

  580.     while ((csnroffst + SNR_INC1) <= 63 &&

  581.            bit_alloc(s, mask, psd, bap1, frame_bits,

  582.                      csnroffst + SNR_INC1, 0) >= 0) {

  583.         csnroffst += SNR_INC1;

  584.         memcpy(bap, bap1, sizeof(bap1));

  585.     }

  586.     while ((csnroffst + 1) <= 63 &&

  587.            bit_alloc(s, mask, psd, bap1, frame_bits, csnroffst + 1, 0) >= 0) {

  588.         csnroffst++;

  589.         memcpy(bap, bap1, sizeof(bap1));

  590.     }

  591. 

  592.     fsnroffst = 0;

  593.     while ((fsnroffst + SNR_INC1) <= 15 &&

  594.            bit_alloc(s, mask, psd, bap1, frame_bits,

  595.                      csnroffst, fsnroffst + SNR_INC1) >= 0) {

  596.         fsnroffst += SNR_INC1;

  597.         memcpy(bap, bap1, sizeof(bap1));

  598.     }

  599.     while ((fsnroffst + 1) <= 15 &&

  600.            bit_alloc(s, mask, psd, bap1, frame_bits,

  601.                      csnroffst, fsnroffst + 1) >= 0) {

  602.         fsnroffst++;

  603.         memcpy(bap, bap1, sizeof(bap1));

  604.     }

  605. 

  606.     s->csnroffst = csnroffst;

  607.     for(ch=0;ch<s->nb_all_channels;ch++)

  608.         s->fsnroffst[ch] = fsnroffst;

  609. #if defined(DEBUG_BITALLOC)

  610.     {

  611.         int j;

  612. 

  613.         for(i=0;i<6;i++) {

  614.             for(ch=0;ch<s->nb_all_channels;ch++) {

  615.                 printf("Block #%d Ch%d:\n", i, ch);

  616.                 printf("bap=");

  617.                 for(j=0;j<s->nb_coefs[ch];j++) {

  618.                     printf("%d ",bap[i][ch][j]);

  619.                 }

  620.                 printf("\n");

  621.             }

  622.         }

  623.     }

  624. #endif

  625.     return 0;

  626. }

  627. 

  628. static int AC3_encode_init(AVCodecContext *avctx)

  629. {

  630.     int freq = avctx->sample_rate;

  631.     int bitrate = avctx->bit_rate;

  632.     int channels = avctx->channels;

  633.     AC3EncodeContext *s = avctx->priv_data;

  634.     int i, j, ch;

  635.     float alpha;

  636.     static const uint8_t acmod_defs[6] = {

  637.         0x01, /* C */

  638.         0x02, /* L R */

  639.         0x03, /* L C R */

  640.         0x06, /* L R SL SR */

  641.         0x07, /* L C R SL SR */

  642.         0x07, /* L C R SL SR (+LFE) */

  643.     };

  644. 

  645.     avctx->frame_size = AC3_FRAME_SIZE;

  646. 

  647.     ac3_common_init();

  648. 

  649.     /* number of channels */

  650.     if (channels < 1 || channels > 6)

  651.         return -1;

  652.     s->acmod = acmod_defs[channels - 1];

  653.     s->lfe = (channels == 6) ? 1 : 0;

  654.     s->nb_all_channels = channels;

  655.     s->nb_channels = channels > 5 ? 5 : channels;

  656.     s->lfe_channel = s->lfe ? 5 : -1;

  657. 

  658.     /* frequency */

  659.     for(i=0;i<3;i++) {

  660.         for(j=0;j<3;j++)

  661.             if ((ff_ac3_freqs[j] >> i) == freq)

  662.                 goto found;

  663.     }

  664.     return -1;

  665.  found:

  666.     s->sample_rate = freq;

  667.     s->halfratecod = i;

  668.     s->fscod = j;

  669.     s->bsid = 8 + s->halfratecod;

  670.     s->bsmod = 0; /* complete main audio service */

  671. 

  672.     /* bitrate & frame size */

  673.     bitrate /= 1000;

  674.     for(i=0;i<19;i++) {

  675.         if ((ff_ac3_bitratetab[i] >> s->halfratecod) == bitrate)

  676.             break;

  677.     }

  678.     if (i == 19)

  679.         return -1;

  680.     s->bit_rate = bitrate;

  681.     s->frmsizecod = i << 1;

  682.     s->frame_size_min = ff_ac3_frame_sizes[s->frmsizecod][s->fscod];

  683.     s->bits_written = 0;

  684.     s->samples_written = 0;

  685.     s->frame_size = s->frame_size_min;

  686. 

  687.     /* bit allocation init */

  688.     for(ch=0;ch<s->nb_channels;ch++) {

  689.         /* bandwidth for each channel */

  690.         /* XXX: should compute the bandwidth according to the frame

  691.            size, so that we avoid anoying high freq artefacts */

  692.         s->chbwcod[ch] = 50; /* sample bandwidth as mpeg audio layer 2 table 0 */

  693.         s->nb_coefs[ch] = ((s->chbwcod[ch] + 12) * 3) + 37;

  694.     }

  695.     if (s->lfe) {

  696.         s->nb_coefs[s->lfe_channel] = 7; /* fixed */

  697.     }

  698.     /* initial snr offset */

  699.     s->csnroffst = 40;

  700. 

  701.     /* mdct init */

  702.     fft_init(MDCT_NBITS - 2);

  703.     for(i=0;i<N/4;i++) {

  704.         alpha = 2 * M_PI * (i + 1.0 / 8.0) / (float)N;

  705.         xcos1[i] = fix15(-cos(alpha));

  706.         xsin1[i] = fix15(-sin(alpha));

  707.     }

  708. 

  709.     avctx->coded_frame= avcodec_alloc_frame();

  710.     avctx->coded_frame->key_frame= 1;

  711. 

  712.     return 0;

  713. }

  714. 

  715. /* output the AC3 frame header */

  716. static void output_frame_header(AC3EncodeContext *s, unsigned char *frame)

  717. {

  718.     init_put_bits(&s->pb, frame, AC3_MAX_CODED_FRAME_SIZE);

  719. 

  720.     put_bits(&s->pb, 16, 0x0b77); /* frame header */

  721.     put_bits(&s->pb, 16, 0); /* crc1: will be filled later */

  722.     put_bits(&s->pb, 2, s->fscod);

  723.     put_bits(&s->pb, 6, s->frmsizecod + (s->frame_size - s->frame_size_min));

  724.     put_bits(&s->pb, 5, s->bsid);

  725.     put_bits(&s->pb, 3, s->bsmod);

  726.     put_bits(&s->pb, 3, s->acmod);

  727.     if ((s->acmod & 0x01) && s->acmod != 0x01)

  728.         put_bits(&s->pb, 2, 1); /* XXX -4.5 dB */

  729.     if (s->acmod & 0x04)

  730.         put_bits(&s->pb, 2, 1); /* XXX -6 dB */

  731.     if (s->acmod == 0x02)

  732.         put_bits(&s->pb, 2, 0); /* surround not indicated */

  733.     put_bits(&s->pb, 1, s->lfe); /* LFE */

  734.     put_bits(&s->pb, 5, 31); /* dialog norm: -31 db */

  735.     put_bits(&s->pb, 1, 0); /* no compression control word */

  736.     put_bits(&s->pb, 1, 0); /* no lang code */

  737.     put_bits(&s->pb, 1, 0); /* no audio production info */

  738.     put_bits(&s->pb, 1, 0); /* no copyright */

  739.     put_bits(&s->pb, 1, 1); /* original bitstream */

  740.     put_bits(&s->pb, 1, 0); /* no time code 1 */

  741.     put_bits(&s->pb, 1, 0); /* no time code 2 */

  742.     put_bits(&s->pb, 1, 0); /* no addtional bit stream info */

  743. }

  744. 

  745. /* symetric quantization on 'levels' levels */

  746. static inline int sym_quant(int c, int e, int levels)

  747. {

  748.     int v;

  749. 

  750.     if (c >= 0) {

  751.         v = (levels * (c << e)) >> 24;

  752.         v = (v + 1) >> 1;

  753.         v = (levels >> 1) + v;

  754.     } else {

  755.         v = (levels * ((-c) << e)) >> 24;

  756.         v = (v + 1) >> 1;

  757.         v = (levels >> 1) - v;

  758.     }

  759.     assert (v >= 0 && v < levels);

  760.     return v;

  761. }

  762. 

  763. /* asymetric quantization on 2^qbits levels */

  764. static inline int asym_quant(int c, int e, int qbits)

  765. {

  766.     int lshift, m, v;

  767. 

  768.     lshift = e + qbits - 24;

  769.     if (lshift >= 0)

  770.         v = c << lshift;

  771.     else

  772.         v = c >> (-lshift);

  773.     /* rounding */

  774.     v = (v + 1) >> 1;

  775.     m = (1 << (qbits-1));

  776.     if (v >= m)

  777.         v = m - 1;

  778.     assert(v >= -m);

  779.     return v & ((1 << qbits)-1);

  780. }

  781. 

  782. /* Output one audio block. There are NB_BLOCKS audio blocks in one AC3

  783.    frame */

  784. static void output_audio_block(AC3EncodeContext *s,

  785.                                uint8_t exp_strategy[AC3_MAX_CHANNELS],

  786.                                uint8_t encoded_exp[AC3_MAX_CHANNELS][N/2],

  787.                                uint8_t bap[AC3_MAX_CHANNELS][N/2],

  788.                                int32_t mdct_coefs[AC3_MAX_CHANNELS][N/2],

  789.                                int8_t global_exp[AC3_MAX_CHANNELS],

  790.                                int block_num)

  791. {

  792.     int ch, nb_groups, group_size, i, baie, rbnd;

  793.     uint8_t *p;

  794.     uint16_t qmant[AC3_MAX_CHANNELS][N/2];

  795.     int exp0, exp1;

  796.     int mant1_cnt, mant2_cnt, mant4_cnt;

  797.     uint16_t *qmant1_ptr, *qmant2_ptr, *qmant4_ptr;

  798.     int delta0, delta1, delta2;

  799. 

  800.     for(ch=0;ch<s->nb_channels;ch++)

  801.         put_bits(&s->pb, 1, 0); /* 512 point MDCT */

  802.     for(ch=0;ch<s->nb_channels;ch++)

  803.         put_bits(&s->pb, 1, 1); /* no dither */

  804.     put_bits(&s->pb, 1, 0); /* no dynamic range */

  805.     if (block_num == 0) {

  806.         /* for block 0, even if no coupling, we must say it. This is a

  807.            waste of bit :-) */

  808.         put_bits(&s->pb, 1, 1); /* coupling strategy present */

  809.         put_bits(&s->pb, 1, 0); /* no coupling strategy */

  810.     } else {

  811.         put_bits(&s->pb, 1, 0); /* no new coupling strategy */

  812.     }

  813. 

  814.     if (s->acmod == 2)

  815.       {

  816.         if(block_num==0)

  817.           {

  818.             /* first block must define rematrixing (rematstr)  */

  819.             put_bits(&s->pb, 1, 1);

  820. 

  821.             /* dummy rematrixing rematflg(1:4)=0 */

  822.             for (rbnd=0;rbnd<4;rbnd++)

  823.               put_bits(&s->pb, 1, 0);

  824.           }

  825.         else

  826.           {

  827.             /* no matrixing (but should be used in the future) */

  828.             put_bits(&s->pb, 1, 0);

  829.           }

  830.       }

  831. 

  832. #if defined(DEBUG)

  833.     {

  834.       static int count = 0;

  835.       av_log(NULL, AV_LOG_DEBUG, "Block #%d (%d)\n", block_num, count++);

  836.     }

  837. #endif

  838.     /* exponent strategy */

  839.     for(ch=0;ch<s->nb_channels;ch++) {

  840.         put_bits(&s->pb, 2, exp_strategy[ch]);

  841.     }

  842. 

  843.     if (s->lfe) {

  844.         put_bits(&s->pb, 1, exp_strategy[s->lfe_channel]);

  845.     }

  846. 

  847.     for(ch=0;ch<s->nb_channels;ch++) {

  848.         if (exp_strategy[ch] != EXP_REUSE)

  849.             put_bits(&s->pb, 6, s->chbwcod[ch]);

  850.     }

  851. 

  852.     /* exponents */

  853.     for (ch = 0; ch < s->nb_all_channels; ch++) {

  854.         switch(exp_strategy[ch]) {

  855.         case EXP_REUSE:

  856.             continue;

  857.         case EXP_D15:

  858.             group_size = 1;

  859.             break;

  860.         case EXP_D25:

  861.             group_size = 2;

  862.             break;

  863.         default:

  864.         case EXP_D45:

  865.             group_size = 4;

  866.             break;

  867.         }

  868.         nb_groups = (s->nb_coefs[ch] + (group_size * 3) - 4) / (3 * group_size);

  869.         p = encoded_exp[ch];

  870. 

  871.         /* first exponent */

  872.         exp1 = *p++;

  873.         put_bits(&s->pb, 4, exp1);

  874. 

  875.         /* next ones are delta encoded */

  876.         for(i=0;i<nb_groups;i++) {

  877.             /* merge three delta in one code */

  878.             exp0 = exp1;

  879.             exp1 = p[0];

  880.             p += group_size;

  881.             delta0 = exp1 - exp0 + 2;

  882. 

  883.             exp0 = exp1;

  884.             exp1 = p[0];

  885.             p += group_size;

  886.             delta1 = exp1 - exp0 + 2;

  887. 

  888.             exp0 = exp1;

  889.             exp1 = p[0];

  890.             p += group_size;

  891.             delta2 = exp1 - exp0 + 2;

  892. 

  893.             put_bits(&s->pb, 7, ((delta0 * 5 + delta1) * 5) + delta2);

  894.         }

  895. 

  896.         if (ch != s->lfe_channel)

  897.             put_bits(&s->pb, 2, 0); /* no gain range info */

  898.     }

  899. 

  900.     /* bit allocation info */

  901.     baie = (block_num == 0);

  902.     put_bits(&s->pb, 1, baie);

  903.     if (baie) {

  904.         put_bits(&s->pb, 2, s->sdecaycod);

  905.         put_bits(&s->pb, 2, s->fdecaycod);

  906.         put_bits(&s->pb, 2, s->sgaincod);

  907.         put_bits(&s->pb, 2, s->dbkneecod);

  908.         put_bits(&s->pb, 3, s->floorcod);

  909.     }

  910. 

  911.     /* snr offset */

  912.     put_bits(&s->pb, 1, baie); /* always present with bai */

  913.     if (baie) {

  914.         put_bits(&s->pb, 6, s->csnroffst);

  915.         for(ch=0;ch<s->nb_all_channels;ch++) {

  916.             put_bits(&s->pb, 4, s->fsnroffst[ch]);

  917.             put_bits(&s->pb, 3, s->fgaincod[ch]);

  918.         }

  919.     }

  920. 

  921.     put_bits(&s->pb, 1, 0); /* no delta bit allocation */

  922.     put_bits(&s->pb, 1, 0); /* no data to skip */

  923. 

  924.     /* mantissa encoding : we use two passes to handle the grouping. A

  925.        one pass method may be faster, but it would necessitate to

  926.        modify the output stream. */

  927. 

  928.     /* first pass: quantize */

  929.     mant1_cnt = mant2_cnt = mant4_cnt = 0;

  930.     qmant1_ptr = qmant2_ptr = qmant4_ptr = NULL;

  931. 

  932.     for (ch = 0; ch < s->nb_all_channels; ch++) {

  933.         int b, c, e, v;

  934. 

  935.         for(i=0;i<s->nb_coefs[ch];i++) {

  936.             c = mdct_coefs[ch][i];

  937.             e = encoded_exp[ch][i] - global_exp[ch];

  938.             b = bap[ch][i];

  939.             switch(b) {

  940.             case 0:

  941.                 v = 0;

  942.                 break;

  943.             case 1:

  944.                 v = sym_quant(c, e, 3);

  945.                 switch(mant1_cnt) {

  946.                 case 0:

  947.                     qmant1_ptr = &qmant[ch][i];

  948.                     v = 9 * v;

  949.                     mant1_cnt = 1;

  950.                     break;

  951.                 case 1:

  952.                     *qmant1_ptr += 3 * v;

  953.                     mant1_cnt = 2;

  954.                     v = 128;

  955.                     break;

  956.                 default:

  957.                     *qmant1_ptr += v;

  958.                     mant1_cnt = 0;

  959.                     v = 128;

  960.                     break;

  961.                 }

  962.                 break;

  963.             case 2:

  964.                 v = sym_quant(c, e, 5);

  965.                 switch(mant2_cnt) {

  966.                 case 0:

  967.                     qmant2_ptr = &qmant[ch][i];

  968.                     v = 25 * v;

  969.                     mant2_cnt = 1;

  970.                     break;

  971.                 case 1:

  972.                     *qmant2_ptr += 5 * v;

  973.                     mant2_cnt = 2;

  974.                     v = 128;

  975.                     break;

  976.                 default:

  977.                     *qmant2_ptr += v;

  978.                     mant2_cnt = 0;

  979.                     v = 128;

  980.                     break;

  981.                 }

  982.                 break;

  983.             case 3:

  984.                 v = sym_quant(c, e, 7);

  985.                 break;

  986.             case 4:

  987.                 v = sym_quant(c, e, 11);

  988.                 switch(mant4_cnt) {

  989.                 case 0:

  990.                     qmant4_ptr = &qmant[ch][i];

  991.                     v = 11 * v;

  992.                     mant4_cnt = 1;

  993.                     break;

  994.                 default:

  995.                     *qmant4_ptr += v;

  996.                     mant4_cnt = 0;

  997.                     v = 128;

  998.                     break;

  999.                 }

  1000.                 break;

  1001.             case 5:

  1002.                 v = sym_quant(c, e, 15);

  1003.                 break;

  1004.             case 14:

  1005.                 v = asym_quant(c, e, 14);

  1006.                 break;

  1007.             case 15:

  1008.                 v = asym_quant(c, e, 16);

  1009.                 break;

  1010.             default:

  1011.                 v = asym_quant(c, e, b - 1);

  1012.                 break;

  1013.             }

  1014.             qmant[ch][i] = v;

  1015.         }

  1016.     }

  1017. 

  1018.     /* second pass : output the values */

  1019.     for (ch = 0; ch < s->nb_all_channels; ch++) {

  1020.         int b, q;

  1021. 

  1022.         for(i=0;i<s->nb_coefs[ch];i++) {

  1023.             q = qmant[ch][i];

  1024.             b = bap[ch][i];

  1025.             switch(b) {

  1026.             case 0:

  1027.                 break;

  1028.             case 1:

  1029.                 if (q != 128)

  1030.                     put_bits(&s->pb, 5, q);

  1031.                 break;

  1032.             case 2:

  1033.                 if (q != 128)

  1034.                     put_bits(&s->pb, 7, q);

  1035.                 break;

  1036.             case 3:

  1037.                 put_bits(&s->pb, 3, q);

  1038.                 break;

  1039.             case 4:

  1040.                 if (q != 128)

  1041.                     put_bits(&s->pb, 7, q);

  1042.                 break;

  1043.             case 14:

  1044.                 put_bits(&s->pb, 14, q);

  1045.                 break;

  1046.             case 15:

  1047.                 put_bits(&s->pb, 16, q);

  1048.                 break;

  1049.             default:

  1050.                 put_bits(&s->pb, b - 1, q);

  1051.                 break;

  1052.             }

  1053.         }

  1054.     }

  1055. }

  1056. 

  1057. #define CRC16_POLY ((1 << 0) | (1 << 2) | (1 << 15) | (1 << 16))

  1058. 

  1059. static unsigned int mul_poly(unsigned int a, unsigned int b, unsigned int poly)

  1060. {

  1061.     unsigned int c;

  1062. 

  1063.     c = 0;

  1064.     while (a) {

  1065.         if (a & 1)

  1066.             c ^= b;

  1067.         a = a >> 1;

  1068.         b = b << 1;

  1069.         if (b & (1 << 16))

  1070.             b ^= poly;

  1071.     }

  1072.     return c;

  1073. }

  1074. 

  1075. static unsigned int pow_poly(unsigned int a, unsigned int n, unsigned int poly)

  1076. {

  1077.     unsigned int r;

  1078.     r = 1;

  1079.     while (n) {

  1080.         if (n & 1)

  1081.             r = mul_poly(r, a, poly);

  1082.         a = mul_poly(a, a, poly);

  1083.         n >>= 1;

  1084.     }

  1085.     return r;

  1086. }

  1087. 

  1088. 

  1089. /* compute log2(max(abs(tab[]))) */

  1090. static int log2_tab(int16_t *tab, int n)

  1091. {

  1092.     int i, v;

  1093. 

  1094.     v = 0;

  1095.     for(i=0;i<n;i++) {

  1096.         v |= abs(tab[i]);

  1097.     }

  1098.     return av_log2(v);

  1099. }

  1100. 

  1101. static void lshift_tab(int16_t *tab, int n, int lshift)

  1102. {

  1103.     int i;

  1104. 

  1105.     if (lshift > 0) {

  1106.         for(i=0;i<n;i++) {

  1107.             tab[i] <<= lshift;

  1108.         }

  1109.     } else if (lshift < 0) {

  1110.         lshift = -lshift;

  1111.         for(i=0;i<n;i++) {

  1112.             tab[i] >>= lshift;

  1113.         }

  1114.     }

  1115. }

  1116. 

  1117. /* fill the end of the frame and compute the two crcs */

  1118. static int output_frame_end(AC3EncodeContext *s)

  1119. {

  1120.     int frame_size, frame_size_58, n, crc1, crc2, crc_inv;

  1121.     uint8_t *frame;

  1122. 

  1123.     frame_size = s->frame_size; /* frame size in words */

  1124.     /* align to 8 bits */

  1125.     flush_put_bits(&s->pb);

  1126.     /* add zero bytes to reach the frame size */

  1127.     frame = s->pb.buf;

  1128.     n = 2 * s->frame_size - (pbBufPtr(&s->pb) - frame) - 2;

  1129.     assert(n >= 0);

  1130.     if(n>0)

  1131.       memset(pbBufPtr(&s->pb), 0, n);

  1132. 

  1133.     /* Now we must compute both crcs : this is not so easy for crc1

  1134.        because it is at the beginning of the data... */

  1135.     frame_size_58 = (frame_size >> 1) + (frame_size >> 3);

  1136.     crc1 = bswap_16(av_crc(av_crc8005, 0, frame + 4, 2 * frame_size_58 - 4));

  1137.     /* XXX: could precompute crc_inv */

  1138.     crc_inv = pow_poly((CRC16_POLY >> 1), (16 * frame_size_58) - 16, CRC16_POLY);

  1139.     crc1 = mul_poly(crc_inv, crc1, CRC16_POLY);

  1140.     frame[2] = crc1 >> 8;

  1141.     frame[3] = crc1;

  1142. 

  1143.     crc2 = bswap_16(av_crc(av_crc8005, 0, frame + 2 * frame_size_58, (frame_size - frame_size_58) * 2 - 2));

  1144.     frame[2*frame_size - 2] = crc2 >> 8;

  1145.     frame[2*frame_size - 1] = crc2;

  1146. 

  1147.     //    printf("n=%d frame_size=%d\n", n, frame_size);

  1148.     return frame_size * 2;

  1149. }

  1150. 

  1151. static int AC3_encode_frame(AVCodecContext *avctx,

  1152.                             unsigned char *frame, int buf_size, void *data)

  1153. {

  1154.     AC3EncodeContext *s = avctx->priv_data;

  1155.     int16_t *samples = data;

  1156.     int i, j, k, v, ch;

  1157.     int16_t input_samples[N];

  1158.     int32_t mdct_coef[NB_BLOCKS][AC3_MAX_CHANNELS][N/2];

  1159.     uint8_t exp[NB_BLOCKS][AC3_MAX_CHANNELS][N/2];

  1160.     uint8_t exp_strategy[NB_BLOCKS][AC3_MAX_CHANNELS];

  1161.     uint8_t encoded_exp[NB_BLOCKS][AC3_MAX_CHANNELS][N/2];

  1162.     uint8_t bap[NB_BLOCKS][AC3_MAX_CHANNELS][N/2];

  1163.     int8_t exp_samples[NB_BLOCKS][AC3_MAX_CHANNELS];

  1164.     int frame_bits;

  1165. 

  1166.     frame_bits = 0;

  1167.     for(ch=0;ch<s->nb_all_channels;ch++) {

  1168.         /* fixed mdct to the six sub blocks & exponent computation */

  1169.         for(i=0;i<NB_BLOCKS;i++) {

  1170.             int16_t *sptr;

  1171.             int sinc;

  1172. 

  1173.             /* compute input samples */

  1174.             memcpy(input_samples, s->last_samples[ch], N/2 * sizeof(int16_t));

  1175.             sinc = s->nb_all_channels;

  1176.             sptr = samples + (sinc * (N/2) * i) + ch;

  1177.             for(j=0;j<N/2;j++) {

  1178.                 v = *sptr;

  1179.                 input_samples[j + N/2] = v;

  1180.                 s->last_samples[ch][j] = v;

  1181.                 sptr += sinc;

  1182.             }

  1183. 

  1184.             /* apply the MDCT window */

  1185.             for(j=0;j<N/2;j++) {

  1186.                 input_samples[j] = MUL16(input_samples[j],

  1187.                                          ff_ac3_window[j]) >> 15;

  1188.                 input_samples[N-j-1] = MUL16(input_samples[N-j-1],

  1189.                                              ff_ac3_window[j]) >> 15;

  1190.             }

  1191. 

  1192.             /* Normalize the samples to use the maximum available

  1193.                precision */

  1194.             v = 14 - log2_tab(input_samples, N);

  1195.             if (v < 0)

  1196.                 v = 0;

  1197.             exp_samples[i][ch] = v - 9;

  1198.             lshift_tab(input_samples, N, v);

  1199. 

  1200.             /* do the MDCT */

  1201.             mdct512(mdct_coef[i][ch], input_samples);

  1202. 

  1203.             /* compute "exponents". We take into account the

  1204.                normalization there */

  1205.             for(j=0;j<N/2;j++) {

  1206.                 int e;

  1207.                 v = abs(mdct_coef[i][ch][j]);

  1208.                 if (v == 0)

  1209.                     e = 24;

  1210.                 else {

  1211.                     e = 23 - av_log2(v) + exp_samples[i][ch];

  1212.                     if (e >= 24) {

  1213.                         e = 24;

  1214.                         mdct_coef[i][ch][j] = 0;

  1215.                     }

  1216.                 }

  1217.                 exp[i][ch][j] = e;

  1218.             }

  1219.         }

  1220. 

  1221.         compute_exp_strategy(exp_strategy, exp, ch, ch == s->lfe_channel);

  1222. 

  1223.         /* compute the exponents as the decoder will see them. The

  1224.            EXP_REUSE case must be handled carefully : we select the

  1225.            min of the exponents */

  1226.         i = 0;

  1227.         while (i < NB_BLOCKS) {

  1228.             j = i + 1;

  1229.             while (j < NB_BLOCKS && exp_strategy[j][ch] == EXP_REUSE) {

  1230.                 exponent_min(exp[i][ch], exp[j][ch], s->nb_coefs[ch]);

  1231.                 j++;

  1232.             }

  1233.             frame_bits += encode_exp(encoded_exp[i][ch],

  1234.                                      exp[i][ch], s->nb_coefs[ch],

  1235.                                      exp_strategy[i][ch]);

  1236.             /* copy encoded exponents for reuse case */

  1237.             for(k=i+1;k<j;k++) {

  1238.                 memcpy(encoded_exp[k][ch], encoded_exp[i][ch],

  1239.                        s->nb_coefs[ch] * sizeof(uint8_t));

  1240.             }

  1241.             i = j;

  1242.         }

  1243.     }

  1244. 

  1245.     /* adjust for fractional frame sizes */

  1246.     while(s->bits_written >= s->bit_rate*1000 && s->samples_written >= s->sample_rate) {

  1247.         s->bits_written -= s->bit_rate*1000;

  1248.         s->samples_written -= s->sample_rate;

  1249.     }

  1250.     s->frame_size = s->frame_size_min + (s->bits_written * s->sample_rate < s->samples_written * s->bit_rate*1000);

  1251.     s->bits_written += s->frame_size * 16;

  1252.     s->samples_written += AC3_FRAME_SIZE;

  1253. 

  1254.     compute_bit_allocation(s, bap, encoded_exp, exp_strategy, frame_bits);

  1255.     /* everything is known... let's output the frame */

  1256.     output_frame_header(s, frame);

  1257. 

  1258.     for(i=0;i<NB_BLOCKS;i++) {

  1259.         output_audio_block(s, exp_strategy[i], encoded_exp[i],

  1260.                            bap[i], mdct_coef[i], exp_samples[i], i);

  1261.     }

  1262.     return output_frame_end(s);

  1263. }

  1264. 

  1265. static int AC3_encode_close(AVCodecContext *avctx)

  1266. {

  1267.     av_freep(&avctx->coded_frame);

  1268.     return 0;

  1269. }

  1270. 

  1271. #if 0

  1272. /*************************************************************************/

  1273. /* TEST */

  1274. 

  1275. #define FN (N/4)

  1276. 

  1277. void fft_test(void)

  1278. {

  1279.     IComplex in[FN], in1[FN];

  1280.     int k, n, i;

  1281.     float sum_re, sum_im, a;

  1282. 

  1283.     /* FFT test */

  1284. 

  1285.     for(i=0;i<FN;i++) {

  1286.         in[i].re = random() % 65535 - 32767;

  1287.         in[i].im = random() % 65535 - 32767;

  1288.         in1[i] = in[i];

  1289.     }

  1290.     fft(in, 7);

  1291. 

  1292.     /* do it by hand */

  1293.     for(k=0;k<FN;k++) {

  1294.         sum_re = 0;

  1295.         sum_im = 0;

  1296.         for(n=0;n<FN;n++) {

  1297.             a = -2 * M_PI * (n * k) / FN;

  1298.             sum_re += in1[n].re * cos(a) - in1[n].im * sin(a);

  1299.             sum_im += in1[n].re * sin(a) + in1[n].im * cos(a);

  1300.         }

  1301.         printf("%3d: %6d,%6d %6.0f,%6.0f\n",

  1302.                k, in[k].re, in[k].im, sum_re / FN, sum_im / FN);

  1303.     }

  1304. }

  1305. 

  1306. void mdct_test(void)

  1307. {

  1308.     int16_t input[N];

  1309.     int32_t output[N/2];

  1310.     float input1[N];

  1311.     float output1[N/2];

  1312.     float s, a, err, e, emax;

  1313.     int i, k, n;

  1314. 

  1315.     for(i=0;i<N;i++) {

  1316.         input[i] = (random() % 65535 - 32767) * 9 / 10;

  1317.         input1[i] = input[i];

  1318.     }

  1319. 

  1320.     mdct512(output, input);

  1321. 

  1322.     /* do it by hand */

  1323.     for(k=0;k<N/2;k++) {

  1324.         s = 0;

  1325.         for(n=0;n<N;n++) {

  1326.             a = (2*M_PI*(2*n+1+N/2)*(2*k+1) / (4 * N));

  1327.             s += input1[n] * cos(a);

  1328.         }

  1329.         output1[k] = -2 * s / N;

  1330.     }

  1331. 

  1332.     err = 0;

  1333.     emax = 0;

  1334.     for(i=0;i<N/2;i++) {

  1335.         printf("%3d: %7d %7.0f\n", i, output[i], output1[i]);

  1336.         e = output[i] - output1[i];

  1337.         if (e > emax)

  1338.             emax = e;

  1339.         err += e * e;

  1340.     }

  1341.     printf("err2=%f emax=%f\n", err / (N/2), emax);

  1342. }

  1343. 

  1344. void test_ac3(void)

  1345. {

  1346.     AC3EncodeContext ctx;

  1347.     unsigned char frame[AC3_MAX_CODED_FRAME_SIZE];

  1348.     short samples[AC3_FRAME_SIZE];

  1349.     int ret, i;

  1350. 

  1351.     AC3_encode_init(&ctx, 44100, 64000, 1);

  1352. 

  1353.     fft_test();

  1354.     mdct_test();

  1355. 

  1356.     for(i=0;i<AC3_FRAME_SIZE;i++)

  1357.         samples[i] = (int)(sin(2*M_PI*i*1000.0/44100) * 10000);

  1358.     ret = AC3_encode_frame(&ctx, frame, samples);

  1359.     printf("ret=%d\n", ret);

  1360. }

  1361. #endif

  1362. 

  1363. AVCodec ac3_encoder = {

  1364.     "ac3",

  1365.     CODEC_TYPE_AUDIO,

  1366.     CODEC_ID_AC3,

  1367.     sizeof(AC3EncodeContext),

  1368.     AC3_encode_init,

  1369.     AC3_encode_frame,

  1370.     AC3_encode_close,

  1371.     NULL,

  1372. };