Intel Corporation

Kai Miao

Siu H Lam

Amin Rhemtulla

Ling Chen

Sui Lam

Siu Lam

A method and apparatus to communicate tones is described.

Communicating tone information in a network

A method includes receiving at a receiver a voice signal in the form of a sequence of data packets, and using an automatic level control (ALC) component of the receiver to detect that one of the received packets is a silence packet or a noise packet. The method further includes receiving at a jitter delay control circuit from the ALC component a signal or signals to indicate that the one of the received packets is a silence or a noise packet, and dropping the one of the received packets in response to the signal or signals received from the ALC component. The ALC component includes a gain adjustment block and a level estimation and active voice detector block. The gain adjustment block is controlled by the level estimation and active voice detector block to adjust a gain applied by the gain adjustment block to an audio signal.

Selecting discard packets in receiver for voice over packet network

Tone detection includes receiving a series of frames having a signal containing a tone and locating a first frame in the series of frames in which there is at least a partial, tone. The signal energy of the first frame may then be compared to the signal energy of a full tone frame or compared to the signal energy of a frame. A start time of the tone in the signal may then be determined. An end time of the tone in the signal may be determined by locating a last frame in the series of frames. The duration of the tone signal may be determined based on the determined start time and end time of the tone in the signal.

Method and system for tone detection

A method and apparatus to perform clock compensation for a jitter buffer are described.

Clock difference compensation for a network

A system and method for reducing latency includes receiving at a gateway time division multiplexed data from multiple sender devices, the time division multiplexed data including payloads. The method also includes a generated packet that includes the payloads from the received time division multiplexed data from the multiple sender devices. The method also includes indicating in the generated packet a destination indication associated with at least some of the payloads of the received time division multiplexed data and forwarding the generated packet to a media server.

Data transport between a media gateway and server

A system may include a buffer, a local clock, and a processor. The buffer may store and output received media information. The local clock may control a rate at which the buffer outputs stored media information. The processor may determine a number of mean time differences between the local clock and a remote clock at a corresponding number of different times. The processor may also detect whether the local clock has drifted relative to the remote clock based on the number of mean time differences, and the processor may adjust the local clock if the local clock has drifted.

Clock drift compensation method for remote communications

Apparatus and systems, as well as methods and articles, may operate to generate a system coverage map from a plurality of geosystemic data points, as well as to change wireless system operational parameters responsive to various parameters associated with the plurality of geosystemic data points.

Wireless communication mapping apparatus, systems, and methods

A method and apparatus to manage delay in a multimedia conference session is described.

Method and apparatus to manage a conference

A method and apparatus to manage tone clamping are described wherein atone is clamped using a buffer with a first size and the performance of the clamping is analyzed. The buffer is set to a second size in accordance with the analysis. The clamping comprises receiving audio information, storing the audio information in the buffer, detecting tone information in the audio information, and removing the tone information from the audio information. Other embodiments are described and claimed.

Managing tone clamping in a network

In some embodiments, a method includes detecting a tone in each data frame of a sequence of telephony signal data frames. A first data frame of the sequence of telephony signal data frames may be transmitted immediately after detecting the tone therein. Transmission of a last one or last ones of the sequence of telephony signal data frames may be deferred. It may then be determined whether the tone is present in a next data frame that immediately follows the sequence of telephony signal data frames. If it is determined that the tone is not present in the next data frame, the last one or ones of the sequence of data frames and the next data frame may be transmitted. If it is determined that the tone is present in the next data frame, a respective replacement data frame may be transmitted in place of each one of the last one or last ones of the sequence of data frames and in place of the next data frame.

Methods and apparatus for suppressing signaling tones in telephony signal

A method of optimizing the buffer latency in a streaming application for delivering streamed packets over a network. The packet delays are dynamically recorded for forming a histogram of the frequencies of occurrence associated with each delay. The histogram is updated plural times during a single session. A optimal latency is obtained from the updated histogram at which the packet loss percentage is within a predetermined amount and the optimal latency is less than a allowable maximum delay required by the application. The size of the buffer is thus adjusted.

Optimizing buffer latency in a streamed packet delivery session

A dynamic data queuing mechanism for network packets is disclosed. A three-dimensional coil may be expanded or contracted in length. In addition, the size of each loop of the three-dimensional coil may be adjusted. Moreover, simple circular queue and dynamic buffer management techniques are combined to implement circular queues that may be adjusted in size. Size adjustment, in turn, causes an entire queue either to expand or contract. Circular queue size is changed dynamically, without any copying or moving of queue data. This advantage is attained with little overhead added to conventional circular queues, and is useful in reducing memory requirements for simple circular queues by adjusting queue size as needs change. This is particularly useful for multiple queues that share the same memory space.

Dynamic data queuing mechanism for packet networks

A buffer receives packets of data, and places them in appropriate locations such that they are read out after varying delays. Late arriving packets are assigned a negative delay, and if too many packets are late arriving, the system begins reading out the late arriving packets from a different location in storage, rather than allowing such late arriving packets to be lost.

Growing community of inventors

Boonton Township, NJ, United States of America

Kai Miao