Abstract: This disclosure provides methods, devices, and systems for data compression. The present implementations more specifically relate to dynamically queuing entropy-coded data to be transmitted in a bitstream. For example, an encoder may perform a first order image compression operation on raw image data to produce a set of first order coefficients and may perform a second order image compression operation on at least a subset of the first order coefficients to produce a set of second order coefficients. The encoder may further encode the first and second order coefficients as first and second order codewords, respectively, according to an entropy coding scheme. In some aspects, the encoder may output the first order codewords to a transmit queue before the lengths of the second order codewords are known. However, in some implementations, the second order codewords may be transmitted from the transmit queue before the first order codewords.

Abstract: A method and apparatus for enabling compression of a stream of pictures according to a target bit rate are described. A first configuration parameter for a first portion is determined based at least in part on a first relative weight of the first portion with respect to a first set of N portions, where the first set of N portions includes the first portion and N-1 portions which succeed the first portion. A second configuration parameter for a second portion of a second picture is determined based at least in part on a second relative weight of the second portion with respect to a second set of M portions of pictures, where the second set of M portions includes a subset of the N-1 portions from the first set and zero or more additional portions of pictures from the stream of pictures.

Abstract: To achieve a reduction in the amount of coding taken in the use of an asymmetric partition and to implement efficient encoding/decoding processes exploiting the characteristics of the asymmetric partition. In a case that a CU information decoding unit decodes information for specifying an asymmetric partition (AMP; Asymmetric Motion Partition) as a partition type, an arithmetic decoding unit is configured to decode binary values by switching between arithmetic decoding that uses contexts and arithmetic decoding that does not use contexts in accordance with the position of the binary values.

Abstract: Techniques are described for encoding symbols using a new algorithm that provides a flexible Huffman tree approximation and that can be used for low latency encoding. For example, the new algorithm can perform encoding using one or more of the following phases: Shannon-based binning, code space optimization, tree completion, and code assignment.

Abstract: To achieve a reduction in the amount of coding taken in the use of an asymmetric partition and to implement efficient encoding/decoding processes exploiting the characteristics of the asymmetric partition. In a case that a CU information decoding unit decodes information for specifying an asymmetric partition (AMP; Asymmetric Motion Partition) as a partition type, an arithmetic decoding unit is configured to decode binary values by switching between arithmetic decoding that uses contexts and arithmetic decoding that does not use contexts in accordance with the position of the binary values.

Abstract: An apparatus for encoding an image in intra prediction can include an intra prediction unit generating a prediction block using an intra prediction mode; a transform unit transforming residual signals generated using an original block and the prediction block to generate a transformed block; a quantization unit determining a quantization parameter and quantizing the transformed block using a quantization matrix and the quantization parameter to generate a quantized block; a scanning unit determining a scan pattern and applying the scan pattern to the quantized block to generate one-dimensional coefficient information; and an entropy coding unit entropy-coding the one-dimensional coefficient information and the intra prediction mode, in which the residual signals are transformed in a transform unit, DST-based integer transforms are used for transforming the residual signals if the size of the transform unit is smaller than a predetermined size, and DCT-based transforms are used if the size of the transform uni

Abstract: A data processing apparatus has a camera sensor, a camera buffer, a compressor, and an output interface. The camera sensor generates an input multimedia data. The camera buffer stores a first data derived from the input multimedia data. The compressor generates a compressed multimedia data by compressing a second data derived from the input multimedia data. The output interface packs the compressed multimedia data into a bitstream, and outputs the bitstream via a camera interface. The camera interface is coupled between the data processing apparatus and another data processing apparatus that are located at different chips, and the camera interface is a chip-to-chip interface that provides direct pin connections between the different chips.

Abstract: To achieve a reduction in the amount of coding taken in the use of an asymmetric partition and to implement efficient encoding/decoding processes exploiting the characteristics of the asymmetric partition. In a case that a CU information decoding unit decodes information for specifying an asymmetric partition (AMP; Asymmetric Motion Partition) as a partition type, an arithmetic decoding unit is configured to decode binary values by switching between arithmetic decoding that uses contexts and arithmetic decoding that does not use contexts in accordance with the position of the binary values.

Abstract: A method of encoding a video using constrained soft-decision quantization. The soft-decision quantization includes first performing hard-decision quantization to obtain hard quantized coefficients and, then, obtaining a soft quantized coefficient using a rate-distortion calculation over a search range of quantization levels for a transform domain coefficient, wherein the search range of quantization levels for that transform domain coefficient is constrained within a number of quantization levels of a corresponding hard quantized coefficient. The search range may be based upon a fixed threshold, the coefficient position, the hard quantized coefficient magnitude, a threshold value less accumulated distortion, or other factors, including combinations of these factors. The accumulated distortion may be measured by an L1 norm.

Abstract: Provided is a wireless communication device which can improve the notification accuracy of the channel state information (CSI) without straining the feedback circuit. In this device, a channel estimator (105) uses a pilot signal input from a wireless receiver (102) to estimate the channel and obtain a plurality of path gains in each of a plurality of delay periods. Then, the channel estimator (105) outputs the plurality of path gains to a quantizer (107). The quantizer (107) quantizes the plurality of path gains in the number of notification bits corresponding to each of the plurality of delay periods based on the correspondence of the delay period and the number of notification bits input from a setting unit (106).

Abstract: An inverse quantization processing method and associated device is provided comprising a determining unit, a bit reduction unit, a frequency/time-domain conversion unit, and a bit addition unit which collectively perform an inverse quantization processing method by receiving a plurality of quantized frequency-domain data, performing a bit reduction on a current quantized frequency domain data according to an adjusting factor, generating a bit-reduced quantized frequency-domain data when an accumulated count value of a plurality of valid bit numbers of the plurality of quantized frequency-domain data greater than a first threshold reaches a second threshold, performing a frequency/time domain conversion on the bit-reduced quantized frequency-domain data to obtain a bit-reduced time-domain PCM data, and performing a bit addition on the bit-reduced time-domain PCM data according to the adjusting factor, so as to obtain a time-domain PCM data.

Abstract: A method for encoding a picture is disclosed. The method generally includes the steps of (A) generating at least one respective macroblock statistic from each of a plurality of macroblocks in the picture, (B) generating at least one global statistic from the picture and (C) generating a respective macroblock quantization parameter for each of the macroblocks based on both (i) the at least one respective macroblock statistic and (ii) said at least one global statistic.

Abstract: Embodiments of the present invention comprise systems and methods for processing of data related to video wherein reduced bit depth intermediate calculations are enabled.

Abstract: Embodiments of the present invention comprise systems and methods for processing of data related to video wherein reduced bit depth intermediate calculations are enabled.

Abstract: Embodiments of the present invention comprise systems and methods for processing of data related to video wherein reduced bit depth intermediate calculations are enabled.

Abstract: Embodiments of the present invention comprise systems and methods for processing of data related to video wherein reduced bit depth intermediate calculations are enabled.

Abstract: Embodiments of the present invention comprise systems and methods for processing of data related to video wherein reduced bit depth intermediate calculations are enabled.

Abstract: Embodiments of the present invention comprise systems and methods for processing of data related to video wherein reduced bit depth intermediate calculations are enabled.