Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Efficient Quality-Based Playout Buffer Algorithm (0909.2816v1)

Published 15 Sep 2009 in cs.MM

Abstract: Playout buffers are used in VoIP systems to compensate for network delay jitter by making a trade-off between delay and loss. In this work we propose a playout buffer algorithm that makes the trade-off based on maximization of conversational speech quality, aiming to keep the computational complexity lowest possible. We model the network delay using a Pareto distribution and show that it is a good compromise between providing an appropriate fit to the network delay characteristics and yielding a low arithmetical complexity. We use the ITU-T E-Model as the quality model and simplify its delay impairment function. The proposed playout buffer algorithm finds the optimum playout delay using a closed-form solution that minimizes the sum of the simplified delay impairment factor and the loss-dependent equipment impairment factor of the E-model. The simulation results show that our proposed algorithm outperforms existing state-of-the-art algorithms with a reduced complexity for a quality-based algorithm.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (2)

Summary

We haven't generated a summary for this paper yet.