Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

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

A method for estimating the time intervals between transactions in speech-compression algorithms 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Automatic Documentation and Mathematical Linguistics Springer Journals

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

Loading next page...
 
/lp/springer-journals/a-method-for-estimating-the-time-intervals-between-transactions-in-06sQLnAqjA
Publisher
Springer Journals
Copyright
Copyright © 2017 by Allerton Press, Inc.
Subject
Computer Science; Information Storage and Retrieval
ISSN
0005-1055
eISSN
1934-8371
DOI
10.3103/S000510551705003X
Publisher site
See Article on Publisher Site

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.

Journal

Automatic Documentation and Mathematical LinguisticsSpringer Journals

Published: Dec 7, 2017

References