| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | /* | ||
| 2 | * QCELP decoder | ||
| 3 | * Copyright (c) 2007 Reynaldo H. Verdejo Pinochet | ||
| 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 | ||
| 24 | * QCELP decoder | ||
| 25 | * @author Reynaldo H. Verdejo Pinochet | ||
| 26 | * @remark FFmpeg merging spearheaded by Kenan Gillet | ||
| 27 | * @remark Development mentored by Benjamin Larson | ||
| 28 | */ | ||
| 29 | |||
| 30 | #include "libavutil/avassert.h" | ||
| 31 | #include "libavutil/channel_layout.h" | ||
| 32 | #include "libavutil/float_dsp.h" | ||
| 33 | #include "avcodec.h" | ||
| 34 | #include "codec_internal.h" | ||
| 35 | #include "decode.h" | ||
| 36 | #include "get_bits.h" | ||
| 37 | #include "qcelpdata.h" | ||
| 38 | #include "celp_filters.h" | ||
| 39 | #include "acelp_filters.h" | ||
| 40 | #include "acelp_vectors.h" | ||
| 41 | #include "lsp.h" | ||
| 42 | |||
| 43 | typedef enum { | ||
| 44 | I_F_Q = -1, /**< insufficient frame quality */ | ||
| 45 | SILENCE, | ||
| 46 | RATE_OCTAVE, | ||
| 47 | RATE_QUARTER, | ||
| 48 | RATE_HALF, | ||
| 49 | RATE_FULL | ||
| 50 | } qcelp_packet_rate; | ||
| 51 | |||
| 52 | typedef struct QCELPContext { | ||
| 53 | GetBitContext gb; | ||
| 54 | qcelp_packet_rate bitrate; | ||
| 55 | QCELPFrame frame; /**< unpacked data frame */ | ||
| 56 | |||
| 57 | uint8_t erasure_count; | ||
| 58 | uint8_t octave_count; /**< count the consecutive RATE_OCTAVE frames */ | ||
| 59 | float prev_lspf[10]; | ||
| 60 | float predictor_lspf[10];/**< LSP predictor for RATE_OCTAVE and I_F_Q */ | ||
| 61 | float pitch_synthesis_filter_mem[303]; | ||
| 62 | float pitch_pre_filter_mem[303]; | ||
| 63 | float rnd_fir_filter_mem[180]; | ||
| 64 | float formant_mem[170]; | ||
| 65 | float last_codebook_gain; | ||
| 66 | int prev_g1[2]; | ||
| 67 | int prev_bitrate; | ||
| 68 | float pitch_gain[4]; | ||
| 69 | uint8_t pitch_lag[4]; | ||
| 70 | uint16_t first16bits; | ||
| 71 | uint8_t warned_buf_mismatch_bitrate; | ||
| 72 | |||
| 73 | /* postfilter */ | ||
| 74 | float postfilter_synth_mem[10]; | ||
| 75 | float postfilter_agc_mem; | ||
| 76 | float postfilter_tilt_mem; | ||
| 77 | } QCELPContext; | ||
| 78 | |||
| 79 | /** | ||
| 80 | * Initialize the speech codec according to the specification. | ||
| 81 | * | ||
| 82 | * TIA/EIA/IS-733 2.4.9 | ||
| 83 | */ | ||
| 84 | 3 | static av_cold int qcelp_decode_init(AVCodecContext *avctx) | |
| 85 | { | ||
| 86 | 3 | QCELPContext *q = avctx->priv_data; | |
| 87 | int i; | ||
| 88 | |||
| 89 | 3 | av_channel_layout_uninit(&avctx->ch_layout); | |
| 90 | 3 | avctx->ch_layout = (AVChannelLayout)AV_CHANNEL_LAYOUT_MONO; | |
| 91 | 3 | avctx->sample_fmt = AV_SAMPLE_FMT_FLT; | |
| 92 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 3 times.
|
3 | if (!avctx->sample_rate) |
| 93 | ✗ | avctx->sample_rate = 8000; | |
| 94 | |||
| 95 |
2/2✓ Branch 0 taken 30 times.
✓ Branch 1 taken 3 times.
|
33 | for (i = 0; i < 10; i++) |
| 96 | 30 | q->prev_lspf[i] = (i + 1) / 11.0; | |
| 97 | |||
| 98 | 3 | return 0; | |
| 99 | } | ||
| 100 | |||
| 101 | /** | ||
| 102 | * Decode the 10 quantized LSP frequencies from the LSPV/LSP | ||
| 103 | * transmission codes of any bitrate and check for badly received packets. | ||
| 104 | * | ||
| 105 | * @param q the context | ||
| 106 | * @param lspf line spectral pair frequencies | ||
| 107 | * | ||
| 108 | * @return 0 on success, -1 if the packet is badly received | ||
| 109 | * | ||
| 110 | * TIA/EIA/IS-733 2.4.3.2.6.2-2, 2.4.8.7.3 | ||
| 111 | */ | ||
| 112 | 497 | static int decode_lspf(QCELPContext *q, float *lspf) | |
| 113 | { | ||
| 114 | int i; | ||
| 115 | float tmp_lspf, smooth, erasure_coeff; | ||
| 116 | const float *predictors; | ||
| 117 | |||
| 118 |
4/4✓ Branch 0 taken 346 times.
✓ Branch 1 taken 151 times.
✓ Branch 2 taken 17 times.
✓ Branch 3 taken 329 times.
|
497 | if (q->bitrate == RATE_OCTAVE || q->bitrate == I_F_Q) { |
| 119 |
2/2✓ Branch 0 taken 29 times.
✓ Branch 1 taken 139 times.
|
197 | predictors = q->prev_bitrate != RATE_OCTAVE && |
| 120 |
2/2✓ Branch 0 taken 14 times.
✓ Branch 1 taken 15 times.
|
29 | q->prev_bitrate != I_F_Q ? q->prev_lspf |
| 121 | : q->predictor_lspf; | ||
| 122 | |||
| 123 |
2/2✓ Branch 0 taken 151 times.
✓ Branch 1 taken 17 times.
|
168 | if (q->bitrate == RATE_OCTAVE) { |
| 124 | 151 | q->octave_count++; | |
| 125 | |||
| 126 |
2/2✓ Branch 0 taken 1510 times.
✓ Branch 1 taken 151 times.
|
1661 | for (i = 0; i < 10; i++) { |
| 127 | 1510 | q->predictor_lspf[i] = | |
| 128 | 3020 | lspf[i] = (q->frame.lspv[i] ? QCELP_LSP_SPREAD_FACTOR | |
| 129 |
2/2✓ Branch 0 taken 604 times.
✓ Branch 1 taken 906 times.
|
1510 | : -QCELP_LSP_SPREAD_FACTOR) + |
| 130 | 1510 | predictors[i] * QCELP_LSP_OCTAVE_PREDICTOR + | |
| 131 | 1510 | (i + 1) * ((1 - QCELP_LSP_OCTAVE_PREDICTOR) / 11); | |
| 132 | } | ||
| 133 |
2/2✓ Branch 0 taken 76 times.
✓ Branch 1 taken 75 times.
|
151 | smooth = q->octave_count < 10 ? .875 : 0.1; |
| 134 | } else { | ||
| 135 | 17 | erasure_coeff = QCELP_LSP_OCTAVE_PREDICTOR; | |
| 136 | |||
| 137 | av_assert2(q->bitrate == I_F_Q); | ||
| 138 | |||
| 139 |
2/2✓ Branch 0 taken 14 times.
✓ Branch 1 taken 3 times.
|
17 | if (q->erasure_count > 1) |
| 140 |
2/2✓ Branch 0 taken 2 times.
✓ Branch 1 taken 12 times.
|
14 | erasure_coeff *= q->erasure_count < 4 ? 0.9 : 0.7; |
| 141 | |||
| 142 |
2/2✓ Branch 0 taken 170 times.
✓ Branch 1 taken 17 times.
|
187 | for (i = 0; i < 10; i++) { |
| 143 | 170 | q->predictor_lspf[i] = | |
| 144 | 170 | lspf[i] = (i + 1) * (1 - erasure_coeff) / 11 + | |
| 145 | 170 | erasure_coeff * predictors[i]; | |
| 146 | } | ||
| 147 | 17 | smooth = 0.125; | |
| 148 | } | ||
| 149 | |||
| 150 | // Check the stability of the LSP frequencies. | ||
| 151 |
1/2✓ Branch 0 taken 168 times.
✗ Branch 1 not taken.
|
168 | lspf[0] = FFMAX(lspf[0], QCELP_LSP_SPREAD_FACTOR); |
| 152 |
2/2✓ Branch 0 taken 1512 times.
✓ Branch 1 taken 168 times.
|
1680 | for (i = 1; i < 10; i++) |
| 153 |
2/2✓ Branch 0 taken 1427 times.
✓ Branch 1 taken 85 times.
|
1512 | lspf[i] = FFMAX(lspf[i], lspf[i - 1] + QCELP_LSP_SPREAD_FACTOR); |
| 154 | |||
| 155 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 168 times.
|
168 | lspf[9] = FFMIN(lspf[9], 1.0 - QCELP_LSP_SPREAD_FACTOR); |
| 156 |
2/2✓ Branch 0 taken 1512 times.
✓ Branch 1 taken 168 times.
|
1680 | for (i = 9; i > 0; i--) |
| 157 |
2/2✓ Branch 0 taken 41 times.
✓ Branch 1 taken 1471 times.
|
1512 | lspf[i - 1] = FFMIN(lspf[i - 1], lspf[i] - QCELP_LSP_SPREAD_FACTOR); |
| 158 | |||
| 159 | // Low-pass filter the LSP frequencies. | ||
| 160 | 168 | ff_weighted_vector_sumf(lspf, lspf, q->prev_lspf, smooth, 1.0 - smooth, 10); | |
| 161 | } else { | ||
| 162 | 329 | q->octave_count = 0; | |
| 163 | |||
| 164 | 329 | tmp_lspf = 0.0; | |
| 165 |
2/2✓ Branch 0 taken 1645 times.
✓ Branch 1 taken 329 times.
|
1974 | for (i = 0; i < 5; i++) { |
| 166 | 1645 | lspf[2 * i + 0] = tmp_lspf += qcelp_lspvq[i][q->frame.lspv[i]][0] * 0.0001; | |
| 167 | 1645 | lspf[2 * i + 1] = tmp_lspf += qcelp_lspvq[i][q->frame.lspv[i]][1] * 0.0001; | |
| 168 | } | ||
| 169 | |||
| 170 | // Check for badly received packets. | ||
| 171 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 329 times.
|
329 | if (q->bitrate == RATE_QUARTER) { |
| 172 | ✗ | if (lspf[9] <= .70 || lspf[9] >= .97) | |
| 173 | ✗ | return -1; | |
| 174 | ✗ | for (i = 3; i < 10; i++) | |
| 175 | ✗ | if (fabs(lspf[i] - lspf[i - 2]) < .08) | |
| 176 | ✗ | return -1; | |
| 177 | } else { | ||
| 178 |
2/4✓ Branch 0 taken 329 times.
✗ Branch 1 not taken.
✗ Branch 2 not taken.
✓ Branch 3 taken 329 times.
|
329 | if (lspf[9] <= .66 || lspf[9] >= .985) |
| 179 | ✗ | return -1; | |
| 180 |
2/2✓ Branch 0 taken 1974 times.
✓ Branch 1 taken 329 times.
|
2303 | for (i = 4; i < 10; i++) |
| 181 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 1974 times.
|
1974 | if (fabs(lspf[i] - lspf[i - 4]) < .0931) |
| 182 | ✗ | return -1; | |
| 183 | } | ||
| 184 | } | ||
| 185 | 497 | return 0; | |
| 186 | } | ||
| 187 | |||
| 188 | /** | ||
| 189 | * Convert codebook transmission codes to GAIN and INDEX. | ||
| 190 | * | ||
| 191 | * @param q the context | ||
| 192 | * @param gain array holding the decoded gain | ||
| 193 | * | ||
| 194 | * TIA/EIA/IS-733 2.4.6.2 | ||
| 195 | */ | ||
| 196 | 497 | static void decode_gain_and_index(QCELPContext *q, float *gain) | |
| 197 | { | ||
| 198 | int i, subframes_count, g1[16]; | ||
| 199 | float slope; | ||
| 200 | |||
| 201 |
2/2✓ Branch 0 taken 329 times.
✓ Branch 1 taken 168 times.
|
497 | if (q->bitrate >= RATE_QUARTER) { |
| 202 |
2/3✓ Branch 0 taken 282 times.
✓ Branch 1 taken 47 times.
✗ Branch 2 not taken.
|
329 | switch (q->bitrate) { |
| 203 | 282 | case RATE_FULL: subframes_count = 16; break; | |
| 204 | 47 | case RATE_HALF: subframes_count = 4; break; | |
| 205 | ✗ | default: subframes_count = 5; | |
| 206 | } | ||
| 207 |
2/2✓ Branch 0 taken 4700 times.
✓ Branch 1 taken 329 times.
|
5029 | for (i = 0; i < subframes_count; i++) { |
| 208 | 4700 | g1[i] = 4 * q->frame.cbgain[i]; | |
| 209 |
4/4✓ Branch 0 taken 4512 times.
✓ Branch 1 taken 188 times.
✓ Branch 2 taken 1128 times.
✓ Branch 3 taken 3384 times.
|
4700 | if (q->bitrate == RATE_FULL && !((i + 1) & 3)) { |
| 210 | 1128 | g1[i] += av_clip((g1[i - 1] + g1[i - 2] + g1[i - 3]) / 3 - 6, 0, 32); | |
| 211 | } | ||
| 212 | |||
| 213 | 4700 | gain[i] = qcelp_g12ga[g1[i]]; | |
| 214 | |||
| 215 |
2/2✓ Branch 0 taken 2227 times.
✓ Branch 1 taken 2473 times.
|
4700 | if (q->frame.cbsign[i]) { |
| 216 | 2227 | gain[i] = -gain[i]; | |
| 217 | 2227 | q->frame.cindex[i] = (q->frame.cindex[i] - 89) & 127; | |
| 218 | } | ||
| 219 | } | ||
| 220 | |||
| 221 | 329 | q->prev_g1[0] = g1[i - 2]; | |
| 222 | 329 | q->prev_g1[1] = g1[i - 1]; | |
| 223 | 329 | q->last_codebook_gain = qcelp_g12ga[g1[i - 1]]; | |
| 224 | |||
| 225 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 329 times.
|
329 | if (q->bitrate == RATE_QUARTER) { |
| 226 | // Provide smoothing of the unvoiced excitation energy. | ||
| 227 | ✗ | gain[7] = gain[4]; | |
| 228 | ✗ | gain[6] = 0.4 * gain[3] + 0.6 * gain[4]; | |
| 229 | ✗ | gain[5] = gain[3]; | |
| 230 | ✗ | gain[4] = 0.8 * gain[2] + 0.2 * gain[3]; | |
| 231 | ✗ | gain[3] = 0.2 * gain[1] + 0.8 * gain[2]; | |
| 232 | ✗ | gain[2] = gain[1]; | |
| 233 | ✗ | gain[1] = 0.6 * gain[0] + 0.4 * gain[1]; | |
| 234 | } | ||
| 235 |
1/2✓ Branch 0 taken 168 times.
✗ Branch 1 not taken.
|
168 | } else if (q->bitrate != SILENCE) { |
| 236 |
2/2✓ Branch 0 taken 151 times.
✓ Branch 1 taken 17 times.
|
168 | if (q->bitrate == RATE_OCTAVE) { |
| 237 | 151 | g1[0] = 2 * q->frame.cbgain[0] + | |
| 238 | 151 | av_clip((q->prev_g1[0] + q->prev_g1[1]) / 2 - 5, 0, 54); | |
| 239 | 151 | subframes_count = 8; | |
| 240 | } else { | ||
| 241 | av_assert2(q->bitrate == I_F_Q); | ||
| 242 | |||
| 243 | 17 | g1[0] = q->prev_g1[1]; | |
| 244 |
4/4✓ Branch 0 taken 3 times.
✓ Branch 1 taken 1 times.
✓ Branch 2 taken 1 times.
✓ Branch 3 taken 12 times.
|
17 | switch (q->erasure_count) { |
| 245 | 3 | case 1 : break; | |
| 246 | 1 | case 2 : g1[0] -= 1; break; | |
| 247 | 1 | case 3 : g1[0] -= 2; break; | |
| 248 | 12 | default: g1[0] -= 6; | |
| 249 | } | ||
| 250 |
2/2✓ Branch 0 taken 14 times.
✓ Branch 1 taken 3 times.
|
17 | if (g1[0] < 0) |
| 251 | 14 | g1[0] = 0; | |
| 252 | 17 | subframes_count = 4; | |
| 253 | } | ||
| 254 | // This interpolation is done to produce smoother background noise. | ||
| 255 | 168 | slope = 0.5 * (qcelp_g12ga[g1[0]] - q->last_codebook_gain) / subframes_count; | |
| 256 |
2/2✓ Branch 0 taken 1276 times.
✓ Branch 1 taken 168 times.
|
1444 | for (i = 1; i <= subframes_count; i++) |
| 257 | 1276 | gain[i - 1] = q->last_codebook_gain + slope * i; | |
| 258 | |||
| 259 | 168 | q->last_codebook_gain = gain[i - 2]; | |
| 260 | 168 | q->prev_g1[0] = q->prev_g1[1]; | |
| 261 | 168 | q->prev_g1[1] = g1[0]; | |
| 262 | } | ||
| 263 | 497 | } | |
| 264 | |||
| 265 | /** | ||
| 266 | * If the received packet is Rate 1/4 a further sanity check is made of the | ||
| 267 | * codebook gain. | ||
| 268 | * | ||
| 269 | * @param cbgain the unpacked cbgain array | ||
| 270 | * @return -1 if the sanity check fails, 0 otherwise | ||
| 271 | * | ||
| 272 | * TIA/EIA/IS-733 2.4.8.7.3 | ||
| 273 | */ | ||
| 274 | ✗ | static int codebook_sanity_check_for_rate_quarter(const uint8_t *cbgain) | |
| 275 | { | ||
| 276 | ✗ | int i, diff, prev_diff = 0; | |
| 277 | |||
| 278 | ✗ | for (i = 1; i < 5; i++) { | |
| 279 | ✗ | diff = cbgain[i] - cbgain[i-1]; | |
| 280 | ✗ | if (FFABS(diff) > 10) | |
| 281 | ✗ | return -1; | |
| 282 | ✗ | else if (FFABS(diff - prev_diff) > 12) | |
| 283 | ✗ | return -1; | |
| 284 | ✗ | prev_diff = diff; | |
| 285 | } | ||
| 286 | ✗ | return 0; | |
| 287 | } | ||
| 288 | |||
| 289 | /** | ||
| 290 | * Compute the scaled codebook vector Cdn From INDEX and GAIN | ||
| 291 | * for all rates. | ||
| 292 | * | ||
| 293 | * The specification lacks some information here. | ||
| 294 | * | ||
| 295 | * TIA/EIA/IS-733 has an omission on the codebook index determination | ||
| 296 | * formula for RATE_FULL and RATE_HALF frames at section 2.4.8.1.1. It says | ||
| 297 | * you have to subtract the decoded index parameter from the given scaled | ||
| 298 | * codebook vector index 'n' to get the desired circular codebook index, but | ||
| 299 | * it does not mention that you have to clamp 'n' to [0-9] in order to get | ||
| 300 | * RI-compliant results. | ||
| 301 | * | ||
| 302 | * The reason for this mistake seems to be the fact they forgot to mention you | ||
| 303 | * have to do these calculations per codebook subframe and adjust given | ||
| 304 | * equation values accordingly. | ||
| 305 | * | ||
| 306 | * @param q the context | ||
| 307 | * @param gain array holding the 4 pitch subframe gain values | ||
| 308 | * @param cdn_vector array for the generated scaled codebook vector | ||
| 309 | */ | ||
| 310 | 497 | static void compute_svector(QCELPContext *q, const float *gain, | |
| 311 | float *cdn_vector) | ||
| 312 | { | ||
| 313 | int i, j, k; | ||
| 314 | uint16_t cbseed, cindex; | ||
| 315 | float *rnd, tmp_gain, fir_filter_value; | ||
| 316 | |||
| 317 |
4/7✓ Branch 0 taken 282 times.
✓ Branch 1 taken 47 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 151 times.
✓ Branch 4 taken 17 times.
✗ Branch 5 not taken.
✗ Branch 6 not taken.
|
497 | switch (q->bitrate) { |
| 318 | 282 | case RATE_FULL: | |
| 319 |
2/2✓ Branch 0 taken 4512 times.
✓ Branch 1 taken 282 times.
|
4794 | for (i = 0; i < 16; i++) { |
| 320 | 4512 | tmp_gain = gain[i] * QCELP_RATE_FULL_CODEBOOK_RATIO; | |
| 321 | 4512 | cindex = -q->frame.cindex[i]; | |
| 322 |
2/2✓ Branch 0 taken 45120 times.
✓ Branch 1 taken 4512 times.
|
49632 | for (j = 0; j < 10; j++) |
| 323 | 45120 | *cdn_vector++ = tmp_gain * | |
| 324 | 45120 | qcelp_rate_full_codebook[cindex++ & 127]; | |
| 325 | } | ||
| 326 | 282 | break; | |
| 327 | 47 | case RATE_HALF: | |
| 328 |
2/2✓ Branch 0 taken 188 times.
✓ Branch 1 taken 47 times.
|
235 | for (i = 0; i < 4; i++) { |
| 329 | 188 | tmp_gain = gain[i] * QCELP_RATE_HALF_CODEBOOK_RATIO; | |
| 330 | 188 | cindex = -q->frame.cindex[i]; | |
| 331 |
2/2✓ Branch 0 taken 7520 times.
✓ Branch 1 taken 188 times.
|
7708 | for (j = 0; j < 40; j++) |
| 332 | 7520 | *cdn_vector++ = tmp_gain * | |
| 333 | 7520 | qcelp_rate_half_codebook[cindex++ & 127]; | |
| 334 | } | ||
| 335 | 47 | break; | |
| 336 | ✗ | case RATE_QUARTER: | |
| 337 | ✗ | cbseed = (0x0003 & q->frame.lspv[4]) << 14 | | |
| 338 | ✗ | (0x003F & q->frame.lspv[3]) << 8 | | |
| 339 | ✗ | (0x0060 & q->frame.lspv[2]) << 1 | | |
| 340 | ✗ | (0x0007 & q->frame.lspv[1]) << 3 | | |
| 341 | ✗ | (0x0038 & q->frame.lspv[0]) >> 3; | |
| 342 | ✗ | rnd = q->rnd_fir_filter_mem + 20; | |
| 343 | ✗ | for (i = 0; i < 8; i++) { | |
| 344 | ✗ | tmp_gain = gain[i] * (QCELP_SQRT1887 / 32768.0); | |
| 345 | ✗ | for (k = 0; k < 20; k++) { | |
| 346 | ✗ | cbseed = 521 * cbseed + 259; | |
| 347 | ✗ | *rnd = (int16_t) cbseed; | |
| 348 | |||
| 349 | // FIR filter | ||
| 350 | ✗ | fir_filter_value = 0.0; | |
| 351 | ✗ | for (j = 0; j < 10; j++) | |
| 352 | ✗ | fir_filter_value += qcelp_rnd_fir_coefs[j] * | |
| 353 | ✗ | (rnd[-j] + rnd[-20+j]); | |
| 354 | |||
| 355 | ✗ | fir_filter_value += qcelp_rnd_fir_coefs[10] * rnd[-10]; | |
| 356 | ✗ | *cdn_vector++ = tmp_gain * fir_filter_value; | |
| 357 | ✗ | rnd++; | |
| 358 | } | ||
| 359 | } | ||
| 360 | ✗ | memcpy(q->rnd_fir_filter_mem, q->rnd_fir_filter_mem + 160, | |
| 361 | 20 * sizeof(float)); | ||
| 362 | ✗ | break; | |
| 363 | 151 | case RATE_OCTAVE: | |
| 364 | 151 | cbseed = q->first16bits; | |
| 365 |
2/2✓ Branch 0 taken 1208 times.
✓ Branch 1 taken 151 times.
|
1359 | for (i = 0; i < 8; i++) { |
| 366 | 1208 | tmp_gain = gain[i] * (QCELP_SQRT1887 / 32768.0); | |
| 367 |
2/2✓ Branch 0 taken 24160 times.
✓ Branch 1 taken 1208 times.
|
25368 | for (j = 0; j < 20; j++) { |
| 368 | 24160 | cbseed = 521 * cbseed + 259; | |
| 369 | 24160 | *cdn_vector++ = tmp_gain * (int16_t) cbseed; | |
| 370 | } | ||
| 371 | } | ||
| 372 | 151 | break; | |
| 373 | 17 | case I_F_Q: | |
| 374 | 17 | cbseed = -44; // random codebook index | |
| 375 |
2/2✓ Branch 0 taken 68 times.
✓ Branch 1 taken 17 times.
|
85 | for (i = 0; i < 4; i++) { |
| 376 | 68 | tmp_gain = gain[i] * QCELP_RATE_FULL_CODEBOOK_RATIO; | |
| 377 |
2/2✓ Branch 0 taken 2720 times.
✓ Branch 1 taken 68 times.
|
2788 | for (j = 0; j < 40; j++) |
| 378 | 2720 | *cdn_vector++ = tmp_gain * | |
| 379 | 2720 | qcelp_rate_full_codebook[cbseed++ & 127]; | |
| 380 | } | ||
| 381 | 17 | break; | |
| 382 | ✗ | case SILENCE: | |
| 383 | ✗ | memset(cdn_vector, 0, 160 * sizeof(float)); | |
| 384 | ✗ | break; | |
| 385 | } | ||
| 386 | 497 | } | |
| 387 | |||
| 388 | /** | ||
| 389 | * Apply generic gain control. | ||
| 390 | * | ||
| 391 | * @param v_out output vector | ||
| 392 | * @param v_in gain-controlled vector | ||
| 393 | * @param v_ref vector to control gain of | ||
| 394 | * | ||
| 395 | * TIA/EIA/IS-733 2.4.8.3, 2.4.8.6 | ||
| 396 | */ | ||
| 397 | 329 | static void apply_gain_ctrl(float *v_out, const float *v_ref, const float *v_in) | |
| 398 | { | ||
| 399 | int i; | ||
| 400 | |||
| 401 |
2/2✓ Branch 0 taken 1316 times.
✓ Branch 1 taken 329 times.
|
1645 | for (i = 0; i < 160; i += 40) { |
| 402 | 1316 | float res = ff_scalarproduct_float_c(v_ref + i, v_ref + i, 40); | |
| 403 | 1316 | ff_scale_vector_to_given_sum_of_squares(v_out + i, v_in + i, res, 40); | |
| 404 | } | ||
| 405 | 329 | } | |
| 406 | |||
| 407 | /** | ||
| 408 | * Apply filter in pitch-subframe steps. | ||
| 409 | * | ||
| 410 | * @param memory buffer for the previous state of the filter | ||
| 411 | * - must be able to contain 303 elements | ||
| 412 | * - the 143 first elements are from the previous state | ||
| 413 | * - the next 160 are for output | ||
| 414 | * @param v_in input filter vector | ||
| 415 | * @param gain per-subframe gain array, each element is between 0.0 and 2.0 | ||
| 416 | * @param lag per-subframe lag array, each element is | ||
| 417 | * - between 16 and 143 if its corresponding pfrac is 0, | ||
| 418 | * - between 16 and 139 otherwise | ||
| 419 | * @param pfrac per-subframe boolean array, 1 if the lag is fractional, 0 | ||
| 420 | * otherwise | ||
| 421 | * | ||
| 422 | * @return filter output vector | ||
| 423 | */ | ||
| 424 | 658 | static const float *do_pitchfilter(float memory[303], const float v_in[160], | |
| 425 | const float gain[4], const uint8_t *lag, | ||
| 426 | const uint8_t pfrac[4]) | ||
| 427 | { | ||
| 428 | int i, j; | ||
| 429 | float *v_lag, *v_out; | ||
| 430 | const float *v_len; | ||
| 431 | |||
| 432 | 658 | v_out = memory + 143; // Output vector starts at memory[143]. | |
| 433 | |||
| 434 |
2/2✓ Branch 0 taken 2632 times.
✓ Branch 1 taken 658 times.
|
3290 | for (i = 0; i < 4; i++) { |
| 435 |
1/2✓ Branch 0 taken 2632 times.
✗ Branch 1 not taken.
|
2632 | if (gain[i]) { |
| 436 | 2632 | v_lag = memory + 143 + 40 * i - lag[i]; | |
| 437 |
2/2✓ Branch 0 taken 105280 times.
✓ Branch 1 taken 2632 times.
|
107912 | for (v_len = v_in + 40; v_in < v_len; v_in++) { |
| 438 |
2/2✓ Branch 0 taken 31280 times.
✓ Branch 1 taken 74000 times.
|
105280 | if (pfrac[i]) { // If it is a fractional lag... |
| 439 |
2/2✓ Branch 0 taken 125120 times.
✓ Branch 1 taken 31280 times.
|
156400 | for (j = 0, *v_out = 0.0; j < 4; j++) |
| 440 | 125120 | *v_out += qcelp_hammsinc_table[j] * | |
| 441 | 125120 | (v_lag[j - 4] + v_lag[3 - j]); | |
| 442 | } else | ||
| 443 | 74000 | *v_out = *v_lag; | |
| 444 | |||
| 445 | 105280 | *v_out = *v_in + gain[i] * *v_out; | |
| 446 | |||
| 447 | 105280 | v_lag++; | |
| 448 | 105280 | v_out++; | |
| 449 | } | ||
| 450 | } else { | ||
| 451 | ✗ | memcpy(v_out, v_in, 40 * sizeof(float)); | |
| 452 | ✗ | v_in += 40; | |
| 453 | ✗ | v_out += 40; | |
| 454 | } | ||
| 455 | } | ||
| 456 | |||
| 457 | 658 | memmove(memory, memory + 160, 143 * sizeof(float)); | |
| 458 | 658 | return memory + 143; | |
| 459 | } | ||
| 460 | |||
| 461 | /** | ||
| 462 | * Apply pitch synthesis filter and pitch prefilter to the scaled codebook vector. | ||
| 463 | * TIA/EIA/IS-733 2.4.5.2, 2.4.8.7.2 | ||
| 464 | * | ||
| 465 | * @param q the context | ||
| 466 | * @param cdn_vector the scaled codebook vector | ||
| 467 | */ | ||
| 468 | 497 | static void apply_pitch_filters(QCELPContext *q, float *cdn_vector) | |
| 469 | { | ||
| 470 | int i; | ||
| 471 | const float *v_synthesis_filtered, *v_pre_filtered; | ||
| 472 | |||
| 473 |
3/4✓ Branch 0 taken 168 times.
✓ Branch 1 taken 329 times.
✓ Branch 2 taken 168 times.
✗ Branch 3 not taken.
|
497 | if (q->bitrate >= RATE_HALF || q->bitrate == SILENCE || |
| 474 |
3/4✓ Branch 0 taken 17 times.
✓ Branch 1 taken 151 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 17 times.
|
168 | (q->bitrate == I_F_Q && (q->prev_bitrate >= RATE_HALF))) { |
| 475 | |||
| 476 |
1/2✓ Branch 0 taken 329 times.
✗ Branch 1 not taken.
|
329 | if (q->bitrate >= RATE_HALF) { |
| 477 | // Compute gain & lag for the whole frame. | ||
| 478 |
2/2✓ Branch 0 taken 1316 times.
✓ Branch 1 taken 329 times.
|
1645 | for (i = 0; i < 4; i++) { |
| 479 |
1/2✓ Branch 0 taken 1316 times.
✗ Branch 1 not taken.
|
1316 | q->pitch_gain[i] = q->frame.plag[i] ? (q->frame.pgain[i] + 1) * 0.25 : 0.0; |
| 480 | |||
| 481 | 1316 | q->pitch_lag[i] = q->frame.plag[i] + 16; | |
| 482 | } | ||
| 483 | } else { | ||
| 484 | float max_pitch_gain; | ||
| 485 | |||
| 486 | ✗ | if (q->bitrate == I_F_Q) { | |
| 487 | ✗ | if (q->erasure_count < 3) | |
| 488 | ✗ | max_pitch_gain = 0.9 - 0.3 * (q->erasure_count - 1); | |
| 489 | else | ||
| 490 | ✗ | max_pitch_gain = 0.0; | |
| 491 | } else { | ||
| 492 | av_assert2(q->bitrate == SILENCE); | ||
| 493 | ✗ | max_pitch_gain = 1.0; | |
| 494 | } | ||
| 495 | ✗ | for (i = 0; i < 4; i++) | |
| 496 | ✗ | q->pitch_gain[i] = FFMIN(q->pitch_gain[i], max_pitch_gain); | |
| 497 | |||
| 498 | ✗ | memset(q->frame.pfrac, 0, sizeof(q->frame.pfrac)); | |
| 499 | } | ||
| 500 | |||
| 501 | // pitch synthesis filter | ||
| 502 | 329 | v_synthesis_filtered = do_pitchfilter(q->pitch_synthesis_filter_mem, | |
| 503 | 329 | cdn_vector, q->pitch_gain, | |
| 504 | 329 | q->pitch_lag, q->frame.pfrac); | |
| 505 | |||
| 506 | // pitch prefilter update | ||
| 507 |
2/2✓ Branch 0 taken 1316 times.
✓ Branch 1 taken 329 times.
|
1645 | for (i = 0; i < 4; i++) |
| 508 |
2/2✓ Branch 0 taken 61 times.
✓ Branch 1 taken 1255 times.
|
1316 | q->pitch_gain[i] = 0.5 * FFMIN(q->pitch_gain[i], 1.0); |
| 509 | |||
| 510 | 329 | v_pre_filtered = do_pitchfilter(q->pitch_pre_filter_mem, | |
| 511 | v_synthesis_filtered, | ||
| 512 | 329 | q->pitch_gain, q->pitch_lag, | |
| 513 | 329 | q->frame.pfrac); | |
| 514 | |||
| 515 | 329 | apply_gain_ctrl(cdn_vector, v_synthesis_filtered, v_pre_filtered); | |
| 516 | } else { | ||
| 517 | 168 | memcpy(q->pitch_synthesis_filter_mem, | |
| 518 | 168 | cdn_vector + 17, 143 * sizeof(float)); | |
| 519 | 168 | memcpy(q->pitch_pre_filter_mem, cdn_vector + 17, 143 * sizeof(float)); | |
| 520 | 168 | memset(q->pitch_gain, 0, sizeof(q->pitch_gain)); | |
| 521 | 168 | memset(q->pitch_lag, 0, sizeof(q->pitch_lag)); | |
| 522 | } | ||
| 523 | 497 | } | |
| 524 | |||
| 525 | /** | ||
| 526 | * Reconstruct LPC coefficients from the line spectral pair frequencies | ||
| 527 | * and perform bandwidth expansion. | ||
| 528 | * | ||
| 529 | * @param lspf line spectral pair frequencies | ||
| 530 | * @param lpc linear predictive coding coefficients | ||
| 531 | * | ||
| 532 | * @note: bandwidth_expansion_coeff could be precalculated into a table | ||
| 533 | * but it seems to be slower on x86 | ||
| 534 | * | ||
| 535 | * TIA/EIA/IS-733 2.4.3.3.5 | ||
| 536 | */ | ||
| 537 | 1484 | static void lspf2lpc(const float *lspf, float *lpc) | |
| 538 | { | ||
| 539 | double lsp[10]; | ||
| 540 | 1484 | double bandwidth_expansion_coeff = QCELP_BANDWIDTH_EXPANSION_COEFF; | |
| 541 | int i; | ||
| 542 | |||
| 543 |
2/2✓ Branch 0 taken 14840 times.
✓ Branch 1 taken 1484 times.
|
16324 | for (i = 0; i < 10; i++) |
| 544 | 14840 | lsp[i] = cos(M_PI * lspf[i]); | |
| 545 | |||
| 546 | 1484 | ff_acelp_lspd2lpc(lsp, lpc, 5); | |
| 547 | |||
| 548 |
2/2✓ Branch 0 taken 14840 times.
✓ Branch 1 taken 1484 times.
|
16324 | for (i = 0; i < 10; i++) { |
| 549 | 14840 | lpc[i] *= bandwidth_expansion_coeff; | |
| 550 | 14840 | bandwidth_expansion_coeff *= QCELP_BANDWIDTH_EXPANSION_COEFF; | |
| 551 | } | ||
| 552 | 1484 | } | |
| 553 | |||
| 554 | /** | ||
| 555 | * Interpolate LSP frequencies and compute LPC coefficients | ||
| 556 | * for a given bitrate & pitch subframe. | ||
| 557 | * | ||
| 558 | * TIA/EIA/IS-733 2.4.3.3.4, 2.4.8.7.2 | ||
| 559 | * | ||
| 560 | * @param q the context | ||
| 561 | * @param curr_lspf LSP frequencies vector of the current frame | ||
| 562 | * @param lpc float vector for the resulting LPC | ||
| 563 | * @param subframe_num frame number in decoded stream | ||
| 564 | */ | ||
| 565 | 1988 | static void interpolate_lpc(QCELPContext *q, const float *curr_lspf, | |
| 566 | float *lpc, const int subframe_num) | ||
| 567 | { | ||
| 568 | float interpolated_lspf[10]; | ||
| 569 | float weight; | ||
| 570 | |||
| 571 |
2/2✓ Branch 0 taken 1316 times.
✓ Branch 1 taken 672 times.
|
1988 | if (q->bitrate >= RATE_QUARTER) |
| 572 | 1316 | weight = 0.25 * (subframe_num + 1); | |
| 573 |
4/4✓ Branch 0 taken 604 times.
✓ Branch 1 taken 68 times.
✓ Branch 2 taken 151 times.
✓ Branch 3 taken 453 times.
|
672 | else if (q->bitrate == RATE_OCTAVE && !subframe_num) |
| 574 | 151 | weight = 0.625; | |
| 575 | else | ||
| 576 | 521 | weight = 1.0; | |
| 577 | |||
| 578 |
2/2✓ Branch 0 taken 1138 times.
✓ Branch 1 taken 850 times.
|
1988 | if (weight != 1.0) { |
| 579 | 1138 | ff_weighted_vector_sumf(interpolated_lspf, curr_lspf, q->prev_lspf, | |
| 580 | weight, 1.0 - weight, 10); | ||
| 581 | 1138 | lspf2lpc(interpolated_lspf, lpc); | |
| 582 |
2/2✓ Branch 0 taken 521 times.
✓ Branch 1 taken 329 times.
|
850 | } else if (q->bitrate >= RATE_QUARTER || |
| 583 |
4/4✓ Branch 0 taken 68 times.
✓ Branch 1 taken 453 times.
✓ Branch 2 taken 17 times.
✓ Branch 3 taken 51 times.
|
521 | (q->bitrate == I_F_Q && !subframe_num)) |
| 584 | 346 | lspf2lpc(curr_lspf, lpc); | |
| 585 |
1/4✗ Branch 0 not taken.
✓ Branch 1 taken 504 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
|
504 | else if (q->bitrate == SILENCE && !subframe_num) |
| 586 | ✗ | lspf2lpc(q->prev_lspf, lpc); | |
| 587 | 1988 | } | |
| 588 | |||
| 589 | 994 | static qcelp_packet_rate buf_size2bitrate(const int buf_size) | |
| 590 | { | ||
| 591 |
4/6✓ Branch 0 taken 283 times.
✓ Branch 1 taken 48 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 166 times.
✗ Branch 4 not taken.
✓ Branch 5 taken 497 times.
|
994 | switch (buf_size) { |
| 592 | 283 | case 35: return RATE_FULL; | |
| 593 | 48 | case 17: return RATE_HALF; | |
| 594 | ✗ | case 8: return RATE_QUARTER; | |
| 595 | 166 | case 4: return RATE_OCTAVE; | |
| 596 | ✗ | case 1: return SILENCE; | |
| 597 | } | ||
| 598 | |||
| 599 | 497 | return I_F_Q; | |
| 600 | } | ||
| 601 | |||
| 602 | /** | ||
| 603 | * Determine the bitrate from the frame size and/or the first byte of the frame. | ||
| 604 | * | ||
| 605 | * @param avctx the AV codec context | ||
| 606 | * @param buf_size length of the buffer | ||
| 607 | * @param buf the buffer | ||
| 608 | * | ||
| 609 | * @return the bitrate on success, | ||
| 610 | * I_F_Q if the bitrate cannot be satisfactorily determined | ||
| 611 | * | ||
| 612 | * TIA/EIA/IS-733 2.4.8.7.1 | ||
| 613 | */ | ||
| 614 | 497 | static qcelp_packet_rate determine_bitrate(AVCodecContext *avctx, | |
| 615 | const int buf_size, | ||
| 616 | const uint8_t **buf) | ||
| 617 | { | ||
| 618 | qcelp_packet_rate bitrate; | ||
| 619 | |||
| 620 |
1/2✗ Branch 1 not taken.
✓ Branch 2 taken 497 times.
|
497 | if ((bitrate = buf_size2bitrate(buf_size)) >= 0) { |
| 621 | ✗ | if (bitrate > **buf) { | |
| 622 | ✗ | QCELPContext *q = avctx->priv_data; | |
| 623 | ✗ | if (!q->warned_buf_mismatch_bitrate) { | |
| 624 | ✗ | av_log(avctx, AV_LOG_WARNING, | |
| 625 | "Claimed bitrate and buffer size mismatch.\n"); | ||
| 626 | ✗ | q->warned_buf_mismatch_bitrate = 1; | |
| 627 | } | ||
| 628 | ✗ | bitrate = **buf; | |
| 629 | ✗ | } else if (bitrate < **buf) { | |
| 630 | ✗ | av_log(avctx, AV_LOG_ERROR, | |
| 631 | "Buffer is too small for the claimed bitrate.\n"); | ||
| 632 | ✗ | return I_F_Q; | |
| 633 | } | ||
| 634 | ✗ | (*buf)++; | |
| 635 |
1/2✓ Branch 1 taken 497 times.
✗ Branch 2 not taken.
|
497 | } else if ((bitrate = buf_size2bitrate(buf_size + 1)) >= 0) { |
| 636 | 497 | av_log(avctx, AV_LOG_WARNING, | |
| 637 | "Bitrate byte missing, guessing bitrate from packet size.\n"); | ||
| 638 | } else | ||
| 639 | ✗ | return I_F_Q; | |
| 640 | |||
| 641 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 497 times.
|
497 | if (bitrate == SILENCE) { |
| 642 | // FIXME: Remove this warning when tested with samples. | ||
| 643 | ✗ | avpriv_request_sample(avctx, "Blank frame handling"); | |
| 644 | } | ||
| 645 | 497 | return bitrate; | |
| 646 | } | ||
| 647 | |||
| 648 | 17 | static void warn_insufficient_frame_quality(AVCodecContext *avctx, | |
| 649 | const char *message) | ||
| 650 | { | ||
| 651 | 17 | av_log(avctx, AV_LOG_WARNING, "Frame #%"PRId64", IFQ: %s\n", | |
| 652 | avctx->frame_num, message); | ||
| 653 | 17 | } | |
| 654 | |||
| 655 | 497 | static void postfilter(QCELPContext *q, float *samples, float *lpc) | |
| 656 | { | ||
| 657 | static const float pow_0_775[10] = { | ||
| 658 | 0.775000, 0.600625, 0.465484, 0.360750, 0.279582, | ||
| 659 | 0.216676, 0.167924, 0.130141, 0.100859, 0.078166 | ||
| 660 | }, pow_0_625[10] = { | ||
| 661 | 0.625000, 0.390625, 0.244141, 0.152588, 0.095367, | ||
| 662 | 0.059605, 0.037253, 0.023283, 0.014552, 0.009095 | ||
| 663 | }; | ||
| 664 | float lpc_s[10], lpc_p[10], pole_out[170], zero_out[160]; | ||
| 665 | int n; | ||
| 666 | |||
| 667 |
2/2✓ Branch 0 taken 4970 times.
✓ Branch 1 taken 497 times.
|
5467 | for (n = 0; n < 10; n++) { |
| 668 | 4970 | lpc_s[n] = lpc[n] * pow_0_625[n]; | |
| 669 | 4970 | lpc_p[n] = lpc[n] * pow_0_775[n]; | |
| 670 | } | ||
| 671 | |||
| 672 | 497 | ff_celp_lp_zero_synthesis_filterf(zero_out, lpc_s, | |
| 673 | 497 | q->formant_mem + 10, 160, 10); | |
| 674 | 497 | memcpy(pole_out, q->postfilter_synth_mem, sizeof(float) * 10); | |
| 675 | 497 | ff_celp_lp_synthesis_filterf(pole_out + 10, lpc_p, zero_out, 160, 10); | |
| 676 | 497 | memcpy(q->postfilter_synth_mem, pole_out + 160, sizeof(float) * 10); | |
| 677 | |||
| 678 | 497 | ff_tilt_compensation(&q->postfilter_tilt_mem, 0.3, pole_out + 10, 160); | |
| 679 | |||
| 680 | 497 | ff_adaptive_gain_control(samples, pole_out + 10, | |
| 681 | 497 | ff_scalarproduct_float_c(q->formant_mem + 10, | |
| 682 | 497 | q->formant_mem + 10, | |
| 683 | 160), | ||
| 684 | 160, 0.9375, &q->postfilter_agc_mem); | ||
| 685 | 497 | } | |
| 686 | |||
| 687 | 497 | static int qcelp_decode_frame(AVCodecContext *avctx, AVFrame *frame, | |
| 688 | int *got_frame_ptr, AVPacket *avpkt) | ||
| 689 | { | ||
| 690 | 497 | const uint8_t *buf = avpkt->data; | |
| 691 | 497 | int buf_size = avpkt->size; | |
| 692 | 497 | QCELPContext *q = avctx->priv_data; | |
| 693 | float *outbuffer; | ||
| 694 | int i, ret; | ||
| 695 | float quantized_lspf[10], lpc[10]; | ||
| 696 | float gain[16]; | ||
| 697 | float *formant_mem; | ||
| 698 | |||
| 699 | /* get output buffer */ | ||
| 700 | 497 | frame->nb_samples = 160; | |
| 701 |
1/2✗ Branch 1 not taken.
✓ Branch 2 taken 497 times.
|
497 | if ((ret = ff_get_buffer(avctx, frame, 0)) < 0) |
| 702 | ✗ | return ret; | |
| 703 | 497 | outbuffer = (float *)frame->data[0]; | |
| 704 | |||
| 705 |
1/2✗ Branch 1 not taken.
✓ Branch 2 taken 497 times.
|
497 | if ((q->bitrate = determine_bitrate(avctx, buf_size, &buf)) == I_F_Q) { |
| 706 | ✗ | warn_insufficient_frame_quality(avctx, "Bitrate cannot be determined."); | |
| 707 | ✗ | goto erasure; | |
| 708 | } | ||
| 709 | |||
| 710 |
2/2✓ Branch 0 taken 166 times.
✓ Branch 1 taken 331 times.
|
497 | if (q->bitrate == RATE_OCTAVE && |
| 711 |
2/2✓ Branch 0 taken 15 times.
✓ Branch 1 taken 151 times.
|
166 | (q->first16bits = AV_RB16(buf)) == 0xFFFF) { |
| 712 | 15 | warn_insufficient_frame_quality(avctx, "Bitrate is 1/8 and first 16 bits are on."); | |
| 713 | 15 | goto erasure; | |
| 714 | } | ||
| 715 | |||
| 716 |
1/2✓ Branch 0 taken 482 times.
✗ Branch 1 not taken.
|
482 | if (q->bitrate > SILENCE) { |
| 717 | 482 | const QCELPBitmap *bitmaps = qcelp_unpacking_bitmaps_per_rate[q->bitrate]; | |
| 718 | 482 | const QCELPBitmap *bitmaps_end = qcelp_unpacking_bitmaps_per_rate[q->bitrate] + | |
| 719 | 482 | qcelp_unpacking_bitmaps_lengths[q->bitrate]; | |
| 720 | 482 | uint8_t *unpacked_data = (uint8_t *)&q->frame; | |
| 721 | |||
| 722 |
1/2✗ Branch 1 not taken.
✓ Branch 2 taken 482 times.
|
482 | if ((ret = init_get_bits8(&q->gb, buf, buf_size)) < 0) |
| 723 | ✗ | return ret; | |
| 724 | |||
| 725 | 482 | memset(&q->frame, 0, sizeof(QCELPFrame)); | |
| 726 | |||
| 727 |
2/2✓ Branch 0 taken 26074 times.
✓ Branch 1 taken 482 times.
|
26556 | for (; bitmaps < bitmaps_end; bitmaps++) |
| 728 | 26074 | unpacked_data[bitmaps->index] |= get_bits(&q->gb, bitmaps->bitlen) << bitmaps->bitpos; | |
| 729 | |||
| 730 | // Check for erasures/blanks on rates 1, 1/4 and 1/8. | ||
| 731 |
2/2✓ Branch 0 taken 1 times.
✓ Branch 1 taken 481 times.
|
482 | if (q->frame.reserved) { |
| 732 | 1 | warn_insufficient_frame_quality(avctx, "Wrong data in reserved frame area."); | |
| 733 | 1 | goto erasure; | |
| 734 | } | ||
| 735 |
1/4✗ Branch 0 not taken.
✓ Branch 1 taken 481 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
|
481 | if (q->bitrate == RATE_QUARTER && |
| 736 | ✗ | codebook_sanity_check_for_rate_quarter(q->frame.cbgain)) { | |
| 737 | ✗ | warn_insufficient_frame_quality(avctx, "Codebook gain sanity check failed."); | |
| 738 | ✗ | goto erasure; | |
| 739 | } | ||
| 740 | |||
| 741 |
2/2✓ Branch 0 taken 330 times.
✓ Branch 1 taken 151 times.
|
481 | if (q->bitrate >= RATE_HALF) { |
| 742 |
2/2✓ Branch 0 taken 1317 times.
✓ Branch 1 taken 329 times.
|
1646 | for (i = 0; i < 4; i++) { |
| 743 |
4/4✓ Branch 0 taken 392 times.
✓ Branch 1 taken 925 times.
✓ Branch 2 taken 1 times.
✓ Branch 3 taken 391 times.
|
1317 | if (q->frame.pfrac[i] && q->frame.plag[i] >= 124) { |
| 744 | 1 | warn_insufficient_frame_quality(avctx, "Cannot initialize pitch filter."); | |
| 745 | 1 | goto erasure; | |
| 746 | } | ||
| 747 | } | ||
| 748 | } | ||
| 749 | } | ||
| 750 | |||
| 751 | 480 | decode_gain_and_index(q, gain); | |
| 752 | 480 | compute_svector(q, gain, outbuffer); | |
| 753 | |||
| 754 |
1/2✗ Branch 1 not taken.
✓ Branch 2 taken 480 times.
|
480 | if (decode_lspf(q, quantized_lspf) < 0) { |
| 755 | ✗ | warn_insufficient_frame_quality(avctx, "Badly received packets in frame."); | |
| 756 | ✗ | goto erasure; | |
| 757 | } | ||
| 758 | |||
| 759 | 480 | apply_pitch_filters(q, outbuffer); | |
| 760 | |||
| 761 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 480 times.
|
480 | if (q->bitrate == I_F_Q) { |
| 762 | ✗ | erasure: | |
| 763 | 17 | q->bitrate = I_F_Q; | |
| 764 | 17 | q->erasure_count++; | |
| 765 | 17 | decode_gain_and_index(q, gain); | |
| 766 | 17 | compute_svector(q, gain, outbuffer); | |
| 767 | 17 | decode_lspf(q, quantized_lspf); | |
| 768 | 17 | apply_pitch_filters(q, outbuffer); | |
| 769 | } else | ||
| 770 | 480 | q->erasure_count = 0; | |
| 771 | |||
| 772 | 497 | formant_mem = q->formant_mem + 10; | |
| 773 |
2/2✓ Branch 0 taken 1988 times.
✓ Branch 1 taken 497 times.
|
2485 | for (i = 0; i < 4; i++) { |
| 774 | 1988 | interpolate_lpc(q, quantized_lspf, lpc, i); | |
| 775 | 1988 | ff_celp_lp_synthesis_filterf(formant_mem, lpc, | |
| 776 | 1988 | outbuffer + i * 40, 40, 10); | |
| 777 | 1988 | formant_mem += 40; | |
| 778 | } | ||
| 779 | |||
| 780 | // postfilter, as per TIA/EIA/IS-733 2.4.8.6 | ||
| 781 | 497 | postfilter(q, outbuffer, lpc); | |
| 782 | |||
| 783 | 497 | memcpy(q->formant_mem, q->formant_mem + 160, 10 * sizeof(float)); | |
| 784 | |||
| 785 | 497 | memcpy(q->prev_lspf, quantized_lspf, sizeof(q->prev_lspf)); | |
| 786 | 497 | q->prev_bitrate = q->bitrate; | |
| 787 | |||
| 788 | 497 | *got_frame_ptr = 1; | |
| 789 | |||
| 790 | 497 | return buf_size; | |
| 791 | } | ||
| 792 | |||
| 793 | const FFCodec ff_qcelp_decoder = { | ||
| 794 | .p.name = "qcelp", | ||
| 795 | CODEC_LONG_NAME("QCELP / PureVoice"), | ||
| 796 | .p.type = AVMEDIA_TYPE_AUDIO, | ||
| 797 | .p.id = AV_CODEC_ID_QCELP, | ||
| 798 | .init = qcelp_decode_init, | ||
| 799 | FF_CODEC_DECODE_CB(qcelp_decode_frame), | ||
| 800 | .p.capabilities = AV_CODEC_CAP_DR1 | AV_CODEC_CAP_CHANNEL_CONF, | ||
| 801 | .priv_data_size = sizeof(QCELPContext), | ||
| 802 | }; | ||
| 803 |