# US 2003/0223443 A1 · Apparatus and method to compensate for unsynchronized transmission of synchrous data using a sorted list

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

- Number: US 2003/0223443 A1
- Document ID: US20030223443A1
- Status: Published application
- Kind: A1
- Application number: 10/159,438
- Filed: 2002-05-30
- Published: 2003-12-04
- Earliest claimed: 2002-05-30
- Assignees: Avaya Technology Corp.
- Inventors: Norman W. Petty
- Web page: https://patentgrep.com/patent/US20030223443A1

## CPC

- G10L 19/167: {Audio streaming, i.e. formatting and decoding of an encoded audio signal representation into a data stream for transmission or storage purposes}
- H04L 49/9023: for implementing a jitter-buffer
- H04M 7/1275: {Methods and means to improve the telephone service quality, e.g. reservation, prioritisation or admission control}
- G10L: SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING
- 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

A low energy detector maintains a sorted list that defines to the circuit removing samples from the queue the location and energy of all samples that fall below the predetermined energy level. This allows a circuit removing samples to execute an algorithm that allows samples to be deleted in accordance with a predetermined pattern.

## Claims

### Claim 1

A method for compensating for unsynchronized data transmission of synchronous data, comprising the steps of:
receiving samples of synchronous data;
storing the received samples in a queue;
maintaining a sorted list of low energy samples stored in the queue;
comparing a number of the samples in the queue with a predefined capacity of the queue; and
deleting a one of the low energy samples listed in the sorted list from the queue if the number is greater than the predefined capacity.

### Claim 2 (depends on 1)

The method of claim 1 wherein the step of deleting comprises the step of removing the one of low energy samples from the queue upon the one of the low energy samples having lower energy than any other ones of the low energy samples.

### Claim 3 (depends on 2)

The method of claim 2 wherein the step of removing comprises the steps of determining a position in the queue of a previously deleted low energy sample; and
removing the one of the low energy samples from the queue if the one of the low energy samples is a predefined distance in the queue from the previously deleted low energy sample.

### Claim 4 (depends on 3)

The method of claim 3 wherein the step of removing further comprises the step of updating the sorted list to reflect the deletion of the one of the low energy samples.

### Claim 5 (depends on 3)

The method of claim 3 wherein the step of determining the position comprises the step of updating the position in the queue of the previously deleted low energy sample.

### Claim 6 (depends on 3)

The method of claim 3 wherein the step of removing further comprises the step of selecting another one of the low energy samples having the next lowest energy than any other ones of the low energy samples to be removed if the one of the low energy samples is not the predefined distance from the previously deleted low energy sample and the other one of the low energy samples is the predefined distance from the previously deleted low energy sample.

### Claim 7 (depends on 6)

The method of claim 6 wherein the step of removing further comprises updating the sorted list to reflect the deletion of the other one of the low energy samples.

### Claim 8 (depends on 6)

The method of claim 6 wherein the step of determining the position comprises updating the position in the queue of the previously deleted low energy sample.

### Claim 9 (depends on 1)

The method of claim 1 wherein the step of maintaining comprises the steps of determining if one of the received samples is below a predefined energy level;
inserting the one of the received samples into the queue; and
recording the energy level of the one of the received samples in the sorted list if the one of the received samples is below a predefined energy level.

### Claim 10 (depends on 9)

The method of claim 9 wherein the step of maintaining further comprises positioning the one of the received samples in sorted list relative to energy levels of the other low energy samples in the sorted list if the one of the received samples is below a predefined energy level.

### Claim 11

A method for compensating for unsynchronized data transmission of synchronous data, comprising the steps of:
receiving samples of synchronous data;
storing the received samples in a queue;
maintaining a sorted list of low energy samples stored in the queue;
requesting one of the received samples in the queue by an interface;
comparing a number of the samples in the queue with a predefined capacity of the queue;
deleting a one of the low energy samples listed in the sorted list if the one of the low energy sample is a next received sample in queue to be transmitted to the interface and if the number is greater than the predefined capacity; and
transmitting another one of the samples in the queue to the interface if the one of the low energy sample is deleted.

### Claim 12 (depends on 11)

The method of claim 11 wherein the step of deleting comprises the step of removing the one of low energy samples from the queue upon the one of the low energy samples having lower energy than any other ones of the low energy samples.

