blob: 9008232fb262988c7287f563921d1c760f45ec27 [file] [log] [blame]
peah522d71b2017-02-23 05:16:26 -08001/*
2 * Copyright (c) 2017 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
Mirko Bonadei92ea95e2017-09-15 06:47:31 +020011#include "modules/audio_processing/aec3/aec_state.h"
peah522d71b2017-02-23 05:16:26 -080012
Per Åhgren8ba58612017-12-01 23:01:44 +010013#include "modules/audio_processing/aec3/aec3_fft.h"
14#include "modules/audio_processing/aec3/render_delay_buffer.h"
Mirko Bonadei92ea95e2017-09-15 06:47:31 +020015#include "modules/audio_processing/logging/apm_data_dumper.h"
16#include "test/gtest.h"
peah522d71b2017-02-23 05:16:26 -080017
18namespace webrtc {
19
20// Verify the general functionality of AecState
21TEST(AecState, NormalUsage) {
22 ApmDataDumper data_dumper(42);
Per Åhgren8ba58612017-12-01 23:01:44 +010023 EchoCanceller3Config config;
24 AecState state(config);
Per Åhgren3ab308f2018-02-21 08:46:03 +010025 rtc::Optional<DelayEstimate> delay_estimate;
Per Åhgren8ba58612017-12-01 23:01:44 +010026 std::unique_ptr<RenderDelayBuffer> render_delay_buffer(
27 RenderDelayBuffer::Create(config, 3));
peah86afe9d2017-04-06 15:45:32 -070028 std::array<float, kFftLengthBy2Plus1> E2_main = {};
29 std::array<float, kFftLengthBy2Plus1> Y2 = {};
30 std::vector<std::vector<float>> x(3, std::vector<float>(kBlockSize, 0.f));
Per Åhgren8ba58612017-12-01 23:01:44 +010031 EchoPathVariability echo_path_variability(
32 false, EchoPathVariability::DelayAdjustment::kNone, false);
peah29103572017-07-11 02:54:02 -070033 std::array<float, kBlockSize> s;
Per Åhgren8ba58612017-12-01 23:01:44 +010034 Aec3Fft fft;
peah29103572017-07-11 02:54:02 -070035 s.fill(100.f);
peah522d71b2017-02-23 05:16:26 -080036
37 std::vector<std::array<float, kFftLengthBy2Plus1>>
38 converged_filter_frequency_response(10);
39 for (auto& v : converged_filter_frequency_response) {
40 v.fill(0.01f);
41 }
42 std::vector<std::array<float, kFftLengthBy2Plus1>>
43 diverged_filter_frequency_response = converged_filter_frequency_response;
44 converged_filter_frequency_response[2].fill(100.f);
peah86afe9d2017-04-06 15:45:32 -070045 converged_filter_frequency_response[2][0] = 1.f;
peah522d71b2017-02-23 05:16:26 -080046
Per Åhgren09a718a2017-12-11 22:28:45 +010047 std::vector<float> impulse_response(
Per Åhgren08ea5892018-01-15 08:07:41 +010048 GetTimeDomainLength(config.filter.main.length_blocks), 0.f);
peah29103572017-07-11 02:54:02 -070049
Per Åhgrende22a172017-12-20 18:00:51 +010050 // Verify that linear AEC usability is false when the filter is diverged.
Per Åhgren3ab308f2018-02-21 08:46:03 +010051 state.Update(delay_estimate, diverged_filter_frequency_response,
52 impulse_response, true, *render_delay_buffer->GetRenderBuffer(),
53 E2_main, Y2, s, false);
peah522d71b2017-02-23 05:16:26 -080054 EXPECT_FALSE(state.UsableLinearEstimate());
55
56 // Verify that linear AEC usability is true when the filter is converged
peah86afe9d2017-04-06 15:45:32 -070057 std::fill(x[0].begin(), x[0].end(), 101.f);
58 for (int k = 0; k < 3000; ++k) {
Per Åhgren0e6d2f52017-12-20 22:19:56 +010059 render_delay_buffer->Insert(x);
Per Åhgren3ab308f2018-02-21 08:46:03 +010060 state.Update(
61 delay_estimate, converged_filter_frequency_response, impulse_response,
62 true, *render_delay_buffer->GetRenderBuffer(), E2_main, Y2, s, false);
peah522d71b2017-02-23 05:16:26 -080063 }
64 EXPECT_TRUE(state.UsableLinearEstimate());
65
66 // Verify that linear AEC usability becomes false after an echo path change is
67 // reported
Per Åhgren8ba58612017-12-01 23:01:44 +010068 state.HandleEchoPathChange(EchoPathVariability(
69 true, EchoPathVariability::DelayAdjustment::kNone, false));
Per Åhgren3ab308f2018-02-21 08:46:03 +010070 state.Update(delay_estimate, converged_filter_frequency_response,
71 impulse_response, true, *render_delay_buffer->GetRenderBuffer(),
72 E2_main, Y2, s, false);
peah522d71b2017-02-23 05:16:26 -080073 EXPECT_FALSE(state.UsableLinearEstimate());
74
75 // Verify that the active render detection works as intended.
peah86afe9d2017-04-06 15:45:32 -070076 std::fill(x[0].begin(), x[0].end(), 101.f);
Per Åhgren0e6d2f52017-12-20 22:19:56 +010077 render_delay_buffer->Insert(x);
Per Åhgren8ba58612017-12-01 23:01:44 +010078 state.HandleEchoPathChange(EchoPathVariability(
79 true, EchoPathVariability::DelayAdjustment::kNewDetectedDelay, false));
Per Åhgren3ab308f2018-02-21 08:46:03 +010080 state.Update(delay_estimate, converged_filter_frequency_response,
81 impulse_response, true, *render_delay_buffer->GetRenderBuffer(),
82 E2_main, Y2, s, false);
peah522d71b2017-02-23 05:16:26 -080083 EXPECT_FALSE(state.ActiveRender());
84
peah86afe9d2017-04-06 15:45:32 -070085 for (int k = 0; k < 1000; ++k) {
Per Åhgren0e6d2f52017-12-20 22:19:56 +010086 render_delay_buffer->Insert(x);
Per Åhgren3ab308f2018-02-21 08:46:03 +010087 state.Update(
88 delay_estimate, converged_filter_frequency_response, impulse_response,
89 true, *render_delay_buffer->GetRenderBuffer(), E2_main, Y2, s, false);
peah86afe9d2017-04-06 15:45:32 -070090 }
peah522d71b2017-02-23 05:16:26 -080091 EXPECT_TRUE(state.ActiveRender());
92
93 // Verify that echo leakage is properly reported.
Per Åhgren3ab308f2018-02-21 08:46:03 +010094 state.Update(delay_estimate, converged_filter_frequency_response,
95 impulse_response, true, *render_delay_buffer->GetRenderBuffer(),
96 E2_main, Y2, s, false);
peah522d71b2017-02-23 05:16:26 -080097 EXPECT_FALSE(state.EchoLeakageDetected());
98
Per Åhgren3ab308f2018-02-21 08:46:03 +010099 state.Update(delay_estimate, converged_filter_frequency_response,
100 impulse_response, true, *render_delay_buffer->GetRenderBuffer(),
101 E2_main, Y2, s, true);
peah522d71b2017-02-23 05:16:26 -0800102 EXPECT_TRUE(state.EchoLeakageDetected());
103
peah522d71b2017-02-23 05:16:26 -0800104 // Verify that the ERL is properly estimated
peah86afe9d2017-04-06 15:45:32 -0700105 for (auto& x_k : x) {
106 x_k = std::vector<float>(kBlockSize, 0.f);
107 }
108
109 x[0][0] = 5000.f;
Per Åhgrenc59a5762017-12-11 21:34:19 +0100110 for (size_t k = 0;
Per Åhgrenec22e3f2017-12-20 15:20:37 +0100111 k < render_delay_buffer->GetRenderBuffer()->GetFftBuffer().size(); ++k) {
Per Åhgren8ba58612017-12-01 23:01:44 +0100112 render_delay_buffer->Insert(x);
113 if (k == 0) {
114 render_delay_buffer->Reset();
115 }
Per Åhgrenc59a5762017-12-11 21:34:19 +0100116 render_delay_buffer->PrepareCaptureProcessing();
peah86afe9d2017-04-06 15:45:32 -0700117 }
118
119 Y2.fill(10.f * 10000.f * 10000.f);
120 for (size_t k = 0; k < 1000; ++k) {
Per Åhgren3ab308f2018-02-21 08:46:03 +0100121 state.Update(
122 delay_estimate, converged_filter_frequency_response, impulse_response,
123 true, *render_delay_buffer->GetRenderBuffer(), E2_main, Y2, s, false);
peah522d71b2017-02-23 05:16:26 -0800124 }
125
126 ASSERT_TRUE(state.UsableLinearEstimate());
127 const std::array<float, kFftLengthBy2Plus1>& erl = state.Erl();
peah86afe9d2017-04-06 15:45:32 -0700128 EXPECT_EQ(erl[0], erl[1]);
129 for (size_t k = 1; k < erl.size() - 1; ++k) {
130 EXPECT_NEAR(k % 2 == 0 ? 10.f : 1000.f, erl[k], 0.1);
131 }
132 EXPECT_EQ(erl[erl.size() - 2], erl[erl.size() - 1]);
peah522d71b2017-02-23 05:16:26 -0800133
134 // Verify that the ERLE is properly estimated
peah86afe9d2017-04-06 15:45:32 -0700135 E2_main.fill(1.f * 10000.f * 10000.f);
peah522d71b2017-02-23 05:16:26 -0800136 Y2.fill(10.f * E2_main[0]);
peah86afe9d2017-04-06 15:45:32 -0700137 for (size_t k = 0; k < 1000; ++k) {
Per Åhgren3ab308f2018-02-21 08:46:03 +0100138 state.Update(
139 delay_estimate, converged_filter_frequency_response, impulse_response,
140 true, *render_delay_buffer->GetRenderBuffer(), E2_main, Y2, s, false);
peah522d71b2017-02-23 05:16:26 -0800141 }
142 ASSERT_TRUE(state.UsableLinearEstimate());
peah86afe9d2017-04-06 15:45:32 -0700143 {
144 const auto& erle = state.Erle();
145 EXPECT_EQ(erle[0], erle[1]);
peah1d680892017-05-23 04:07:10 -0700146 constexpr size_t kLowFrequencyLimit = 32;
147 for (size_t k = 1; k < kLowFrequencyLimit; ++k) {
peah86afe9d2017-04-06 15:45:32 -0700148 EXPECT_NEAR(k % 2 == 0 ? 8.f : 1.f, erle[k], 0.1);
149 }
peah1d680892017-05-23 04:07:10 -0700150 for (size_t k = kLowFrequencyLimit; k < erle.size() - 1; ++k) {
151 EXPECT_NEAR(k % 2 == 0 ? 1.5f : 1.f, erle[k], 0.1);
152 }
peah86afe9d2017-04-06 15:45:32 -0700153 EXPECT_EQ(erle[erle.size() - 2], erle[erle.size() - 1]);
154 }
peah522d71b2017-02-23 05:16:26 -0800155
peah86afe9d2017-04-06 15:45:32 -0700156 E2_main.fill(1.f * 10000.f * 10000.f);
peah522d71b2017-02-23 05:16:26 -0800157 Y2.fill(5.f * E2_main[0]);
peah86afe9d2017-04-06 15:45:32 -0700158 for (size_t k = 0; k < 1000; ++k) {
Per Åhgren3ab308f2018-02-21 08:46:03 +0100159 state.Update(
160 delay_estimate, converged_filter_frequency_response, impulse_response,
161 true, *render_delay_buffer->GetRenderBuffer(), E2_main, Y2, s, false);
peah522d71b2017-02-23 05:16:26 -0800162 }
peah86afe9d2017-04-06 15:45:32 -0700163
peah522d71b2017-02-23 05:16:26 -0800164 ASSERT_TRUE(state.UsableLinearEstimate());
peah86afe9d2017-04-06 15:45:32 -0700165 {
166 const auto& erle = state.Erle();
167 EXPECT_EQ(erle[0], erle[1]);
peah1d680892017-05-23 04:07:10 -0700168 constexpr size_t kLowFrequencyLimit = 32;
169 for (size_t k = 1; k < kLowFrequencyLimit; ++k) {
peah86afe9d2017-04-06 15:45:32 -0700170 EXPECT_NEAR(k % 2 == 0 ? 5.f : 1.f, erle[k], 0.1);
171 }
peah1d680892017-05-23 04:07:10 -0700172 for (size_t k = kLowFrequencyLimit; k < erle.size() - 1; ++k) {
173 EXPECT_NEAR(k % 2 == 0 ? 1.5f : 1.f, erle[k], 0.1);
174 }
peah86afe9d2017-04-06 15:45:32 -0700175 EXPECT_EQ(erle[erle.size() - 2], erle[erle.size() - 1]);
176 }
peah522d71b2017-02-23 05:16:26 -0800177}
178
peah522d71b2017-02-23 05:16:26 -0800179// Verifies the delay for a converged filter is correctly identified.
180TEST(AecState, ConvergedFilterDelay) {
181 constexpr int kFilterLength = 10;
Per Åhgren8ba58612017-12-01 23:01:44 +0100182 EchoCanceller3Config config;
183 AecState state(config);
184 std::unique_ptr<RenderDelayBuffer> render_delay_buffer(
185 RenderDelayBuffer::Create(config, 3));
Per Åhgren3ab308f2018-02-21 08:46:03 +0100186 rtc::Optional<DelayEstimate> delay_estimate;
peah522d71b2017-02-23 05:16:26 -0800187 std::array<float, kFftLengthBy2Plus1> E2_main;
peah522d71b2017-02-23 05:16:26 -0800188 std::array<float, kFftLengthBy2Plus1> Y2;
189 std::array<float, kBlockSize> x;
Per Åhgren8ba58612017-12-01 23:01:44 +0100190 EchoPathVariability echo_path_variability(
191 false, EchoPathVariability::DelayAdjustment::kNone, false);
peah29103572017-07-11 02:54:02 -0700192 std::array<float, kBlockSize> s;
193 s.fill(100.f);
peah522d71b2017-02-23 05:16:26 -0800194 x.fill(0.f);
195
196 std::vector<std::array<float, kFftLengthBy2Plus1>> frequency_response(
197 kFilterLength);
198
Per Åhgren09a718a2017-12-11 22:28:45 +0100199 std::vector<float> impulse_response(
Per Åhgren08ea5892018-01-15 08:07:41 +0100200 GetTimeDomainLength(config.filter.main.length_blocks), 0.f);
peah29103572017-07-11 02:54:02 -0700201
peah522d71b2017-02-23 05:16:26 -0800202 // Verify that the filter delay for a converged filter is properly identified.
203 for (int k = 0; k < kFilterLength; ++k) {
204 for (auto& v : frequency_response) {
205 v.fill(0.01f);
206 }
207 frequency_response[k].fill(100.f);
peah86afe9d2017-04-06 15:45:32 -0700208 frequency_response[k][0] = 0.f;
209 state.HandleEchoPathChange(echo_path_variability);
Per Åhgren3ab308f2018-02-21 08:46:03 +0100210 state.Update(delay_estimate, frequency_response, impulse_response, true,
Per Åhgren0e6d2f52017-12-20 22:19:56 +0100211 *render_delay_buffer->GetRenderBuffer(), E2_main, Y2, s,
Per Åhgren8ba58612017-12-01 23:01:44 +0100212 false);
peah522d71b2017-02-23 05:16:26 -0800213 if (k != (kFilterLength - 1)) {
214 EXPECT_EQ(k, state.FilterDelay());
215 }
216 }
217}
218
peah522d71b2017-02-23 05:16:26 -0800219} // namespace webrtc