Lowering the threshold for delay change detection in AEC3

This CL lowers the threshold for delay change detection in AEC3.
This makes the delay decisions more stable.

TBR=gustaf@webrtc.org

Bug: chromium:778396,webrtc:8451
Change-Id: I8b015455399d696172b7c0beb033caf508f426e9
Reviewed-on: https://webrtc-review.googlesource.com/15541
Reviewed-by: Per Åhgren <peah@webrtc.org>
Commit-Queue: Per Åhgren <peah@webrtc.org>
Cr-Commit-Position: refs/heads/master@{#20433}
This commit is contained in:
Per Åhgren 2017-10-25 23:14:44 +02:00 committed by Commit Bot
parent 173fd91b56
commit 74e72c8c9b
3 changed files with 3 additions and 3 deletions

View File

@ -62,7 +62,7 @@ TEST(EchoPathDelayEstimator, DelayEstimation) {
EchoPathDelayEstimator estimator(&data_dumper, EchoCanceller3Config());
rtc::Optional<size_t> estimated_delay_samples;
for (size_t k = 0; k < (100 + delay_samples / kBlockSize); ++k) {
for (size_t k = 0; k < (150 + delay_samples / kBlockSize); ++k) {
RandomizeSampleVector(&random_generator, render[0]);
signal_delay_buffer.Delay(render[0], capture);
render_delay_buffer->Insert(render);

View File

@ -368,7 +368,7 @@ void MatchedFilter::Update(const DownsampledRenderBuffer& render_buffer,
[](float a, float b) -> bool { return a * a < b * b; }));
// Update the lag estimates for the matched filter.
const float kMatchingFilterThreshold = 0.1f;
const float kMatchingFilterThreshold = 0.05f;
lag_estimates_[n] = LagEstimate(
error_sum_anchor - error_sum,
(lag_estimate > 2 && lag_estimate < (filters_[n].size() - 10) &&

View File

@ -142,7 +142,7 @@ TEST(MatchedFilter, LagEstimation) {
RenderDelayBuffer::Create(3));
// Analyze the correlation between render and capture.
for (size_t k = 0; k < (100 + delay_samples / kSubBlockSize); ++k) {
for (size_t k = 0; k < (150 + delay_samples / kSubBlockSize); ++k) {
RandomizeSampleVector(&random_generator, render[0]);
signal_delay_buffer.Delay(render[0], capture);
render_delay_buffer->Insert(render);