# US 2012/0259624 A1 · Systems, processes and integrated circuits for rate and/or diversity adaptation for packet communications

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

- Number: US 2012/0259624 A1
- Document ID: US20120259624A1
- Status: Published application
- Kind: A1
- Application number: 13/493,548
- Filed: 2012-06-11
- Published: 2012-10-11
- Earliest claimed: 1999-12-14
- Assignees: Texas Instruments Incorporated
- Inventors: Krishnasamy Anandakumar; Vishu R. Viswanathan; Alan V. McCree
- Web page: https://patentgrep.com/patent/US20120259624A1

## CPC

- H04L 65/752: adapting media to network capabilities
- G10L 13/02: Methods for producing synthetic speech; Speech synthesisers
- G10L 19/04: using predictive techniques
- H04L 65/65: Network streaming protocols, e.g. real-time transport protocol [RTP] or real-time control protocol [RTCP]
- H04L 65/80: Responding to QoS
- H04W 88/02: Terminal devices
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- G10L: SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)

## Abstract

Packets of real-time information are sent with a source rate greater than zero kilobits per second, and a time or path or combined time/path diversity rate initially being zero kilobits per second. This results in a quality of service QoS, optionally measured at the sender or the receiver. When the QoS is on an unacceptable side of a threshold of acceptability, the sender sends diversity packets at an increased rate. Increasing the diversity rate while either reducing or maintaining the overall transmission rate is new. CELP-based multiple-description data partitioning sends the base or important information plus a subset of fixed excitation in one packet and sends the base or important information plus the complementary subset of fixed excitation in another packet. Reconstruction produces acceptable quality when only one of the two packets is received and better quality when both packets are received. Reconstruction provides for single and multiple lost packets.

## Claims

### Claim 1

A process of sending packets of real-time information comprising:
A. receiving audible speech;
B. converting the audible speech into digital data representing the audible speech in each of successive frames, for each frame the converting including forming Linear Prediction Coding data, Long Term Prediction lag data, parity check data, fixed codebook data, and adaptive and fixed codebook gain data from the speech;
C. placing in a first packet first data for the first frame, the first data being the Linear Prediction coding data, the Long Term Prediction lag data, the parity check data, the adaptive and fixed codebook gain data, first few fixed codebook pulse data, and every other fixed codebook pulse for the remaining pulses;
D. placing in a second packet second data for the first frame, the second data being the Linear Prediction coding data, the Long Term Prediction lag data, the parity check data, the adaptive and fixed codebook gain data, the same first few fixed codebook pulse data, and data for the complementary subset of pulses from the remaining fixed codebook pulses not represented in the first packet; and
E. sending the first and second packets of data sequentially over a packet switched network.

### Claim 2 (depends on 1)

The process of claim 1 in which the converting occurs in frames of ten milliseconds.

### Claim 3 (depends on 1)

The process of claim 1 in which the sending occurs over one of a Voice Over Packet network and a Voice Over Internet Protocol network.

### Claim 4

The process of claim in which the sending includes sending packets according to the following sequence:
P(n)P(n−1)′P(n+1)P(n)′P(n+2)P(n+1)′P(n+3)P(n+2)′,
where “P” indicates a first packet of data and a prime(′) indicates a second packet of data.
