| 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 |
| (...skipping 23 matching lines...) Expand all Loading... |
| 34 static const int16_t kReferenceMin[32] = { | 34 static const int16_t kReferenceMin[32] = { |
| 35 1600, 720, 509, 512, 532, 552, 570, 588, | 35 1600, 720, 509, 512, 532, 552, 570, 588, |
| 36 606, 624, 642, 659, 675, 691, 707, 723, | 36 606, 624, 642, 659, 675, 691, 707, 723, |
| 37 1600, 544, 502, 522, 542, 561, 579, 597, | 37 1600, 544, 502, 522, 542, 561, 579, 597, |
| 38 615, 633, 651, 667, 683, 699, 715, 731 | 38 615, 633, 651, 667, 683, 699, 715, 731 |
| 39 }; | 39 }; |
| 40 | 40 |
| 41 // Construct a speech signal that will trigger the VAD in all modes. It is | 41 // Construct a speech signal that will trigger the VAD in all modes. It is |
| 42 // known that (i * i) will wrap around, but that doesn't matter in this case. | 42 // known that (i * i) will wrap around, but that doesn't matter in this case. |
| 43 for (int16_t i = 0; i < kMaxFrameLenSp; ++i) { | 43 for (int16_t i = 0; i < kMaxFrameLenSp; ++i) { |
| 44 data_in[i] = (i * i); | 44 data_in[i] = static_cast<int16_t>(i * i); |
| 45 } | 45 } |
| 46 // Input values all zeros, expect all zeros out. | 46 // Input values all zeros, expect all zeros out. |
| 47 WebRtcVad_Downsampling(zeros, data_out, state, kMaxFrameLenSp); | 47 WebRtcVad_Downsampling(zeros, data_out, state, kMaxFrameLenSp); |
| 48 EXPECT_EQ(0, state[0]); | 48 EXPECT_EQ(0, state[0]); |
| 49 EXPECT_EQ(0, state[1]); | 49 EXPECT_EQ(0, state[1]); |
| 50 for (int16_t i = 0; i < kMaxFrameLenSp / 2; ++i) { | 50 for (int16_t i = 0; i < kMaxFrameLenSp / 2; ++i) { |
| 51 EXPECT_EQ(0, data_out[i]); | 51 EXPECT_EQ(0, data_out[i]); |
| 52 } | 52 } |
| 53 // Make a simple non-zero data test. | 53 // Make a simple non-zero data test. |
| 54 WebRtcVad_Downsampling(data_in, data_out, state, kMaxFrameLenSp); | 54 WebRtcVad_Downsampling(data_in, data_out, state, kMaxFrameLenSp); |
| (...skipping 10 matching lines...) Expand all Loading... |
| 65 // Use values both above and below initialized value. | 65 // Use values both above and below initialized value. |
| 66 EXPECT_EQ(kReferenceMin[i], WebRtcVad_FindMinimum(self, value, j)); | 66 EXPECT_EQ(kReferenceMin[i], WebRtcVad_FindMinimum(self, value, j)); |
| 67 EXPECT_EQ(kReferenceMin[i + 16], WebRtcVad_FindMinimum(self, 12000, j)); | 67 EXPECT_EQ(kReferenceMin[i + 16], WebRtcVad_FindMinimum(self, 12000, j)); |
| 68 } | 68 } |
| 69 self->frame_counter++; | 69 self->frame_counter++; |
| 70 } | 70 } |
| 71 | 71 |
| 72 free(self); | 72 free(self); |
| 73 } | 73 } |
| 74 } // namespace | 74 } // namespace |
| OLD | NEW |