blob: b4eee66219030e8df7bc2f16f0e270b55ffde8b3 [file] [log] [blame]
niklase@google.com470e71d2011-07-07 08:21:25 +00001/*
2 * Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
3 *
4 * Use of this source code is governed by a BSD-style license
5 * that can be found in the LICENSE file in the root of the source
6 * tree. An additional intellectual property rights grant can be found
7 * in the file PATENTS. All contributing project authors may
8 * be found in the AUTHORS file in the root of the source tree.
9 */
10
11/******************************************************************
12
13 iLBC Speech Coder ANSI-C Source Code
14
15 WebRtcIlbcfix_Chebyshev.c
16
17******************************************************************/
18
Timothy Gu31117832020-12-18 22:25:57 -080019#include "modules/audio_coding/codecs/ilbc/chebyshev.h"
20
Mirko Bonadei06c2aa92018-02-01 15:11:41 +010021#include "modules/audio_coding/codecs/ilbc/constants.h"
Timothy Gu31117832020-12-18 22:25:57 -080022#include "modules/audio_coding/codecs/ilbc/defines.h"
niklase@google.com470e71d2011-07-07 08:21:25 +000023
24/*------------------------------------------------------------------*
25 * Calculate the Chevyshev polynomial series
26 * F(w) = 2*exp(-j5w)*C(x)
27 * C(x) = (T_0(x) + f(1)T_1(x) + ... + f(4)T_1(x) + f(5)/2)
28 * T_i(x) is the i:th order Chebyshev polynomial
29 *------------------------------------------------------------------*/
30
pbos@webrtc.org0946a562013-04-09 00:28:06 +000031int16_t WebRtcIlbcfix_Chebyshev(
niklase@google.com470e71d2011-07-07 08:21:25 +000032 /* (o) Result of C(x) */
pbos@webrtc.org0946a562013-04-09 00:28:06 +000033 int16_t x, /* (i) Value to the Chevyshev polynomial */
34 int16_t *f /* (i) The coefficients in the polynomial */
niklase@google.com470e71d2011-07-07 08:21:25 +000035 ) {
pbos@webrtc.org0946a562013-04-09 00:28:06 +000036 int16_t b1_high, b1_low; /* Use the high, low format to increase the accuracy */
37 int32_t b2;
38 int32_t tmp1W32;
39 int32_t tmp2W32;
niklase@google.com470e71d2011-07-07 08:21:25 +000040 int i;
41
pbos@webrtc.org0946a562013-04-09 00:28:06 +000042 b2 = (int32_t)0x1000000; /* b2 = 1.0 (Q23) */
niklase@google.com470e71d2011-07-07 08:21:25 +000043 /* Calculate b1 = 2*x + f[1] */
bjornv@webrtc.org4ab23d02015-03-20 06:01:06 +000044 tmp1W32 = (x << 10) + (f[1] << 14);
niklase@google.com470e71d2011-07-07 08:21:25 +000045
46 for (i = 2; i < 5; i++) {
47 tmp2W32 = tmp1W32;
48
49 /* Split b1 (in tmp1W32) into a high and low part */
bjornv@webrtc.org78ea06d2014-10-21 07:17:24 +000050 b1_high = (int16_t)(tmp1W32 >> 16);
51 b1_low = (int16_t)((tmp1W32 - ((int32_t)b1_high << 16)) >> 1);
niklase@google.com470e71d2011-07-07 08:21:25 +000052
53 /* Calculate 2*x*b1-b2+f[i] */
bjornv@webrtc.org4ab23d02015-03-20 06:01:06 +000054 tmp1W32 = ((b1_high * x + ((b1_low * x) >> 15)) << 2) - b2 + (f[i] << 14);
niklase@google.com470e71d2011-07-07 08:21:25 +000055
56 /* Update b2 for next round */
57 b2 = tmp2W32;
58 }
59
60 /* Split b1 (in tmp1W32) into a high and low part */
bjornv@webrtc.org78ea06d2014-10-21 07:17:24 +000061 b1_high = (int16_t)(tmp1W32 >> 16);
62 b1_low = (int16_t)((tmp1W32 - ((int32_t)b1_high << 16)) >> 1);
niklase@google.com470e71d2011-07-07 08:21:25 +000063
64 /* tmp1W32 = x*b1 - b2 + f[i]/2 */
bjornv@webrtc.org4ab23d02015-03-20 06:01:06 +000065 tmp1W32 = ((b1_high * x) << 1) + (((b1_low * x) >> 15) << 1) -
66 b2 + (f[i] << 13);
niklase@google.com470e71d2011-07-07 08:21:25 +000067
pbos@webrtc.org0946a562013-04-09 00:28:06 +000068 /* Handle overflows and set to maximum or minimum int16_t instead */
69 if (tmp1W32>((int32_t)33553408)) {
niklase@google.com470e71d2011-07-07 08:21:25 +000070 return(WEBRTC_SPL_WORD16_MAX);
pbos@webrtc.org0946a562013-04-09 00:28:06 +000071 } else if (tmp1W32<((int32_t)-33554432)) {
niklase@google.com470e71d2011-07-07 08:21:25 +000072 return(WEBRTC_SPL_WORD16_MIN);
73 } else {
bjornv@webrtc.org78ea06d2014-10-21 07:17:24 +000074 return (int16_t)(tmp1W32 >> 10);
niklase@google.com470e71d2011-07-07 08:21:25 +000075 }
76}