Coherent Logix, Inc.

Affirmed Networks, Inc.

Calos Fund Limited Liability Company

Lifesize, Inc.

Ol Security Limited Liability

John C Sievers

Martin A Hunt

Michael W Bruns

Manjunath H Siddaiah

Ujval J Kapasi

Amit Gulati

Srinivasan Venkatraman

Paul Alexander

Yipeng Liu

Piotr Galecki

Dan Miller

Thuy Fernandes

Methods and devices for a parallel multi-processor encoder system for encoding video data. The video data comprises a sequence of frames, wherein each frame comprises a plurality of blocks of pixels in sequential rows. For each frame, the system divides the plurality of blocks into a plurality of subsets of blocks, wherein each subset of blocks is allocated to a respective processor of the parallel multi-processor system. Each respective processor of the parallel multi-processor system may sequentially encode rows of the subset of blocks allocated to the respective processor and sequentially transmit each encoded row of blocks as a bit stream to a decoder on a channel. For each row, the respective encoded row of blocks is transmitted to the decoder for each processor prior to transmission of the next sequential respective encoded row of blocks for any processor. Additionally, a similar parallel multi-processor decoder system is described.

Low latency video codec and transmission with parallel processing

Methods and devices are described for a parallel multi-processor encoder system for encoding video data, wherein the video data comprises a sequence of frames, wherein each frame comprises a plurality of blocks of pixels in sequential rows. For each frame, the system may divide the plurality of blocks into a plurality of subsets of blocks, wherein each subset of blocks is allocated to a respective processor of the parallel multi-processor system. Each respective processor of the parallel multi-processor system may sequentially encode rows of the subset of blocks allocated to the respective processor and sequentially transmit each encoded row of blocks as a bit stream to a decoder on a channel. For each row, the respective encoded row of blocks may be transmitted to the decoder for each processor prior to transmission of the next sequential respective encoded row of blocks for any processor. Additionally, a similar parallel multi-processor decoder system is described.

A method operates within an integrated circuit having a plurality of processing lanes. For each of a first and second processing lanes, the method determines a number of packed data words among one or more packed data words associated with the respective processing lane, associates the number of packed data words with a used field of the processing lane, wherein the used field indicates the number of packed data words in the processing lane; and stores the one or more packed data words in a variable record length memory based, at least in part, on the used field of the processing lane.

Hierarchical packing of syntax elements

Systems and methods of transcoding video sequences for delivery in a mobile network. A source video sequence including source video frames is received and a source video frame type associated with each of the source video frames is determined based on a differential between a composition time stamp (CTS) and a decoding time stamp (DTS) associated with each of the source video frames. A frame type ratio value for the target frame-types is calculated based on a longest mini-GOP length. A target frame size of each target video frame is determined based on the frame type ratio value and a target transcoding rate, and each of the target video frames in a target video track is encoded to the target frame size to form a target video sequence.

Transcoding using time stamps

Systems and methods are described herein for adaptively transcoding media in a communications network such that computer processing resources are effectively utilized to deal with varying traffic patterns in the communications network. A computing device receives a request to transcode content and determines a first amount of tokens based on a number of CPU cores associated with the computing device, and a currently used amount of tokens. The computing device determines a second amount of tokens associated with transcoding the content and when the first amount of tokens is less than the second amount of tokens, the computing device bypasses transcoding for the content or adjusts a transcoding parameter to reduce a number of tokens associated with transcoding the content.

Adaptive content optimization

A mechanism for performing a motion vector search at a current block within a current frame of video data. For each test vector position v of a plurality of test vector positions, compute a rate distortion value J(v) based on a combination of a distortion value D(v) and a bit cost value R(v,p,C). The distortion value D(v) represents a measure of distortion of the current block relative to a corresponding block Bin the reference frame. The bit cost value R(v,p,C) depends on the test vector position v, a prediction vector p for the current block and a set C of one or more vectors c, c, . . . , c. The one or more vectors c, c, . . . , care estimates (or predictions) of statistically-popular motion vectors for the current frame. The test vector position v* that gives a minimum rate-distortion value J(v*) is selected as the motion vector for the current block.

Mechanism for video encoding based on estimates of statistically-popular motion vectors in frame

A method of estimating motion is disclosed. A first plurality of candidates is identified in a reference frame, wherein the total area occupied by the first plurality of candidates is substantially smaller than that of the reference frame. A first refinement search is then performed based, at least in part, on the first plurality of candidates. One or more best candidates are then identified based, at least in part, on the first refinement search. Finally, motion data is encoded based, at least in part, on the one or more best candidates.

Growing community of inventors

Lynnfield, MA, United States of America

John C Sievers