OLD | NEW |
1 /* | 1 /* |
2 * Copyright (c) 2012 The WebRTC project authors. All Rights Reserved. | 2 * Copyright (c) 2012 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 #include "webrtc/common_audio/signal_processing/include/signal_processing_librar
y.h" | 11 #include "webrtc/common_audio/signal_processing/include/signal_processing_librar
y.h" |
12 | 12 |
13 #include <assert.h> | 13 #include "webrtc/base/checks.h" |
14 | 14 |
15 size_t WebRtcSpl_AutoCorrelation(const int16_t* in_vector, | 15 size_t WebRtcSpl_AutoCorrelation(const int16_t* in_vector, |
16 size_t in_vector_length, | 16 size_t in_vector_length, |
17 size_t order, | 17 size_t order, |
18 int32_t* result, | 18 int32_t* result, |
19 int* scale) { | 19 int* scale) { |
20 int32_t sum = 0; | 20 int32_t sum = 0; |
21 size_t i = 0, j = 0; | 21 size_t i = 0, j = 0; |
22 int16_t smax = 0; | 22 int16_t smax = 0; |
23 int scaling = 0; | 23 int scaling = 0; |
24 | 24 |
25 assert(order <= in_vector_length); | 25 RTC_DCHECK_LE(order, in_vector_length); |
26 | 26 |
27 // Find the maximum absolute value of the samples. | 27 // Find the maximum absolute value of the samples. |
28 smax = WebRtcSpl_MaxAbsValueW16(in_vector, in_vector_length); | 28 smax = WebRtcSpl_MaxAbsValueW16(in_vector, in_vector_length); |
29 | 29 |
30 // In order to avoid overflow when computing the sum we should scale the | 30 // In order to avoid overflow when computing the sum we should scale the |
31 // samples so that (in_vector_length * smax * smax) will not overflow. | 31 // samples so that (in_vector_length * smax * smax) will not overflow. |
32 if (smax == 0) { | 32 if (smax == 0) { |
33 scaling = 0; | 33 scaling = 0; |
34 } else { | 34 } else { |
35 // Number of bits in the sum loop. | 35 // Number of bits in the sum loop. |
(...skipping 20 matching lines...) Expand all Loading... |
56 } | 56 } |
57 for (; j < in_vector_length - i; j++) { | 57 for (; j < in_vector_length - i; j++) { |
58 sum += (in_vector[j] * in_vector[i + j]) >> scaling; | 58 sum += (in_vector[j] * in_vector[i + j]) >> scaling; |
59 } | 59 } |
60 *result++ = sum; | 60 *result++ = sum; |
61 } | 61 } |
62 | 62 |
63 *scale = scaling; | 63 *scale = scaling; |
64 return order + 1; | 64 return order + 1; |
65 } | 65 } |
OLD | NEW |