kjellander@webrtc.org 36e1ad9b5d Restructuring and removing ilbc_test.gypi.
According to project structure discussed with Andrew. We want to flatten out the hierarchy and minimize the number of GYP files.

No changes at all are being made in the source files; they are just moved.
The only modified files are the GYP file and Android.mk

Kevin: I updated relative paths in Android.mk so please verify it is correct, since I don't know how to build that.

Review URL: http://webrtc-codereview.appspot.com/256006

git-svn-id: http://webrtc.googlecode.com/svn/trunk@894 4adac7df-926f-26a2-2b94-8c16560cd09d
2011-11-07 15:27:11 +00:00

64 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_Vq3.c
******************************************************************/
#include "vq3.h"
#include "constants.h"
/*----------------------------------------------------------------*
* vector quantization
*---------------------------------------------------------------*/
void WebRtcIlbcfix_Vq3(
WebRtc_Word16 *Xq, /* quantized vector (Q13) */
WebRtc_Word16 *index,
WebRtc_Word16 *CB, /* codebook in Q13 */
WebRtc_Word16 *X, /* vector to quantize (Q13) */
WebRtc_Word16 n_cb
){
WebRtc_Word16 i, j;
WebRtc_Word16 pos, minindex=0;
WebRtc_Word16 tmp;
WebRtc_Word32 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 = WEBRTC_SPL_MUL_16_16(tmp, tmp);
for (i = 1; i < 3; i++) {
tmp = X[i] - CB[pos + i];
dist += WEBRTC_SPL_MUL_16_16(tmp, tmp);
}
if (dist < mindist) {
mindist = dist;
minindex = j;
}
pos += 3;
}
/* Store the quantized codebook and the index */
for (i = 0; i < 3; i++) {
Xq[i] = CB[minindex*3 + i];
}
*index = minindex;
}