Abstract: Techniques and mechanisms for exchanging sets of video data each via multiple channels. In an embodiment, a first data set is distributed across the multiple channels according to a first mapping of the multiple channels each to a different respective one of multiple data types, where each of the multiple data types corresponds to a different respective dimension of a color space. In another embodiment, a second data set is distributed across the multiple channels according to a second mapping of the multiple channels each to a different respective one of the multiple data types, where the second mapping is different from the first mapping.

Abstract: A method facilitating random access to segments of compressed data stored in memory includes the steps of receiving a series of data segments, encoding the series of data segments into a series of compressed data segments of variable segment sizes, storing the series of compressed data segments in a memory, and generating a locator for each of the compressed data segments. Each locator is indicative of the location of an associated compressed data segment in the memory. A method for randomly accessing a segment of compressed data includes receiving a request for a compressed data segment, retrieving a locator associated with the requested segment, using the retrieved locator to locate the requested segment in the memory, and retrieving the requested segment from the memory. Thus, compressed data segments can be decoded in a different order than the order they were encoded in. Systems for implementing the methods are also disclosed.

Abstract: A codec includes an encoder having a quantization level generator that defines a quantization level specific to a block of values (e.g., transform coefficients), a quantizer that quantizes the block of transform coefficients according to the block-specific quantization level, a run-length encoder, and an entropy encoder. The quantization level is defined to result in at least a predetermined number (k) of quantized coefficients having a predetermined value. The amount of data compression by the encoder is proportional to (k). The codec also includes a decoder having entropy and run-length decoding sections whose throughputs are proportional to (k). The decoder takes advantage of this increased throughput by further decoding coefficients in parallel using a plurality of decoding channels. Methods for encoding and decoding data are also disclosed. The invention is well-suited to quantization, entropy, and/or run-length-based codecs, such as JPEG.

Abstract: A codec includes an encoder having a quantization level generator that defines a quantization level specific to a block of values (e.g., transform coefficients), a quantizer that quantizes the block of transform coefficients according to the block-specific quantization level, a run-length encoder, and an entropy encoder. The quantization level is defined to result in at least a predetermined number (k) of quantized coefficients having a predetermined value. The amount of data compression by the encoder is proportional to (k). The codec also includes a decoder having entropy and run-length decoding sections whose throughputs are proportional to (k). The decoder takes advantage of this increased throughput by further decoding coefficients in parallel using a plurality of decoding channels. Methods for encoding and decoding data are also disclosed. The invention is well-suited to quantization, entropy, and/or run-length-based codecs, such as JPEG.

Abstract: A method facilitating random access to segments of compressed data stored in memory includes the steps of receiving a series of data segments, encoding the series of data segments into a series of compressed data segments of variable segment sizes, storing the series of compressed data segments in a memory, and generating a locator for each of the compressed data segments. Each locator is indicative of the location of an associated compressed data segment in the memory. A method for randomly accessing a segment of compressed data includes receiving a request for a compressed data segment, retrieving a locator associated with the requested segment, using the retrieved locator to locate the requested segment in the memory, and retrieving the requested segment from the memory. Thus, compressed data segments can be decoded in a different order than the order they were encoded in. Systems for implementing the methods are also disclosed.

Abstract: A method for decoding run-length encoded (RLE) data includes the steps of receiving the RLE data and storing a predetermined value (e.g., zero) in each of a plurality of consecutively-accessible storage locations of a buffer. The method further includes writing a first value different than the predetermined value to a first storage location based on the RLE data, jumping over (i.e., skipping) a number of the consecutively-accessible storage locations from the first storage location to a next storage location based on the RLE data, and writing a next value different than the predetermined value to the next storage location based on the RLE data. In the case of JPEG, the values stored in the storage locations of the buffer are quantized coefficients associated with a block of image data. A run-length decoder is also described.

Abstract: A codec includes an encoder having a quantization level generator that defines a quantization level specific to a block of values (e.g., transform coefficients), a quantizer that quantizes the block of transform coefficients according to the block-specific quantization level, a run-length encoder, and an entropy encoder. The quantization level is defined to result in at least a predetermined number (k) of quantized coefficients having a predetermined value. The amount of data compression by the encoder is proportional to (k). The codec also includes a decoder having entropy and run-length decoding sections whose throughputs are proportional to (k). The decoder takes advantage of this increased throughput by further decoding coefficients in parallel using a plurality of decoding channels. Methods for encoding and decoding data are also disclosed. The invention is well-suited to quantization, entropy, and/or run-length-based codecs, such as JPEG.

Abstract: A codec includes an encoder having a quantization level generator that defines a quantization level specific to a block of values (e.g., transform coefficients), a quantizer that quantizes the block of transform coefficients according to the block-specific quantization level, a run-length encoder, and an entropy encoder. The quantization level is defined to result in at least a predetermined number (k) of quantized coefficients having a predetermined value. The amount of data compression by the encoder is proportional to (k). The codec also includes a decoder having entropy and run-length decoding sections whose throughputs are proportional to (k). The decoder takes advantage of this increased throughput by further decoding coefficients in parallel using a plurality of decoding channels. Methods for encoding and decoding data are also disclosed. The invention is well-suited to quantization, entropy, and/or run-length-based codecs, such as JPEG.

Abstract: A method for decoding run-length encoded (RLE) data includes the steps of receiving the RLE data and storing a predetermined value (e.g., zero) in each of a plurality of consecutively-accessible storage locations of a buffer. The method further includes writing a first value different than the predetermined value to a first storage location based on the RLE data, jumping over (i.e., skipping) a number of the consecutively-accessible storage locations from the first storage location to a next storage location based on the RLE data, and writing a next value different than the predetermined value to the next storage location based on the RLE data. In the case of JPEG, the values stored in the storage locations of the buffer are quantized coefficients associated with a block of image data. A run-length decoder is also described.

Abstract: Techniques and mechanisms for exchanging sets of video data each via multiple channels. In an embodiment, a first data set is distributed across the multiple channels according to a first mapping of the multiple channels each to a different respective one of multiple data types, where each of the multiple data types corresponds to a different respective dimension of a color space. In another embodiment, a second data set is distributed across the multiple channels according to a second mapping of the multiple channels each to a different respective one of the multiple data types, where the second mapping is different from the first mapping.