Abstract: 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.

Abstract: Method and apparatus to synchronize packet rate for audio information are described.

Abstract: A method and apparatus to perform task scheduling are described. Tasks are assigned by receiving a request to execute a task on one of multiprocessors. The type of task is determined for the task. A processor task value is used to select the proper processor and the task is assigned.

Abstract: Method and apparatus to synchronize packet rate for audio information are described.

Abstract: Conference calls are handled using distributed processing. In one embodiment, the invention includes receiving sets of telephone audio signals from conference subnodes, the telephone audio signals corresponding to subscribers of the conference call, selecting an output set of telephone audio signals from all of the received telephone audio signals, and transmitting the output set to the conference subnodes. In another embodiment, the invention includes receiving a set of telephone audio signals, each signal being received from a subscriber node of a single conference call, selecting a subset of the set of signals, transmitting the selected subset of signals to a conference node, receiving a second set of telephone audio signals from the conference node, and transmitting the second set to the subscriber nodes.

Abstract: Method and apparatus to synchronize packet rate for audio information are described.

Abstract: 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.

Abstract: A method and apparatus to manage tone clamping are described.

Abstract: 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.

Abstract: A method, apparatus, and system for recovering from loss of a packet.

Abstract: A method and apparatus to manage tone clamping are described.

Abstract: 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.

Abstract: Dynamically adjustable load-sharing circular queues are disclosed. That is, a method of reversing the processing order of a second queue placed adjacent to a first queue to allow the space allocated to both queues to be dynamically adjusted, without copying or moving queue data or affecting the performance of the input and output queue functions is described. These advantages are attained without adding any overhead to conventional circular queues, in terms of processing and memory requirements. Dynamically adjustable circular queues are particularly useful in reducing memory requirements for simple circular queues used in serving either a primary/backup or load-sharing configuration of two input queues. A simple way of determining when the queue sizes can be adjusted is further described.

Abstract: A method, apparatus, and system for recovering from loss of a packet.

Abstract: 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.

Abstract: Dynamically adjustable load-sharing circular queues are disclosed. That is, a method of reversing the processing order of a second queue placed adjacent to a first queue to allow the space allocated to both queues to be dynamically adjusted, without copying or moving queue data or affecting the performance of the input and output queue functions is described. These advantages are attained without adding any overhead to conventional circular queues, in terms of processing and memory requirements. Dynamically adjustable circular queues are particularly useful in reducing memory requirements for simple circular queues used in serving either a primary/backup or load-sharing configuration of two input queues. A simple way of determining when the queue sizes can be adjusted is further described.