Abstract: An encoding method includes: encoding transform coefficients of a transform coefficient block according to a predetermined scan order, and encoding a set number of transform coefficients in each group until a last group of the transform coefficient block is encoded; storing an obtained map of non-zero transform coefficients, absolute values of transform coefficients, and positive and negative signs of non-zero transform coefficients; when the last group is being encoded, encoding the stored map of non-zero transform coefficients and the map of non-zero transform coefficients encoded in the last group into a bit stream; and encoding the stored absolute values of transform coefficients and positive and negative signs of non-zero transform coefficients and the absolute values of transform coefficients and positive and negative signs of non-zero transform coefficients encoded in the last group into the bit stream.

Abstract: A decoding apparatus according to the present invention includes: a decoding unit which decodes identification information identifying an orthogonal transform basis for inverse orthogonal transform; an orthogonal transform basis accumulation unit accumulating orthogonal transform bases for inverse orthogonal transform; an orthogonal transform basis storage unit storing an orthogonal transform basis for inverse transform, from among the stored orthogonal transform bases; an inverse orthogonal transform unit which performs inverse orthogonal transform using the identified orthogonal transform basis; and an orthogonal transform basis transfer control unit which transfers the identified orthogonal transfer basis from the orthogonal transform basis accumulation unit to the orthogonal transfer basis storage unit only when the identified orthogonal transform basis is not yet stored therein.

Abstract: System and methodologies are provided herein for reconstructing a video signal from multiple video streams. Various aspects described herein can utilize a least square estimate (LSE) algorithm to jointly decode multiple video bitstreams that are generated from a common original video sequence at different bit rates. As described herein, the LSE algorithm can reconstruct an original video sequence by determining and computing a weighted sum of collocated video information reconstructed from different video bitstreams. The weights applied can be adaptively determined to minimize the mean square error (MSE) of the reconstructed video sequence as compared to the original.

Abstract: A video coder, when coding residual data, determines whether to perform SDH for a coefficient group of a chroma transform block independently from determining whether to perform SDH for the coefficient group of the luma transform block.

Abstract: A video coder determines, based at least in part on a distance between a current sub-block of a transform coefficient block and a sub-block that contains a last significant coefficient (LSC) of the transform coefficient block, coding contexts for significance flags for transform coefficients of the current sub-block. Furthermore, the video coder entropy codes, based on the coding contexts for the significance flags for the transform coefficients of the current sub-block, the significance flags for the transform coefficients of the current sub-block.

Abstract: Methods and systems are provided for encoding and decoding a video stream. Each picture in a video stream can be divided into slices, each of which contains a contiguous row of macroblocks. All the blocks corresponding to a single video component within each slice can then be used as the basis for encoding the picture. By decomposing each picture into slices, the video stream can be efficiently converted for displays of varying size and/or quality. The encoded bitstream can include a slice table to allow direct access to each slice without reading the entire bitstream. Each slice can also be processed independently, allowing for parallelized encoding and/or decoding.

Abstract: This disclosure describes techniques for transforming residual blocks of video data. In particular, a plurality of different transforms selectively applied to the residual blocks based on the prediction mode of the video blocks. At least a portion of the plurality of transforms are separable directional transform specifically trained for a corresponding prediction mode to provide better energy compaction for the residual blocks of the given prediction mode. Using separable directional transforms offers the benefits of lower computation complexity and storage requirement than use of non-separable directional transforms. Additionally, a scan order used to scan the coefficients of the residual block may be adjusted when applying separable directional transforms.

Abstract: Systems and methods for processing media streams for transport over a network based on network conditions. An integrated circuit comprises a media processing unit coupled to receive feedback from a network processing unit. The media processing unit converts a media stream from a compressed input stream to a compressed output stream such that the compressed output stream has characteristics that are best suited for the network conditions. Network conditions can include, for example, characteristics of the network (e.g., latency or bandwidth) or characteristics of the remote playback devices (e.g., playback resolution). Changes in the network conditions can result in a change in the conversion process.

Abstract: In one method embodiment, forward transforming a set of co-located blocks corresponding to plural matched frames; computing a difference measure for a subset of coefficients between a set of transformed blocks and a reference block, the computation in a two-dimensional (2D) transform domain; and selectively thresholding one or more of the co-located transformed blocks based on the number of transformed blocks having a difference measure below a predetermined threshold.

