Abstract:
A dither matrix is applied to a high-resolution image to compare the value of each of the pixels that compose it with a threshold value of the matrix and to obtain an output value of the matrix (Dither matrix value) from each comparison. To each pixel value (in_value_r) of the image there is applied the algorithm represented by the schematic layout of Figure 7 to obtain the pixel values (Out_r) of a low-resolution image. C 1 -C 5 and n 1 -n 10 are parameters that may be selected by means of predetermined criteria based on comparisons of the low-resolution image, obtained by means of the operations described above, with an equivalent low-resolution image obtained by means of a sample method.
Abstract:
A geometric processing stage (111b) for a pipelined engine for processing video signals and generating processed video signal in space coordinates (S) adapted for display on a screen. The geometric processing stage (111b) includes:
a model view module (201) for generating projection coordinates of primitives of the video signals in a view space, said primitives including visible and non-visible primitives, a back face culling module (309) arranged downstream of the model view module (201) for at least partially eliminating the non visible primitives, a projection transform module (204) for transforming the coordinates of the video signals from view space coordinates into normalized projection coordinates (P), and a perspective divide module (208) for transforming the coordinates of the video signals from normalized projection (P) coordinates into screen space coordinates (S).
The back face culling module (309) is arranged downstream the projection transform module (204) and operates on normalized projection (P) coordinates of said primitives. The perspective divide module (208) is arranged downstream the back face culling module (309) for transforming the coordinates of the video signals from normalized projection (P) coordinates into screen space coordinates (S). A circuit (10) in the back face culling module can be shared with a standard three dimension back face culling operation when necessary. A preferred application is in graphic engines using standard graphics language like OpenGL and NokiaGL.
Abstract:
A graphic system comprising a pipelined tridimensional graphic engine for generating image frames for a display inlcudes a graphic engine (110;210) comprising at least one geometric processing elaboration stages (111, 112), performing motion motion extraction. The engine also includes a rendering stage (113) generating full image frames (KF) at a first frame rate (F2) to be displayed at a second frame rate (F1), higher than the first frame rate (F2). The pipelined graphic engine further comprises a motion encoder (214) receiving motion vector information (MB) and suitable for coding the motion information e.g. with a variable length code, while generating a signal (R4) representative of interpolated frames (IF). The motion encoder (214) exploits the motion information (MB) as generated by the geometric elaboration stages (211, 212). A motion compensation stage (237) is provided fed with the signal representative of interpolated frames (IF) and full image frames for generating said the interpolated frames (IF). A preferred application is in graphic engines intended to operate in association with smart displays through a wireless connection, i.e. in mobile phones.
Abstract:
An antialiasing method, comprising: providing a first fragment; computing a first coverage area representing a portion of the first fragment covered by a first primitive; providing a second fragment juxtaposed to the first fragment and at least partially covered by a second primitive; processing the first coverage area to obtain a corrected coverage area indicative of a visible first fragment portion resulting from the juxtaposition of said fragments; applying an antialiasing procedure based on said corrected coverage area.
Abstract:
Described herein is a method for compressing a sequence of repetitive data, which uses in combination one or more words with a format for non-compressible data and one or more words with a format for compressible data, in which a word with a format for non-compressible data is made up of a set of bits, in which the most significant bit is set at the logic value "1" and the remaining bits are the bits of a non-compressible datum to be encoded, whilst a word with a format for compressible data is made up of a set of bits, in which the most significant bit is set at a the logic value "0", the next five most significant bits indicate the total number of subsequent words which encode the sequence of repetitive data, and the remaining eleven bits indicate the number of times that the words indicated by the preceding five most significant bits are repeated.
Abstract:
A built-in self-test (BIST) circuit adapted to be embedded in an integrated circuit ( 101 ) for testing the integrated circuit, including in particular a collection of addressable elements, for example a semiconductor memory. The BIST circuit comprises a general-purpose data processor ( 105 ) programmable for executing a test program for testing the integrated circuit. The BIST circuit comprises an accelerator circuit ( 113 ) cooperating with the general-purpose data processor for autonomously conducting operations on the integrated circuit according to the test program. The accelerator circuit comprises configuration means ( 201,203,233,301,303,501 ) adapted to be loaded with configuration parameters for adapting the accelerator circuit to the specific type of integrated circuit and the specific type of test program. ( FIG. 1 )
Abstract:
A method for texture compressing images having a plurality of color components (R, G, B) includes the step of defining color representatives for use in encoding by defining groups of colors for each said color component (R,G,B), and selecting for each said group a representative color for the group, the median color being chosen as the representative color of the group. Each said group is preferably composed of 3 to 15 colors and the method includes the step of computing, for each group, an error between each member of the group and said representative color of the group. Typically, the error is computed as the sum of the absolute differences (SAD) between each member of the group and said representative color of the group. In order to select each said group and then extract therefrom said representative color, a criterium is used selected from the group consisting of:
selecting the group that minimizes said error by assuming each group comprised of the lower colors sorted in ascending order, wherein the same applies for the groups comprised of the higher colors, accruing the error as computed separately for two groups in all possible combinations and finding the minimum of the composite error.