mirror of
https://github.com/mollyim/webrtc.git
synced 2025-05-13 13:50:40 +01:00
06c2aa9f7b
WebRTC internal code should always use include paths that start from the root of the project and that clearly identify the header file. This allows 'gn check' to actually keep dependencies under control because 'gn check' cannot enforce anything if the include path is not fully qualified (starting from the root of the project). Bug: webrtc:8815 Change-Id: I36f01784fa5f5b77eefc02db479b1f7f6ee1a8c3 Reviewed-on: https://webrtc-review.googlesource.com/46263 Reviewed-by: Karl Wiberg <kwiberg@webrtc.org> Commit-Queue: Mirko Bonadei <mbonadei@webrtc.org> Cr-Commit-Position: refs/heads/master@{#21871}
62 lines
1.7 KiB
C
62 lines
1.7 KiB
C
/*
|
|
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
*
|
|
* Use of this source code is governed by a BSD-style license
|
|
* that can be found in the LICENSE file in the root of the source
|
|
* tree. An additional intellectual property rights grant can be found
|
|
* in the file PATENTS. All contributing project authors may
|
|
* be found in the AUTHORS file in the root of the source tree.
|
|
*/
|
|
|
|
/******************************************************************
|
|
|
|
iLBC Speech Coder ANSI-C Source Code
|
|
|
|
WebRtcIlbcfix_Vq4.c
|
|
|
|
******************************************************************/
|
|
|
|
#include "modules/audio_coding/codecs/ilbc/vq4.h"
|
|
#include "modules/audio_coding/codecs/ilbc/constants.h"
|
|
|
|
/*----------------------------------------------------------------*
|
|
* vector quantization
|
|
*---------------------------------------------------------------*/
|
|
|
|
void WebRtcIlbcfix_Vq4(
|
|
int16_t *Xq, /* quantized vector (Q13) */
|
|
int16_t *index,
|
|
int16_t *CB, /* codebook in Q13 */
|
|
int16_t *X, /* vector to quantize (Q13) */
|
|
int16_t n_cb
|
|
){
|
|
int16_t i, j;
|
|
int16_t pos, minindex=0;
|
|
int16_t tmp;
|
|
int32_t dist, mindist;
|
|
|
|
pos = 0;
|
|
mindist = WEBRTC_SPL_WORD32_MAX; /* start value */
|
|
|
|
/* Find the codebook with the lowest square distance */
|
|
for (j = 0; j < n_cb; j++) {
|
|
tmp = X[0] - CB[pos];
|
|
dist = tmp * tmp;
|
|
for (i = 1; i < 4; i++) {
|
|
tmp = X[i] - CB[pos + i];
|
|
dist += tmp * tmp;
|
|
}
|
|
|
|
if (dist < mindist) {
|
|
mindist = dist;
|
|
minindex = j;
|
|
}
|
|
pos += 4;
|
|
}
|
|
|
|
/* Store the quantized codebook and the index */
|
|
for (i = 0; i < 4; i++) {
|
|
Xq[i] = CB[minindex*4 + i];
|
|
}
|
|
*index = minindex;
|
|
}
|