Ati International Srl

Fabio Ingrao

Stefan Eckart

Xiaohua Yang

Richard W Webb

Michael L Lightstone

Haitao Guo

A method and apparatus for multiplexing data streams is provided. An earliest time and a latest time are determined for each packet of a each data stream. The packets of the data streams are multiplexed so as to meet earliest time and latest time requirements. The calculation of the earliest time and the latest time are simplified by allowing use of linear constraints rather than irregular stairstep constraints. Compensation for drift in the data streams is also provided.

Method and apparatus for multiplexing data streams using time constraints

A method and apparatus for storing multimedia data for use in a digital VCR includes processing that begins by maintaining a first link list of a plurality of memory sections, where the first link list links the plurality of memory sections as a circular buffer. The processing then continues by receiving a stream of multimedia data. The processing then continues by storing the stream of multimedia data in at least some of the memory sections of the plurality of memory sections. The processing then continues by receiving a request for independent storage of a selected portion of the stream of multimedia data, e.g., the user desires to have a permanent copy of a particular program. The processing further continues by generating a second link list for a set of memory sections of the at least some of the memory sections. The set of memory sections stores the selected portion of the stream of multimedia data. The processing continues by updating the linking of the plurality of memory sections within the first link list without the set of memory section.

Method and apparatus for storing multi-media data

A method and apparatus for indexing and locating key frames in streaming frame data and variable-frame-length data is described. Fast and efficient location of desired key frames in both directions (e.g., forward/backward, future/past) is provided. An estimate of the distance to the desired key frame is made and a seek performed according to that distance. At the location specified by the seek, key frame seek assist data are obtained. The desired key frame is located or a new seek is performed, depending on the key frame seek assist data obtained. By placing the key frame seek assist data at readily identifiable locations, efficient location of key frames is provided. The key frame seek assist data may be tailored to optimize efficiency for seeking in a particular direction, for example, backwards. The seek process is correspondingly configured to favor seeking in the more efficient direction.

Growing community of inventors

San Francisco, CA, United States of America

Fabio Ingrao