Abstract: A system for encoding and decoding data blocks and methods of operating the same result in an encoder that provides intelligent data rate control. The encoder comprises DCT (discrete cosine transformer) resources having a truncate controller configured to receive a truncate signal to truncate the data blocks to provide reduced data blocks. Quantizing resources is coupled to the DCT resources to quantize the reduced data blocks to provide quantized data blocks. Inverse quantizing resources is coupled to the quantizing resources to inverse quantize the quantized data blocks. Frame reconstruction resources is coupled to the inverse quantizing resources to reconstruct previous compressed frames. Motion estimation resources is coupled to the frame reconstruction resources to provide predicted data blocks. Subtraction resources is coupled to the DCT resources and the motion estimation resources to subtract the data blocks and the predicted data blocks.

Abstract: An apparatus for encoding input images and methods of operating the same result in a video encoder that improves compression performance of the video encoder engine. The video encoder comprises image interpolation resources configured to interpolate an input image to provide an interpolated input image. Block matching resources is coupled to the image interpolation resources having a last encoder input image to provide a best match input image from the interpolated input image in response to the last encoder input image. An encoder engine is coupled to the block matching resources to provide the last encoder input image to the block matching resources and to encode the best match input image.

Abstract: Improved method and apparatus for vector quantization (VQ) to build a codebook for the compression of data. The codebook or "tree" is initialized by establishing N initial nodes and creating the remainder of the codebook as a binary codebook. Children entries are split upon determination of various attributes, such as maximum distortion, population, etc. Vectors obtained from the data are associated with the children nodes, and then representative children entries are recalculated. This splitting/reassociation continues iteratively until a difference in error associated with the previous children and current children becomes less than a threshold. This splitting and reassociating process continues until the maximum number of terminal nodes is created in the tree, a total error or distortion threshold has been reached or some other criterion. The data may then be transmitted as a compressed bitstream comprising a codebook and indices referencing the codebook.

Abstract: An apparatus for encoding data blocks and methods of operating the same result in an encoder that provides constant data rate outputs. The encoder comprises DCT (discrete cosine transformer) resources having a truncate controller configured to receive a truncate signal to truncate the data blocks to provide reduced data blocks. Quantizing resources is coupled to the DCT resources to quantize the reduced data blocks to provide quantized data blocks. Inverse quantizing resources is coupled to the quantizing resources to inverse quantize the quantized data blocks to provide inverse quantized data blocks. Frame reconstruction resources is coupled to the inverse quantizing resources to reconstruct previous compressed frames. Motion estimation resources is coupled to the frame reconstruction resources to provide predicted data blocks. Subtraction resources is coupled to the DCT resources and the motion estimation resources to subtract the data blocks and the predicted data blocks.

Abstract: A signal processing system determines the characteristic of a signal for encoding or decoding by examining and classifying such signal, and then applies a transformation or inverse transformation to such signal. Depending on classification of the signal, various transforms or inverse transforms are applicable adaptively thereto.

Abstract: Improved method and apparatus for vector quantization (VQ) to build a codebook for the compression of data. The codebook or "tree" is initialized by establishing N initial nodes and creating the remainder of the codebook as a binary codebook. Children entries are split upon determination of various attributes, such as maximum distortion, population, etc. Vectors obtained from the data are associated with the children nodes, and then representative children entries are recalculated. This splitting/reassociation continues iteratively until a difference in error associated with the previous children and current children becomes less than a threshold. This splitting and reassociating process continues until the maximum number of terminal nodes is created in the tree, a total error or distortion threshold has been reached or some other criterion. The data may then be transmitted as a compressed bitstream comprising a codebook and indices referencing the codebook.