Abstract:
At high bit rates, the reconstruction error of compressed video is generally proportional to the squared value of quantization step size, such that full quantization step size increments at high bit rates can lead to significant change in the reconstruction error and/or bit rate of the compressed video. A video codec uses fractional increments of quantization step size at high bit rates to permit a more continuous variation of quality and/or bit rate as the quantization scale changes. For high bit rate scenarios, the bit stream syntax includes an additional syntax element to specify fractional step increments (e.g., half step) of the normal quantizer scale step sizes.

Description:
CROSS REFERENCE TO RELATED APPLICATIONS  
       [0001]     This application claims the benefit of U.S. Provisional Patent Application Ser. No. 60/488,710, filed Jul. 18, 2003, the disclosure of which is incorporated herein by reference. This application also is a continuation-in-part of U.S. patent application Ser. No. 10/623,195, filed Jul. 18, 2003, the disclosure of which is incorporated herein by reference. 
     
    
     COPYRIGHT AUTHORIZATION  
       [0002]     A portion of the disclosure of this patent document contains material which is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by any one of the patent disclosure, as it appears in the Patent and Trademark Office patent files or records, but otherwise reserves all copyright rights whatsoever.  
       TECHNICAL FIELD  
       [0003]     The invention relates generally to video and other digital media coding and decoding, and more particularly relates to quantization of transform coefficients in video and other digital media coding and decoding.  
       BACKGROUND  
       [0004]     With the increased popularity of DVDs, music delivery over the Internet, and digital cameras, digital media have become commonplace. Engineers use a variety of techniques to process digital audio, video, and images efficiently while still maintaining quality. To understand these techniques, it helps to understand how the audio, video, and image information is represented and processed in a computer.  
         [0000]     I. Representation of Media Information in a Computer  
         [0005]     A computer processes media information as a series of numbers representing that information. For example, a single number may represent the intensity of brightness or the intensity of a color component such as red, green or blue for each elementary small region of a picture, so that the digital representation of the picture consists of one or more arrays of such numbers. Each such number may be referred to as a sample. For a color image, it is conventional to use more than one sample to represent the color of each elemental region, and typically three samples are used. The set of these samples for an elemental region may be referred to as a pixel, where the word “pixel” is a contraction referring to the concept of a “picture element.” For example, one pixel may consist of three samples that represent the intensity of red, green and blue light necessary to represent the elemental region. Such a pixel type is referred to as an RGB pixel. Several factors affect quality, including sample depth, resolution, and frame rate (for video).  
         [0006]     Sample depth is a property normally measured in bits that indicates the range of numbers that can be used to represent a sample. When more values are possible for the sample, quality can be higher because the number can capture more subtle variations in intensity and/or a greater range of values. Images with higher resolution tend to look crisper than other images and contain more discemable useful details. Video with higher frame rate tends to mimic the smooth motion of natural objects better than other video, and can similarly be considered to contain more detail in the temporal dimension. For all of these factors, the tradeoff for high quality is the cost of storing and transmitting the information in terms of the bit rate necessary to represent the sample depth, resolution and frame rate, as Table 1 shows.  
                                                   TABLE 1                           Bit rates for different quality levels of raw video                Resolution               Bits Per Pixel   (in pixels,   Frame Rate   Bit Rate       (sample depth times   Width ×   (in frames   (in millions of       samples per pixel)   Height)   per second)   bits per second)                     8 (value 0-255,   160 × 120   7.5   1.2       monochrome)       24 (value 0-255, RGB)   320 × 240   15   27.6       24 (value 0-255, RGB)   640 × 480   30   221.2       24 (value 0-255, RGB)   1280 × 720    60   1327.1                  
 
         [0007]     Despite the high bit rate necessary for sending high quality video (such as HDTV), companies and consumers increasingly depend on computers to create, distribute, and play back high quality content. For this reason, engineers use compression (also called source coding or source encoding) to reduce the bit rate of digital media. Compression decreases the cost of storing and transmitting the information by converting the information into a lower bit rate form. Decompression (also called decoding) reconstructs a version of the original information from the compressed form. A “codec” is an encoder/decoder system. Two categories of compression are lossless compression and lossy compression.  
         [0008]     Lossless compression reduces the bit rate of information by removing redundancy from the information without any reduction in fidelity. For example, a series of ten consecutive pixels that are all exactly the same shade of red could be represented as a code for the particular shade of red and the number ten as a “run length” of consecutive pixels, and this series can be perfectly reconstructed by decompression from the code for the shade of red and the indicated number (ten) of consecutive pixels having that shade of red. Lossless compression techniques reduce bit rate at no cost to quality, but can only reduce bit rate up to a certain point. Decreases in bit rate are limited by the inherent amount of variability in the statistical characterization of the input data, which is referred to as the source entropy. Entropy coding is another term for lossless compression.  
         [0009]     In contrast, with lossy compression, the quality suffers somewhat but the achievable decrease in bit rate is more dramatic. For example, a series of ten pixels, each being a slightly different shade of red, can be approximated as ten pixels with exactly the same particular approximate red color. Lossy compression techniques can be used to reduce bit rate more than lossless compression techniques, but some of the reduction in bit rate is achieved by reducing quality, and the lost quality cannot be completely recovered. Lossy compression is often used in conjunction with lossless compression—in a system design in which the lossy compression establishes an approximation of the information and lossless compression techniques are applied to represent the approximation. For example, the series of ten pixels, each a slightly different shade of red, can be represented as a code for one particular shade of red and the number ten as a run-length of consecutive pixels. In decompression, the original series would then be reconstructed as ten pixels with the same approximated red color.  
         [0000]     II. Quantization  
         [0010]     According to one possible definition, quantization is a term used for an approximating non-reversible mapping function commonly used for lossy compression, in which there is a specified set of possible output values, and each member of the set of possible output values has an associated set of input values that result in the selection of that particular output value. A variety of quantization techniques have been developed, including scalar or vector, uniform or non-uniform, and adaptive or non-adaptive quantization.  
         [0011]     A. Scalar Quantizers  
         [0012]     According to one possible definition, a scalar quantizer is an approximating functional mapping x→Q[x] of an input value x to a quantized value Q[x].  FIG. 1  shows a “staircase” I/O function ( 100 ) for a scalar quantizer. The horizontal axis is a number line for a real number input variable x, and the vertical axis indicates the corresponding quantized values Q[x]. The number line is partitioned by thresholds such as the threshold ( 110 ). Each value of x within a given range between a pair of adjacent thresholds is assigned the same quantized value Q[x]. For example, each value of x within the range ( 120 ) is assigned the same quantized value ( 130 ). (At a threshold, one of the two possible quantized values is assigned to an input x, depending on the system.) Overall, the quantized values Q[x] exhibit a discontinuous, staircase pattern. The distance the mapping continues along the number line depends on the system, typically ending after a finite number of thresholds. The placement of the thresholds on the number line may be uniformly spaced (as shown in  FIG. 1 ) or non-uniformly spaced.  
         [0013]     A scalar quantizer can be decomposed into two distinct stages. The first stage is the classifier stage, in which a classifier function mapping x→A[x] maps an input x to a quantization index A[x], which is often integer-valued. In essence, the classifier segments an input number line or data set.  FIG. 2   a  shows a generalized classifier ( 200 ) and thresholds for a scalar quantizer. As in  FIG. 1 , a number line for a real number variable x is segmented by thresholds such as the threshold ( 210 ). Each value of x within a given range such as the range ( 220 ) is assigned the same quantized value Q[x].  FIG. 2   b  shows a numerical example of a classifier ( 250 ) and thresholds for a scalar quantizer.  
         [0014]     In the second stage, a reconstructor functional mapping k→β[k] maps each quantization index k to a reconstruction value β[k]. In essence, the reconstructor places steps having a particular height relative to the input number line segments (or selects a subset of data set values) for reconstruction of each region determined by the classifier. The reconstructor functional mapping may be implemented, for example, using a lookup table. Overall, the classifier relates to the reconstructor as follows: 
 
 Q[x]=β[A[x]]   (1). 
 
         [0015]     The distortion introduced by using such a quantizer may be computed with a difference-based distortion measure d(x−Q[x]). Typically, such a distortion measure has the property that d(x−Q[x] ) increases as x−Q[x] deviates from zero; and typically each reconstruction value lies within the range of the corresponding classification region, so that the straight line that would be formed by the functional equation Q[x]=x will pass through every step of the staircase diagram (as shown in  FIG. 1 ) and therefore Q[Q[x]] will typically be equal to Q[x]. In general, a quantizer is considered better in rate-distortion terms if the quantizer results in a lower average value of distortion than other quantizers for a given bit rate of output. More formally, a quantizer is considered better if, for a source random variable X, the expected (i.e., the average or statistical mean) value of the distortion measure {overscore (D)}=E X {d(X−Q[X])} is lower for an equal or lower entropy H of A[X]. The most commonly-used distortion measure is the squared error distortion measure, for which d(|x−y|)=|x−y| 2 . When the squared error distortion measure is used, the expected value of the distortion measure ({overscore (D)}) is referred to as the mean squared error.  
         [0016]     B. Dead Zone+Uniform Threshold Quantizers  
         [0017]     According to one possible definition, a dead zone plus uniform threshold quantizer [“DZ+UTQ”] is a quantizer with uniformly spaced threshold values for all classifier regions except the one containing the zero input value (which is called the dead zone [“DZ”]). A DZ+UTQ has a classifier index mapping rule x→A[x] that can be expressed based on two parameters.  FIG. 3  shows a staircase I/O function ( 300 ) for a DZ+UTQ, and  FIG. 4   a  shows a generalized classifier ( 400 ) and thresholds for a DZ+UTQ. The parameter s, which is greater than 0, indicates the step size for all steps other than the DZ. Mathematically, all s i  are equal to s for i≢0 . The parameter z, which is greater than or equal to 0, indicates the ratio of the DZ size to the size of the other steps. Mathematically, s 0 =z·s. In  FIG. 4   a,  z is 2, so the DZ is twice as wide as the other classification zones. The index mapping rule x→A[x] for a DZ+UTQ can be expressed as:  
                 A   ⁡     [   x   ]       =       sign   ⁡     (   x   )       *     max   ⁡     (     0   ,     ⌊            x        s     -     z   2     +   1     ⌋       )           ,           (   2   )             
 
 where └.┘ denotes the smallest integer less than or equal to the argument and where sign(x) is the function defined as:  
               sign   ⁡     (   x   )       =     {               +   1     ,               for   ⁢           ⁢   x     ≥   0     ,                 -   1     ,             for   ⁢           ⁢   x     &lt;   0.           .               (   3   )             
 
         [0018]      FIG. 4   b  shows a numerical example of a classifier ( 450 ) and thresholds for a DZ+UTQ with s=1 and z=2.  FIGS. 1, 2   a,  and  2   b  show a special case DZ+UTQ with z=1. Quantizers of the UTQ form have good performance for a variety of statistical sources. In particular, the DZ+UTQ form is optimal for the statistical random variable source known as the Laplacian source.  
         [0019]     In some system designs (not shown), an additional consideration may be necessary to fully characterize a DZ+UTQ classification rule. For practical reasons there may be a need to limit the range of values that can result from the classification function A[x] to some reasonable finite range. This limitation is referred to as clipping. For example, in some such systems the classification rule could more precisely be defined as:  
                 A   ⁡     [   x   ]       =       sign   ⁡     (   x   )       *     min   ⁡     [     g   ,     max   ⁡     (     0   ,     ⌊            x        s     -     z   2     +   1     ⌋       )         ]           ,           (   4   )             
 
 where g is a limit on the absolute value of A[x]. In much of the theoretical analysis presented herein, consideration of clipping is omitted as it unduly complicates the analysis without advancing the explanation. Moreover, although the clipping shown in the above example is symmetric about zero, the clipping does not need to be symmetric, and often is not exactly symmetric. For example, a common clipping range would be such that the value of A[x] is limited to some range from −2 B  to +2 B −1 so that A [x] can be represented as an integer using a two&#39;s complement representation that uses B+1 bits, where B+1 may be equal to 8 or 16 or another particular selected number of bits. 
 
         [0020]     C. Reconstruction Rules  
         [0021]     Different reconstruction rules may be used to determine the reconstruction value for each quantization index. These include the optimal reconstruction rule and the single offset reconstruction rule (of which the mid-point reconstruction rule is an example).  FIG. 5  shows reconstruction points according to different reconstruction rules for a particular shape of a source probability distribution function ƒ(x). For a range of values between two thresholds t j  and t j+1 , the reconstruction value r j,mid  according to the mid-point reconstruction rule bisects the range (thus, r j,mid =(t j +t j+1 )/2). For the example probability distribution function shown in  FIG. 5 , this fails to account for the fact that values to the left of the mid-point are more likely than values to the right of the mid-point. The reconstruction value r j,opt  according to the optimal reconstruction rule accounts for the probability distribution.  
         [0022]     In general, a probability distribution function [“pdf”] indicates the probabilities for the different values of a variable. One possible definition of the optimal reconstruction value r j,opt  for each region between two neighboring thresholds t j  and t j+1  for a pdf ƒ(x) can be expressed as:  
               r     j   ,   opt       =         min   y       -   1       ⁢       ∫     t   j       t     j   +   1         ⁢       ⅆ     (     x   -   y     )       ⁢     f   ⁡     (   x   )       ⁢       ⅆ   x     .                   (   5   )             
 
 Assuming that the pdf ƒ(x) for a given source is symmetric around zero, one possible definition of the optimal reconstruction rule of a DZ+UTQ for a symmetric, difference-based distortion measure d(|x−y|) is:  
               β   ⁡     [   k   ]       =     {                   min   y       -   1       ⁢       ∫   0     zs   2       ⁢       [       ⅆ     (          x   -   y          )       +     ⅆ     (          y   -   x          )         ]     ⁢     f   ⁡     (   x   )       ⁢     ⅆ   x           ,               for   ⁢           ⁢   k     =   0     ,                   sign   ⁡     (   k   )       ⁢         min   y       -   1       ⁢       ∫       zs   2     +       (          k        -   1     )     ⁢   s           zs   2     +          k        ⁢   s         ⁢       ⅆ     (          x   -   y          )       ⁢     f   ⁡     (   x   )       ⁢     ⅆ   x             ,             for   ⁢           ⁢   k     ≠   0.           ,               (   6   )             
 
 where y is the quantized value Q[x], and where the rule finds the quantized value Q[x] that results in the smallest distortion according to the distortion measure. Typically, the optimal quantized value for p[0] is equal to 0, and that will be assumed to be true for the remainder of this description. For minimizing mean squared error, the optimal reconstruction rule sets the reconstruction value for each region equal to the conditional mean of the input values in that region. Stated more precisely, the optimal reconstruction value r j,opt  for the region between two neighboring thresholds t j  and t j+1  for a pdf ƒ(x) when using the mean squared error distortion measure is given by  
               r     j   ,   opt       =           ∫     t   j       t     j   +   1         ⁢       x   ·     f   ⁡     (   x   )         ⁢     ⅆ   x             ∫     t   j       t     j   +   1         ⁢       f   ⁡     (   x   )       ⁢     ⅆ   x           .             (   7   )             
 
         [0023]     According to one possible definition for a DZ+UTQ, the single-offset reconstruction rule is based on an offset parameter A, where ordinarily 0&lt;Δ&lt;s/2, and the rule is:  
               β   ⁡     [   k   ]       =     {             0   ,               for   ⁢           ⁢   k     =   0     ,                   sign   ⁡     (   k   )       ⁡     [         (          k        +     z   2     -   1     )     ⁢   s     +   Δ     ]       ,             for   ⁢           ⁢   k     ≠   0.           .               (   8   )             
 
         [0024]     The mid-point reconstruction rule is a special case of the single-offset reconstruction rule, specified by Δ=s/2. Mid-point reconstruction is commonly used for convenience due to its simplicity. And, in the limit as s becomes very small, the performance of the mid-point rule becomes optimal under a variety of well-behaved mathematical conditions.  
         [0025]     D. Specifying Reconstruction Values, Constructing Classifiers  
         [0026]     Standards and product specifications that focus only on achieving interoperability will often specify reconstruction values without necessarily specifying the classification rule. In other words, some specifications may define the functional mapping k→β[k] without defining the functional mapping x→A[x]. This allows a decoder built to comply with the standard/specification to reconstruct information correctly. In contrast, encoders are often given the freedom to change the classifier in any way that they wish, while still complying with the standard/specification.  
         [0027]     Numerous systems for adjusting quantization thresholds have been developed. Many standards and products specify reconstruction values that correspond to a typical mid-point reconstruction rule (e.g., for a typical simple classification rule) for the sake of simplicity. For classification, however, the thresholds can in fact be adjusted so that certain input values will be mapped to more common (and hence, lower bit rate) indices, which makes the reconstruction values closer to optimal.  FIG. 6  shows such adjusted thresholds for a classifier ( 600 ). The original thresholds (such as old t j ) are situated halfway between the reconstruction points. The thresholds are moved outward on the number line, away from 0. Before the adjustment, a marginal value (shown between the old t j  and the new t j ) is mapped to r j . After the adjustment, the marginal value is mapped to r 0 . The decoder performs reconstruction without knowledge of the adjustments done in the encoder.  
         [0028]     For optimal encoding, an encoder may adjust quantization thresholds to optimally fit a given set of reconstruction values as follows. The probability p j  for the source random variable X to fall within a range j between t j  and t j+1 (where t j+1 &gt;t j ) for a source pdf ƒ(x) is:  
                 p   j     =       ∫     t   j       t     j   +   1         ⁢       f   ⁡     (   x   )       ⁢     ⅆ   x           ,           (   9   )             
 
 and the number of bits necessary to represent an event with probability p j  in an ideal lossless communication system may be quantified as:  
                 h   j     =       log   2     ⁢     1     p   j           ,           (   10   )             
 
 where the h j  is expressed in terms of bits. The total entropy of the classifier is then given by  
             H   =       ∑   j     ⁢         p   j     ·     h   j       ⁢           ⁢     bits   .                 (   11   )             
 
         [0029]     In general, if the encoder is required to use b j  bits to indicate the selection of the reconstruction value r j , the encoder may evaluate and optimize its thresholds according to minimization of the rate-distortion relation D+λR, where D indicates distortion, R indicates bit usage, and λ is a tuning parameter for favoring a particular selected balance between distortion and bit rate. For each particular threshold t j+1  between two points r j  and r j+1 , the encoder can set t j+1  to the x that satisfies: 
 
 d ( x−r   j )+λ b   j   =d ( x−r   j+1 )+λ b   j+1    (12). 
 
         [0030]     In an ideal design, b j  will be approximately equal to h j , and modem lossless coding techniques can be used to very nearly achieve this goal. In a design using some non-ideal lossless coding technique to represent the output of the classifier, b j  may have some other value.  
         [0031]     Note in summation that optimal decision thresholds can be selected using equation (12), that optimal reconstruction values can be selected using equation (5) or (7), and that optimal bit usage can be computed by setting b j  equal to h j  as given by equation (10) or to the number of bits used in some other lossless code (such as a Huffman code designed using equation (9) or a fixed-length code). In some highly-optimized scalar quantizer system designs, reconstruction values (initially uniformly spaced) are analyzed to adjust thresholds in encoder analysis, then use of the adjusted thresholds is analyzed to set the number of bits needed to represent the output of the classifier using lossless coding and to set the reconstruction values in decoder analysis. The new reconstruction values are then analyzed to adjust thresholds, and so on, until the thresholds and/or reconstruction values stabilize across iterations.  
       SUMMARY  
       [0032]     Described tools and techniques relate to use of fractional quantization step sizes for high bit rate video or other media. The various tools and techniques may be used in combination or separately.  
         [0033]     Quantization is typically used in video compression to remove or reduce resolution of high-frequency information in video, without causing too much degradation in visual quality for quantization step sizes in the low to intermediate range. A problem in high bit rate video coding is that even small adjustments of quantization step size often lead to dramatic swings in the size of the compressed result. For example, when quantization step size is decreased from 2 to 1, bit rate may increase by 50% or more. This can make it difficult for an encoder to match a target bit rate in a constant bit rate encoding scenario. Moreover, for some small increases in quantization step size, even when there is a big improvement in bit rate, there may be very little change in objective quality, and possibly no subjective benefit. For example, for a quantization step size higher than 1 but less than 2, there may be a dramatic improvement in bit rate compared to the video sequence compressed at the quantization step size of 1, but no discernable quality difference. In order to improve the granularity of rate control, it is often desirable for intermediate or fractional quantization step sizes to be permissible, especially at low values of quantization step sizes.  
         [0034]     In one implementation of fractional quantization step sizes for high bit rate video, a video codec uses a quantizer scale index in the bit stream syntax, which translates to a quantizer scale value for a picture in the video sequence. In a low range of the quantizer scale values, an additional syntax element is sent to signal fractional step increments (e.g., half steps) of the normal quantizer scale increments.  
         [0035]     Additional features and advantages will be made apparent from the following detailed description of various embodiments that proceeds with reference to the accompanying drawings. 
     
    
     BRIEF DESCRIPTION OF THE DRAWINGS  
       [0036]      FIG. 1  is a chart showing a staircase I/O function for a scalar quantizer according to the prior art.  
         [0037]      FIGS. 2   a  and  2   b  are charts showing classifiers and thresholds for scalar quantizers according to the prior art.  
         [0038]      FIG. 3  is a chart showing a staircase I/O function for a DZ+UTQ according to the prior art.  
         [0039]      FIGS. 4   a  and  4   b  are charts showing classifiers and thresholds for DZ+UTQs according to the prior art.  
         [0040]      FIG. 5  is a chart showing reconstruction points for different reconstruction rules for a given pdf shape according to the prior art.  
         [0041]      FIG. 6  is a chart showing adjustments to a classifier for a scalar quantizer according to the prior art.  
         [0042]      FIG. 7  is a block diagram of a suitable computing environment in which several described embodiments may be implemented.  
         [0043]      FIGS. 8 and 9  are block diagrams of a video encoder system and a video decoder system, respectively, in conjunction with which several described embodiments may be implemented.  
         [0044]      FIGS. 10A-10C  are diagrams for different syntax layers of a bitstream. 
     
    
     DETAILED DESCRIPTION  
       [0045]     Described embodiments relate to techniques and tools of fractional quantization step size for high bit rate. In particular, signaling mechanisms of fractional quantization step size for high bit rate are described, including mechanisms for signaling use of fractional step size. The various techniques and tools can be used in combination or independently.  
         [0000]     I. Computing Environment  
         [0046]      FIG. 7  illustrates a generalized example of a suitable computing environment ( 700 ) in which several of the described embodiments may be implemented. The computing environment ( 700 ) is not intended to suggest any limitation as to scope of use or functionality, as the techniques and tools may be implemented in diverse general-purpose or special-purpose computing environments.  
         [0047]     With reference to  FIG. 7 , the computing environment ( 700 ) includes at least one processing unit ( 710 ) and memory ( 720 ). In  FIG. 7 , this most basic configuration ( 730 ) is included within a dashed line. The processing unit ( 710 ) executes computer-executable instructions and may be a real or a virtual processor. In a multi-processing system, multiple processing units execute computer-executable instructions to increase processing power. The memory ( 720 ) may be volatile memory (e.g., registers, cache, RAM), non-volatile memory (e.g., ROM, EEPROM, flash memory, etc.), or some combination of the two. The memory ( 720 ) stores software ( 780 ) implementing an encoder and/or decoder with adaptive multiple quantization and/or half quantization step sizes.  
         [0048]     A computing environment may have additional features. For example, the computing environment ( 700 ) includes storage ( 740 ), one or more input devices ( 750 ), one or more output devices ( 760 ), and one or more communication connections ( 770 ). An interconnection mechanism (not shown) such as a bus, controller, or network interconnects the components of the computing environment ( 700 ). Typically, operating system software (not shown) provides an operating environment for other software executing in the computing environment ( 700 ), and coordinates activities of the components of the computing environment ( 700 ).  
         [0049]     The storage ( 740 ) may be removable or non-removable, and includes magnetic disks, magnetic tapes or cassettes, CD-ROMs, DVDs, or any other medium which can be used to store information and which can be accessed within the computing environment ( 700 ). The storage ( 740 ) stores instructions for the software ( 780 ) implementing the encoder and/or decoder.  
         [0050]     The input device(s) ( 750 ) may be a touch input device such as a keyboard, mouse, pen, or trackball, a voice input device, a scanning device, or another device that provides input to the computing environment ( 700 ). For audio or video encoding, the input device(s) ( 750 ) may be a sound card, video card, TV tuner card, or similar device that accepts audio or video input in analog or digital form, or a CD-ROM or CD-RW that reads audio or video samples into the computing environment ( 700 ). The output device(s) ( 760 ) may be a display, printer, speaker, CD-writer, or another device that provides output from the computing environment ( 700 ).  
         [0051]     The communication connection(s) ( 770 ) enable communication over a communication medium to another computing entity. The communication medium conveys information such as computer-executable instructions, audio or video input or output, or other data in a modulated data signal. A modulated data signal is a signal that has one or more of its characteristics set or changed in such a manner as to encode information in the signal. By way of example, and not limitation, communication media include wired or wireless techniques implemented with an electrical, optical, RF, infrared, acoustic, or other carrier.  
         [0052]     The techniques and tools can be described in the general context of computer-readable media. Computer-readable media are any available media that can be accessed within a computing environment. By way of example, and not limitation, with the computing environment ( 700 ), computer-readable media include memory ( 720 ), storage ( 740 ), communication media, and combinations of any of the above.  
         [0053]     The techniques and tools can be described in the general context of computer-executable instructions, such as those included in program modules, being executed in a computing environment on a target real or virtual processor. Generally, program modules include routines, programs, libraries, objects, classes, components, data structures, etc. that perform particular tasks or implement particular abstract data types. The functionality of the program modules may be combined or split between program modules as desired in various embodiments. Computer-executable instructions for program modules may be executed within a local or distributed computing environment.  
         [0000]     II. Video Encoder and Decoder  
         [0054]      FIG. 8  is a block diagram of a generalized video encoder system ( 800 ), and  FIG. 9  is a block diagram of a video decoder system ( 900 ), in conjunction with which various described embodiments may be implemented.  
         [0055]     The relationships shown between modules within the encoder and decoder indicate the main flow of information in the encoder and decoder; other relationships are not shown for the sake of simplicity. In particular,  FIGS. 8 and 9  usually do not show side information indicating the encoder settings, modes, tables, etc. used for a video sequence, frame, macroblock, block, etc. Such side information is sent in the output bitstream, typically after entropy encoding of the side information. The format of the output bitstream can be a Windows Media Video version 9 or other format.  
         [0056]     The encoder ( 800 ) and decoder ( 900 ) are block-based and use a 4:2:0 macroblock format, with each macroblock including four 8×8 luminance blocks (at times treated as one 16×16 macroblock) and two 8×8 chrominance blocks. Alternatively, the encoder ( 800 ) and decoder ( 900 ) are object-based, use a different macroblock or block format, or perform operations on sets of pixels of different size or configuration than 8×8 blocks and 16×16 macroblocks.  
         [0057]     Depending on implementation and the type of compression desired, modules of the encoder or decoder can be added, omitted, split into multiple modules, combined with other modules, and/or replaced with like modules. In alternative embodiments, encoders or decoders with different modules and/or other configurations of modules perform one or more of the described techniques.  
         [0058]     A. Video Encoder  
         [0059]      FIG. 8  is a block diagram of a general video encoder system ( 800 ) that can perform joint entropy coding and bitstream formation operations for variable-size transform information. The encoder system ( 800 ) receives a sequence of video frames including a current frame ( 805 ), and produces compressed video information ( 895 ) as output. Particular embodiments of video encoders typically use a variation or supplemented version of the generalized encoder ( 800 ).  
         [0060]     The encoder system ( 800 ) compresses predicted frames and key frames. For the sake of presentation,  FIG. 8  shows a path for key frames through the encoder system ( 800 ) and a path for forward-predicted frames. Many of the components of the encoder system ( 800 ) are used for compressing both key frames and predicted frames. The exact operations performed by those components can vary depending on the type of information being compressed.  
         [0061]     A predicted frame (also called p-frame, b-frame for bi-directional prediction, or inter-coded frame) is represented in terms of prediction (or difference) from one or more other frames. A prediction residual is the difference between what was predicted and the original frame. In contrast, a key frame (also called an I-frame or intra-coded frame) is compressed without reference to other frames.  
         [0062]     If the current frame ( 805 ) is a forward-predicted frame, a motion estimator ( 810 ) estimates motion of macroblocks or other sets of pixels of the current frame ( 805 ) with respect to a reference frame, which is a reconstructed previous frame ( 825 ) buffered in the frame store ( 820 ). In alternative embodiments, the reference frame is a later frame or the current frame is bi-directionally predicted. The motion estimator ( 810 ) can estimate motion by pixel, ½ pixel, ¼ pixel, or other increments, and can switch the precision of the motion estimation on a frame-by-frame basis or other basis. The precision of the motion estimation can be the same or different horizontally and vertically. The motion estimator ( 810 ) outputs as side information motion information ( 815 ) such as motion vectors. A motion compensator ( 830 ) applies the motion information ( 815 ) to the reconstructed previous frame ( 825 ) to form a motion-compensated current frame ( 835 ). The prediction is rarely perfect, however, and the difference between the motion-compensated current frame ( 835 ) and the original current frame ( 805 ) is the prediction residual ( 845 ). Alternatively, a motion estimator and motion compensator apply another type of motion estimation/compensation.  
         [0063]     A frequency transformer ( 860 ) converts the spatial domain video information into frequency domain (i.e., spectral) data. For block-based video frames, the frequency transformer ( 860 ) applies a DCT or variant of DCT to blocks of the pixel data or prediction residual data, producing blocks of DCT coefficients. Alternatively, the frequency transformer ( 860 ) applies another conventional frequency transform such as a Fourier transform or uses wavelet or subband analysis. In embodiments in which the encoder uses spatial extrapolation (not shown in  FIG. 8 ) to encode blocks of key frames, the frequency transformer ( 860 ) can apply a re-oriented frequency transform such as a skewed DCT to blocks of prediction residuals for the key frame. The frequency transformer ( 860 ) applies an 8×8, 8×4, 4×8, or other size frequency transforms (e.g., DCT) to prediction residuals for predicted frames.  
         [0064]     A quantizer ( 870 ) then quantizes the blocks of spectral data coefficients. The quantizer applies uniform, scalar quantization to the spectral data with a step-size that varies on a frame-by-frame basis or other basis. Alternatively, the quantizer applies another type of quantization to the spectral data coefficients, for example, a non-uniform, vector, or non-adaptive quantization, or directly quantizes spatial domain data in an encoder system that does not use frequency transformations. For adaptive multiple quantization and/or half quantization step sizes, the encoder ( 800 ) operates and produces a bitstream in compliance with a syntax and semantics such as those described below. In addition to adaptive quantization, the encoder ( 800 ) can use frame dropping, adaptive filtering, or other techniques for rate control.  
         [0065]     If a given macroblock in a predicted frame has no information of certain types (e.g., no motion information for the macroblock and no residual information), the encoder ( 800 ) may encode the macroblock as a skipped macroblock. If so, the encoder signals the skipped macroblock in the output bitstream of compressed video information ( 895 ).  
         [0066]     When a reconstructed current frame is needed for subsequent motion estimation/compensation, an inverse quantizer ( 876 ) performs inverse quantization on the quantized spectral data coefficients. An inverse frequency transformer ( 866 ) then performs the inverse of the operations of the frequency transformer ( 860 ), producing a reconstructed prediction residual (for a predicted frame) or reconstructed samples (for an intra-coded frame). If the frame ( 805 ) being encoded is an intra-coded frame, then the reconstructed samples form the reconstructed current frame (not shown). If the frame ( 805 ) being encoded is a predicted frame, the reconstructed prediction residual is added to the motion-compensated predictions ( 835 ) to form the reconstructed current frame. The frame store ( 820 ) buffers the reconstructed current frame for use in predicting a next frame. In some embodiments, the encoder applies a deblocking filter to the reconstructed frame to adaptively smooth discontinuities between the blocks of the frame.  
         [0067]     The entropy coder ( 880 ) compresses the output of the quantizer ( 870 ) as well as certain side information (e.g., motion information ( 815 ), spatial extrapolation modes, quantization step size). Typical entropy coding techniques include arithmetic coding, differential coding, Huffman coding, run length coding, LZ coding, dictionary coding, and combinations of the above. The entropy coder ( 880 ) typically uses different coding techniques for different kinds of information (e.g., DC coefficients, AC coefficients, different kinds of side information), and can choose from among multiple code tables within a particular coding technique.  
         [0068]     The entropy coder ( 880 ) puts compressed video information ( 895 ) in the buffer ( 890 ). A buffer level indicator is fed back to bit rate adaptive modules. The compressed video information ( 895 ) is depleted from the buffer ( 890 ) at a constant or relatively constant bit rate and stored for subsequent streaming at that bit rate. Therefore, the level of the buffer ( 890 ) is primarily a function of the entropy of the filtered, quantized video information, which affects the efficiency of the entropy coding. Alternatively, the encoder system ( 800 ) streams compressed video information immediately following compression, and the level of the buffer ( 890 ) also depends on the rate at which information is depleted from the buffer ( 890 ) for transmission.  
         [0069]     Before or after the buffer ( 890 ), the compressed video information ( 895 ) can be channel coded for transmission over the network. The channel coding can apply error detection and correction data to the compressed video information ( 895 ).  
         [0070]     B. Video Decoder  
         [0071]      FIG. 9  is a block diagram of a general video decoder system ( 900 ). The decoder system ( 900 ) receives information ( 995 ) for a compressed sequence of video frames and produces output including a reconstructed frame ( 905 ). Particular embodiments of video decoders typically use a variation or supplemented version of the generalized decoder ( 900 ).  
         [0072]     The decoder system ( 900 ) decompresses predicted frames and key frames. For the sake of presentation,  FIG. 9  shows a path for key frames through the decoder system ( 900 ) and a path for forward-predicted frames. Many of the components of the decoder system ( 900 ) are used for decompressing both key frames and predicted frames. The exact operations performed by those components can vary depending on the type of information being decompressed.  
         [0073]     A buffer ( 990 ) receives the information ( 995 ) for the compressed video sequence and makes the received information available to the entropy decoder ( 980 ). The buffer ( 990 ) typically receives the information at a rate that is fairly constant over time, and includes a jitter buffer to smooth short-term variations in bandwidth or transmission. The buffer ( 990 ) can include a playback buffer and other buffers as well. Alternatively, the buffer ( 990 ) receives information at a varying rate. Before or after the buffer ( 990 ), the compressed video information can be channel decoded and processed for error detection and correction.  
         [0074]     The entropy decoder ( 980 ) entropy decodes entropy-coded quantized data as well as entropy-coded side information (e.g., motion information ( 915 ), spatial extrapolation modes, quantization step size), typically applying the inverse of the entropy encoding performed in the encoder. Entropy decoding techniques include arithmetic decoding, differential decoding, Huffman decoding, run length decoding, LZ decoding, dictionary decoding, and combinations of the above. The entropy decoder ( 980 ) frequently uses different decoding techniques for different kinds of information (e.g., DC coefficients, AC coefficients, different kinds of side information), and can choose from among multiple code tables within a particular decoding technique.  
         [0075]     If the frame ( 905 ) to be reconstructed is a forward-predicted frame, a motion compensator ( 930 ) applies motion information ( 915 ) to a reference frame ( 925 ) to form a prediction ( 935 ) of the frame ( 905 ) being reconstructed. For example, the motion compensator ( 930 ) uses a macroblock motion vector to find a macroblock in the reference frame ( 925 ). A frame buffer ( 920 ) stores previous reconstructed frames for use as reference frames. The motion compensator ( 930 ) can compensate for motion at pixel, ½ pixel, ¼ pixel, or other increments, and can switch the precision of the motion compensation on a frame-by-frame basis or other basis. The precision of the motion compensation can be the same or different horizontally and vertically. Alternatively, a motion compensator applies another type of motion compensation. The prediction by the motion compensator is rarely perfect, so the decoder ( 900 ) also reconstructs prediction residuals.  
         [0076]     When the decoder needs a reconstructed frame for subsequent motion compensation, the frame store ( 920 ) buffers the reconstructed frame for use in predicting a next frame. In some embodiments, the encoder applies a deblocking filter to the reconstructed frame to adaptively smooth discontinuities between the blocks of the frame.  
         [0077]     An inverse quantizer ( 970 ) inverse quantizes entropy-decoded data. In general, the inverse quantizer applies uniform, scalar inverse quantization to the entropy-decoded data with a step-size that varies on a frame-by-frame basis or other basis. Alternatively, the inverse quantizer applies another type of inverse quantization to the data, for example, a non-uniform, vector, or non-adaptive inverse quantization, or directly inverse quantizes spatial domain data in a decoder system that does not use inverse frequency transformations. For inverse quantization with adaptive multiple quantization and/or half quantization step sizes, the decoder ( 900 ) operates, for example, as described below.  
         [0078]     An inverse frequency transformer ( 960 ) converts the quantized, frequency domain data into spatial domain video information. For block-based video frames, the inverse frequency transformer ( 960 ) applies an IDCT or variant of IDCT to blocks of the DCT coefficients, producing pixel data or prediction residual data for key frames or predicted frames, respectively. Alternatively, the frequency transformer ( 960 ) applies another conventional inverse frequency transform such as a Fourier transform or uses wavelet or subband synthesis. In embodiments in which the decoder uses spatial extrapolation (not shown in  FIG. 9 ) to decode blocks of key frames, the inverse frequency transformer ( 960 ) can apply a re-oriented inverse frequency transform such as a skewed IDCT to blocks of prediction residuals for the key frame. The inverse frequency transformer ( 960 ) applies an 8×8, 8×4, 4×8, or other size inverse frequency transforms (e.g., IDCT) to prediction residuals for predicted frames.  
         [0000]     III. Example Bitstream Syntax and Semantics  
         [0079]     An example bitstream includes information for a sequence of compressed progressive video frames or other pictures. The bitstream is organized into several hierarchical layers that are decoded by a decoder such as the decoder ( 900 ) of  FIG. 9 . The highest layer is the sequence layer, which has information for the overall sequence of frames. Additionally, each compressed video frame is made up of data that is structured into three hierarchical layers. From top to bottom the layers are: picture, macroblock, and block.  
         [0080]      FIG. 10A  is a syntax diagram for the sequence layer ( 1000 ), which includes a sequence header ( 1010 ) followed by data for the picture layer (see  FIG. 10B ). The sequence header ( 1010 ) includes several sequence-level elements that are processed by the decoder and used to decode the sequence, including a macroblock quantization (DQUANT) element ( 1011 ) and quantizer specifier (QUANTIZER) element ( 1012 ). DQUANT ( 1011 ) is a 2-bit field that indicates whether or not the quantization step size can vary within a frame. There are three possible values for DQUANT. If DQUANT=0, then the only one quantization step size (i.e. the frame quantization step size) can be used per frame. If DQUANT=1 or 2, then it is possible to quantize each of the macroblocks in the frame differently.  
         [0081]     The QUANTIZER ( 1012 ) is a 2-bit fixed length code [“FLC”] field that indicates the quantizer used for the sequence. The quantizer types are encoded according to the following Table 2.  
                         TABLE 2                           Quantizer Specification            FLC   Quantizer specification               00   Quantizer implicitly specified at frame level       01   Quantizer explicitly specified at frame level       10   5 QP deadzone quantizer used for all frames       11   3 QP deadzone quantizer used for all frames                  
 
         [0082]      FIG. 10B  is a syntax diagram for the picture layer ( 1020 ) for a progressive forward-predicted frame [“progressive P-frame”]. Syntax diagrams for other pictures, such as interlaced P-pictures and progressive B-frames have many similar syntax elements. The picture layer ( 1020 ) includes a picture header ( 1030 ) followed by data for the macroblock layer. The picture header ( 1030 ) includes several picture-level elements that are processed by the decoder and used to decode the corresponding frame. Some of those elements are only present if their presence is signaled or implied by a sequence-level element or a preceding picture-level element.  
         [0083]     For example, the picture header ( 1030 ) includes a picture quantizer index (PQINDEX) element ( 1031 ). PQINDEX ( 1031 ) is a 5-bit field that signals the quantizer scale index for the entire frame. It is present in all picture types. If the implicit quantizer is used (signaled by sequence field QUANTIZER=00, see Table 2 above) then PQINDEX specifies both the picture quantizer scale (PQUANT) and the quantizer (3QP or 5QP deadzone) used for the frame. Table 3 shows how PQINDEX is translated to PQUANT and the quantizer for implicit mode.  
                                           TABLE 3                           PQINDEX to PQUANT/Quantizer Deadzone Translation       (Implicit Quantizer)                    Quantizer       PQINDEX   PQUANT   Deadzone                    0   NA   NA       1   1   3 QP       2   2   3 QP       3   3   3 QP       4   4   3 QP       5   5   3 QP       6   6   3 QP       7   7   3 QP       8   8   3 QP       9   6   5 QP       10   7   5 QP       11   8   5 QP       12   9   5 QP       13   10   5 QP       14   11   5 QP       15   12   5 QP       16   13   5 QP       17   14   5 QP       18   15   5 QP       19   16   5 QP       20   17   5 QP       21   18   5 QP       22   19   5 QP       23   20   5 QP       24   21   5 QP       25   22   5 QP       26   23   5 QP       27   24   5 QP       28   25   5 QP       29   27   5 QP       30   29   5 QP       31   31   5 QP                  
 
         [0084]     If the quantizer is signaled explicitly at the sequence or frame level (signaled by sequence field QUANTIZER=01, 10 or 11, see Table 2 above) then PQINDEX is translated to the picture quantizer step size PQUANT as indicated by Table 4.  
                                           TABLE 4                           PQINDEX to PQUANT Translation (Explicit Quantizer)                PQUANT   PQUANT           3QP   5QP       PQINDEX   Deadzone   Deadzone                    0   NA   NA       1   1   1       2   2   1       3   3   1       4   4   2       5   5   3       6   6   4       7   7   5       8   8   6       9   9   7       10   10   8       11   11   9       12   12   10       13   13   11       14   14   12       15   15   13       16   16   14       17   17   15       18   18   16       19   19   17       20   20   18       21   21   19       22   22   20       23   23   21       24   24   22       25   25   23       26   26   24       27   27   25       28   28   26       29   29   27       30   30   29       31   31   31                  
 
         [0085]     Alternatively, instead of the translation shown in Table 4, PQUANT is equal to PQINDEX for all values of PQINDEX from 1 through 31 when the quantizer is signaled explicitly at the sequence or frame level.  
         [0086]     The picture header ( 1030 ) also includes a half QP step (HALFQP) element ( 1034 ) and picture quantizer type (PQUANTIZER) element ( 1035 ). HALFQP ( 1034 ) is a 1-bit field present if PQINDEX ( 1031 ) is less than or equal to 8. HALFQP ( 1034 ) allows the picture quantizer to be expressed in half step increments over the low PQUANT range. If HALFQP=1 then the picture quantizer step size is PQUANT+½. If HALFQP=0 then the picture quantizer step size is PQUANT. Therefore, if the 3QP deadzone quantizer is used then half step sizes are possible up to PQUANT=9 (i.e., PQUANT=1, 1.5, 2, 2.5 . . . 8.5, 9) and then only integer step sizes are allowable above PQUANT=9. For the 5QP deadzone quantizer, half step sizes are possible up to PQUANT=7 (i.e., 1, 1.5, 2, 2.5 . . . 6.5, 7).  
         [0087]     PQUANTIZER ( 1035 ) is a 1-bit field present in all frame types if the sequence level field QUANTIZER=01 (see Table 2 above). In this case, the quantizer used for the frame is specified by PQUANTIZER. If PQUANTIZER=0 then the 5QP deadzone quantizer is used for the frame. If PQUANTIZER=1 then the 3QP deadzone quantizer is used.  
         [0088]     The picture header ( 1030 ) further includes a macroblock quantization (VODPQUANT) field ( 1036 ). VODPQUANT ( 1036 ) may be used to adjust quantization step sizes for macroblocks (e.g., macroblocks at one or more edges of a frame, or on a per macroblock basis). For additional detail about VODPQUANT ( 1036 ), see U.S. patent application Ser. No. 10/623,195, filed Jul. 18, 2003.  
         [0089]      FIG. 10C  is a macroblock-layer ( 1050 ) bitstream syntax diagram for progressive P-frames. The bitstream syntax for the macroblock layer of I-pictures and B-pictures contain many elements in common. Data for a macroblock consists of a macroblock header that may be followed by block-layer data. More specifically,  FIG. 10C  illustrates two patterns of macroblock headers. The non-skipped 1 MV macroblock header ( 1051 ) is a header for a macroblock that is not skipped and has one motion vector for the macroblock. The non-skipped 4 MV macroblock header ( 1052 ) is a header for a macroblock that is not skipped and has up to four motion vectors, one for each of the four blocks of the macroblock. The headers for skipped 1 MV macroblocks and skipped 4 MV macroblocks are not shown.  
         [0090]     The macro-block layer headers ( 1051 ,  1052 ) include a macroblock quantizer differential (MQDIFF) element ( 1053 ) and an absolute macroblock quantizer scale (ABSMQ) element ( 1054 ), which may be used to determine a macroblock quantization step size MQUANT when per-macroblock quantization step sizes are signaled for a progressive P-frame or other picture. For example, MQDIFF ( 1053 ) may be used to select between two alternative quantization step sizes for the macroblock, signal a differential quantization step size for the macroblock, or (with ABSMQ ( 1054 )) signal an absolute quantization step size for the macroblock.  
         [0000]     IV. Decoding and Dequantization of Transform Coefficients  
         [0091]     For typical intra-coded blocks, a decoder such as the decoder ( 900 ) of  FIG. 9  decodes coefficients, performs inverse quantization, and performs an inverse transform. For typical inter-coded blocks, a decoder such as the decoder ( 900 ) of  FIG. 9  selects transform type(s), decodes subblock patterns, decodes coefficients, performs inverse quantization, and performs an inverse transform. The decoder obtains predicted blocks (or macroblocks) by motion compensation. To reconstruct the inter-coded blocks, the decoder combines the error and predicted blocks.  
         [0092]     A. Inverse-Quantization For Baseline I-Frame Pictures  
         [0093]     In each macroblock of a picture frame, the decoder decodes a DC coefficient and set of AC coefficients, which were each quantized at the encoder. These quantized transform coefficients are dequantized for a baseline I-Frame picture as described below.  
         [0094]     1. DC Inverse-Quantization  
         [0095]     The quantized DC coefficient (DCCoeffQ) is reconstructed by performing the following de-quantization operation: 
 
 DC Coefficient= DC Coeff Q*DC StepSize 
 
         [0096]     The value of DCStepSize is based on the value of PQUANT (obtained in the picture header and described in Tables 3 and 4 above) as follows:  
         [0097]     For PQUANT equal to 1 or 2: 
 
 DC StepSize=2 *P QUANT 
 
         [0098]     For PQUANT equal to 3 or 4: 
 
DCStepSize=8 
 
         [0099]     For PQUANT greater than or equal to 5: 
 
 DC StepSize= P QUANT/2+6 
 
         [0100]     The DC inverse-quantization for macroblocks other than baseline I frame picture is basically the same, with the exception that each macroblock might have a different quantization step size specified by MQUANT.  
         [0101]     2. Inverse AC Coefficient Quantization  
         [0102]     Depending on whether the 3-QP or 5-QP deadzone quantizer is used (see Table 3 above), the non-zero quantized AC coefficients reconstructed as described in the sections above are inverse quantized according to the following formula: 
 
dequant_coeff=quant_coeff*double_quant (if 3- QP  deadzone quantizer), or dequant_coeff=quant_coeff*double_quant+sign(quant_coeff)*quant_scale 
 
 (if 5-QP deadzone quantizer) 
        where:     quant_coeff is the quantized coefficient     dequant_coeff is the inverse quantized coefficient     double_quant=2*PQUANT+HalfStep     quant_scale=PQUANT        
 
         [0108]     PQUANT is encoded in the picture layer as described in Tables 3 and 4 above. HalfStep is encoded in the picture layer as via the HALFQP element as described above.  
         [0109]     B. Inverse-Quantization For Interlace I-Frame Pictures  
         [0110]     The inverse quantization procedure is the same as for baseline I frame pictures described above with the exception that each macroblock might have a different quantization step size specified by MQUANT.  
         [0111]     C. Inverse-Quantization For P Pictures  
         [0112]     The quantized transform coefficients of P pictures are dequantized as described below.  
         [0113]     1. Picture-Level Quantizer Scale  
         [0114]     In decoding the picture layer, the decoder ( 900 ) decodes a picture-level quantizer scale. The frame level quantizer scale PQUANT is decoded from the 5-bit picture layer field PQINDEX as shown in Table 3 or 4. PQUANT specifies the frame level quantizer scale (a value between 1 and 31) for the macroblocks in the current picture. When the sequence header DQUANT=0, then PQUANT is used as the quantization step size for every macroblock in the current picture. When DQUANT !=0, then PQUANT is used as signaled by VOPDQUANT syntax field. The PQINDEX field also specifies whether the 3-QP or 5-QP deadzone quantizer is used for all macroblocks in the frame when implicit quantizer signaling is used.  
         [0115]     2. Inverse Quantization  
         [0116]     In decoding the block layer, the non-zero quantized coefficients are inverse quantized in one of two ways depending on the value of PQUANT and the quantizer used.  
         [0117]     If the 3QP deadzone quantizer is used, the following formula describes the inverse quantization process: 
 
dequant_coeff=quant_coeff*(2*quant_scale+halfstep) 
 
         [0118]     If the 5QP deadzone quantizer is used, the following formula describes the inverse quantization process: 
 
dequant_coeff=quant_coeff*(2*quant_scale+halfstep)+sign(quant_coeff)*quant_scale 
        where:     quant_coeff is the quantized coefficient     dequant_coeff is the inverse quantized coefficient     quant_scale=The quantizer scale for the block (either PQUANT or MQUANT)     haltstep=The half step encoded in the picture layer as described above.     PQUANT is encoded in the picture layer as described above.     MQUANT is encoded in the macroblock layer as described above.        
 
         [0126]     Having described and illustrated the principles of our invention, it will be recognized that the various embodiments can be modified in arrangement and detail without departing from such principles. It should be understood that the programs, processes, or methods described herein are not related or limited to any particular type of computing environment, unless indicated otherwise. Various types of general purpose or specialized computing environments may be used with or perform operations in accordance with the teachings described herein. Elements of embodiments shown in software may be implemented in hardware and vice versa.  
         [0127]     In view of the many possible embodiments to which the principles of our invention may be applied, we claim as our invention all such embodiments as may come within the scope and spirit of the following claims and equivalents thereto.