blob: 5bdab7a4b0811a744f2ecec06bae9ec0b2ce250f [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_Refiner.c
16
17******************************************************************/
18
Timothy Gu31117832020-12-18 22:25:57 -080019#include "modules/audio_coding/codecs/ilbc/refiner.h"
20
Mirko Bonadei06c2aa92018-02-01 15:11:41 +010021#include "modules/audio_coding/codecs/ilbc/constants.h"
22#include "modules/audio_coding/codecs/ilbc/enh_upsample.h"
23#include "modules/audio_coding/codecs/ilbc/my_corr.h"
niklase@google.com470e71d2011-07-07 08:21:25 +000024
25/*----------------------------------------------------------------*
26 * find segment starting near idata+estSegPos that has highest
27 * correlation with idata+centerStartPos through
28 * idata+centerStartPos+ENH_BLOCKL-1 segment is found at a
29 * resolution of ENH_UPSO times the original of the original
30 * sampling rate
31 *---------------------------------------------------------------*/
32
33void WebRtcIlbcfix_Refiner(
Peter Kasting1380e262015-08-28 17:31:03 -070034 size_t *updStartPos, /* (o) updated start point (Q-2) */
pbos@webrtc.org0946a562013-04-09 00:28:06 +000035 int16_t *idata, /* (i) original data buffer */
Peter Kasting1380e262015-08-28 17:31:03 -070036 size_t idatal, /* (i) dimension of idata */
37 size_t centerStartPos, /* (i) beginning center segment */
38 size_t estSegPos, /* (i) estimated beginning other segment (Q-2) */
pbos@webrtc.org0946a562013-04-09 00:28:06 +000039 int16_t *surround, /* (i/o) The contribution from this sequence
niklase@google.com470e71d2011-07-07 08:21:25 +000040 summed with earlier contributions */
pbos@webrtc.org0946a562013-04-09 00:28:06 +000041 int16_t gain /* (i) Gain to use for this sequence */
niklase@google.com470e71d2011-07-07 08:21:25 +000042 ){
Peter Kasting1380e262015-08-28 17:31:03 -070043 size_t estSegPosRounded, searchSegStartPos, searchSegEndPos, corrdim;
44 size_t tloc, tloc2, i;
niklase@google.com470e71d2011-07-07 08:21:25 +000045
pbos@webrtc.org0946a562013-04-09 00:28:06 +000046 int32_t maxtemp, scalefact;
47 int16_t *filtStatePtr, *polyPtr;
niklase@google.com470e71d2011-07-07 08:21:25 +000048 /* Stack based */
pbos@webrtc.org0946a562013-04-09 00:28:06 +000049 int16_t filt[7];
50 int32_t corrVecUps[ENH_CORRDIM*ENH_UPS0];
51 int32_t corrVecTemp[ENH_CORRDIM];
52 int16_t vect[ENH_VECTL];
53 int16_t corrVec[ENH_CORRDIM];
niklase@google.com470e71d2011-07-07 08:21:25 +000054
niklase@google.com470e71d2011-07-07 08:21:25 +000055 /* defining array bounds */
56
bjornv@webrtc.orgf71785c2014-10-08 15:36:30 +000057 estSegPosRounded = (estSegPos - 2) >> 2;
niklase@google.com470e71d2011-07-07 08:21:25 +000058
Peter Kasting1380e262015-08-28 17:31:03 -070059 searchSegStartPos =
60 (estSegPosRounded < ENH_SLOP) ? 0 : (estSegPosRounded - ENH_SLOP);
niklase@google.com470e71d2011-07-07 08:21:25 +000061
Peter Kasting1380e262015-08-28 17:31:03 -070062 searchSegEndPos = estSegPosRounded + ENH_SLOP;
63 if ((searchSegEndPos + ENH_BLOCKL) >= idatal) {
64 searchSegEndPos = idatal - ENH_BLOCKL - 1;
niklase@google.com470e71d2011-07-07 08:21:25 +000065 }
niklase@google.com470e71d2011-07-07 08:21:25 +000066
Peter Kasting1380e262015-08-28 17:31:03 -070067 corrdim = searchSegEndPos + 1 - searchSegStartPos;
niklase@google.com470e71d2011-07-07 08:21:25 +000068
69 /* compute upsampled correlation and find
70 location of max */
71
Peter Kasting1380e262015-08-28 17:31:03 -070072 WebRtcIlbcfix_MyCorr(corrVecTemp, idata + searchSegStartPos,
73 corrdim + ENH_BLOCKL - 1, idata + centerStartPos,
74 ENH_BLOCKL);
niklase@google.com470e71d2011-07-07 08:21:25 +000075
76 /* Calculate the rescaling factor for the correlation in order to
pbos@webrtc.org0946a562013-04-09 00:28:06 +000077 put the correlation in a int16_t vector instead */
Peter Kasting1380e262015-08-28 17:31:03 -070078 maxtemp = WebRtcSpl_MaxAbsValueW32(corrVecTemp, corrdim);
niklase@google.com470e71d2011-07-07 08:21:25 +000079
Peter Kasting1380e262015-08-28 17:31:03 -070080 scalefact = WebRtcSpl_GetSizeInBits(maxtemp) - 15;
niklase@google.com470e71d2011-07-07 08:21:25 +000081
Peter Kasting1380e262015-08-28 17:31:03 -070082 if (scalefact > 0) {
83 for (i = 0; i < corrdim; i++) {
bjornv@webrtc.org78ea06d2014-10-21 07:17:24 +000084 corrVec[i] = (int16_t)(corrVecTemp[i] >> scalefact);
niklase@google.com470e71d2011-07-07 08:21:25 +000085 }
86 } else {
Peter Kasting1380e262015-08-28 17:31:03 -070087 for (i = 0; i < corrdim; i++) {
88 corrVec[i] = (int16_t)corrVecTemp[i];
niklase@google.com470e71d2011-07-07 08:21:25 +000089 }
90 }
91 /* In order to guarantee that all values are initialized */
Peter Kasting1380e262015-08-28 17:31:03 -070092 for (i = corrdim; i < ENH_CORRDIM; i++) {
93 corrVec[i] = 0;
niklase@google.com470e71d2011-07-07 08:21:25 +000094 }
95
96 /* Upsample the correlation */
Peter Kasting1380e262015-08-28 17:31:03 -070097 WebRtcIlbcfix_EnhUpsample(corrVecUps, corrVec);
niklase@google.com470e71d2011-07-07 08:21:25 +000098
99 /* Find maximum */
Peter Kasting1380e262015-08-28 17:31:03 -0700100 tloc = WebRtcSpl_MaxIndexW32(corrVecUps, ENH_UPS0 * corrdim);
niklase@google.com470e71d2011-07-07 08:21:25 +0000101
102 /* make vector can be upsampled without ever running outside
103 bounds */
Peter Kasting1380e262015-08-28 17:31:03 -0700104 *updStartPos = searchSegStartPos * 4 + tloc + 4;
niklase@google.com470e71d2011-07-07 08:21:25 +0000105
bjornv@webrtc.orgf71785c2014-10-08 15:36:30 +0000106 tloc2 = (tloc + 3) >> 2;
niklase@google.com470e71d2011-07-07 08:21:25 +0000107
niklase@google.com470e71d2011-07-07 08:21:25 +0000108 /* initialize the vector to be filtered, stuff with zeros
109 when data is outside idata buffer */
Peter Kasting1380e262015-08-28 17:31:03 -0700110 if (ENH_FL0 > (searchSegStartPos + tloc2)) {
111 const size_t st = ENH_FL0 - searchSegStartPos - tloc2;
112 WebRtcSpl_MemSetW16(vect, 0, st);
113 WEBRTC_SPL_MEMCPY_W16(&vect[st], idata, ENH_VECTL - st);
114 } else {
115 const size_t st = searchSegStartPos + tloc2 - ENH_FL0;
116 if ((st + ENH_VECTL) > idatal) {
117 const size_t en = st + ENH_VECTL - idatal;
118 WEBRTC_SPL_MEMCPY_W16(vect, &idata[st], ENH_VECTL - en);
119 WebRtcSpl_MemSetW16(&vect[ENH_VECTL - en], 0, en);
120 } else {
niklase@google.com470e71d2011-07-07 08:21:25 +0000121 WEBRTC_SPL_MEMCPY_W16(vect, &idata[st], ENH_VECTL);
122 }
123 }
niklase@google.com470e71d2011-07-07 08:21:25 +0000124
125 /* compute the segment (this is actually a convolution) */
niklase@google.com470e71d2011-07-07 08:21:25 +0000126 filtStatePtr = filt + 6;
Peter Kasting1380e262015-08-28 17:31:03 -0700127 polyPtr = (int16_t*)WebRtcIlbcfix_kEnhPolyPhaser[tloc2 * ENH_UPS0 - tloc];
128 for (i = 0; i < 7; i++) {
niklase@google.com470e71d2011-07-07 08:21:25 +0000129 *filtStatePtr-- = *polyPtr++;
130 }
131
Peter Kasting1380e262015-08-28 17:31:03 -0700132 WebRtcSpl_FilterMAFastQ12(&vect[6], vect, filt, ENH_FLO_MULT2_PLUS1,
133 ENH_BLOCKL);
niklase@google.com470e71d2011-07-07 08:21:25 +0000134
Peter Kasting1380e262015-08-28 17:31:03 -0700135 /* Add the contribution from this vector (scaled with gain) to the total
136 surround vector */
137 WebRtcSpl_AddAffineVectorToVector(surround, vect, gain, 32768, 16,
138 ENH_BLOCKL);
niklase@google.com470e71d2011-07-07 08:21:25 +0000139
140 return;
141}