Abstract: A method of losslessly compressing and encoding signals representing image information is claimed. A lossy compressed data file and a residual compressed data file are generated. When the lossy compressed data file and the residual compressed data file are combined, a lossless data file that is substantially identical to the original data file is created.

Abstract: A method of losslessly compressing and encoding signals representing image information is claimed. A lossy compressed data file and a residual compressed data file are generated. When the lossy compressed data file and the residual compressed data file are combined, a lossless data file that is substantially identical to the original data file is created.

Abstract: By locating the depth buffer of a 3D graphics rasterization pipeline in a dedicated high speed memory, bandwidth on a main bus can be eliminated that would otherwise result from hidden surface removal (HSR) hardware contained in the pipeline. Also, by reordering of read and write access commands to the depth buffer memory, it is possible to improve memory access throughput otherwise impacted by an increased latency of a read access.

Abstract: A method of losslessly compressing and encoding signals representing image information is claimed. A lossy compressed data file and a residual compressed data file are generated. When the lossy compressed data file and the residual compressed data file are combined, a lossless data file that is substantially identical to the original data file is created.

Abstract: A method of losslessly compressing and encoding signals representing image information is claimed. A lossy compressed data file and a residual compressed data file are generated. When the lossy compressed data file and the residual compressed data file are combined, a lossless data file that is substantially identical to the original data file is created.

Abstract: A method of losslessly compressing and encoding signals representing image information is claimed. A lossy compressed data file and a residual compressed data file are generated. When the lossy compressed data file and the residual compressed data file are combined, a lossless data file that is substantially identical to the original data file is created.

Abstract: Embodiments describe a method, apparatus and system for processing images using block based compression. In one embodiment, a method comprises determining whether two blocks are neighboring blocks, determining whether the two neighboring blocks are both subdivided, if the two blocks are neighboring blocks; performing deblocking filtering on one or more edge pixels of the two neighboring blocks, if it is determined that both of the two neighboring blocks are not subdivided.

Abstract: A method of losslessly compressing and encoding signals representing image information is claimed. A lossy compressed data file and a residual compressed data file are generated. When the lossy compressed data file and the residual compressed data file are combined, a lossless data file that is substantially identical to the original data file is created.

Abstract: A method of losslessly compressing and encoding signals representing image information is claimed. A lossy compressed data file and a residual compressed data file are generated. When the lossy compressed data file and the residual compressed data file are combined, a lossless data file that is substantially identical to the original data file is created.

Abstract: A method of receiving a bit-stream and extracting data from the bit-stream based on one or more criteria and sub-sampling (for example, filtering and decimating) the extracted data in the transform domain. The method either stores the data for future transmission or transmits the data to one or more connected devices, such as a mobile terminal or a fixed terminal.

Abstract: In a system having a plurality of processors 1 to M and each processor has corresponding output registers 1 to N an apparatus and method to transfer is claimed. The data comprises a current group of data and a next group of data. Each group of data comprises a plurality of portions of data. The current group of data from each processor 1 to M is transferred to its corresponding output register 1 to N. Each processor then receives and processes the next group of data. Simultaneously, the portion of data from output register N to output register N-1 is transferred. Similarly, each portion of data from output register N-1 is transferred to output register N-2, and so on. The portion of data from register 1 is transferred to a frame buffer.

Abstract: Embodiments describe a method, apparatus and system for processing images using block based compression. In one embodiment, a method comprises determining whether two blocks are neighboring blocks, determining whether the two neighboring blocks are both subdivided, if the two blocks are neighboring blocks; performing deblocking filtering on one or more edge pixels of the two neighboring blocks, if it is determined that both of the two neighboring blocks are not subdivided.

Abstract: In a system for encoding digital video, a method of interframe coding is described. A sequence of digital video frames may be expressed as anchor frames and at least one associated subsequent frame. The plurality of pixels of the anchor frame and each subsequent frame are converted from pixel domain elements to the frequency domain elements. The elements are quantized to emphasize those elements that are more sensitive to the human visual system and de-emphasize those elements that are less sensitive to the human visual system. The difference between each quantized frequency domain element of the anchor frame and corresponding quantized frequency domain elements of each subsequent frame are determined and encoded.

Abstract: In a system having a plurality of processors 1 to M and each processor has corresponding output registers 1 to N an apparatus and method to transfer is claimed. The data comprises a current group of data and a next group of data. Each group of data comprises a plurality of portions of data. The current group of data from each processor 1 to M is transferred to its corresponding output register 1 to N. Each processor then receives and processes the next group of data. Simultaneously, the portion of data from output register N to output register N-1 is transferred. Similarly, each portion of data from output register N-1 is transferred to output register N-2, and so on. The portion of data from register 1 is transferred to a frame buffer.