mirror of
https://github.com/mollyim/webrtc.git
synced 2025-05-14 14:20:45 +01:00
8037fc6ffa
Bug: webrtc:342905193 No-Try: True Change-Id: Icc968be43b8830038ea9a1f5f604307220457807 Reviewed-on: https://webrtc-review.googlesource.com/c/src/+/361021 Auto-Submit: Florent Castelli <orphis@webrtc.org> Reviewed-by: Harald Alvestrand <hta@webrtc.org> Commit-Queue: Florent Castelli <orphis@webrtc.org> Cr-Commit-Position: refs/heads/main@{#42911}
44 lines
1.3 KiB
C++
44 lines
1.3 KiB
C++
/*
|
|
* Copyright (c) 2021 The WebRTC project authors. All Rights Reserved.
|
|
*
|
|
* Use of this source code is governed by a BSD-style license
|
|
* that can be found in the LICENSE file in the root of the source
|
|
* tree. An additional intellectual property rights grant can be found
|
|
* in the file PATENTS. All contributing project authors may
|
|
* be found in the AUTHORS file in the root of the source tree.
|
|
*/
|
|
|
|
#ifndef MODULES_AUDIO_CODING_NETEQ_REORDER_OPTIMIZER_H_
|
|
#define MODULES_AUDIO_CODING_NETEQ_REORDER_OPTIMIZER_H_
|
|
|
|
#include <optional>
|
|
|
|
#include "modules/audio_coding/neteq/histogram.h"
|
|
|
|
namespace webrtc {
|
|
|
|
// Calculates an optimal delay to reduce the chance of missing reordered
|
|
// packets. The delay/loss trade-off can be tune using the `ms_per_loss_percent`
|
|
// parameter.
|
|
class ReorderOptimizer {
|
|
public:
|
|
ReorderOptimizer(int forget_factor,
|
|
int ms_per_loss_percent,
|
|
std::optional<int> start_forget_weight);
|
|
|
|
void Update(int relative_delay_ms, bool reordered, int base_delay_ms);
|
|
|
|
std::optional<int> GetOptimalDelayMs() const { return optimal_delay_ms_; }
|
|
|
|
void Reset();
|
|
|
|
private:
|
|
int MinimizeCostFunction(int base_delay_ms) const;
|
|
|
|
Histogram histogram_;
|
|
const int ms_per_loss_percent_;
|
|
std::optional<int> optimal_delay_ms_;
|
|
};
|
|
|
|
} // namespace webrtc
|
|
#endif // MODULES_AUDIO_CODING_NETEQ_REORDER_OPTIMIZER_H_
|