2 * adaptive and fixed codebook vector operations for ACELP-based codecs
4 * Copyright (c) 2008 Vladimir Voroshilov
6 * This file is part of FFmpeg.
8 * FFmpeg is free software; you can redistribute it and/or
9 * modify it under the terms of the GNU Lesser General Public
10 * License as published by the Free Software Foundation; either
11 * version 2.1 of the License, or (at your option) any later version.
13 * FFmpeg is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 * Lesser General Public License for more details.
18 * You should have received a copy of the GNU Lesser General Public
19 * License along with FFmpeg; if not, write to the Free Software
20 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
25 #include "acelp_vectors.h"
26 #include "celp_math.h"
28 const uint8_t ff_fc_2pulses_9bits_track1[16] =
39 const uint8_t ff_fc_2pulses_9bits_track1_gray[16] =
51 const uint8_t ff_fc_2pulses_9bits_track2_gray[32] =
71 const uint8_t ff_fc_4pulses_8bits_tracks_13[16] =
73 0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75,
76 const uint8_t ff_fc_4pulses_8bits_track_4[32] =
97 static uint8_t gray_decode[32] =
99 0, 1, 3, 2, 7, 6, 4, 5,
100 15, 14, 12, 13, 8, 9, 11, 10,
101 31, 30, 28, 29, 24, 25, 27, 26,
102 16, 17, 19, 18, 23, 22, 20, 21
106 void ff_acelp_fc_pulse_per_track(
115 int mask = (1 << bits) - 1;
118 for(i=0; i<pulse_count; i++)
120 fc_v[i + tab1[pulse_indexes & mask]] +=
121 (pulse_signs & 1) ? 8191 : -8192; // +/-1 in (2.13)
123 pulse_indexes >>= bits;
127 fc_v[tab2[pulse_indexes]] += (pulse_signs & 1) ? 8191 : -8192;
130 void ff_decode_10_pulses_35bits(const int16_t *fixed_index,
131 AMRFixed *fixed_sparse,
132 const uint8_t *gray_decode,
133 int half_pulse_count, int bits)
136 int mask = (1 << bits) - 1;
138 fixed_sparse->n = 2 * half_pulse_count;
139 for (i = 0; i < half_pulse_count; i++) {
140 const int pos1 = gray_decode[fixed_index[2*i+1] & mask] + i;
141 const int pos2 = gray_decode[fixed_index[2*i ] & mask] + i;
142 const float sign = (fixed_index[2*i+1] & (1 << bits)) ? -1.0 : 1.0;
143 fixed_sparse->x[2*i+1] = pos1;
144 fixed_sparse->x[2*i ] = pos2;
145 fixed_sparse->y[2*i+1] = sign;
146 fixed_sparse->y[2*i ] = pos2 < pos1 ? -sign : sign;
150 void ff_acelp_weighted_vector_sum(
154 int16_t weight_coeff_a,
155 int16_t weight_coeff_b,
162 // Clipping required here; breaks OVERFLOW test.
163 for(i=0; i<length; i++)
164 out[i] = av_clip_int16((
165 in_a[i] * weight_coeff_a +
166 in_b[i] * weight_coeff_b +
170 void ff_weighted_vector_sumf(float *out, const float *in_a, const float *in_b,
171 float weight_coeff_a, float weight_coeff_b, int length)
175 for(i=0; i<length; i++)
176 out[i] = weight_coeff_a * in_a[i]
177 + weight_coeff_b * in_b[i];
180 void ff_adaptative_gain_control(float *buf_out, float speech_energ,
181 int size, float alpha, float *gain_mem)
184 float postfilter_energ = ff_dot_productf(buf_out, buf_out, size);
185 float gain_scale_factor = 1.0;
186 float mem = *gain_mem;
188 if (postfilter_energ)
189 gain_scale_factor = sqrt(speech_energ / postfilter_energ);
191 gain_scale_factor *= 1.0 - alpha;
193 for (i = 0; i < size; i++) {
194 mem = alpha * mem + gain_scale_factor;
201 void ff_scale_vector_to_given_sum_of_squares(float *out, const float *in,
202 float sum_of_squares, const int n)
205 float scalefactor = ff_dot_productf(in, in, n);
207 scalefactor = sqrt(sum_of_squares / scalefactor);
208 for (i = 0; i < n; i++)
209 out[i] = in[i] * scalefactor;
212 void ff_set_fixed_vector(float *out, const AMRFixed *in, float scale, int size)
216 for (i=0; i < in->n; i++) {
218 float y = in->y[i] * scale;
230 void ff_clear_fixed_vector(float *out, const AMRFixed *in, int size)
234 for (i=0; i < in->n; i++) {