Gustaf Ullberg | bbfcc70 | 2018-06-19 12:33:36 +0200 | [diff] [blame] | 1 | /* |
| 2 | * Copyright (c) 2018 The WebRTC project authors. All Rights Reserved. |
| 3 | * |
| 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 |
| 6 | * tree. An additional intellectual property rights grant can be found |
| 7 | * in the file PATENTS. All contributing project authors may |
| 8 | * be found in the AUTHORS file in the root of the source tree. |
| 9 | */ |
| 10 | |
| 11 | #include "modules/audio_processing/aec3/moving_average.h" |
Jonas Olsson | a4d8737 | 2019-07-05 19:08:33 +0200 | [diff] [blame] | 12 | |
Gustaf Ullberg | bbfcc70 | 2018-06-19 12:33:36 +0200 | [diff] [blame] | 13 | #include "test/gtest.h" |
| 14 | |
| 15 | namespace webrtc { |
| 16 | |
| 17 | TEST(MovingAverage, Average) { |
| 18 | constexpr size_t num_elem = 4; |
| 19 | constexpr size_t mem_len = 3; |
| 20 | constexpr float e = 1e-6f; |
| 21 | aec3::MovingAverage ma(num_elem, mem_len); |
| 22 | std::array<float, num_elem> data1 = {1, 2, 3, 4}; |
| 23 | std::array<float, num_elem> data2 = {5, 1, 9, 7}; |
| 24 | std::array<float, num_elem> data3 = {3, 3, 5, 6}; |
| 25 | std::array<float, num_elem> data4 = {8, 4, 2, 1}; |
| 26 | std::array<float, num_elem> output; |
| 27 | |
| 28 | ma.Average(data1, output); |
| 29 | EXPECT_NEAR(output[0], data1[0] / 3.0f, e); |
| 30 | EXPECT_NEAR(output[1], data1[1] / 3.0f, e); |
| 31 | EXPECT_NEAR(output[2], data1[2] / 3.0f, e); |
| 32 | EXPECT_NEAR(output[3], data1[3] / 3.0f, e); |
| 33 | |
| 34 | ma.Average(data2, output); |
| 35 | EXPECT_NEAR(output[0], (data1[0] + data2[0]) / 3.0f, e); |
| 36 | EXPECT_NEAR(output[1], (data1[1] + data2[1]) / 3.0f, e); |
| 37 | EXPECT_NEAR(output[2], (data1[2] + data2[2]) / 3.0f, e); |
| 38 | EXPECT_NEAR(output[3], (data1[3] + data2[3]) / 3.0f, e); |
| 39 | |
| 40 | ma.Average(data3, output); |
| 41 | EXPECT_NEAR(output[0], (data1[0] + data2[0] + data3[0]) / 3.0f, e); |
| 42 | EXPECT_NEAR(output[1], (data1[1] + data2[1] + data3[1]) / 3.0f, e); |
| 43 | EXPECT_NEAR(output[2], (data1[2] + data2[2] + data3[2]) / 3.0f, e); |
| 44 | EXPECT_NEAR(output[3], (data1[3] + data2[3] + data3[3]) / 3.0f, e); |
| 45 | |
| 46 | ma.Average(data4, output); |
| 47 | EXPECT_NEAR(output[0], (data2[0] + data3[0] + data4[0]) / 3.0f, e); |
| 48 | EXPECT_NEAR(output[1], (data2[1] + data3[1] + data4[1]) / 3.0f, e); |
| 49 | EXPECT_NEAR(output[2], (data2[2] + data3[2] + data4[2]) / 3.0f, e); |
| 50 | EXPECT_NEAR(output[3], (data2[3] + data3[3] + data4[3]) / 3.0f, e); |
| 51 | } |
| 52 | |
| 53 | TEST(MovingAverage, PassThrough) { |
| 54 | constexpr size_t num_elem = 4; |
| 55 | constexpr size_t mem_len = 1; |
| 56 | constexpr float e = 1e-6f; |
| 57 | aec3::MovingAverage ma(num_elem, mem_len); |
| 58 | std::array<float, num_elem> data1 = {1, 2, 3, 4}; |
| 59 | std::array<float, num_elem> data2 = {5, 1, 9, 7}; |
| 60 | std::array<float, num_elem> data3 = {3, 3, 5, 6}; |
| 61 | std::array<float, num_elem> data4 = {8, 4, 2, 1}; |
| 62 | std::array<float, num_elem> output; |
| 63 | |
| 64 | ma.Average(data1, output); |
| 65 | EXPECT_NEAR(output[0], data1[0], e); |
| 66 | EXPECT_NEAR(output[1], data1[1], e); |
| 67 | EXPECT_NEAR(output[2], data1[2], e); |
| 68 | EXPECT_NEAR(output[3], data1[3], e); |
| 69 | |
| 70 | ma.Average(data2, output); |
| 71 | EXPECT_NEAR(output[0], data2[0], e); |
| 72 | EXPECT_NEAR(output[1], data2[1], e); |
| 73 | EXPECT_NEAR(output[2], data2[2], e); |
| 74 | EXPECT_NEAR(output[3], data2[3], e); |
| 75 | |
| 76 | ma.Average(data3, output); |
| 77 | EXPECT_NEAR(output[0], data3[0], e); |
| 78 | EXPECT_NEAR(output[1], data3[1], e); |
| 79 | EXPECT_NEAR(output[2], data3[2], e); |
| 80 | EXPECT_NEAR(output[3], data3[3], e); |
| 81 | |
| 82 | ma.Average(data4, output); |
| 83 | EXPECT_NEAR(output[0], data4[0], e); |
| 84 | EXPECT_NEAR(output[1], data4[1], e); |
| 85 | EXPECT_NEAR(output[2], data4[2], e); |
| 86 | EXPECT_NEAR(output[3], data4[3], e); |
| 87 | } |
| 88 | |
| 89 | } // namespace webrtc |