OLD | NEW |
1 /* | 1 /* |
2 * Copyright (c) 2011 The WebRTC project authors. All Rights Reserved. | 2 * Copyright (c) 2011 The WebRTC project authors. All Rights Reserved. |
3 * | 3 * |
4 * Use of this source code is governed by a BSD-style license | 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 | 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 | 6 * tree. An additional intellectual property rights grant can be found |
7 * in the file PATENTS. All contributing project authors may | 7 * in the file PATENTS. All contributing project authors may |
8 * be found in the AUTHORS file in the root of the source tree. | 8 * be found in the AUTHORS file in the root of the source tree. |
9 */ | 9 */ |
10 | 10 |
11 /****************************************************************** | 11 /****************************************************************** |
12 | 12 |
13 iLBC Speech Coder ANSI-C Source Code | 13 iLBC Speech Coder ANSI-C Source Code |
14 | 14 |
15 WebRtcIlbcfix_NearestNeighbor.c | 15 WebRtcIlbcfix_NearestNeighbor.c |
16 | 16 |
17 ******************************************************************/ | 17 ******************************************************************/ |
18 | 18 |
19 #include "defines.h" | 19 #include "defines.h" |
20 | 20 |
21 /*----------------------------------------------------------------* | 21 void WebRtcIlbcfix_NearestNeighbor(size_t* index, |
22 * Find index in array such that the array element with said | 22 const size_t* array, |
23 * index is the element of said array closest to "value" | 23 size_t value, |
24 * according to the squared-error criterion | 24 size_t arlength) { |
25 *---------------------------------------------------------------*/ | |
26 | |
27 void WebRtcIlbcfix_NearestNeighbor( | |
28 int16_t *index, /* (o) index of array element closest to value */ | |
29 int16_t *array, /* (i) data array (Q2) */ | |
30 int16_t value, /* (i) value (Q2) */ | |
31 size_t arlength /* (i) dimension of data array (==8) */ | |
32 ){ | |
33 size_t i; | 25 size_t i; |
34 int16_t diff; | 26 size_t min_diff = (size_t)-1; |
35 /* Stack based */ | 27 for (i = 0; i < arlength; i++) { |
36 int32_t crit[8]; | 28 const size_t diff = |
37 | 29 (array[i] < value) ? (value - array[i]) : (array[i] - value); |
38 /* Calculate square distance */ | 30 if (diff < min_diff) { |
39 for(i=0;i<arlength;i++){ | 31 *index = i; |
40 diff=array[i]-value; | 32 min_diff = diff; |
41 crit[i] = diff * diff; | 33 } |
42 } | 34 } |
43 | |
44 /* Find the minimum square distance */ | |
45 *index=WebRtcSpl_MinIndexW32(crit, arlength); | |
46 } | 35 } |
OLD | NEW |