Abstract: Techniques for coding and deriving (e.g., determining) one or more coded-block-flags associated with video content are described herein. A coded-block-flag of a last node may be determined when coded-block-flags of preceding nodes are determined to be a particular value and when a predetermined condition is satisfied. In some instances, the predetermined condition may be satisfied when log2(size of current transform unit) is less than log2(size of maximum transform unit) or log2(size of current coding unit) is less than or equal to log2(size of maximum transform unit)+1. The preceding nodes may be nodes that precede the last node on a particular level in a residual tree.

Abstract: A device for coding video data includes a video coder configured to: determine for a chroma transform block (TB) a sub-sampling format for the chroma TB; based on the sub-sampling format for the chroma TB, identify one or more corresponding luma TBs; determine, for each of the one or more corresponding luma TBs, if the corresponding luma TB is coded using a transform skip mode; and, based on a number of the one or more corresponding luma TBs coded using the transform skip mode being greater than or equal to a threshold value, determine that the chroma TB is coded in the transform skip mode.

Abstract: An image coding method using arithmetic coding. The method includes: performing arithmetic coding on a first flag that indicates whether or not an absolute value of a target coefficient in a target coefficient block is greater than 1; and performing arithmetic coding on a second flag that indicates whether or not the absolute value is greater than 2. In the arithmetic coding on the first flag and the arithmetic coding on the second flag, it is determined whether or not an immediately-prior coefficient block that has been coded immediately prior to the target coefficient block includes a coefficient having an absolute value greater than a threshold value. Based on a result of the determination, respective contexts to be used in the arithmetic coding on the first and second flags are selected.

Abstract: In one example, an apparatus is configured to code video data. The apparatus comprises a processor configured to determine a base layer reference block for a current block. The base layer reference block may be located in the base layer. The processor is further configured to determine an enhancement layer reference block for the current block. The enhancement layer reference block may comprise a weighted sum of a first reference block located in the enhancement layer and a second reference block located in the enhancement layer. The processor is further configured to determine a reference block from the base layer reference block and the enhancement layer reference block.

Abstract: The method for scanning a transform coefficient of the present invention comprises the steps of: determining a reference transform block for a block to be decoded; deriving a scanning map of the block to be decoded using scanning information of the reference transform block; and executing a reverse-scan on the transform coefficient of the block to be decoded using the derived scanning map. The present invention enhances image encoding/decoding efficiency.

Abstract: A block transform-based digital media codec more efficiently encodes transform coefficients by jointly-coding non-zero coefficients along with succeeding runs of zero-value coefficients. When a non-zero coefficient is the last in its block, a last indicator is substituted for the run value in the symbol for that coefficient. Initial non-zero coefficients are indicated in a special symbol which jointly-codes the non-zero coefficient along with initial and subsequent runs of zeroes. The codec allows for multiple coding contexts by recognizing breaks in runs of non-zero coefficients and coding non-zero coefficients on either side of such a break separately. The codec also reduces code table size by indicating in each symbol whether a non-zero coefficient has absolute value greater than 1 and whether runs of zeros have positive value, and separately encodes the level of the coefficients and the length of the runs outside of the symbols.

Abstract: Methods and devices for encoding and decoding that involve sorting bins according to their respective estimated probabilities to form subsequences, each subsequence having an associated estimated probability. Subsequences are encoded to form codewords. Ordered sets of phrases of known length are then formed from the codewords. Each first of the phrases in a set contains at least part of one codeword. The first phrase has an associated estimated probability and the probability estimates associated with each of the other phrases in the set are determined based upon the probability estimate associated with the first phrase, which permits the phrases to be decoded in parallel.

Abstract: In an example, an electronic device of a decoder is configured to obtain a bit stream and recover a binary symbol from the obtained bit stream. The electronic device is configured to determine whether the binary symbol is to be decoded using a modified transform skip mode. The electronic device is configured to, in response to determining that the binary symbol is not to be decoded using the modified transform skip mode, determine a first TS_Shift value, and recover video data using the first TS_Shift value. The electronic device is configured to, in response to determining that the binary symbol is to be decoded using the modified transform skip mode, determine a second TS_Shift value, and recover video data using the second TS_Shift value.

Abstract: Methods and systems are provided for encoding and decoding a video stream. Each picture in a video stream can be divided into slices, each of which contains a contiguous row of macroblocks. All the blocks corresponding to a single video component within each slice can then be used as the basis for encoding the picture. By decomposing each picture into slices, the video stream can be efficiently converted for displays of varying size and/or quality. The encoded bitstream can include a slice table to allow direct access to each slice without reading the entire bitstream. Each slice can also be processed independently, allowing for parallelized encoding and/or decoding.