### Claim 13 (depends on 12)

The method of claim 12 wherein the step of removing further comprises updating the sorted list to reflect the deletion of the one of the low energy samples.

### Claim 14 (depends on 11)

The method of claim 11 wherein the step of maintaining comprises the steps of determining if one of the received samples is below a predefined energy level;
inserting the one of the received samples into the queue; and
recording the energy level of the one of the received samples in the sorted list if the one of the received samples is below a predefined energy level.

### Claim 15 (depends on 14)

The method of claim 14 wherein the step of maintaining further comprises positioning the one of the received samples in sorted list relative to energy levels of the other low energy samples in the sorted list if the one of the received samples is below a predefined energy level.

### Claim 16

An apparatus for compensating for unsynchronized data transmission of synchronous data, comprising:
a receiver for receiving samples of synchronous data;
a queue for storing the received samples;
a memory for storing a sorted list of low energy samples in the queue;
a low energy detector for storing received samples into the queue and for inserting energy levels of the low energy samples into the sorted list; and
a circuit further deleting one of the low energy samples from the queue if the queue has exceeded a predefined capacity of the queue.

### Claim 17 (depends on 16)

The apparatus of claim 16 wherein the circuit only deletes the one of the low energy samples if the one of the low energy samples has less energy than any other ones of the low energy samples.

### Claim 18 (depends on 17)

The apparatus of claim 17 wherein the circuit further determines the position of the one of the low energy samples and only deletes the one of the low energy samples if the one of the low energy samples is a predefined distance from a previously deleted low energy sample.

### Claim 19 (depends on 18)

The apparatus of claim 18 wherein the circuit further updates the sorted list stored in the memory to reflect the deletion of the one of the low energy samples.

### Claim 20 (depends on 19)

The apparatus of claim 19 wherein the circuit further updates the position in the queue of the previously deleted low energy sample.

### Claim 21 (depends on 18)

The apparatus of claim 18 wherein the circuit further selects another one of the low energy samples having the next lowest energy than any other ones of the low energy samples to be removed if the one of the low energy samples is not the predefined distance from the previously deleted low energy sample and the other one of the low energy samples is the predefined distance from the previously deleted low energy sample.

### Claim 22 (depends on 21)

The apparatus of claim 21 wherein the circuit further updates the sorted list stored in the memory to reflect the deletion of the other one of the low energy samples.

### Claim 23 (depends on 21)

The apparatus of claim 21 wherein the circuit further updates the position in the queue of the previously deleted low energy sample.

### Claim 24 (depends on 16)

The apparatus of claim 16 wherein low energy detector determines if one of the received samples is below a predefined energy level, inserts the one of the received samples into the queue, and records the energy level of the one of the received samples in the sorted list if the one of the received samples is below a predefined energy level.

### Claim 25 (depends on 24)

The apparatus of claim 24 wherein the low energy detector positions the one of the received samples in sorted list relative to energy levels of the other low energy samples in the sorted list if the one of the received samples is below a predefined energy level.

### Claim 26

An apparatus for compensating for unsynchronized data transmission of synchronous data, comprising:
a receiver for receiving samples of synchronous data;
an interface;
a queue for storing the received samples;
a memory for storing a sorted list of low energy samples in the queue;
a low energy detector for storing received samples into the queue and for inserting energy levels of the low energy samples into the sorted list;
a circuit for removing one of the received samples from the queue upon receiving a request from the interface; and
the circuit further discarding a next one of the received samples from the queue upon the next one of the received samples having the lowest energy of any sample in the queue.

### Claim 27 (depends on 26)

The apparatus of claim 26 wherein the circuit further determining that the next one of the received samples having the lowest energy of any sample in the queue by accessing the sorted list.

### Claim 28 (depends on 27)

The apparatus of claim 27 wherein the circuit further responsive to the next one of the received samples having the lowest energy to access another sample from the queue and transmit the other sample to the interface.

### Claim 29 (depends on 28)

The apparatus of claim 28 wherein the circuit further updates the sorted list stored in the memory to reflect the deletion of the next one of the low energy samples.

### Claim 30 (depends on 28)

The apparatus of claim 28 wherein the circuit further updates the position in the queue of the previously deleted low energy sample.
