# US 2004/0057382 A1 · Method of distributed voice transmission

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2004/0057382 A1
- Document ID: US20040057382A1
- Status: Published application
- Kind: A1
- Application number: 09/972,727
- Filed: 2001-10-05
- Published: 2004-03-25
- Earliest claimed: 2000-10-09
- Inventors: Anurag Kumar; Rama. Kumar Mopidevi
- Web page: https://patentgrep.com/patent/US20040057382A1

## CPC

- H04L 12/6418: {Hybrid transport}
- H04L 65/80: Responding to QoS
- H04M 7/006: {Networks other than PSTN/ISDN providing telephone service, e.g. Voice over Internet Protocol (VoIP) , including next generation networks with a packet-switched transport layer (H04L65/00 takes precedence; aspects not specific to the type of network H04M3/00; special services in those networks H04M3/42)}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04M: TELEPHONIC COMMUNICATION (circuits for controlling other apparatus via a telephone cable and not involving telephone switching apparatus G08)

## Abstract

The disclosed invention provides a method for reducing the delay in speech play out in network conferencing such as in the Internet and the like communication systems. The method entails steps directly computing excess play out delay for a given target loss probability; estimating the excess delay required at the beginning of a talk spurt, such that straggling packets catch up; providing a built-in notion of target loss probability (TLP) as a parameter and producing excess play out delay; binding late packet probability, thereby emerging a class of algorithms.

## Claims

### Claim 1

A method for minimizing end-to-end voice delay in packet telephony comprises steps of directly computing an excess play out delay for a given target loss probability; estimating excess delay required at the beginning of a talk spurt, such that straggling packets catch up; providing a built-in notion of target loss probability (TLP) as a parameter and producing excess play out delay; binding late packet probability, thereby emerging a class of algorithms.

### Claim 2 (depends on 1)

The method for minimizing end-to-end voice delay in packet telephony of claim 1, one of the said algorithms is based on the stochastic approximation (SA) approach, where loss probability function is Ploss (h, b), where h is the VAD hangover and b is the play out delay.

### Claim 3 (depends on 2)

The method for minimizing end-to-end voice delay in packet telephony of claim 2, the b performs the function of fixed hangover.

### Claim 4 (depends on 2)

The method for minimizing end-to-end voice delay in packet telephony of claim 2, the TLP p* solves the equation Ploss(h, b).

### Claim 5 (depends on 2)

The method for minimizing end-to-end voice delay in packet telephony of claim 2, the achieved loss probability is measured with a given value of b.

### Claim 6 (depends on 1)

The method for minimizing end-to-end voice delay in packet telephony of claim 1, another algorithm used fact for a talk spurt in which packet delays are (X1, X2, . . . Xn), the required play out delay for no packet loss is b=max (Xj−X1).

### Claim 7 (depends on 6)

The method for minimizing end-to-end voice delay in packet telephony of claim 6, in case of the tolerated loss probability is p*, 1<=J<=b* is used, which is the 1−p* percentile of [(X2−X1) . . . (Xn−X1).

### Claim 8 (depends on 7)

The method for minimizing end-to-end voice delay in packet telephony of claim 7, in which the zero of the percentile is negative.

### Claim 9 (depends on 1, 2, 3, 4, 5, 6)

The method for minimizing end-to-end voice delay in packet telephony of claims 1 to 6, in which the approach used to obtain a running estimate of the play out delay is by exponentially weighting of moving average (EWMA).

### Claim 10 (depends on 7)

The method for minimizing end-to-end voice delay in packet telephony of claim 7, in which the estimate is used in the next talk spurt, yielding another sample to be used to further correct the estimate.

### Claim 11 (depends on 1, 2, 3, 4, 5, 6, 7)

The method for minimizing end-to-end voice delay in packet telephony of claims 1 to 7, in which play out delay is kept small by dynamically adjusting the h.

### Claim 12 (depends on 1, 2, 3, 4, 5, 6, 7, 8)

The method for minimizing end-to-end voice delay in packet telephony of claims 1 to 8, in the equation Ploss (h,b)=p*, the hangovers h and the excess play out delay b are adopted, so as to minimize b while maintaining h above a minimum desired value.

### Claim 13 (depends on 1, 2, 3, 4, 5, 6, 7, 8, 9, 10)

The method for minimizing end-to-end voice delay in packet telephony of claims 1 to 10, in optimizing the play out delay, the receiver is periodically fed with new h values to the sender.

### Claim 14 (depends on 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11)

The method for minimizing end-to-end voice delay in packet telephony of claims 1 to 11, the achieved loss probability is measured with a given value of the b.

### Claim 15 (depends on 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12)

The method for minimizing end-to-end voice delay in packet telephony of claims 1 to 12, an estimate of b is iteratively improved by using the stochastic approximation (SA) algorithm.

### Claim 16

The method for minimizing end-to-end voice delay in packet telephony of any of the preceding claims, the algorithms emerged provide the excess play out iodelay for a given target loss probability.