Abstract: A system for transmitting a transport stream including a robust stream is provided. The transmitting system includes an adaptor for, when receiving a first stream, making a space in the first stream to insert a second stream; a Reed-Solomon (RS) encoder for RS-encoding the input second stream; a Cyclic Redundancy Check (CRC) processor for converting the RS-encoded second stream to a stream comprising an added CRC bit sequence; and a stuffer for inserting the stream to the space in the first stream and outputting a transport stream. Hence, the robust stream can be efficiently transmitted.

Abstract: Provided are an apparatus for multi-stage transforming a plurality of unit blocks in multi-dimension that can improve compression efficiency of video data by collecting Discrete Cosine Transforming (DCT) coefficients of neighboring blocks and performing an additional transformation based on the DCT coefficients of an original picture and a differential picture. The method includes the steps of: performing a Discrete Cosine Transform (DCT) on inputted picture data and selecting R blocks of a predetermined size from DCT picture data, where R is a natural number equal to or greater than 2; arranging DCT coefficients of each of the selected R blocks according to each frequency in one-dimension; and performing one-dimensional transformation again on the DCT coefficients arranged in one-dimension.

Abstract: An integrated circuit receives a compressed input stream having a first compression format. A media processing module converts the compressed input stream to an intermediary compression format for processing without fully decompressing the compressed input stream. After processing, a compressed output stream having a second compression format is generated from the intermediary compression format. Processing is dynamically adjusted responsive to changing network conditions. Optionally, the integrated circuit can receive live, raw video, partially encode it into the intermediary compression format, process it with the media process module as well as take the intermediary compression format, decode and output the live, raw video.

Abstract: An encoder receives a signal. The encoder utilizes one or more downsample operations to produce downsampled renditions of the signal at successively lower levels of quality in the hierarchy. In a reverse direction, the encoder applies the one or more upsample operations to a downsampled rendition of the signal at a first level of quality to produce an upsampled rendition of the signal at a second level of quality in the hierarchy. The second level of quality is higher than the first level of quality. The one or more upsample operations and one or more downsample operations can be asymmetrical with respect to each other. That is, the function applied during downsampling can differ from the function applied when upsampling. The encoder produces residual data indicating a difference between the downsampled rendition of the signal at the second level of quality and the upsampled rendition of the signal at the second level of quality.

Abstract: An example method includes determining whether an encoded block of residual video data was encoded losslessly in accordance with a lossless coding mode, based on whether transform operations were skipped during encoding of the block of residual video data, and if the block of residual video data was encoded losslessly, then decoding the encoded block of residual video data according to the lossless coding mode to form a reconstructed block of residual video data, where decoding the encoded block of residual data comprises bypassing quantization and sign hiding while decoding the encoded block of residual video data, and bypassing all loop filters with respect to the reconstructed block of residual video data.

Abstract: Particular embodiments include a method, an apparatus, and logic embodied in tangible computer-readable medium that when executed carries out a method of encoding an ordered sequence of quantized transform coefficients of a block of image data. One embodiment is a context adaptive variable length coding method that includes position coding the positions of zero-valued and non-zero valued coefficients by either a mixed method that encodes either the run length of zeroes preceding a non-zero coefficient or the run length of nonzero-valued coefficients preceding a zero-valued coefficients. Another includes position coding that uses a variable length code for two parameters respectively indicating the number of zero-valued coefficient positions and nonzero-valued coefficient positions still to be coded.

Abstract: A method comprising receiving a syntax element to be encoded as a code word of a set of code words, determining a mapping between the syntax element and the code word on the basis of a hierarchy level in a tree structure, using the mapping to obtain the code word, and updating the mapping is disclosed.

Abstract: A video coding/decoding system, method and computer program product employ an integer transform matrix for transforming to/from transform coefficients and residual pixel data in moving pictures by a set of semi-orthonormal basis vectors. The basis vectors are derived from conventional DCT or KTL matrixes, but relaxes to some extent the requirements for orthogonality, norm equality and element size limitation. In this way improved coding efficiency and lower complexity compared to previously used integer transforms are possible.

