Visualon, Inc.

Avant! Corporation

Yang Cai

Chin-Yee Lin

Cheng Yi Huang

Huan-Chih Tsai

Michael Chin-Hsen Lin

A system of video stream transitioning includes an interface and a video stream transitioner. The interface is to receive an indication for changing from a current video stream to a target video stream. The video stream transitioner is to determine key frame information in the target video stream; determine a specific key frame to switch to; and provide a request for target video stream starting at the specific key frame.

Bitrate adaptation transitioning using key frames

A method of encoding video data comprises calculating a set of parameter values for a basis set of partition blocks of a macroblock of the video data. The basis set comprising one or more partition blocks into which the macroblock could validly be partitioned under an encoding scheme, wherein the basis set of partition blocks is smaller in number than the number of ways into which a macroblock is partitionable for encoding. The method further comprises constructing a desired partitioned macroblock using one or more partition blocks selected from the basis set based at least in part on the set of parameter values.

Encoding video data

Cache usage optimization is disclosed. At runtime, a number of blocks of video data to be processed as a batch is determined based at least in part on a performance metric. A group of blocks that includes the determined number of blocks is processed as a batch.

Cache optimization for video codecs and video filters or color converters

A method for optimal track assignment in a grid-based channel router. Initially, interconnection information is extracted from a global routing result. Multiple pin nets derived from the interconnection information are decomposed into simpler mapped segments. A channel grid map is then built and marked with existing objects. Next, a vertical constraint graph specifying the relative positions of the mapped segments is constructed. A first track is computed. A track assignment loop is repeated until all requisite connections are realized. The track assignment loop includes the steps of breaking cycles and long paths and collecting a set of feasible links. One or more weighting functions are assigned to each such feasible link. A dynamic programming approach is used to select an optimal set of feasible links according to the weighting functions. In addition, an optimal set of feasible links corresponding to unpreferred layers is collected by applying dynamic programming. Finally, the chosen feasible links are physically realized on the current track.

Method for optimizing track assignment in a grid-based channel router

In a grid-based channel router, a method for handling variable width wires. The user initially specifies the widths of the wires. In this manner, wider wires may be selected for special nets, such as those used for routing clock signals, whereas narrower wires are used for normal nets in order to minimize the die size. A refined grid map is generated. This refined grid map consists of extra rows and columns for marking the variable width wires. These extra rows and columns are spaced as a function of the wire width and are marked the same as with normal rows and columns. Before a wire is placed, the affected rows or columns are checked for any violations. If there are no violations, the wire is placed and the appropriate rows or columns are marked. Due to the extra rows and columns, the problems associated with overmarking and undermarking variable width wires are avoided.

Growing community of inventors

San Jose, CA, United States of America

Yang Cai