A method for estimating the time intervals between transactions in speech-compression algorithms

Abstract

A method is described for estimating the time intervals between transactions in speech-compression algorithms based on a complex Markov process, each state of which is a 2-parallel Markov process that describes the “competition” between the source of the signal that fills the buffer and the receiver of the signal that empties the buffer. The complex Markov process is transformed into an ordinary process, whose states simulate the number of buffer cells that are filled at the current time. This makes it possible to obtain a dependence connecting the probability of failure, the amount of buffer memory, and the mathematical expectations of the times of filling and emptying the buffer.