Abstract: Systems, methods, and devices for processing video data are disclosed. Some examples relate to receiving or forming a parameter set having an identifier that is fixed length coded, wherein a parameter set identification (ID) for the parameter set is before any syntax element in the parameter set that is entropy coded and using the parameter set having the identifier that is fixed length coded to decode or encode video data. Other examples determine whether a first parameter set ID of a first parameter set of a first bitstream is the same as a second parameter set ID of a second parameter set of a second bitstream. In response to determining that the second parameter set ID is the same as the first parameter set ID, changing the second parameter set ID to a unique parameter set ID. A parameter set associated with the unique parameter set ID may be transmitted.

Abstract: This disclosure proposes techniques for encoding and decoding transform coefficients in a video coding process. In particular, this disclosure proposes techniques determining whether or not to apply a sign data hiding process for a group of transform coefficients, and techniques for applying the sign data hiding process. In one example, this disclosure describes a method for decoding video data comprising determining a block of transform coefficients, determining whether to perform a sign data hiding process for at least one transform coefficient in the block of transform coefficients based on a single variable compared to a threshold, and decoding sign information for the block based on the determination of whether to perform the sign data hiding process.

Abstract: Techniques are described for determining a scan order for transform coefficients of a block. The techniques may determine context for encoding or decoding significance syntax elements for the transform coefficients based on the determined scan order. A video encoder may encode the significance syntax elements and a video decoder may decode the significance syntax elements based on the determined contexts.

Abstract: Method and apparatus are provided for efficient reference data decoding for video compression by image content based search and ranking. An apparatus includes an entropy decoder for respectively entropy decoding an encoded respective rank number for each of a plurality of candidate reference blocks with respect to a current block to be decoded to obtain a decoded respective rank number there for. The encoded respective rank number is in place of and representative of respective reference data for each of the plurality of candidate reference blocks With respect to the current block. The apparatus further includes an inverse rank transformer for respectively transforming the decoded respective rank number for each of the plurality of candidate reference blocks with respect to the current block into the respective reference data there for based on a context feature of the current block with respect to the context feature of each of the plurality of candidate reference blocks.

Abstract: A system and method for encoding/decoding videos using an edge-adaptive transform. The encoding system encodes input videos using the edge-adaptive transform or, alternatively, using either the edge-adaptive transform or a discrete cosine transform.

Abstract: An image decoding apparatus for decoding a bit stream includes a receiving unit that receives the bit stream and a weight parameter that is added to a luma quantization parameter. The image decoding apparatus also includes a decoding unit that decodes the bit stream and generates a chroma component of quantized coefficients. Further, the image decoding apparatus includes a dequantization unit that performs dequantization on the chroma component of quantized coefficients using a chroma quantization parameter calculated on the basis of a luma quantization parameter weighted by the weight parameter. In addition, the image decoding apparatus includes a transform unit that performs an inverse orthogonal transform.

Abstract: Local motion estimation is described herein. Each picture of a video is partitioned into blocks for the local motion estimation. An extended-block FFT is calculated for each block, where the extended-block denotes that a certain area around the block is also included for applying FFT. Extending the block for FFT helps to account for the motion of objects that are moving into or out of the block. Phase correlation is applied to attain a set of Motion Vector (MV) candidates for the blocks, and a cost function is evaluated for each MV. If no MV candidate produces a cost function below a pre-defined threshold, a hierarchical variable block matching search is applied and the process is repeated with blocks for finer resolution. Also, predictive MV candidates are used during the block matching search along with temporal constraints tracking to select an MV that yields the minimum cost function.

Abstract: In video decoding using the H.264/AVC standard, the computation of an inverse 4×4 integer transform of a coefficient matrix derived by variable length decoding may be carried out using data reduction techniques to reduce the computation load. If the index value of the highest-indexed nonzero coefficient in the matrix is three or higher, the transform is computed conventionally, using two 1D transform operations separated by a transpose operation, and followed by rounding and shifting. If the index value of the highest-indexed nonzero coefficient in the matrix is zero (including the case where there is no nonzero coefficient), the inverse integer transform operation includes only rounding and shifting of that coefficient. If the index value of the highest-indexed nonzero coefficient in the matrix is one or two, then the inverse integer transform operation can be performed using a single integrated 2D transform followed by rounding and shifting.

Abstract: An image decoding apparatus for decoding a bit stream includes a receiving unit that receives the bit stream and a weight parameter that is added to a luma quantization parameter. Further, the image decoding apparatus includes a decoding unit that decodes the bit stream and generates a chroma component of quantized coefficients. The image decoding apparatus also includes a setting unit that sets a chroma quantization parameter calculated on the basis of the luma quantization parameter weighted by an addition operation that adds the weight parameter. Additionally, the image decoding apparatus includes a dequantization unit that performs dequantization on the chroma component of quantized coefficients using the chroma quantization parameter. In addition, the image decoding apparatus includes a transform unit that performs an inverse orthogonal transform.

