Papers
Topics
Authors
Recent
2000 character limit reached

Efficient Quality-Based Playout Buffer Algorithm

Published 15 Sep 2009 in cs.MM | (0909.2816v1)

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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.