Abstract: Provided are a bS derivation process and a deblocking filtering method and apparatus using illumination compensation and/or chrominance compensation, such as a multi-view video coding, in a picture coding/decoding process in which a prediction coding is performed. If neither of the two blocks are intra-coded, neither of the two blocks do contain a none-zero transformed coefficient, and motion compensation for the two blocks is performed based on the identical reference frame and the absolute difference between the horizontal or vertical components of the two motion vectors of the two blocks is less than 1, the bS of the two blocks is derived by considering whether the two blocks are coded by illumination compensation (IC) according to an embodiment of the present invention. Specifically, if both of the two blocks are coded by IC mode or neither of the two blocks are coded by IC mode, bS is set as such a value that filtering is unnecessary.

Abstract: A decoding method decodes a bit stream in an image decoding apparatus. The method includes receiving a luma quantization parameter and a weight parameter that is added to the luma quantization parameter as the bit stream. The method also includes decoding, in a decoding unit in the image decoding apparatus, the bit stream, and generating a luma component of quantized coefficients and a chroma component of quantized coefficients. Further, the method includes performing, in a dequantization unit in the image decoding apparatus, dequantization on the luma component of quantized coefficients using the luma quantization parameter and the chroma component of quantized coefficients using a chroma quantization parameter calculated on the basis of the luma quantization parameter weighted by an add operation of the weight parameter.

Abstract: A more efficient encoder/decoder is provided in which an N-point MDCT transform is mapped into smaller sized N/2-point DCT-IV and/or DCT-II transforms with isolated pre-multiplications which can be moved to a prior or subsequent windowing stage. That is, the windowing operations may be merged with first/last stage multiplications in the core MDCT/IMDCT functions, respectively, thus reducing the total number of multiplications. Additionally, the MDCT may be systematically decimated by factor of 2 by utilizing a uniformly scaled 5-point DCT-II core function as opposed to the DCT-IV or FFT cores used in many existing MDCT designs in audio codecs. The modified windowing stage merges factors from a transform stage and windowing stage to obtain piece-wise symmetric windowing factors, which can be represented by a sub-set of the piece-wise symmetric windowing factors to save storage space. Such features offer appreciable reduction in complexity and less memory usage than the prior art.

Abstract: Embodiments of the present invention disclose an RRU, which performs IDFT on a PUSCH signal that is obtained after resource block demapping, where due to a characteristic of an extremely low peak to average power ratio of SC-FDMA modulation, a signal after IDFT has an extremely low peak to average power ratio at this time, and an amplitude range of the signal changes slightly; amplitude/phase conversion is performed on the signal after the IDFT, where the signal after the IDFT is represented by using amplitude and phase, and then amplitude quantization and phase quantization are performed respectively to obtain a quantized amplitude signal and a quantized phase signal respectively.

Abstract: Methods are provided for reducing the size of a transpose buffer used for computation of a two-dimensional (2D) separable transform. Scaling factors and clip bit widths determined for a particular transpose buffer size and the expected transform sizes are used to reduce the size of the intermediate results of applying the 2D separable transform. The reduced bit widths of the intermediate results may vary across the intermediate results. In some embodiments, the scaling factors and associated clip bit widths may be adapted during encoding.

Abstract: A system that compresses a digital image. During operation, the system obtains a digital image in which the image components are de-correlated into separate channels containing luminance information and chrominance information. Next, the system receives a quality number for the luminance channel and a quality number for the chrominance channels, and uses the quality numbers to determine a target bitrate for the luminance channel and for the chrominance channels, respectively. Given the target bitrate for the luminance channel and the target bit rate for the chrominance channels, the system performs rate distortion optimizations separately on the luminance and chrominance channels to determine which portions of the luminance bitstream and which portions of the chrominance bitstream are to be included in the final bitstream. The system then uses the stored rate-distortion information to generate a preview of the digital image without performing entropy coding each time the quality settings are changed.

Abstract: The present invention is directed to a rate-distortion optimized (RDO) transform and quantization system. A frame classification unit classifies an input frame as either a key frame or a non-key frame. A rate model update unit generates at least one model parameter of a rate model according to a transform coefficient and a bitrate resulted from an encoded key frame. An RDO transform and quantization unit processes the input frame, thereby generating a quantized transform coefficient according to the model parameter. A frame buffer is used to store a previous frame, according to which the bitrate is estimated.

Abstract: Methods of encoding and decoding for video data are described for encoding or decoding coefficients for a transform unit. In particular, the significant-coefficient flags for a coefficient group are encoded and decoded based upon a context determination, and the context is determined based upon the values of neighboring flags. The neighborhood used to determine the context varies depending on whether the significant-coefficient flag to be encoded or decoded is in the right column or bottom row of the coefficient group or not. If it is in the right column or bottom row one of the alternative context neighborhoods is used to avoid relying on significant-coefficient flags in other coefficient groups except for the flags immediately adjacent the right border and bottom border of the coefficient group, and the flag diagonally to the lower-right.

Abstract: A method for representing a video sequence including a time sequence of input video frames, the input video frames including some common scene content that is common to all of the input video frames and some dynamic scene content that changes between at least some of the input video frames. Affine transform are determined to align the common scene content in the input video frames. A common video frame including the common scene content is determined by forming a sparse combination of a first basis functions. A dynamic video frame is determined for each input video frame by forming a sparse combination of a second basis functions, wherein the dynamic video frames can be combined with the respective affine transforms and the common video frame to provide reconstructed video frames.

Abstract: A video processing apparatus and method are provided, the video processing apparatus comprising first stage video processing circuitry and second stage video processing circuitry. The first stage video processing circuitry receives input video data and performs one or more processing operations on the input video data to generate an intermediate representation of the input video data. The intermediate representation comprises first and second separate data portions, with the first data portion containing transient data derived from the input video data and the second data portion containing long term data derived from the input video data. Transient data is only required for processing of a single video frame, while the long term data is required for processing of at least two video frames.

Abstract: A method, apparatus, article of manufacture, and a memory structure for encoding and decoding transform unit coefficients is disclosed. In one embodiment, the encoding of the transform unit coefficients is performed by determining a last significant subblock, wherein the last significant subblock is the last subblock along a subblock processing scan pattern that has at least one non-zero coefficient, encoding a position of the determined last significant subblock, encoding a first value for each subblock preceding the last significant subblock in the subblock processing scan pattern having at least one non-zero coefficient, and encoding the coefficients of the last significant subblock and the coefficients of the subblocks preceding the last significant subblock having the first encoded value.

Abstract: In certain embodiments, to eliminate DC leakage into surrounding AC values, scaling stage within a photo overlap transform operator is modified such that the off-diagonal elements of the associated scaling matrix have the values of 0. In certain embodiments, the on-diagonal scaling matrix are given the values (0.5, 2). In some embodiments, the scaling is performed using a combination of reversible modulo arithmetic and lifting steps. In yet other embodiments, amount of DC leakage is estimated at the encoder, and preprocessing occurs to mitigate amount of leakage, with the bitstream signaling that preprocessing has occurred. A decoder may then read the signal and use the information to mitigate DC leakage.

Abstract: A method, apparatus, article of manufacture, and a memory structure for encoding and decoding transform unit coefficients is disclosed. In one embodiment, the encoding of the transform unit coefficients is performed by determining if all of the coefficients of a portion of the transform unit disposed on a portion of a scan pattern are zero, setting a flag associated with the portion of the transform unit to a first value if at least one of the coefficients of the portion of the transform unit coefficients disposed on the portion of the scan pattern are non-zero, and setting the flag associated with the portion of the transform unit coefficients to a second value if all of the coefficients of the portion of the transform unit coefficients disposed in the portion of the scan pattern are zero.

Abstract: Methods and apparatus are provided for improved entropy encoding and decoding. An apparatus includes a video encoder for encoding at least a block in a picture by transforming a residue of the block to obtain transform coefficients, quantizing the transform coefficients to obtain quantized transform coefficients, and entropy coding the quantized transform coefficients. The quantized transform coefficients are encoded using a flag to indicate that a current one of the quantized transform coefficients being processed is a last non-zero coefficient for the block having a value greater than or equal to a specified value.

Abstract: A method of determining predicted numbers of processor cycles required for respective segments of a media file for playback of the media file, a method of playback of a media file, a method of downloading a media file, a device for playback of a media file and a system for downloading a media file. The method comprising performing a bitstream analysis of the media file to determine a number of non-zero IDCT coefficients of the respective segments, input parameters of an MC task function associated with respective segments, or both; and determining the predicted numbers of processor cycles based on the bitstream analysis.