US 7,343,291 B2Grant
Multi-pass variable bitrate media encoding
Issue Date:2008-03-11
•34 Claims
•12 Drawing Sheets
Abstract
An encoder uses multi-pass VBR control strategies to provide constant or relatively constant quality for VBR output while guaranteeing (within tolerance) either compressed file size or, equivalently, overall average bitrate. The control strategies include various techniques and tools, which can be used in combination or independently. For example, in a first pass, an audio encoder encodes a sequence of audio data partitioned into variable-size chunks. In a second pass, the encoder encodes the sequence according to control parameters to produce output of relatively constant quality. The encoder sets checkpoints in the second pass to adjust the control parameters and/or subsequent checkpoints. The encoder selectively considers a peak bitrate constraint to limit peak bitrate. The encoder stores auxiliary information from the first pass for use in the second pass, which increases the speed of the second pass. Finally, the encoder compares signatures for the input data to check consistency between passes.
Metadata
Assignee
- Microsoft Corporation
Inventors
- Naveen Thumpudi
- Wei-Ge Chen
Application Information
Application Number:US 10/623,338
Filing Date:2003-07-18
Priority Date:2003-07-18
Art Unit:2626
Classifications
IPC:
G10L19/00
Patent Drawings (12 sheets)
Description
Technical Field
[0001] The present invention relates to control strategies for media. For example, an audio encoder uses a two-pass variable bitrate control strategy when encoding audio data to produce variable bitrate output of uniform or relatively uniform quality.
Background
[0002] With the introduction of compact disks, digital wireless telephone networks, and audio delivery over the Internet, digital audio has become commonplace. Engineers use a variety of techniques to control the quality and bitrate of digital audio. To understand these techniques, it helps to understand how audio information is represented in a computer and how humans perceive audio.
I. Representation of Audio Information in a Computer
[0003] A computer processes audio information as a series of numbers representing the audio information. For example, a single number can represent an audio sample, which is an amplitude (i.e., loudness) at a particular time. Several factors affect the quality of the audio information, including sample depth, sampling rate, and channel mode.
[0004] Sample depth (or precision) indicates the range of numbers used to represent a sample. The more values possible for the sample, the higher the quality because the number can capture more subtle variations in amplitude. For example, an 8-bit sample has 256 possible values, while a 16-bit sample has 65,536 possible values.
[0005] The sampling rate (usually measured as the number of samples per second) also affects quality. The higher the sampling rate, the higher the quality because more frequencies of sound can be represented. Some common sampling rates are 8,000, 11,025, 22,050, 32,000, 44,100, 48,000, and 96,000 samples/second.
[0006] Mono and stereo are two common channel modes for audio. In mono mode, audio information is present in one channel. In stereo mode, audio information is present in two channels, usually labeled the left and right channels. Other modes with more channels, such as 5-channel surround sound, are also possible. Table 1 shows several formats of audio with different quality levels, along with corresponding raw bitrate costs.
[0007]
| TABLE 1 | ||||
|---|---|---|---|---|
| Bitrates for different quality audio information | ||||
| Sample Depth | Sampling Rate | Raw Bitrate | ||
| Quality | (bits/sample) | (samples/second) | Mode | (bits/second) |
| Internet | 8 | 8,000 | mono | 64,000 |
| telephony | ||||
| telephone | 8 | 11,025 | mono | 88,200 |
| CD audio | 16 | 44,100 | stereo | 1,411,200 |
| high quality | 16 | 48,000 | stereo | 1,536,000 |
| audio | ||||
[0008] As Table 1 shows, the cost of high quality audio information such as CD audio is high bitrate. High quality audio information consumes large amounts of computer storage and transmission capacity.
II. Processing Audio Information in a Computer
[0009] Many computers and computer networks lack the resources to process raw digital audio. Compression (also called encoding or coding) decreases the cost of storing and transmitting audio information by converting the information into a lower bitrate form. Compression can be lossless (in which quality does not suffer) or lossy (in which quality suffers but bitrate reduction from subsequent lossless compression is more dramatic). Decompression (also called decoding) extracts a reconstructed version of the original information from the compressed form.
[0010] A. Standard Perceptual Audio Encoders and Decoders
[0011] Generally, the goal of audio compression is to digitally represent audio signals to provide maximum signal quality with the least possible amount of bits. A conventional audio coder/decoder [“codec”] system uses subband/transform coding, quantization, rate control, and variable length coding to achieve its compression. The quantization and other lossy compression techniques introduce potentially audible noise into an audio signal. The audibility of the noise depends on how much noise there is and how much of the noise the listener perceives. The first factor relates mainly to objective quality, while the second factor depends on human perception of sound.
[0012] An audio encoder can use various techniques to provide the best possible quality for a given bitrate, including transform coding, modeling human perception of audio, and rate control. As a result of these techniques, an audio signal can be more heavily quantized at selected frequencies or times to decrease bitrate, yet the increased quantization will not significantly degrade perceived quality for a listener.
[0013] FIG. 1 shows a generalized diagram of a transform-based, perceptual audio encoder (100) according to the prior art. FIG. 2 shows a generalized diagram of a corresponding audio decoder (200) according to the prior art. Though the codec system shown in FIGS. 1 and 2 is generalized, it has characteristics found in several real world codec systems, including versions of Microsoft Corporation's Windows Media Audio [“WMA”] encoder and decoder, in particular WMA version 8 [“WMA8”]. Other codec systems are provided or specified by the Motion Picture Experts Group, Audio Layer 3 [“MP3”] standard, the Motion Picture Experts Group 2, Advanced Audio Coding [“AAC”] standard, and Dolby AC3. For additional information about these other codec systems, see the respective standards or technical publications.
[0014] 1. Perceptual Audio Encoder
[0015] Overall, the encoder (100) receives a time series of input audio samples (105), compresses the audio samples (105) in one pass, and multiplexes information produced by the various modules of the encoder (100) to output a bitstream (195) at a constant or relatively constant bitrate. The encoder (100) includes a frequency transformer (110), a multi-channel transformer (120), a perception modeler (130), a weighter (140), a quantizer (150), an entropy encoder (160), a controller (170), and a bitstream multiplexer [“MUX”] (180).
[0016] The frequency transformer (110) receives the audio samples (105) and converts them into data in the frequency domain. For example, the frequency transformer (110) splits the audio samples (105) into blocks, which can have variable size to allow variable temporal resolution. Small blocks allow for greater preservation of time detail at short but active transition segments in the input audio samples (105), but sacrifice some frequency resolution. In contrast, large blocks have better frequency resolution and worse time resolution, and usually allow for greater compression efficiency at longer and less active segments. Blocks can overlap to reduce perceptible discontinuities between blocks that could otherwise be introduced by later quantization. For multi-channel audio, the frequency transformer (110) uses the same pattern of windows for each channel in a particular frame. The frequency transformer (110) outputs blocks of frequency coefficient data to the multi-channel transformer (120) and outputs side information such as block sizes to the MUX (180).
[0017] Transform coding techniques convert information into a form that makes it easier to separate perceptually important information from perceptually unimportant information. The less important information can then be quantized heavily, while the more important information is preserved, so as to provide the best perceived quality for a given bitrate.
[0018] For multi-channel audio data, the multiple channels of frequency coefficient data produced by the frequency transformer (110) often correlate. To exploit this correlation, the multi-channel transformer (120) can convert the multiple original, independently coded channels into jointly coded channels. For example, if the input is stereo mode, the multi-channel transformer (120) can convert the left and right channels into sum and difference channels:
[0019]
Or, the multi-channel transformer (120) can pass the left and right channels through as independently coded channels. The decision to use independently or jointly coded channels is predetermined or made adaptively during encoding. For example, the encoder (100) determines whether to code stereo channels jointly or independently with an open loop selection decision that considers the (a) energy separation between coding channels with and without the multi-channel transform and (b) the disparity in excitation patterns between the left and right input channels. Such a decision can be made on a window-by-window basis or only once per frame to simplify the decision. The multi-channel transformer (120) produces side information to the MUX (180) indicating the channel mode used.
Or, the multi-channel transformer (120) can pass the left and right channels through as independently coded channels. The decision to use independently or jointly coded channels is predetermined or made adaptively during encoding. For example, the encoder (100) determines whether to code stereo channels jointly or independently with an open loop selection decision that considers the (a) energy separation between coding channels with and without the multi-channel transform and (b) the disparity in excitation patterns between the left and right input channels. Such a decision can be made on a window-by-window basis or only once per frame to simplify the decision. The multi-channel transformer (120) produces side information to the MUX (180) indicating the channel mode used.
[0020] The encoder (100) can apply multi-channel rematrixing to a block of audio data after a multi-channel transform. For low bitrate, multi-channel audio data in jointly coded channels, the encoder (100) selectively suppresses information in certain channels (e.g., the difference channel) to improve the quality of the remaining channel(s) (e.g., the sum channel). For example, the encoder (100) scales the difference channel by a scaling factor ρ:
{tilde over (X)}Diff[k]=ρ·XDiff[k], (3)
where the value of ρ is based on: (a) current average levels of a perceptual audio quality measure such as Noise to Excitation Ratio [“NER”], (b) current fullness of a virtual buffer, (c) bitrate and sampling rate settings of the encoder (100), and (d) the channel separation in the left and right input channels.
{tilde over (X)}Diff[k]=ρ·XDiff[k], (3)
where the value of ρ is based on: (a) current average levels of a perceptual audio quality measure such as Noise to Excitation Ratio [“NER”], (b) current fullness of a virtual buffer, (c) bitrate and sampling rate settings of the encoder (100), and (d) the channel separation in the left and right input channels.
[0021] The perception modeler (130) processes audio data according to a model of the human auditory system to improve the perceived quality of the reconstructed audio signal for a given bitrate. For example, an auditory model typically considers the range of human hearing and critical bands. The human nervous system integrates sub-ranges of frequencies. For this reason, an auditory model may organize and process audio information by critical bands. Different auditory models use a different number of critical bands (e.g., 25, 32, 55, or 109) and/or different cut-off frequencies for the critical bands. Bark bands are a well-known example of critical bands. Aside from range and critical bands, interactions between audio signals can dramatically affect perception. An audio signal that is clearly audible if presented alone can be completely inaudible in the presence of another audio signal, called the masker or the masking signal. The human ear is relatively insensitive to distortion or other loss in fidelity (i.e., noise) in the masked signal, so the masked signal can include more distortion without degrading perceived audio quality. In addition, an auditory model can consider a variety of other factors relating to physical or neural aspects of human perception of sound.
[0022] Using an auditory model, an audio encoder can determine which parts of an audio signal can be heavily quantized without introducing audible distortion, and which parts should be quantized lightly or not at all. Thus, the encoder can spread distortion across the signal so as to decrease the audibility of the distortion. The perception modeler (130) outputs information that the weighter (140) uses to shape noise in the audio data to reduce the audibility of the noise. For example, using any of various techniques, the weighter (140) generates weighting factors (sometimes called scaling factors) for quantization matrices (sometimes called masks) based upon the received information. The weighting factors in a quantization matrix include a weight for each of multiple quantization bands in the audio data, where the quantization bands are frequency ranges of frequency coefficients. The number of quantization bands can be the same as or less than the number of critical bands. Thus, the weighting factors indicate proportions at which noise is spread across the quantization bands, with the goal of minimizing the audibility of the noise by putting more noise in bands where it is less audible, and vice versa. The weighting factors can vary in amplitudes and number of quantization bands from block to block. The weighter (140) then applies the weighting factors to the data received from the multi-channel transformer (120).
[0023] In one implementation, the weighter (140) generates a set of weighting factors for each window of each channel of multi-channel audio, or shares a single set of weighting factors for parallel windows of jointly coded channels. The weighter (140) outputs weighted blocks of coefficient data to the quantizer (150) and outputs side information such as the sets of weighting factors to the MUX (180).
[0024] A set of weighting factors can be compressed for more efficient representation using direct compression. In the direct compression technique, the encoder (100) uniformly quantizes each element of a quantization matrix. The encoder then differentially codes the quantized elements, and Huffman codes the differentially coded elements. In some cases (e.g., when all of the coefficients of particular quantization bands have been quantized or truncated to a value of 0), the decoder (200) does not require weighting factors for all quantization bands. In such cases, the encoder (100) gives values to one or more unneeded weighting factors that are identical to the value of the next needed weighting factor in a series, which makes differential coding of elements of the quantization matrix more efficient.
[0025] Or, for low bitrate applications, the encoder (100) can parametrically compress a quantization matrix to represent the quantization matrix as a set of parameters, for example, using Linear Predictive Coding [“LPC”] of pseudo-autocorrelation parameters computed from the quantization matrix.
[0026] The quantizer (150) quantizes the output of the weighter (140), producing quantized coefficient data to the entropy encoder (160) and side information including quantization step size to the MUX (180). Quantization maps ranges of input values to single values. In a generalized example, with uniform, scalar quantization by a factor of 3.0, a sample with a value anywhere between −1.5 and 1.499 is mapped to 0, a sample with a value anywhere between 1.5 and 4.499 is mapped to 1, etc. To reconstruct the sample, the quantized value is multiplied by the quantization factor, but the reconstruction is imprecise. Continuing the example started above, the quantized value 1 reconstructs to 1×3=3; it is impossible to determine where the original sample value was in the range 1.5 to 4.499. Quantization causes a loss in fidelity of the reconstructed value compared to the original value, but can dramatically improve the effectiveness of subsequent lossless compression, thereby reducing bitrate. Adjusting quantization allows the encoder (100) to regulate the quality and bitrate of the output bitstream (195) in conjunction with the controller (170). In FIG. 1 , the quantizer (150) is an adaptive, uniform, scalar quantizer. The quantizer (150) applies the same quantization step size to each frequency coefficient, but the quantization step size itself can change from one iteration of a quantization loop to the next to affect quality and the bitrate of the entropy encoder (160) output. Other kinds of quantization are non-uniform quantization, vector quantization, and/or non-adaptive quantization.
[0027] The entropy encoder (160) losslessly compresses quantized coefficient data received from the quantizer (150). The entropy encoder (160) can compute the number of bits spent encoding audio information and pass this information to the rate/quality controller (170).
[0028] The controller (170) works with the quantizer (150) to regulate the bitrate and/or quality of the output of the encoder (100). The controller (170) receives information from other modules of the encoder (100) and processes the received information to determine a desired quantization step size given current conditions. The controller (170) outputs the quantization step size to the quantizer (150) with the goal of satisfying bitrate and quality constraints. U.S. patent application Ser. No. 10/017,694, filed Dec. 14, 2001, entitled “Quality and Rate Control Strategy for Digital Audio,” published on Jun. 19, 2003, as Publication No. US-2003-0115050-A1, includes description of quality and rate control as implemented in an audio encoder of WMA8, as well as additional description of other quality and rate control techniques.
[0029] The encoder (100) can apply noise substitution and/or band truncation to a block of audio data. At low and mid-bitrates, the audio encoder (100) can use noise substitution to convey information in certain bands. In band truncation, if the measured quality for a block indicates poor quality, the encoder (100) can completely eliminate the coefficients in certain (usually higher frequency) bands to improve the overall quality in the remaining bands.
[0030] The MUX (180) multiplexes the side information received from the other modules of the audio encoder (100) along with the entropy encoded data received from the entropy encoder (160). The MUX (180) outputs the information in a format that an audio decoder recognizes. The MUX (180) includes a virtual buffer that stores the bitstream (195) to be output by the encoder (100).
[0031] 2. Perceptual Audio Decoder
[0032] Overall, the decoder (200) receives a bitstream (205) of compressed audio information including entropy encoded data as well as side information, from which the decoder (200) reconstructs audio samples (295). The audio decoder (200) includes a bitstream demultiplexer [“DEMUX”] (210), an entropy decoder (220), an inverse quantizer (230), a noise generator (240), an inverse weighter (250), an inverse multi-channel transformer (260), and an inverse frequency transformer (270).
[0033] The DEMUX (210) parses information in the bitstream (205) and sends information to the modules of the decoder (200). The DEMUX (210) includes one or more buffers to compensate for variations in bitrate due to fluctuations in complexity of the audio, network jitter, and/or other factors.
[0034] The entropy decoder (220) losslessly decompresses entropy codes received from the DEMUX (210), producing quantized frequency coefficient data. The entropy decoder (220) typically applies the inverse of the entropy encoding technique used in the encoder.
[0035] The inverse quantizer (230) receives a quantization step size from the DEMUX (210) and receives quantized frequency coefficient data from the entropy decoder (220). The inverse quantizer (230) applies the quantization step size to the quantized frequency coefficient data to partially reconstruct the frequency coefficient data.
[0036] From the DEMUX (210), the noise generator (240) receives information indicating which bands in a block of data are noise substituted as well as any parameters for the form of the noise. The noise generator (240) generates the patterns for the indicated bands, and passes the information to the inverse weighter (250).
[0037] The inverse weighter (250) receives the weighting factors from the DEMUX (210), patterns for any noise-substituted bands from the noise generator (240), and the partially reconstructed frequency coefficient data from the inverse quantizer (230). As necessary, the inverse weighter (250) decompresses the weighting factors, for example, entropy decoding, inverse differentially coding, and inverse quantizing the elements of the quantization matrix. The inverse weighter (250) applies the weighting factors to the partially reconstructed frequency coefficient data for bands that have not been noise substituted. The inverse weighter (250) then adds in the noise patterns received from the noise generator (240) for the noise-substituted bands.
[0038] The inverse multi-channel transformer (260) receives the reconstructed frequency coefficient data from the inverse weighter (250) and channel mode information from the DEMUX (210). If multi-channel audio is in independently coded channels, the inverse multi-channel transformer (260) passes the channels through. If multi-channel data is in jointly coded channels, the inverse multi-channel transformer (260) converts the data into independently coded channels.
[0039] The inverse frequency transformer (270) receives the frequency coefficient data output by the multi-channel transformer (260) as well as side information such as block sizes from the DEMUX (210). The inverse frequency transformer (270) applies the inverse of the frequency transform used in the encoder and outputs blocks of reconstructed audio samples (295).
III. Controlling Rate and Quality of Audio Information
[0040] Different audio applications have different quality and bitrate requirements. Certain applications require constant or relatively constant bitrate [“CBR”]. One such CBR application is encoding audio for streaming over the Internet. Other applications require constant or relatively constant quality over time for compressed audio information, resulting in variable bitrate [“VBR”] output.
[0041] The goal of a CBR encoder is to output compressed audio information at a constant bitrate despite changes in the complexity of the audio information. Complex audio information is typically less compressible than simple audio information. To meet bitrate requirements, the CBR encoder can adjust how the audio information is quantized. The quality of the compressed audio information then varies, with lower quality for periods of complex audio information due to increased quantization and higher quality for periods of simple audio information due to decreased quantization.
[0042] While adjustment of quantization and audio quality is necessary at times to satisfy CBR requirements, some CBR encoders can cause unnecessary changes in quality, which can result in thrashing between high quality and low quality around the appropriate, middle quality. Moreover, when changes in audio quality are necessary, some CBR encoders often cause abrupt changes, which are more noticeable and objectionable than smooth changes.
[0043] WMA version 7.0 [“WMA7”] includes an audio encoder that can be used for CBR encoding of audio information for streaming. The WMA7 encoder uses a virtual buffer and rate control to handle variations in bitrate due to changes in the complexity of audio information. In general, the WMA7 encoder uses one-pass CBR rate control. In a one-pass encoding scheme, an encoder analyzes the input signal and generates a compressed bit stream in the same pass through the input signal.
[0044] To handle short-term fluctuations around the constant bitrate (such as those due to brief variations in complexity), the WMA7 encoder uses a virtual buffer that stores some duration of compressed audio information. For example, the virtual buffer stores compressed audio information for 5 seconds of audio playback. The virtual buffer outputs the compressed audio information at the constant bitrate, so long as the virtual buffer does not underflow or overflow. Using the virtual buffer, the encoder can compress audio information at relatively constant quality despite variations in complexity, so long as the virtual buffer is long enough to smooth out the variations. In practice, virtual buffers must be limited in duration in order to limit system delay, however, and buffer underflow or overflow can occur unless the encoder intervenes.
[0045] To handle longer-term deviations from the constant bitrate (such as those due to extended periods of complexity or silence), the WMA7 encoder adjusts the quantization step size of a uniform, scalar quantizer in a rate control loop. The relation between quantization step size and bitrate is complex and hard to predict in advance, so the encoder tries one or more different quantization step sizes until the encoder finds one that results in compressed audio information with a bitrate sufficiently close to a target bitrate. The encoder sets the target bitrate to reach a desired buffer fullness, preventing buffer underflow and overflow. Based upon the complexity of the audio information, the encoder can also allocate additional bits for a block or deallocate bits when setting the target bitrate for the rate control loop.
[0046] The WMA7 encoder measures the quality of the reconstructed audio information for certain operations (e.g., deciding which bands to truncate). The WMA7 encoder does not use the quality measurement in conjunction with adjustment of the quantization step size in a quantization loop, however.
[0047] The WMA7 encoder controls bitrate and provides good quality for a given bitrate, but can cause unnecessary quality changes. Moreover, with the WMA7 encoder, necessary changes in audio quality are not as smooth as they could be in transitions from one level of quality to another.
[0048] U.S. patent application Ser. No. 10/017,694 includes description of quality and rate control as implemented in the WMA8 encoder, as well as additional description of other quality and rate control techniques. In general, the WMA8 encoder uses one-pass CBR quality and rate control, with complexity estimation of future frames. For additional detail, see U.S. patent application Ser. No. 10/017,694.
[0049] The WMA8 encoder smoothly controls rate and quality, and provides good quality for a given bitrate. As a one-pass encoder, however, the WMA8 encoder relies on partial and incomplete information about future frames in an audio sequence.
[0050] Numerous other audio encoders use rate control strategies. For example, see U.S. Pat. No. 5,845,243 to Smart et al. Such rate control strategies potentially consider information other than or in addition to current buffer fullness, for example, the complexity of the audio information.
[0051] Several international standards describe audio encoders that incorporate distortion and rate control. The MP3 and AAC standards each describe techniques for controlling distortion and bitrate of compressed audio information.
[0052] In MP3, the encoder uses nested quantization loops to control distortion and bitrate for a block of audio information called a granule. Within an outer quantization loop for controlling distortion, the MP3 encoder calls an inner quantization loop for controlling bitrate.
[0053] In the outer quantization loop, the MP3 encoder compares distortions for scale factor bands to allowed distortion thresholds for the scale factor bands. A scale factor band is a range of frequency coefficients for which the encoder calculates a weight called a scale factor. Each scale factor starts with a minimum weight for a scale factor band. After an iteration of the inner quantization loop, the encoder amplifies the scale factors until the distortion in each scale factor band is less than the allowed distortion threshold for that scale factor band, with the encoder calling the inner quantization loop for each set of scale factors. In special cases, the encoder exits the outer quantization loop even if distortion exceeds the allowed distortion threshold for a scale factor band (e.g., if all scale factors have been amplified or if a scale factor has reached a maximum amplification).
[0054] In the inner quantization loop, the MP3 encoder finds a satisfactory quantization step size for a given set of scale factors. The encoder starts with a quantization step size expected to yield more than the number of available bits for the granule. The encoder then gradually increases the quantization step size until it finds one that yields fewer than the number of available bits.
[0055] The MP3 encoder calculates the number of available bits for the granule based upon the average number of bits per granule, the number of bits in a bit reservoir, and an estimate of complexity of the granule called perceptual entropy. The bit reservoir counts unused bits from previous granules. If a granule uses less than the number of available bits, the MP3 encoder adds the unused bits to the bit reservoir. When the bit reservoir gets too full, the MP3 encoder preemptively allocates more bits to granules or adds padding bits to the compressed audio information. The MP3 encoder uses a psychoacoustic model to calculate the perceptual entropy of the granule based upon the energy, distortion thresholds, and widths for frequency ranges called threshold calculation partitions. Based upon the perceptual entropy, the encoder can allocate more than the average number of bits to a granule.
[0056] For additional information about MP3 and AAC, see the MP3 standard (“ISO/IEC 11172-3, Information Technology—Coding of Moving Pictures and Associated Audio for Digital Storage Media at Up to About 1.5 Mbit/s—Part 3: Audio”) and the AAC standard.
[0057] Other audio encoders use a combination of filtering and zero tree coding to jointly control quality and bitrate, in which an audio encoder decomposes an audio signal into bands at different frequencies and temporal resolutions. The encoder formats band information such that information for less perceptually important bands can be incrementally removed from a bitstream, if necessary, while preserving the most information possible for a given bitrate. For more information about zero tree coding, see Srinivasan et al., “High-Quality Audio Compression Using an Adaptive Wavelet Packet Decomposition and Psychoacoustic Modeling,” IEEE Transactions on Signal Processing, Vol. 46, No. 4, pp. (April 1998).
[0058] Outside of the field of audio encoding, various joint quality and bitrate control strategies for video encoding have been published. For example, see U.S. Pat. No. 5,686,964 to Naveen et al.; U.S. Pat. No. 5,995,151 to Naveen et al.; Caetano et al., “Rate Control Strategy for Embedded Wavelet Video Coders,” IEEE Electronics Letters, pp 1815-17 (Oct. 14, 1999); Ribas-Corbera et al., “Rate Control in DCT Video Coding for Low-Delay Communications,” IEEE Trans Circuits and Systems for Video Tech., Vol. 9, No 1, (February 1999); and Westerink et al., “Two-pass MPEG-2 Variable Bit Rate Encoding,” IBM Journal of Res. Dev., Vol. 43, No. 4 (July 1999).
[0059] The Westerink article describes a two-pass VBR control strategy for video compression. As such, the control strategy described therein cannot be simply applied to other types of media such as audio. For one thing, the video input in the Westerink article is partitioned at regular times into uniformly sized video frames. The Westerink article does not describe how to perform two-pass VBR control for media with variable-size encoding units. Also, for video coding, there are reasonable models relating quantization step size to quality and step size to bits, as used in the Westerink article. These models cannot be simply applied to audio data in many cases, however, due to the erratic step-rate-distortion performance of audio data.
[0060] As one might expect given the importance of quality and rate control to encoder performance, the fields of quality and rate control are well developed. Whatever the advantages of previous quality and rate control strategies, however, they do not offer the performance advantages of the present invention.
Summary
[0061] The present invention relates to strategies for controlling the quality and bitrate of media such as audio data. For example, with a multi-pass VBR control strategy, an audio encoder provides constant or relatively constant quality for VBR output. This improves the overall listening experience and makes computer systems a more compelling platform for creating, distributing, and playing back high quality stereo and multi-channel audio. The multi-pass VBR control strategies described herein include various techniques and tools, which can be used in combination or independently.
[0062] According to a first aspect of the control strategies described herein, in a first pass, an audio encoder encodes a sequence of audio data. In a second pass, the encoder encodes the sequence in view of a target quality level to produce VBR output. The target quality level is based at least in part upon statistics gathered from the encoding in the first pass. In this way, the produces output of uniform or relatively uniform quality.
[0063] According to a second aspect of the control strategies described herein, an encoder uses a multi-pass VBR control strategy to encode media data partitioned into variable-size chunks for encoding. In a second pass, the encoder encodes the media data according to one or more control parameters determined by processing the results of encoding in a first pass. By working with variable-size chunks, the encoder can apply its multi-pass VBR control strategy to media such as audio.
[0064] According to a third aspect of the control strategies described herein, an encoder sets checkpoints for second pass encoding in a multi-pass control strategy. For example, the encoder sets checkpoints at regularly spaced points (10%, 20%, etc.) of a number of bits allocated to a sequence of audio data. At a checkpoint in the second pass, the encoder checks results of the encoding as of the checkpoint. The encoder may then adjust a target quality level and/or adjust subsequent checkpoints based upon the results, which improves the uniformity of quality in the output.
[0065] According to a fourth aspect of the control strategies described herein, an audio encoder considers a peak bitrate constraint in multi-pass encoding. The peak bitrate constraint allows the encoder to limit the peak bitrate so that particular devices are able to handle the output. An encoder may selectively apply the peak bitrate constraint when encoding some sequences, but not other sequences.
[0066] According to a fifth aspect of the control strategies described herein, an encoder stores auxiliary information from encoding media data in a first pass. In a second pass, the encoder encodes the media data using the stored auxiliary information. This increases the speed of the encoding in the second pass.
[0067] According to a sixth aspect of the control strategies described herein, an encoder computes a signature for media data in a first pass. In a second pass, the encoder compares a signature for the media data in the second pass to the signature from the first pass, and continues encoding in the second pass if the signatures match. Otherwise, the encoder takes another action such as stopping the encoding. Thus, the encoder verifies consistency of the media data between the first and second passes.
[0068] Additional features and advantages of the invention will be made apparent from the following detailed description of embodiments that proceeds with reference to the accompanying drawings.
Brief Description of the Drawings
[0069] FIG. 1 is a block diagram of an audio encoder for one-pass encoding according to the prior art.
[0070] FIG. 2 is a block diagram of an audio decoder according to the prior art.
[0071] FIG. 3 is a block diagram of a suitable computing environment.
[0072] FIG. 4 is a block diagram of generalized audio encoder for one-pass encoding.
[0073] FIG. 5 is a block diagram of a particular audio encoder for one-pass encoding.
[0074] FIG. 6 is a block diagram of a corresponding audio decoder.
[0075] FIG. 7 is a graph of quality over time according to a VBR control strategy.
[0076] FIG. 8 is a graph of bits produced over time according to a VBR control strategy.
[0077] FIG. 9 is a flowchart of a two-pass VBR control strategy.
[0078] FIG. 10 is a flowchart showing a technique for gathering statistics for an audio sequence with variable-size chunks in a first pass.
[0079] FIG. 11 is a chart showing a model of a hypothetical decoder buffer for checking a peak bitrate constraint.
[0080] FIG. 12 is a chart showing checkpoints along a sequence of audio data.
[0081] FIGS. 13 and 14 are flowcharts showing techniques for computing a target quality for a segment of a sequence of audio data.
[0082] FIG. 15 is a chart showing checkpoints equally spaced by bits produced.
[0083] FIG. 16 is a flowchart showing a technique for checking the consistency of the input between the first and second passes.
Detailed Description
[0084] An audio encoder uses a multi-pass VBR control strategy in encoding audio information. The audio encoder adjusts quantization of the audio information to satisfy constant or relatively constant quality requirements, while also satisfying a constraint on the overall size of the compressed audio data.
[0085] The audio encoder uses several techniques in the multi-pass VBR control strategy. While the techniques are typically described herein as part of a single, integrated system, the techniques can be applied separately in quality and/or rate control, potentially in combination with other rate control strategies.
[0086] The described embodiments focus on a control strategy with two passes. The techniques and tools of the present invention may also be applied in a control strategy with more passes. In a few cases, the techniques and tools may be applied in a control strategy with a single pass.
[0087] In alternative embodiments, another type of audio processing tool implements one or more of the techniques to control the quality and/or bitrate of audio information. Moreover, although described embodiments focus on audio applications, in alternative embodiments, a video encoder, other media encoder, or other tool applies one or more of the techniques to control the quality and/or bitrate in a multi-pass control strategy.
I. Computing Environment
[0088] FIG. 3 illustrates a generalized example of a suitable computing environment (300) in which described embodiments may be implemented. The computing environment (300) is not intended to suggest any limitation as to scope of use or functionality of the invention, as the present invention may be implemented in diverse general-purpose or special-purpose computing environments.
[0089] With reference to FIG. 3 , the computing environment (300) includes at least one processing unit (310) and memory (320). In FIG. 3 , this most basic configuration (330) is included within a dashed line. The processing unit (310) 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 (320) 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 (320) stores software (380) implementing an audio encoder with a two-pass VBR control strategy.
[0090] A computing environment may have additional features. For example, the computing environment (300) includes storage (340), one or more input devices (350), one or more output devices (360), and one or more communication connections (370). An interconnection mechanism (not shown) such as a bus, controller, or network interconnects the components of the computing environment (300). Typically, operating system software (not shown) provides an operating environment for other software executing in the computing environment (300), and coordinates activities of the components of the computing environment (300).
[0091] The storage (340) may be removable or non-removable, and includes magnetic disks, magnetic tapes or cassettes, CD-ROMs, CD-RWs, DVDs, or any other medium which can be used to store information and which can be accessed within the computing environment (300). The storage (340) stores instructions for the software (380) implementing the audio encoder with a two-pass VBR control strategy.
[0092] The input device(s) (350) 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 (300). For audio, the input device(s) (350) may be a sound card or similar device that accepts audio input in analog or digital form, or a CD-ROM or CD-RW that provides audio samples to the computing environment. The output device(s) (360) may be a display, printer, speaker, CD-writer, or another device that provides output from the computing environment (300).
[0093] The communication connection(s) (370) enable communication over a communication medium to another computing entity. The communication medium conveys information such as computer-executable instructions, compressed audio or video information, 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.
[0094] The invention 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 (300), computer-readable media include memory (320), storage (340), communication media, and combinations of any of the above.
[0095] The invention 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.
[0096] For the sake of presentation, the detailed description uses terms like “determine,” “generate,” “adjust,” and “apply” to describe computer operations in a computing environment. These terms are high-level abstractions for operations performed by a computer, and should not be confused with acts performed by a human being. The actual computer operations corresponding to these terms vary depending on implementation.
II. Exemplary Audio Encoders and Decoders
[0097] FIG. 4 shows a generalized audio encoder for one-pass encoding, in conjunction with which a two-pass VBR control strategy may be implemented. FIG. 5 shows a particular audio encoder for one-pass encoding, in conjunction with which the two-pass VBR control strategy may be implemented. FIG. 6 shows a corresponding audio decoder.
[0098] The relationships shown between modules within the encoders and decoder indicate the main flow of information in the encoders and decoder; other relationships are not shown for the sake of simplicity. Depending on implementation and the type of compression desired, modules of the encoders or decoder can be added, omitted, split into multiple modules, combined with other modules, and/or replaced with like modules. In alternative embodiments, an encoder with different modules and/or other configurations of modules controls quality and bitrate of compressed audio information.
[0099] A. Generalized Encoder
[0100] FIG. 4 is an abstraction of the encoder of FIG. 5 and encoders with other architectures and/or components. The generalized encoder (400) includes a transformer (410), a quality reducer (430), a lossless coder (450), and a controller (470).
[0101] The transformer (410) receives input data (405) and performs one or more transforms on the input data (405). The transforms may include prediction, time slicing, channel transforms, frequency transforms, or time-frequency tile generating subband transforms, linear or non-linear transforms, or any combination thereof.
[0102] The quality reducer (430) works in the transformed domain and reduces quality (i.e., introduces distortion) so as to reduce the output bitrate. By reducing quality carefully, the quality reducer (430) can lessen the perceptibility of the introduced distortion. A quantizer (scalar, vector, or other) is an example of a quality reducer (430). In many predictive coding schemes, the quality reducer (430) provides feedback to the transformer (410).
[0103] The lossless coder (450) is typically an entropy encoder that takes quantized indices as inputs and entropy codes the data for the final output bitstream.
[0104] The controller (470) determines the data transform to perform, output quality, and/or the entropy coding to perform, so as to meet constraints on the bitstream. The constraints may be on quality of the output, the bitrate of the output, latency in the system, overall file size, peak bitrate, and/or other criteria.
[0105] When used in conjunction with the control strategies described herein, the encoder (400) may take the form of a traditional, transform-based audio encoder such as the one shown in FIG. 1 , an audio encoder having the architecture shown in FIG. 5 , or another encoder.
[0106] B. Detailed Audio Encoder
[0107] With reference to FIG. 5 , the audio encoder (500) includes a selector (508), a multi-channel pre-processor (510), a partitioner/tile configurer (520), a frequency transformer (530), a perception modeler (540), a weighter (542), a multi-channel transformer (550), a quantizer (560), an entropy encoder (570), a controller (580), a mixed/pure lossless coder (572) and associated entropy encoder (574), and a bitstream multiplexer [“MUX”] (590).
[0108] The encoder (500) receives a time series of input audio samples (505) at some sampling depth and rate in pulse code modulated [“PCM”] format. The input audio samples (505) are for multi-channel audio (e.g., stereo, surround) or for mono audio. The encoder (500) compresses the audio samples (505) and multiplexes information produced by the various modules of the encoder (500) to output a bitstream (595) in a format such as a WMA format or Advanced Streaming Format [“ASF”]. Alternatively, the encoder (500) works with other input and/or output formats.
[0109] The selector (508) selects between multiple encoding modes for the audio samples (505). In FIG. 5 , the selector (508) switches between a mixed/pure lossless coding mode and a lossy coding mode. The lossless coding mode includes the mixed/pure lossless coder (572) and is typically used for high quality (and high bitrate) compression. The lossy coding mode includes components such as the weighter (542) and quantizer (560) and is typically used for adjustable quality (and controlled bitrate) compression. The selection decision at the selector (508) depends upon user input or other criteria. In certain circumstances (e.g., when lossy compression fails to deliver adequate quality or overproduces bits), the encoder (500) may switch from lossy coding over to mixed/pure lossless coding for a frame or set of frames.
[0110] For lossy coding of multi-channel audio data, the multi-channel pre-processor (510) optionally re-matrixes the time-domain audio samples (505). In some embodiments, the multi-channel pre-processor (510) selectively re-matrixes the audio samples (505) to drop one or more coded channels or increase inter-channel correlation in the encoder (500), yet allow reconstruction (in some form) in the decoder (600). This gives the encoder additional control over quality at the channel level. The multi-channel pre-processor (510) may send side information such as instructions for multi-channel post-processing to the MUX (590). Alternatively, the encoder (500) performs another form of multi-channel pre-processing.
[0111] The partitioner/tile configurer (520) partitions a frame of audio input samples (505) into sub-frame blocks (i.e., windows) with time-varying size and window shaping functions. The sizes and windows for the sub-frame blocks depend upon detection of transient signals in the frame, coding mode, as well as other factors.
[0112] If the encoder (500) switches from lossy coding to mixed/pure lossless coding, sub-frame blocks need not overlap or have a windowing function in theory (i.e., non-overlapping, rectangular-window blocks), but transitions between lossy coded frames and other frames may require special treatment. The partitioner/tile configurer (520) outputs blocks of partitioned data to the mixed/pure lossless coder (572) and outputs side information such as block sizes to the MUX (590).
[0113] When the encoder (500) uses lossy coding, variable-size windows allow variable temporal resolution. Small blocks allow for greater preservation of time detail at short but active transition segments. Large blocks have better frequency resolution and worse time resolution, and usually allow for greater compression efficiency at longer and less active segments, in part because frame header and side information is proportionally less than in small blocks, and in part because it allows for better redundancy removal. Blocks can overlap to reduce perceptible discontinuities between blocks that could otherwise be introduced by later quantization. The partitioner/tile configurer (520) outputs blocks of partitioned data to the frequency transformer (530) and outputs side information such as block sizes to the MUX (590). Alternatively, the partitioner/tile configurer (520) uses other partitioning criteria or block sizes when partitioning a frame into windows.
[0114] In some embodiments, the partitioner/tile configurer (520) partitions frames of multi-channel audio on a per-channel basis. The partitioner/tile configurer (520) independently partitions each channel in the frame, if quality/bitrate allows. This allows, for example, the partitioner/tile configurer (520) to isolate transients that appear in a particular channel with smaller windows, but use larger windows for frequency resolution or compression efficiency in other channels. This can improve compression efficiency by isolating transients on a per channel basis, but additional information specifying the partitions in individual channels is needed in many cases. Windows of the same size that are co-located in time may qualify for further redundancy reduction through multi-channel transformation. Thus, the partitioner/tile configurer (520), groups windows of the same size that are co-located in time as a tile.
[0115] The frequency transformer (530) receives audio samples and converts them into data in the frequency domain. The frequency transformer (530) outputs blocks of frequency coefficient data to the weighter (542) and outputs side information such as block sizes to the MUX (590). The frequency transformer (530) outputs both the frequency coefficients and the side information to the perception modeler (540). In some embodiments, the frequency transformer (530) applies a time-varying Modulated Lapped Transform [“MLT”] MLT to the sub-frame blocks, which operates like a DCT modulated by the sine window function(s) of the sub-frame blocks. Alternative embodiments use other varieties of MLT, or a DCT or other type of modulated or non-modulated, overlapped or non-overlapped frequency transform, or use subband or wavelet coding.
[0116] The perception modeler (540) models properties of the human auditory system to improve the perceived quality of the reconstructed audio signal for a given bitrate. Generally, the perception modeler (540) processes the audio data according to an auditory model, then provides information to the weighter (542) which can be used to generate weighting factors for the audio data. The perception modeler (540) uses any of various auditory models and passes excitation pattern information or other information to the weighter (542).
[0117] The quantization band weighter (542) generates weighting factors for quantization matrices based upon the information received from the perception modeler (540) and applies the weighting factors to the data received from the frequency transformer (530). The weighting factors for a quantization matrix include a weight for each of multiple quantization bands in the audio data. The quantization bands can be the same or different in number or position from the critical bands used elsewhere in the encoder (500), and the weighting factors can vary in amplitudes and number of quantization bands from block to block. The quantization band weighter (542) outputs weighted blocks of coefficient data to the channel weighter (543) and outputs side information such as the set of weighting factors to the MUX (590). The set of weighting factors can be compressed for more efficient representation. If the weighting factors are lossy compressed, the reconstructed weighting factors are typically used to weight the blocks of coefficient data. Alternatively, the encoder (500) uses another form of weighting or skips weighting.
[0118] The channel weighter (543) generates channel-specific weight factors (which are scalars) for channels based on the information received from the perception modeler (540) and also on the quality of locally reconstructed signal. The scalar weights (also called quantization step modifiers) allow the encoder (500) to give the reconstructed channels approximately uniform quality. The channel weight factors can vary in amplitudes from channel to channel and block to block, or at some other level. The channel weighter (543) outputs weighted blocks of coefficient data to the multi-channel transformer (550) and outputs side information such as the set of channel weight factors to the MUX (590). The channel weighter (543) and quantization band weighter (542) in the flow diagram can be swapped or combined together. Alternatively, the encoder (500) uses another form of weighting or skips weighting.
[0119] For multi-channel audio data, the multiple channels of noise-shaped frequency coefficient data produced by the channel weighter (543) often correlate, so the multi-channel transformer (550) may apply a multi-channel transform. For example, the multi-channel transformer (550) selectively and flexibly applies the multi-channel transform to some but not all of the channels and/or quantization bands in the tile. This gives the multi-channel transformer (550) more precise control over application of the transform to relatively correlated parts of the tile. To reduce computational complexity, the multi-channel transformer (550) may use a hierarchical transform rather than a one-level transform. To reduce the bitrate associated with the transform matrix, the multi-channel transformer (550) selectively uses pre-defined matrices (e.g., identity/no transform, Hadamard, DCT Type II) or custom matrices, and applies efficient compression to the custom matrices. Finally, since the multi-channel transform is downstream from the weighter (542), the perceptibility of noise (e.g., due to subsequent quantization) that leaks between channels after the inverse multi-channel transform in the decoder (600) is controlled by inverse weighting. Alternatively, the encoder (500) uses other forms of multi-channel transforms or no transforms at all. The multi-channel transformer (550) produces side information to the MUX (590) indicating, for example, the multi-channel transforms used and multi-channel transformed parts of tiles.
[0120] The quantizer (560) quantizes the output of the multi-channel transformer (550), producing quantized coefficient data to the entropy encoder (570) and side information including quantization step sizes to the MUX (590). In FIG. 5 , the quantizer (560) is an adaptive, uniform, scalar quantizer that computes a quantization factor per tile. The tile quantization factor can change from one iteration of a quantization loop to the next to affect the bitrate of the entropy encoder (560) output, and the per-channel quantization step modifiers can be used to balance reconstruction quality between channels. In alternative embodiments, the quantizer is a non-uniform quantizer, a vector quantizer, and/or a non-adaptive quantizer, or uses a different form of adaptive, uniform, scalar quantization. In other alternative embodiments, the quantizer (560), quantization band weighter (542), channel weighter (543), and multi-channel transformer (550) are fused and the fused module determines various weights all at once.
[0121] The entropy encoder (570) losslessly compresses quantized coefficient data received from the quantizer (560). In some embodiments, the entropy encoder (570) uses adaptive entropy encoding that switches between level and run length/level modes Alternatively, the entropy encoder (570) uses some other form or combination of multi-level run length coding, variable-to-variable length coding, run length coding, Huffman coding, dictionary coding, arithmetic coding, LZ coding, or some other entropy encoding technique. The entropy encoder (570) can compute the number of bits spent encoding audio information and pass this information to the rate/quality controller (580).
[0122] The controller (580) works with the quantizer (560) to regulate the bitrate and/or quality of the output of the encoder (500). The controller (580) receives information from other modules of the encoder (500) and processes the received information to determine desired quantization factors given current conditions. The controller (570) outputs the quantization factors to the quantizer (560) with the goal of satisfying quality and/or bitrate constraints. When the encoder is used in conjunction with a two-pass VBR control strategy, the controller (580) controls encoding in the first pass and records statistics describing the results of the encoding, processes the statistics, and controls encoding in the second pass.
[0123] The mixed/pure lossless encoder (572) and associated entropy encoder (574) compress audio data for the mixed/pure lossless coding mode. The encoder (500) uses the mixed/pure lossless coding mode for an entire sequence or switches between coding modes on a frame-by-frame, block-by-block, tile-by-tile, or other basis. Alternatively, the encoder (500) uses other techniques for mixed and/or pure lossless encoding.
[0124] The MUX (590) multiplexes the side information received from the other modules of the audio encoder (500) along with the entropy encoded data received from the entropy encoders (570, 574). The MUX (590) outputs the information in a WMA format or another format that an audio decoder recognizes. The MUX (590) may include a virtual buffer that stores the bitstream (595) to be output by the encoder (500). The current fullness and other characteristics of the buffer can be used by the controller (580) to regulate quality and/or bitrate.
[0125] C. Detailed Audio Decoder
[0126] With reference to FIG. 6 , a corresponding audio decoder (600) includes a bitstream demultiplexer [“DEMUX”] (610), one or more entropy decoders (620), a mixed/pure lossless decoder (622), a tile configuration decoder (630), an inverse multi-channel transformer (640), a inverse quantizer/weighter (650), an inverse frequency transformer (660), an overlapper/adder (670), and a multi-channel post-processor (680). The decoder (600) is somewhat simpler than the encoder (600) because the decoder (600) does not include modules for rate/quality control or perception modeling.
[0127] The decoder (600) receives a bitstream (605) of compressed audio information in a WMA format or another format. The bitstream (605) includes entropy encoded data as well as side information from which the decoder (600) reconstructs audio samples (695).
[0128] The DEMUX (610) parses information in the bitstream (605) and sends information to the modules of the decoder (600). The DEMUX (610) includes one or more buffers to compensate for variations in bitrate due to fluctuations in complexity of the audio, network jitter, and/or other factors.
[0129] The one or more entropy decoders (620) losslessly decompress entropy codes received from the DEMUX (610). The entropy decoder (620) typically applies the inverse of the entropy encoding technique used in the encoder (500). For the sake of simplicity, one entropy decoder module is shown in FIG. 6 , although different entropy decoders may be used for lossy and lossless coding modes, or even within modes. Also, for the sake of simplicity, FIG. 6 does not show mode selection logic. When decoding data compressed in lossy coding mode, the entropy decoder (620) produces quantized frequency coefficient data.
[0130] The mixed/pure lossless decoder (622) and associated entropy decoder(s) (620) decompress losslessly encoded audio data for the mixed/pure lossless coding mode. Alternatively, decoder (600) uses other techniques for mixed and/or pure lossless decoding.
[0131] The tile configuration decoder (630) receives and, if necessary, decodes information indicating the patterns of tiles for frames from the DEMUX (690). The tile pattern information may be entropy encoded or otherwise parameterized. The tile configuration decoder (630) then passes tile pattern information to various other modules of the decoder (600). Alternatively, the decoder (600) uses other techniques to parameterize window patterns in frames.
[0132] The inverse multi-channel transformer (640) receives the quantized frequency coefficient data from the entropy decoder (620) as well as tile pattern information from the tile configuration decoder (630) and side information from the DEMUX (610) indicating, for example, the multi-channel transform used and transformed parts of tiles. Using this information, the inverse multi-channel transformer (640) decompresses the transform matrix as necessary, and selectively and flexibly applies one or more inverse multi-channel transforms to the audio data. The placement of the inverse multi-channel transformer (640) relative to the inverse quantizer/weighter (640) helps shape quantization noise that may leak across channels.
[0133] The inverse quantizer/weighter (650) receives tile and channel quantization factors as well as quantization matrices from the DEMUX (610) and receives quantized frequency coefficient data from the inverse multi-channel transformer (640). The inverse quantizer/weighter (650) decompresses the received quantization factor/matrix information as necessary, then performs the inverse quantization and weighting. In alternative embodiments, the inverse quantizer/weighter applies the inverse of some other quantization techniques used in the encoder.
[0134] The inverse frequency transformer (660) receives the frequency coefficient data output by the inverse quantizer/weighter (650) as well as side information from the DEMUX (610) and tile pattern information from the tile configuration decoder (630). The inverse frequency transformer (670) applies the inverse of the frequency transform used in the encoder and outputs blocks to the overlapper/adder (670).
[0135] In addition to receiving tile pattern information from the tile configuration decoder (630), the overlapper/adder (670) receives decoded information from the inverse frequency transformer (660) and/or mixed/pure lossless decoder (622). The overlapper/adder (670) overlaps and adds audio data as necessary and interleaves frames or other sequences of audio data encoded with different modes. Alternatively, the decoder (600) uses other techniques for overlapping, adding, and interleaving frames.
[0136] The multi-channel post-processor (680) optionally re-matrixes the time-domain audio samples output by the overlapper/adder (670). The multi-channel post-processor selectively re-matrixes audio data to create phantom channels for playback, perform special effects such as spatial rotation of channels among speakers, fold down channels for playback on fewer speakers, or for any other purpose. For bitstream-controlled post-processing, the post-processing transform matrices vary over time and are signaled or included in the bitstream (605). Alternatively, the decoder (600) performs another form of multi-channel post-processing.
III. Two-Pass VBR Control Strategy
[0137] An audio encoder uses two-pass encoding to produce compressed audio information with relatively constant quality but variable bitrate, while also satisfying a constraint on the overall size of the compressed bitstream. This allows the encoder to provide relatively uniform quality in coded audio data for a given overall size.
[0138] In a two-pass encoding scheme, an encoder analyzes input during a first pass to estimate the complexity of the entire input, and then decides a strategy for compression. During a second pass, the encoder applies this strategy to generate the actual bitstream.
[0139] In general, the process details of a control strategy (whether in a one-pass, two-pass, or delayed-decision solution) depend on the constraints placed on the output. In particular, if the generated bitstream is to be streamed over CBR channels, the encoder places CBR constraints on the output. When a CBR constraint is placed on encoding, the quality of the output can vary wildly over time. This may be objectionable to a user who is mainly concerned with the final size of the compressed data (e.g., for archiving and local storage) and the quality of playback. So, in such cases, the encoder follows a constant quality constraint. Under the constant quality constraint, the goal of the encoder is to keep the quality of the coded representation of the input at or near a target quality for the duration of the clip. The quality metric is the quantizer step size used, PSNR obtained, mean squared error, noise to mask ratio (“NMR”), NER, or some other measure.
[0140] A constant target quality constraint can result in uncertain size for the compressed results. To address this additional concern, the encoder considers an overall compressed data size constraint. At the same time, the encoder may consider a peak bitrate constraint to limit the maximum bitrate for the compressed data, thereby satisfying rate limitations of particular devices. The encoder may consider further constraints related to minimum allowable quality or other criteria.
[0141] When an encoder uses a target quality constraint, the actual quality obtained is not a constant, but may vary slightly over time, as shown in FIG. 7 . FIG. 7 shows a graph (700) of quality versus time for a sequence of encoded audio data. The horizontal axis represents a time series of frames, and the vertical axis represents a range of NER values for the frames. The NER value 0.07 roughly corresponds to good quality for content of typical complexity at 64 Kb/s, while the NER value of 0.01 roughly corresponds to output that is nearly perceptually indistinguishable from the original.
[0142] In comparison, the number of bits generated for the same sequence may vary greatly over time, as shown in FIG. 8 . FIG. 8 is a graph (800) of bits produced versus time for the sequence. The horizontal axis again represents the time series of frames, and the vertical axis represents the count of bits generated per frame. The variation in bits produced relates mainly to the complexity of the input, which can be quite erratic over time, depending on the genre (for music), composition, editing, etc.
[0143] Due to differences in complexity for different sequences, if a particular time-limited sequence of audio content is coded at constant quality, the overall size of the compressed representation can be unpredictable. This can lead to uncertainty and inconvenience for the user, as storage for the compressed data cannot be pre-determined for the input. So, as an additional target, the encoder uses a target overall size for the compressed data. The target size for a sequence of audio data can be reached with a number of possible encodings of the audio data. One reasonable consideration is to concurrently strive for constant quality of the output. Even with the dual constraints of a target overall size and target quality, coding complexity of the audio data can vary from one input to another, lead to variation of quality from output to output.
[0144] FIG. 9 shows a two-pass VBR control strategy (900) that jointly considers the constraints of target quality and target overall size. The strategy can be realized in conjunction with a one-pass audio encoder such as the one-pass encoder (500) of FIG. 5 , the one-pass encoder (100) of FIG. 1 , or another implementation of the encoder (400) of FIG. 4 . No special decoder is needed for decoding VBR streams; the same decoder that handles CBR streams is able to handle VBR streams. This is the case with the encoder/decoder pairs shown in FIGS. 1/2 and 5/6.
[0145] Like the other flowcharts described herein, FIG. 9 shows the main flow of information; other relationships are not shown for the sake of simplicity. Depending on implementation, stages can be added, omitted, split into multiple stages, combined with other stages, and/or replaced with like stages. In alternative embodiments, an encoder uses a strategy with different stages and/or other configurations of stages to control quality and/or bitrate.
[0146] Several stages of the strategy (900) compute or use a quality measure for a block that indicates the quality for the block. The quality measure is typically expressed in terms of NER. Actual NER values may be computed from noise patterns and excitation patterns for blocks, or suitable NER values for blocks may be estimated based upon complexity, bitrate, and other factors. For additional detail about NER and NER computation, see U.S. patent application Ser. No. 10/017,861, filed Dec. 14, 2001, entitled “Techniques for Measurement of Perceptual Audio Quality,” published on Jun. 19, 2003, as Publication No. US-2003-0115042-A1, the disclosure of which is hereby incorporated by reference. More generally, stages of the strategy (900) compute quality measures based upon available information, and can use measures other than NER for objective or perceptual quality.
[0147] Returning to FIG. 9 , in a first pass (910), the encoder gathers statistics regarding the coding complexity of the input (905). For example, the encoder encodes the input (905) at different quantization step sizes and stores statistics (915) relating to quality and bitrate for the different quantization step sizes.
[0148] The encoder then processes (920) the statistics (915), deriving one or more control parameters (925) such as a target quality level for the sequence in view of the collective complexity of the input (905). Alternatively, the encoder computes other and/or additional control parameters. The encoder uses the control parameters (925) to control encoding in the second pass (930).
[0149] In the second pass (930), using the control parameters (925) and complexity information, the encoder distributes the available bits over different segments of the input (905) such that approximately constant quality of representation is obtained in a VBR output bitstream (935). The encoder may use intermediate results of encoding in the second pass (930) to adjust the processing (920), adaptively changing the control parameters (925). Also, the encoder may place additional constraints, such as peak bitrate, on the encoding.
[0150] A. First Pass
[0151] In the first pass, the encoder gathers statistics on the complexity of coding each chunk of the input. A chunk is a block of input such as a frame, sub-frame, or tile. Chunks can have different sizes, and all chunks need not have the same size in a sequence of audio data. (This is in contrast with typical video coding applications, where frames are regularly spaced and have constant size.)
[0152] FIG. 10 shows a technique (1000) for gathering statistics for a sequence of audio with variable-size chunks in the first pass. An encoder first gets (1010) the next variable-size chunk in the sequence. For example, the chunk is a tile of multi-channel audio data in an audio sequence.
[0153] Next, the encoder encodes (1020) the variable-size chunk at a given quality level/quantization step size. The encoder processes the input data for the chunk using the normal components and techniques for the encoder. For example, the encoder (500) of FIG. 5 performs transient detection, determines tile configurations, determines playback durations for tiles, decides channel transforms, determines channel masks, etc.
[0154] The encoder stores auxiliary information, which is side information resulting from analysis of the audio data by the encoder. The auxiliary information generally includes frame partitioning information, perceptual weight values, and channel transform information. For example, the encoder (500) of FIG. 5 stores tile configurations, channel transforms, and mask values from the first pass. The encoder will use the stored information in the second pass to speed up encoding in the second pass. Alternatively, the encoder discards auxiliary information and re-computes it in the second pass.
[0155] During the first pass, the encoder computes (1030) control statistics for the variable-size chunk encoded at the given quality level. Specifically, for each chunk, the encoded gathers statistics on complexity, quality, and bitrate. To do this, the encoder partially codes the input chunks at different quality levels and notes the number of bits produced. In one implementation, the encoder records a triplet (Step,Bits,Quality) consisting of the quantizer step size, number of bits produced with that step size, and the measured quality in terms of NER. Alternatively, the encoder computes other and/or additional statistics, for example, using a different quality metric.
[0156] The encoder determines (1040) whether the encoder is done with the chunk. If the step-rate-distortion curve for the input chunk is well behaved, statistics at one or two quality levels per input chunk would be sufficient to describe the step-rate-distortion curve. (This is typically the case for video inputs.) Unfortunately, the step-rate-distortion performance of any given chunk of audio data can be quite erratic, in part due to the non-linear nature of quality metrics such as NER. Thus, the encoder usually computes and stores more statistics per chunk to facilitate meaningful prediction from the triplets. The encoder attempts to record statistics with a few useful quality levels.
[0157] In one implementation, the encoder computes and records a triplet at an initial target NER (which is derived from a heuristic based on average requested bitrate). The encoder continues computing and recording triplets until data points are found for the endpoints of a useful range of quality measures—a range likely to be used in the second pass encoding. For example, the encoder continues until it finds a data point close to NER of 0.02 and another data point close to NER of 0.08. For a different target range, the encoder would seek different endpoints. The encoder computes up to 35 triplets per chunk, if the encoder is unable to stop sooner.
[0158] If the encoder is done with the chunk, the encoder determines (1050) whether there are any more variable-size chunks in the sequence. If so, the encoder gets (1010) the next variable-size chunk and continues. Otherwise, the technique (1000) ends.
[0159] Alternatively, the encoder performs the first pass on an input source with fixed size chunks. Moreover, instead of encoding the chunks at multiple quality levels in one pass through the input, the encoder may encode the chunks in multiple passes, with one quality level per pass, as part of the “first pass.”
[0160] B. Processing Statistics
[0161] In the processing stage, the encoder determines how to spread the available bits between the chunks of audio data to represent the input in the second pass, given the computed statistics (e.g., step-rate-distortion triplets) for the chunks from the first pass. Specifically, the encoder attempts to spread the available bits such that the resulting quality is uniform over time, subject to the overall size constraint and any additional constraints (such as peak bitrate limit) that concurrently apply. The processing stage and second pass may occur in a feedback loop, with the processing stage being called from different places in the second pass, such that the processing stage influences and is influenced by the results of encoding in the second stage.
[0162] The processing stage includes several sub-stages used in different combinations at different times before and during the second pass. Overall, the encoder predicts the number of bits generated by coding forthcoming input chunks at a particular quality. Based on the prediction, the encoder determines the quality at which to code the input to satisfy the overall size and other constraints, producing one or more control parameters such as target quality.
[0163] The encoder predicts bits produced at a particular target quality in two steps. First, the encoder estimates the quantizer step size needed to arrive at the target quality. Then, the encoder estimates the number of bits that would be produced with that quantizer step size. The encoder performs the prediction for each chunk (e.g., tile). Alternatively, the encoder predicts the bits produced at a particular target quality in a single stage (i.e., predicting bits produced directly from quality) and/or predicts bits for a different size segment of audio data. The encoder can store a quantization step size to use in the second pass in order to achieve a particular quality, thereby speeding up the encoding in the second pass.
[0164] If a peak bitrate constraint applies, the encoder tests the peak bitrate constraint. The encoder maintains a model of a decoder buffer to verify that the peak bitrate is not exceeded.
[0165] The encoder estimates a target quality for a given number of bits for a series of chunks, iteratively using the previous sub-stages. The encoder may also compute checkpoints at which control parameters are adjusted to account for inaccuracies in estimation.
[0166] 1. Estimating the Quantization Step Size for a Target Quality
[0167] In the two-stage prediction, the encoder first estimates the quantizer step size needed to arrive at the target quality. The estimation used depends on the form of the computed statistics as well as the model relating quantization step size to quality.
[0168] In one implementation, given a target quality QualityTarget, the encoder goes through the list of triplets (Step,Bits,Quality) and identifies the nearest smaller step size StepL that produces equal or slightly better quality QualityL than the target quality QualityTarget. The encoder also identifies the nearest larger step size StepR that produces equal or slightly worse quality QualityR than the target quality QualityTarget. If either QualityL or QualityR is sufficiently close to the target quality QualityTarget, the encoder uses the corresponding step size StepL or StepR.
[0169] Otherwise, the encoder performs an interpolation to estimate the step size EstStepTarget needed to produce the target quality. In the interpolation, the encoder assumes a relation between the step size and quality.
Quality=F(Step) (4),
where F( ) is an implementation dependent function. F( ) may depend on the input and also on the local characteristics of the step-rate-distortion curves. As such, F( ) may change from chunk to chunk. Depending on the function used, a number of actual data points are used for the variables in the function. In one function, the encoder uses two data points and a measure of log-log linearity for F( ) in the interpolation, solving for log of estimated target quantization step size:
Quality=F(Step) (4),
where F( ) is an implementation dependent function. F( ) may depend on the input and also on the local characteristics of the step-rate-distortion curves. As such, F( ) may change from chunk to chunk. Depending on the function used, a number of actual data points are used for the variables in the function. In one function, the encoder uses two data points and a measure of log-log linearity for F( ) in the interpolation, solving for log of estimated target quantization step size:
[0170]
[0171] The encoder then computes the estimated target quantization step size:
EstStepTarget=Round(elog(EstStepTarget )) (6).
EstStepTarget=Round(elog(EstStep
[0172] The encoder also performs checks to prevent operations such as divide by zero, log of zero, and log of negative values.
[0173] Alternatively, the encoder uses a different technique and/or relies on different statistics to estimate the quantizer step size needed to arrive at the target quality.
[0174] 2. Estimating the Bits Produced for a Quantization Step Size
[0175] In the two-stage prediction, the encoder then estimates the number of bits that would be produced with the estimated quantization step size. The estimation used depends on the form of the computed statistics as well as the model relating bits produced to quantization step size.
[0176] In one implementation, given a target step size EstStepTarget, the encoder goes through the list of triplets (Step,Bits,Quality) and identifies the nearest smaller step size StepL that is equal or slightly smaller than the target step size EstStepTarget. The encoder also identifies the nearest larger step size StepR that is equal or slightly larger than the target step size EstStepTarget. If either StepL or StepR is sufficiently close to the target step size EstStepTarget, the encoder uses the corresponding bits BitsL or BitsR in its prediction.
[0177] Otherwise, the encoder performs an interpolation to estimate the number of bits produced with the target step size. In the interpolation, the encoder assumes a log-linear relation between step size and bits, which can be generalized as:
Bits=α·βStep (7),
where α and β are constants that depend on the content as well as the region of operation in the step-rate-distortion curve, and where equation (7) may be rewritten as:
log(Bits)=log(α)+Step·log(β) (8).
For one function, equation (8) in turn is written for target, left, and right points, eliminating α and β, for interpolation according to the following relation:
Bits=α·βStep (7),
where α and β are constants that depend on the content as well as the region of operation in the step-rate-distortion curve, and where equation (7) may be rewritten as:
log(Bits)=log(α)+Step·log(β) (8).
For one function, equation (8) in turn is written for target, left, and right points, eliminating α and β, for interpolation according to the following relation:
[0178]
[0179] The encoder then computes the estimated bits produced:
BitsTarget=Round(elog(BitsTarget )) (10).
BitsTarget=Round(elog(Bits
[0180] Again, the encoder performs checks to prevent operations such as divide by zero, log of zero, and log of negative values.
[0181] Alternatively, the encoder uses a different technique and/or relies on different statistics to estimate the bits produced from an estimated quantization step size.
[0182] 3. Buffer Model to Verify Peak Bitrate Constraint
[0183] The encoder in the two-pass VBR control strategy may also consider a constraint on peak bitrate. The peak bitrate constraint signifies, for example, the maximum rate at which a particular device can transmit or accept encoded audio data. The encoder satisfies the peak bitrate constraint so that such a device is not expected to transmit or receive audio data at an excessive rate.
[0184] In one implementation, a model for VBR encoding includes a hypothetical decoder buffer of size BFMax that can be filled at a maximum rate of RMax bits/second. FIG. 11 shows a model (1100) of such a hypothetical decoder buffer. The encoder assumes that the buffer is full at the beginning. According to the model, a decoder draws compressed bits from the buffer for a chunk (e.g., Bits0 for chunk 0, Bits1 for chunk 1, etc.), decodes, and presents the decoded samples. The act of drawing compressed bits is assumed to be instantaneous. Whenever there is room in the decoder buffer, compressed bits are added to the buffer at the rate of RMax. If the buffer is full, it is not over-filled.
[0185] In peak-constrained VBR encoding, the constraint on encoding is that the decoder should not starve; that is, the decoder buffer should not underflow. In an underflow situation, the decoder needs to draw bits from the buffer, but the bits are not available, even though bits have been added to the buffer at the maximum bitrate RMax. (The bits are not available because the bits cannot be added to the buffer at a rate exceeding RMax.) To avoid an underflow situation, the encoder checks whether a particular encoded chunk of audio data is too large, i.e., whether drawing bits for the encoded chunk will cause underflow in the decoder buffer or will cause the decoder buffer to become too close to empty. If so, the encoder reduces the quality of the chunk, thereby reducing the number of bits and ameliorating the underflow situation. The encoder uses a regular rate control procedure to prevent buffer underflow, throttling down on local quality in proportion to how close the buffer is to empty.
[0186] The decoder buffer can safely be at full state without violating the peak bitrate constraint. Fullness is a limiting factor, but the encoder does not proportionally change quality as the buffer gets full. Instead, if the buffer is full, filling stops until there is more room in the buffer. According to the model, the entity filling the decoder buffer waits for room to be available in the decoder buffer, ready to fill the buffer at the maximum rate RMax. (This is different from the CBR model, in which the decoder buffer can be at full state, but that condition is unsafe due to the chance of buffer overflow, since the entity filling the buffer cannot stop and wait for room in the buffer.)
[0187] Mathematically, the decoder buffer is initially specified as follows.
BF0=BFMax (11).
BF0=BFMax (11).
[0188] When a decoder removes a compressed chunk n from the decoder buffer with fullness BFn−1, the buffer fullness becomes:
BFn=BFn−1−Bitsn (12),
where Bitsn is the size of compressed chunk n in number of bits.
BFn=BFn−1−Bitsn (12),
where Bitsn is the size of compressed chunk n in number of bits.
[0189] To test the peak bitrate constraint, the encoder checks the buffer fullness following tentative removal of the bits for compressed chunk n. If BFn is negative or too close to empty, there is an actual or potential underflow violation, and the encoder reduces the target quality for the chunk. For example, the encoder uses a technique for avoiding buffer underflow as described in U.S. patent application Ser. No. 10/017,694, filed Dec. 14, 2001, entitled “Quality and Rate Control Strategy for Digital Audio,” published on Jun. 19, 2003, as Publication No. US-2003-0115050-A1, the disclosure of which is hereby incorporated by reference. Alternatively, the encoder uses another technique to avoid buffer underflow.
[0190] Tn is the presentation duration for chunk n. The buffer fullness at the end of presentation of that chunk is updated to be:
BFn=min(BFn+RMax·Tn, BFMax) (13).
BFn=min(BFn+RMax·Tn, BFMax) (13).
[0191] The encoder then continues with the next chunk.
[0192] Alternatively, the encoder uses a different decoder buffer model, for example one modeling different or additional constraints. Or, the encoder tests different or additional conditions for the peak bitrate constraint. In still other embodiments, the encoder does not consider a peak bitrate constraint at all.
[0193] 4. Estimating Target Quality to Produce Total Number of Bits
[0194] When the target total number of bits BitsTotal for the entire clip is established, the goal of the encoder is to encode the input with as uniform quality as possible while producing a number of bits close to the target total number BitsTotal. At the same time, the encoder satisfies the peak bitrate constraint, if that constraint is present.
[0195] At a particular stage of encoding before or during the second pass, suppose BitsCommitted is the number of bits that have already been committed. The goal of the encoder is to spread the remaining bits BitsAvailable=BitsTotal−BitsCommitted among the remaining chunks in the second pass.
[0196] The bits produced by actual encoding in the second pass can be different from the estimated number of bits, so the encoder places several checkpoints along the sequence. FIG. 12 shows a chart (1200) of checkpoints along a sequence of audio data. At the checkpoints, the encoder refines estimates and adjusts the target quality.
[0197] In one embodiment, as described below, the encoder places checkpoints at equally spaced positions in the total number of bits (e.g., 10% of BitsTotal, 20% of BitsTotal, etc.). As a result, as shown in FIG. 12 , the checkpoints are not necessarily uniformly spaced over time. The encoder dynamically re-positions the checkpoints during the second pass. Alternatively, the encoder sets checkpoints by other criteria such as every x chunks or every y seconds and/or the encoder sets checkpoints statically.
[0198] The encoder uses a single target quality per segment of the sequence, where a segment is a portion of the sequence between two adjacent checkpoints. At the start of the sequence and at each checkpoint, the encoder computes target quality. The determination of target quality is based on the assumption that all the future segments are coded at the same target quality.
[0199] a. Generalized Technique
[0200] FIG. 13 shows a generalized technique (1300) for computing a target quality. The encoder performs the technique (1300) for the first segment in a sequence of audio data, and again to adjust the target quality for later segments. To compute a target quality level according to the technique (1300), the encoder tests one or more target quality levels, using the statistics stored from the first pass, to converge on a satisfactory target quality level for the remainder of the sequence. The encoder will then use the target quality level for the current segment.
[0201] For a given segment, the encoder computes (1310) an initial estimate of target quality. For the first segment, the initial guess of target quality is based on the average target bitrate and complexity measures of the input, as measured in the first pass. For segments other than the first segment, the initial guess of target quality is the final quality setting of the preceding segment. Alternatively, the encoder uses other criteria to compute an initial guess of target quality.
[0202] Next, the encoder estimates (1330) bits for the sequence. For a given target quality setting, the encoder computes a quantization step size for a chunk. The encoder then estimates the number of bits produced for the chunk at the quantization step size. In this way, the encoder estimates the number of bits for each remaining chunk in the sequence at the target quality setting. Alternatively, the encoder uses another technique to predict the number of bits at a given target quality setting. The estimate of the total number of bits may include an actual count of bits for any chunks that have already been encoded in the second pass.
[0203] After estimating (1330) the total number of bits for the sequence, the encoder determines (1370) whether the number of bits is satisfactory, for example, within a threshold of the target total number of bits BitsTotal. The encoder may test other conditions as well.
[0204] If the number of bits is satisfactory, the encoder determines (1390) the next checkpoint (which may be the end of the sequence) and begins the second pass for the current segment with the given target quality setting.
[0205] Otherwise, the encoder adjusts (1380) the target quality up or down, for example, adjusting the target quality in proportion to the difference between the estimated number of bits and the target total number of bits BitsTotal. Alternatively, the encoder uses another algorithm to change the target quality. The encoder reduces the target quality if the number of total bits produced is above budget, and increases quality otherwise. The encoder then resets (1385) the total number of bits and repeats the process with the adjusted target quality setting. In this manner, the encoder converges on a satisfactory target quality setting.
[0206] Alternatively, instead of estimating bits for the entire sequence, the encoder estimates bits only for the segment for which target quality is being computed. The encoder then compares the estimated bits to the number of bits allocated for that segment. Or, instead of computing a single target quality setting, the encoder computes a number of bits per chunk or quantization step size per chunk that results in relatively uniform quality for the segment.
[0207] b. Detailed Technique
[0208] FIG. 14 shows a more detailed technique (1400) for computing a target quality, including testing a peak bitrate constraint. The encoder performs the technique (1400) for the first segment in a sequence of audio data, and again to adjust the target quality for later segments. To compute a target quality level, the encoder tests one or more target quality levels across the sequence, using (Step,Bits,Quality) triplets stored from the first pass, to converge on a satisfactory target quality level for the remainder of the sequence. The encoder will then use the target quality level for the current segment.
[0209] For a given segment, the encoder computes (1410) an initial estimate of target quality. For the first segment, the initial guess of target quality is based on the average target bitrate and complexity measures of the input, as measured in the first pass. The complexity measures are based on the average products of NER×bits for the chunks of the sequence. For segments other than the first segment, the initial guess of target quality is the final quality setting of the preceding segment.
[0210] The encoder positions (1420) statistics and the decoder buffer model to the correct location in the sequence of audio data, in essence “rewinding” the sequence to the proper location to begin the target quality computation. The encoder potentially performs the technique (1400) from anywhere in the sequence. For example, if the encoder performs the technique (1400) after encoding the first minute of a sequence in the second pass, the encoder positions (1420) the statistics and the decoder buffer model to their proper positions as of one minute into the sequence. At the start of the sequence, the decoder buffer is presumed to be full.
[0211] The encoder then considers (1425) data for the next chunk in the sequence. For example, the encoder considers the statistics and input bytes for the chunk. To start, the encoder considers the statistics and input bytes of the first chunk of the current segment. Later, the encoder incrementally changes the position to consider the statistics of the next chunk in the current segment.
[0212] The encoder then predicts (1430) bits for the current chunk. The encoder computes a quantization step size for a chunk at the given target quality setting following equations (5) and (6). The encoder then estimates the number of bits produced for the chunk at the quantization step size following equations (9) and (10).
[0213] To determine (1440) whether the peak bitrate constraint is satisfied, the encoder checks the model of the decoder buffer to simulate removal of the predicted number of bits by a decoder. Specifically, the encoder determines (1440) whether the peak bitrate constraint is satisfied, for example, as described above, by checking for an actual or potential underflow in the decoder buffer. For the target quality for the first segment, the encoder skips modeling the decoding buffer and testing the peak bitrate constraint. Or, the encoder may completely disable the peak bitrate constraint and decoder buffer modeling for a given sequence, for example, according to a user setting.
[0214] If the encoder detects an actual or potential underflow, the encoder adjusts (1450) the local target quality based on the decoder buffer fullness. If the decoder buffer is too low, the encoder reduces the local target quality slightly so that fewer bits are generated by the current chunk than are generated at the global target quality, as described above. The encoder then predicts (1430) bits for the current chunk at the locally adjusted quality level.
[0215] On the other hand, if the peak bitrate constraint is satisfied, the encoder updates (1460) the total bits produced. The total bits produced accounts for the bits already committed in encoding any preceding segments as well as the bits predicted for the remaining chunks in the sequence.
[0216] The encoder determines (1465) whether the current chunk is the last chunk in the sequence. If not, the encoder considers (1425) the next chunk, repeating the prediction for the next chunk.
[0217] If the current chunk was the last chunk, the encoder determines (1470) whether the total number of bits is satisfactory. For example, the encoder determines whether the predicted number of bits through the end of the sequence is within a threshold (such as 1.5%) of the total number of bits BitsTotal. The encoder may also exit the loop if the range of target quality levels reaches a threshold “tightness.” For example, if the candidate NER values to the left and right are within a threshold such as 1%, the encoder accepts the solution and stops iterating through target quality levels.
[0218] If the total number of bits is satisfactory, the encoder determines (1490) the next checkpoint (which may be the end of the sequence). The encoder then begins (or continues) the second pass for the segment with the final target quality setting.
[0219] If the total number of bits is not satisfactory, the encoder adjusts (1480) the target quality up or down, reducing the target quality if the number of total bits produced is above budget, and increasing quality otherwise. Specifically, the encoder revises its estimates of the complexities of the chunks of the sequence (NER×bits for each chunk, in view of the revised numbers of bits) and adjusts the target quality accordingly, with the goal of the same target quality throughout the sequence. For example, suppose the current target quality is 0.05 (in terms of NER) and the average bitrate at that quality is 96 Kb/s. For a given target total size and duration, the target bitrate is 100 Kb/s, so the encoder adjusts the target quality to be 0.05×96/100=0.048, increasing the target quality slightly to increase the average bitrate. Or, suppose the average bitrate for the current target quality had been 104 Kb/s. The adjusted target quality would then be 0.05×104/100=0.052, decreasing the target quality slightly to decrease the average bitrate. For segments other than the very first segment, the encoder does not allow the target quality for the current segment to vary excessively (e.g., by more than 5%) from the preceding segment. The encoder then resets (1485) the total number of bits, positions (1420) the statistics and decoder buffer model at the beginning of the current segment, and repeats the process with the adjusted target quality setting. In this manner, the encoder converges on a satisfactory target quality setting.
[0220] 5. Selecting Checkpoints/Segments
[0221] Since the two-pass VBR control strategy is based on modeling of the complexity of the input, there are inevitably some inaccuracies in the predictions of the number of bits to be produced. Thus, the encoder uses checkpoints to serve as points in the timeline when adjustments can be made to the control parameters.
[0222] In theory, the encoder could adjust control parameters at every input chunk. In view of the computational cost of doing so, however, and since there is no real need to adjust the control parameters so often, the encoder sets a smaller number of checkpoints NCP, for example, 4, 10, 25, or 100.
[0223] FIG. 15 shows a chart (1500) of cumulative bit generation over time, including four checkpoints that are equally spaced in terms of the bit budget for a sequence. The first checkpoint occurs when 25% of the bit budget is expected to be reached. In other words, the first checkpoint is chosen as the point in the timeline when the modeled cumulative bits produced up to that time equal the total bit budget (i.e., the file size) for the entire clip divided by NCP=4. Similarly, the encoder places other checkpoints in the timeline at multiples of the total bit budget divided by NCP.
[0224] The description of a checkpoint includes the expected bits CumulativeBits at the checkpoint as well as the point CumulativeTime in the timeline where the checkpoint is expected to occur. Mathematically, the cumulative bits generated and cumulative time are computed recursively through:
CumulativeBits0=0 (14),
CumulativeBitsn=CumulativeBitsn−1+Bitsn (15),
CumulativeTime0=0 (16), and
CumulativeTimen=CumulativeTimen−1+Tn (17).
CumulativeBits0=0 (14),
CumulativeBitsn=CumulativeBitsn−1+Bitsn (15),
CumulativeTime0=0 (16), and
CumulativeTimen=CumulativeTimen−1+Tn (17).
[0225] After the encoder reaches a checkpoint in the second pass, the encoder may adjust the positions for the remaining checkpoints, dynamically determining the next checkpoint. In essence, whenever either the time target or bits target of a checkpoint is met, the encoder determines a new set of checkpoints, meaning both the time and bits targets of the checkpoints are updated. For example, suppose the first checkpoint is at CumulativeBitsCheckpoint=10%×BitsTotal and CumulativeTimeCheckpoint=10 s, and that the encoder reaches the first checkpoint when CumulativeBitsCheckpoint=10%×BitsTotal and CumulativeTimeCheckpoint=9 s. The encoder removes the first checkpoint and sets a new, second checkpoint according to the model, for example, at CumulativeTimeCheckpoint=18 s and CumulativeBitsCheckpoint=20%×BitsTotal, whichever comes earlier. Alternatively, the encoder may compute all of the checkpoints before the second pass begins and not adjust the checkpoints.
[0226] Or, instead of setting checkpoints according to milestones in bits produced, the encoder sets checkpoints by other criteria such as every y seconds or every x chunks, where x may be greater than 1 to reduce computational complexity.
[0227] C. Second Pass
[0228] In the second pass, the encoder encodes the sequence of audio data while regulating quality based upon the statistics gathered in the first pass. The encoder adjusts control parameters during the second pass to correct inaccuracies in prediction.
[0229] At the beginning of the second pass, the encoder has completed an analysis of the statistics gathered during the first pass. This analysis produces one or more control parameters such as a target quality for the sequence as well as checkpoints (in particular, a first checkpoint) in the sequence. Overall, the encoder uses the control parameters to encode the first segment (i.e., until either the time target or the bits target is met for the first checkpoint). The encoder then adjusts the control parameters and next checkpoint for the next segment, and encodes the next segment. The encoder repeats this process until the entire sequence has been encoded in the second pass.
[0230] More specifically, in the second pass, the encoding proceeds as under a one-pass, quality-based VBR control strategy. For example, the encoder (500) of FIG. 5 encodes the chunks of the sequence according to the target quality. The encoder adjusts quantization step size (and potentially other factors) for chunks to ensure uniform or relatively uniform quality of the encoded audio data. When the encoder has cached auxiliary information such as tile configurations, channel transforms, and mask values from the first pass, the encoder uses the stored information in the second pass to speed up the actual compression process in the second pass.
[0231] If a peak bitrate constraint applies, the encoder employs a model of a decoder buffer. Similar to the model of the decoder buffer in the target quality estimation stage, the model of the decoder buffer tracks buffer fullness to guard against actual and potential underflow situations. If the decoder buffer is close to empty or would be empty after encoding a chunk at a given quality setting, the encoder takes action to reduce the local target quality of the output.
[0232] During the second pass, the encoder maintains counts of the cumulative bits CumulativeBits and cumulative time CumulativeTime for the output being produced. The encoder compares these values against the bits and time values for the next checkpoint. If CumulativeBits≧CumulativeBitsCheckpoint or if CumulativeTime≧CumulativeTimeCheckpoint, the encoder pauses actual compression of input to update the model and control parameters. The update generates a new target quality for the remainder of the input, to be used for the next segment. The update also generates an updated list of checkpoints.
[0233] The encoder continues this adaptive process until all of the input has been encoded and a complete output bitstream has been generated. Due to the use of checkpoints and adaptive refinement of control parameters such as target quality, the two-pass VBR control strategy successfully achieves uniform or relatively uniform quality throughout the sequence, while producing an output bitstream at or very close to the target total number of bits. In contrast, various prior solutions deviate substantially from the target total number of bits, or are forced to drastically alter quality at the end of the sequence to meet the target total number of bits.
[0234] D. Input Checking
[0235] In a typical two-pass encoding scheme, the encoder does not cache the input samples from the first pass for use in the second pass. Doing so could easily require too much additional memory or storage capacity. Instead, the encoder depends on an external source to feed the input to the encoder a second time for the second pass. The external source might involve other decoders, processes, or modules that do not necessarily provide consistent input in the two passes. This is not a problem under typical circumstances, in which the process does not require that input exactly match in the two passes. If auxiliary information generated during the first pass is to be used in the second pass, however, the input data should be consistent across the two passes. For this reason, the encoder may check the consistency of the input between the two passes.
[0236] FIG. 16 shows a technique (1600) for checking the consistency of input between passes. In the technique (1600), to validate that the input is consistent between passes, the encoder produces a “signature” of the input data in the first pass and stores the signature along with other statistics. In the second pass, the signature of the input data is computed and compared against the signature of the input data from the first pass. If the signatures disagree, the encoder stops encoding in the second pass or switches to a mode in which cached auxiliary information is not used.
[0237] In the first pass, the encoder computes (1610) a signature for a portion of the input and performs (1620) first pass compression for that portion of the input. For example, the portion is a chunk of audio data, and the signature is an XOR of the input bytes for the chunk. Alternatively, instead of XOR of input bytes, the encoder computes a different signature. Or, instead of computing signatures for chunks, the encoder computes signatures for portions of different size than chunk.
[0238] The encoder determines (1630) whether the first pass is done. If not, the encoder continues with the next portion in the first pass. Otherwise, the encoder finishes the first pass.
[0239] In the second pass, the encoder computes (1640) a signature for a portion of the input, where the signature is computed with the same technique, and the portion is the same size, as in the first pass encoding. The encoder determines (1650) whether the signatures match for the portion. If so, the encoder performs (1660) second pass compression for that portion of the input. If the two signatures do not match, the encoder takes an alterative action. For example, the encoder stops the second pass and reports the signature problem to the user. This prevents the encoder from generating a bad output stream based on the inconsistent input, since the cached auxiliary information to be used in the second pass may be incorrect for the actual input to the second pass.
[0240] The encoder determines (1670) whether the second pass is done. If not, the encoder continues with the next portion in the second pass. Otherwise, the encoder finishes the second pass.
[0241] Having described and illustrated the principles of our invention with reference to various embodiments, it will be recognized that the described 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 the described embodiments shown in software may be implemented in hardware and vice versa.
[0242] 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.
Claims
We claim:
1. In a computer system, a computer-implemented method of media encoding according to a multi-pass control strategy, the method comprising:
in a first pass, encoding media data;
storing auxiliary information from the encoding in the first pass, wherein the stored auxiliary information is side information to be output in a bitstream and used in decoding; and
in a second pass, encoding the media data, including using the stored auxiliary information to increase speed of the encoding in the second pass.
2. The method of claim 1 wherein the media data are audio data.
3. The method of claim 1 wherein the auxiliary information comprises mask values.
4. The method of claim 1 wherein the auxiliary information comprises tile configurations.
5. The method of claim 1 wherein the auxiliary information comprises multi-channel transforms.
6. The method of claim 1 wherein the encoding in the second pass produces variable bitrate output around a target quality.
7. In a computer system, a computer-implemented method comprising:
in a first pass, computing a first pass signature for each of one or more portions of media data and encoding the one or more portions, wherein the first pass signature for each of the one or more portions comprises a value derived from input of the portion; and
in a second pass,
computing a second pass signature for a given portion of the one or more portions, wherein the second pass signature for the given portion comprises a value derived from input of the given portion;
comparing the second pass signature with the first pass signature for the given portion so as to check that the input for the given portion is consistent between the first pass and the second pass;
if the first pass signature matches the second pass signature, encoding the given portion;
otherwise, performing one or more alternative actions.
8. The method of claim 7 wherein the media data are audio data.
9. The method of claim 7 wherein the portions are chunks.
10. The method of claim 7 wherein the first pass and second pass signatures are based at least in part upon an XOR of input bytes of media data.
11. The method of claim 7 wherein the first and second passes are part of a multi-pass variable bitrate control strategy.
12. The method of claim 7 wherein the one or more alternative actions include stopping the second pass.
13. The method of claim 7 wherein the one or more alternative actions include notifying the user.
14. The method of claim 7 wherein the one or more alternative actions include encoding the given portion using alternative encoding techniques.
15. In an audio encoder, a computer-implemented method of audio encoding according to a multi-pass variable bitrate control strategy, the method comprising:
in a first pass, encoding a sequence of audio data;
storing auxiliary information from the encoding in the first pass, wherein the stored auxiliary information is side information to be output in a bitstream and used in decoding; and
in a second pass, encoding the sequence of audio data in view of a goal of uniform quality at variable bitrate, wherein a peak bitrate constraint affects quality and bitrate in the second pass, and wherein the stored auxiliary information is used to increase speed of the encoding in the second pass.
16. The method of claim 15 wherein the audio encoder models a decoder buffer to test the peak bitrate constraint.
17. The method of claim 16 wherein the audio encoder reduces a target quality to avoid underflow in the decoder buffer.
18. In a media encoder, a computer-implemented method of media encoding, the method comprising:
selectively enabling or disabling a peak bitrate constraint for a sequence of media data;
in a first pass, encoding the sequence of media data;
storing auxiliary information from the encoding in the first pass, wherein the stored auxiliary information is side information to be output in a bitstream and used in decoding; and
in a second pass, encoding the sequence of media data, wherein the peak bitrate constraint affects quality and bitrate in the second pass if the peak bitrate constraint is enabled for the sequence, and wherein the stored auxiliary information is used to increase speed of the encoding in the second pass.
19. The method of claim 18 wherein the media data are audio data.
20. The method of claim 18 wherein the media encoder models a decoder buffer to test the peak bitrate constraint.
21. The method of claim 20 wherein the media encoder adjusts one or more control parameters to avoid underflow in the decoder buffer.
22. In a media encoder, a computer-implemented method of media encoding, the method comprising:
in a first pass, encoding media data;
processing results of the encoding in the first pass, wherein the processing includes setting a checkpoint at a defined percentage of a target total bit count for the media data, wherein the checkpoint is defined in terms of cumulative bit count in encoding of the media data; and
in a second pass, encoding media data, wherein the encoding in the second pass includes checking results of the encoding in the second pass as of the checkpoint.
23. The method of claim 22 wherein the media data are audio data.
24. The method of claim 22 wherein the encoding in the second pass further includes adjusting a target quality level based at least in part upon the results of the encoding in the second pass as of the checkpoint.
25. The method of claim 22 further comprising, at the checkpoint, computing a subsequent checkpoint at a multiple of the defined percentage of the target total bit count, wherein the encoding in the second pass further includes checking results of the encoding in the second pass as of the subsequent checkpoint.
26. In a media encoder, a computer-implemented method of media encoding, the method comprising:
in a first pass, encoding a sequence of media data;
setting a checkpoint for encoding in a second pass, wherein the checkpoint is defined in terms of cumulative bit count in encoding of the media data; and
in the second pass, iteratively:
encoding media data up to the checkpoint,
checking results of encoding in the second pass up to the checkpoint, and
updating the checkpoint for the encoding in the second pass, wherein the second pass continues until the sequence of media data is encoded.
27. The method of claim 26 wherein the media data are audio data.
28. The method of claim 26 further comprising:
in the second pass, after the checking, adjusting one or more control parameters if necessary based upon the results of encoding in the second pass up to the checkpoint, thereby improving uniformity of quality for the sequence.
29. The method of claim 28 wherein a first control parameter of the one or more control parameters is a target quality level.
30. In a media encoder, a computer-implemented method of media encoding, the method comprising:
in a first pass, encoding a sequence of media data;
setting a checkpoint for encoding in a second pass; and
in the second pass, iteratively:
encoding media data up to the checkpoint,
checking results of encoding in the second pass up to the checkpoint, and
updating the checkpoint for the encoding in the second pass, wherein the second pass continues until the sequence of media data is encoded, wherein the checkpoint is set and updated at multiples of a percentage of a target total bit count for the sequence.
31. The method of claim 22 wherein the checkpoint is further defined in terms of cumulative input encoded, and wherein the encoder reaches the checkpoint when the encoder reaches the cumulative time elapsed or the cumulative input encoded during the second pass.
32. The method of claim 31 wherein the cumulative input encoded is measured by elapsed time or number of chunks of input.
33. The method of claim 26 wherein the checkpoint is further defined in terms of cumulative input encoded, and wherein the encoder reaches the checkpoint when the encoder reaches the cumulative time elapsed or the cumulative input encoded during the second pass.
34. The method of claim 33 wherein the cumulative input encoded is measured by elapsed time or number of chunks of input.
Patent Citations (108)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4051470(A) | 1977-09-01 | Esteban et al. | Applicant |
| US4455649(A) | 1984-06-01 | Esteban et al. | Applicant |
| US4493091(A) | 1985-01-01 | Gundry | Applicant |
| US4706260(A) | 1987-11-01 | Fedele et al. | Applicant |
| US4802224(A) | 1989-01-01 | Shiraki et al. | Applicant |
| US4954892(A) | 1990-09-01 | Asai et al. | Applicant |
| US5043919(A) | 1991-08-01 | Callaway et al. | Applicant |
| US5089889(A) | 1992-02-01 | Sugiyama | Applicant |
| US5136377(A) | 1992-08-01 | Johnston et al. | Applicant |
| US5235618(A) | 1993-08-01 | Sakai et al. | Applicant |
| US5266941(A) | 1993-11-01 | Akeley et al. | Applicant |
| US5317672(A) | 1994-05-01 | Crossman et al. | Applicant |
| US5394170(A) | 1995-02-01 | Akeley et al. | Applicant |
| US5398069(A) | 1995-03-01 | Huang et al. | Applicant |
| US5400371(A) | 1995-03-01 | Natarajan | Applicant |
| US5414796(A) | 1995-05-01 | Jacobs et al. | Applicant |
| US5448297(A) | 1995-09-01 | Alattar et al. | Applicant |
| US5457495(A) | 1995-10-01 | Hartung | Applicant |
| US5467134(A) | 1995-11-01 | Laney et al. | Applicant |
| US5533052(A) | 1996-07-01 | Bhaskar | Applicant |
| US5570363(A) | 1996-10-01 | Holm | Applicant |
| US5579430(A) | 1996-11-01 | Grill et al. | Applicant |
| US5586200(A) | 1996-12-01 | Devaney et al. | Applicant |
| US5602959(A) | 1997-02-01 | Bergstrom et al. | Applicant |
| US5623424(A) | 1997-04-01 | Azadegan et al. | Applicant |
| US5650860(A) | 1997-07-01 | Uz | Examiner |
| US5654760(A) | 1997-08-01 | Ohtsuki | Applicant |
| US5661755(A) | 1997-08-01 | Van De Kerkhof et al. | Applicant |
| US5666161(A) | 1997-09-01 | Kohiyama et al. | Applicant |
| US5686964(A) | 1997-11-01 | Tabatabai et al. | Applicant |
| US5724453(A) | 1998-03-01 | Ratnakar et al. | Applicant |
| US5742735(A) | 1998-04-01 | Eberlein et al. | Applicant |
| US5754974(A) | 1998-05-01 | Griffin et al. | Applicant |
| US5787203(A) | 1998-07-01 | Lee et al. | Applicant |
| US5802213(A) | 1998-09-01 | Gardos | Applicant |
| US5819215(A) | 1998-10-01 | Dobson et al. | Applicant |
| US5825310(A) | 1998-10-01 | Tsutsui | Applicant |
| US5835149(A) | 1998-11-01 | Astle | Applicant |
| US5845243(A) | 1998-12-01 | Smart et al. | Applicant |
| US5867230(A) | 1999-02-01 | Wang et al. | Examiner |
| US5884039(A) | 1999-03-01 | Ludwig et al. | Applicant |
| US5886276(A) | 1999-03-01 | Levine et al. | Applicant |
| US5926226(A) | 1999-07-01 | Proctor et al. | Applicant |
| US5933451(A) | 1999-08-01 | Ozkan et al. | Applicant |
| US5952943(A) | 1999-09-01 | Walsh et al. | Applicant |
| US5982305(A) | 1999-11-01 | Taylor | Applicant |
| US5986712(A) | 1999-11-01 | Peterson et al. | Applicant |
| US5990945(A) | 1999-11-01 | Sinha et al. | Examiner |
| US5995151(A) | 1999-11-01 | Naveen et al. | Applicant |
| US6002439(A) | 1999-12-01 | Murakami et al. | Applicant |
| US6029126(A) | 2000-02-01 | Malvar | Applicant |
| US6049630(A) | 2000-04-01 | Wang et al. | Applicant |
| US6058362(A) | 2000-05-01 | Malvar | Applicant |
| US6072831(A) | 2000-06-01 | Chen | Applicant |
| US6073153(A) | 2000-06-01 | Malvar | Applicant |
| US6075768(A) | 2000-06-01 | Mishra | Applicant |
| US6088392(A) | 2000-07-01 | Rosenberg | Applicant |
| US6111914(A) | 2000-08-01 | Bist | Applicant |
| US6115689(A) | 2000-09-01 | Malvar | Applicant |
| US6160846(A) | 2000-12-01 | Chiang et al. | Applicant |
| US6182034(B1) | 2001-01-01 | Malvar | Applicant |
| US6212232(B1) | 2001-04-01 | Reed et al. | Applicant |
| US6215820(B1) | 2001-04-01 | Bagni et al. | Applicant |
| US6223162(B1) | 2001-04-01 | Chen et al. | Applicant |
| US6226407(B1) | 2001-05-01 | Zabih et al. | Applicant |
| US6240380(B1) | 2001-05-01 | Malvar | Applicant |
| US6243497(B1) | 2001-06-01 | Chiang et al. | Applicant |
| US6278735(B1) | 2001-08-01 | Mohsenian | Applicant |
| US6320825(B1) | 2001-11-01 | Bruekers et al. | Examiner |
| US6351226(B1) | 2002-02-01 | Saunders et al. | Applicant |
| US6370502(B1) | 2002-04-01 | Wu et al. | Applicant |
| US6421738(B1) | 2002-07-01 | Ratan et al. | Applicant |
| US6421739(B1) | 2002-07-01 | Holiday | Examiner |
| US6441754(B1) | 2002-08-01 | Wang et al. | Applicant |
| US6473409(B1) | 2002-10-01 | Malvar | Applicant |
| US6490554(B2) | 2002-12-01 | Endo et al. | Applicant |
| US6501798(B1) | 2002-12-01 | Sivan | Applicant |
| US6522693(B1) | 2003-02-01 | Lu et al. | Applicant |
| US6539124(B2) | 2003-03-01 | Sethuraman et al. | Applicant |
| US6573915(B1) | 2003-06-01 | Sivan et al. | Applicant |
| US6574593(B1) | 2003-06-01 | Gao et al. | Applicant |
| US6654417(B1) | 2003-11-01 | Hui | Applicant |
| US6654419(B1) | 2003-11-01 | Sriram et al. | Applicant |
| US6728317(B1) | 2004-04-01 | Demos | Applicant |
| US6732071(B2) | 2004-05-01 | Lopez-Estrada et al. | Applicant |
| US6760598(B1) | 2004-07-01 | Kurjenniemi | Applicant |
| US6810083(B2) | 2004-10-01 | Chen et al. | Applicant |
| US6876703(B2) | 2005-04-01 | Ismaeil et al. | Applicant |
| US6895050(B2) | 2005-05-01 | Lee | Applicant |
| US6934677(B2) | 2005-08-01 | Chen et al. | Applicant |
| US7027982(B2) | 2006-04-01 | Chen et al. | Applicant |
| US7143030(B2) | 2006-11-01 | Chen et al. | Applicant |
| US7146313(B2) | 2006-12-01 | Chen et al. | Applicant |
| US2002/0143556(A1) | 2002-10-01 | Kadatch | Applicant |
| US2002/0154693(A1) | 2002-10-01 | Demos | Applicant |
| US2002/0176624(A1) | 2002-11-01 | Kostrzewski et al. | Applicant |
| US2003/0110236(A1) | 2003-06-01 | Yang et al. | Applicant |
| US2003/0115041(A1) | 2003-06-01 | Chen | Applicant |
| US2003/0115042(A1) | 2003-06-01 | Chen et al. | Applicant |
| US2003/0115050(A1) | 2003-06-01 | Chen et al. | Applicant |
| US2003/0115051(A1) | 2003-06-01 | Chen | Applicant |
| US2003/0115052(A1) | 2003-06-01 | Chen | Applicant |
| US2003/0125932(A1) | 2003-07-01 | Wang et al. | Applicant |
| US2005/0015528(A1) | 2005-01-01 | Du | Applicant |
| US2005/0084166(A1) | 2005-04-01 | Boneh et al. | Applicant |
| US2005/0135484(A1) | 2005-06-01 | Lee | Applicant |
| US2005/0157784(A1) | 2005-07-01 | Tanizawa et al. | Applicant |
| US2006/0062302(A1) | 2006-03-01 | Yin et al. | Applicant |
Non-Patent Literature (71)
- Baron et al., “Coding the Audio Signal,” Digital Image and Audio Communications, pp. 101-128 (1998).Applicant
- Beerends, “Audio Quality Determination Based on Perceptual Measurement Techniques,” Applications of Digital Signal Processing to Audio and Acoustics, Chapter 1, Ed. Mark Kahrs, Karlheinz Brandenburg, Kluwer Acad. Publ., pp. 1-38 (1998).Applicant
- De Luca, “AN1090 Application Note: STA013 MPEG 2.5 Layer III Source Decoder,” STMicroelectronics, 17 pp. (1999).Applicant
- de Queiroz et al., “Time-Varying Lapped Transforms and Wavelet Packets,” IEEE Transactions on Signal Processing, vol. 41, pp. 3293-3305 (1993).Applicant
- “DivX Multi Standard Video Encoder,” 2 pp. (Downloaded from the World Wide Web on Jan. 24, 2006).Applicant
- Gibson et al., Digital Compression for Multimedia, Chapter 8, “Frequency Domain Speech and Audio Coding Standards,” Morgan Kaufman Publishers, Inc., pp. 263-290 (1998).Applicant
- Gibson et al., Digital Compression for Multimedia, Chapter 11.4, “MPEG Audio,” Morgan Kaufman Publishers, Inc., pp. 398-402 (1998).Applicant
- Gibson et al., Digital Compression for Multimedia, Chapter 11.6.2-11.6.4, “More MPEG,” Morgan Kaufman Publishers, Inc., pp. 415-416 (1998).Applicant
- Gill et al., “Creating High-Quality Content with Microsoft Windows Media Encoder 7,” 4 pp. (2000). [Downloaded from the World Wide Web on May 1, 2002.].Applicant
- Herley et al., “Tilings of the Time-Frequency Plane: Construction of Arbitrary Orthogonal Bases and Fast Tiling Algorithms,” IEEE Transactions on Signal Processing, vol. 41, No. 12, pp. 3341-3359 (1993).Applicant
- ISO/IEC, “Information Technology—Coding of Audio-Visual Objects: Visual, ISO/IEC 14496-2, Committee Draft,” 330 pp. (1998).Applicant
- ISO/IEC, “ISO/IEC 11172-2: Information Technnology—Coding of Moving Pictures and Associatged Audio for Storage Medua at up to About 1.5 Mbit/s,” 122 pp. (1993).Applicant
- ITU-T, “ITU-T Recommendation H.261: Video Codec for Audiovisual Services at p×64 kbits,” 28 pp. (1993).Applicant
- ITU-T, “ITU-T Recommendation H.262: Information Technology—Generic Coding of Moving Pictures and Associated Audio Information: Video,” 218 pp. (1995).Applicant
- ITU-T, “ITU-T Recommendation H.263: Video Coding for Low Bit Rate Communication,” 167 pp. (1998).Applicant
- ITU, Recommendation ITU-R BS 1387, Method for Objective Measurements of Perceived Audio Quality, 89 pp. (1998).Applicant
- Joint Video Team of ISO/IEC MPEG and ITU-T VCEG, “Committee Draft of Joint Video Specification (ITU-T Recommendation H.264, ISO/IEC 14496-10 AVC,” 142 pp. (Aug. 2002).Applicant
- Kondoz, Digital Speech: Coding for Low Bit Rate Communications Systems, “Chapter 3.3: Linear Predictive Modeling of Speech Signals,” and “Chapter 4: LPC Parameter Quantisation Using LSFs,” John Wiley & Sons, pp. 42-53 and 79-97 (1994).Applicant
- Mook, “Next-Gen Windows Media Player Leaks to the Web,” BetaNews, 17 pp. (Jul. 19, 2002) [Downloaded from the World Wide Web on Aug. 8, 2003].Applicant
- OPTICOM GmbH, “Objective Perceptual Measurement,” 14 pp. [Downloaded from the World Wide Web on Oct. 24, 2001].Applicant
- Phamdo, “Speech Compression,” 13 pp. [Downloaded from the World Wide Web on Nov 25, 2001].Applicant
- Schuster et al., “A Theory for the Optimal Bit Allocation Between Displacement Vector Field and Displaced Frame Difference,” IEEE J. on Selected Areas in Comm., vol. 15, No. 9, pp. 1739-1751 (Dec. 1997).Applicant
- Sullivan et al., “Rate-Distortion Optimization for Video Compression,” IEEE Signal Processing Magazine, pp. 74-90 (Nov. 1998).Applicant
- Sullivan et al., “The H.264/AVC Advanced Video Coding Standard: Overview and Introduction to the Fidelity Range Extensions,” 21 pp. (Aug. 2004).Applicant
- Tao et al., “Adaptive Model-driven Bit Allocation for MPEG Video Coding,” IEEE Transactions on Circuits and Systems for Video Tech., vol. 10, No. 1, pp. 147-157 (Feb. 2000).Applicant
- Tsang et al., “Fuzzy based rate control for real-time MPEG video,” 12 pp.Applicant
- Yang et al., “Rate Control for Videophone Using Local Perceptual Cues,” IEEE Transactions on Circuits and Systems for Video Tech., vol. 15, No. 4, pp. 496-507 (Apr. 2005).Applicant
- Li et al., “Optimal Linear Interpolation Coding for Server-Based Computing,” Proc. IEEE Int'l Conf. on Communications, 5 pp. (2002).Applicant
- Cliff Reader, “History of MPEG Video Compression—Ver. 4.0,” 99 pp., document marked Dec. 16, 2003.Applicant
- Ronda et al., “Rate Control and Bit Allocation for MPEG-4,” IEEE Transactions on Circuits and Systems for Video Technology, pp. 1243-1258 (1999).Applicant
- Schaar-Mitrea et al., “Hybrid Compression of Video with Graphics in DTV Communication Systems,” IEEE Trans. on Consumer Electronics, pp. 1007-1017 (2000).Applicant
- Vetro et al., “An Overview of MPEG-4 Object-Based Encoding Algorithms,” IEEE International Symposium on Information Technology, pp. 366-369 (2001).Applicant
- Printouts of FTP directories from http://ftp3.itu.ch , 8 pp. (downloaded from the World Wide Web on Sep. 20, 2005).Applicant
- Advanced Television Systems Committee, “ATSC Standard: Digital Audio Compression (AC-3), Revision A,” pp. 1-140 (Aug. 2001).Applicant
- Caetano et al., “Rate Control Strategy for Embedded Wavelet Video Coders,” Electronics Letters, pp. 1815-1817 (Oct. 14, 1999).Applicant
- Cheung et al., “A Comparison of Scalar Quantization Strategies for Noisy Data Channel Data Transmission,” IEEE Transactions on Communications, vol. 43, No. 2/3/4, pp. 738-742 (Apr. 1995).Applicant
- Crisafulli et al., “Adaptive Quantization: Solution via Nonadaptive Linear Control,” IEEE Transactions on Communications, vol. 41, pp. 741-748 (May 1993).Applicant
- Dalgic et al., “Characterization of Quality and Traffic for Various Video Encoding Schemes and Various Encoder Control Schemes,” Technical Report No. CSL-TR-96-701 (Aug. 1996).Applicant
- Dolby Laboratories, “AAC Technology,” 4 pp. [Downloaded from the web site aac-audio.com on World Wide Web on Nov. 21, 2001.].Applicant
- Fraunhofer-Gesellschaft, “MPEG Audio Layer-3,” 4 pp. [Downloaded from the World Wide Web on Oct. 24, 2001.].Applicant
- Fraunhofer-Gesellschaft, “MPEG-2 AAC,” 3 pp. [Downloaded from the World Wide Web on Oct. 24, 2001.].Applicant
- Gibson et al., “Quantization,” Digital Compression for Multimedia, Chapter 4, pp. 113-138 (1998).Applicant
- Gibson et al., “Chapter 7: Frequency Domain Coding,” Digital Compression for Multimedia, Title Page, Contents, Morgan Kaufman Publishers, Inc., pp. iii, v-xi, and 227-262 (1998).Applicant
- ISO, “MPEG-4 Video Verification Model version 18.0,” ISO/IEC JTC1/SC29/WG11 N3908, Jan. 2001, Pisa, pp. 1-10, 299-311 (Jan. 2001).Applicant
- ISO/IEC 11172-3, Information Technology—Coding of Moving Pictures and Associated Audio for Digital Storage Media at Up to About 1.5 Mbit/s—Part 3: Audio, 154 pp. (1993).Applicant
- ISO/IEC 13818-7, “Information Technology—Generic Coding of Moving Pictures and Associated Audio Information, Part 7: Advanced Audio Coding (AAC),” pp. i-iv, 1-145, ISO/IEC (1997).Applicant
- ISO/IEC 13818-7, Technical Corrigendum 1, “Information Technology—Generic Coding of Moving Pictures and Associated Audio Information, Part 7: Advanced Audio Coding (AAC), Technical Corrigendum,” pp. 1-22, ISO/IEC (1997).Applicant
- ITU Recommendation ITU-R BS 1115, Low Bit-Rate Audio Coding, 9 pp. (1994).Applicant
- Jafarkhani et al., “Entropy-Constrained Successively Refinable Scalar Quantization,” Proc. DCC '97, pp. 337-346 (1997).Applicant
- Jayant et al., Digital Coding of Waveforms, Principles and Applications to Speech and Video, pp. 428-445, Prentice Hall (1984).Applicant
- Naveen et al., “Subband Finite State Scalaer Quantization,” IEEE Transactions on Image Processing, vol. 5, No. 1, pp. 150-155 (Jan. 1996).Applicant
- Ortega et al., “Adaptive Scalar Quantization Without Side Information,” IEEE Transactions on Image Processing, vol. 6, No. 5, pp. 665-676 (May 1997).Applicant
- Ortega et al., “Optimal Buffer-constrained Source Quantization and Fast Approximation,” IEEE, pp. 192-195 (1992).Applicant
- Ramchandran et al., “Bit Allocation for Dependent Quantization with Applications to MPEG Video Coders,” IEEE, pp. v-381-v-384 (1993).Applicant
- Ratnakar et al., “RD-OPT: An Efficient Algorithm for Optimizing DCT Quantization Tables,” 11 pp.Applicant
- Ribas Corbera et al., “Rate Control in DCT Video Coding for Low-Delay Communications,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 9, No. 1, pp. 172-185 (Feb. 1999).Applicant
- Sidiropoulos, “Optimal Adaptive Scalar Quantization and Image Compression,” ICIP '98, pp. 574-578 (1998).Applicant
- Solari, “Chapter 8: Sound and Audio,” Digital Video and Audio Compression, Title Page, Contents, McGraw-Hill, Inc., pp. iii, v-vi, and 187-211 (1997).Applicant
- Srinivasan et al., “High-Quality Audio Compression Using an Adaptive Wavelet Packet Decomposition and Psychoacoustic Modeling,” IEEE Transactions on Signal Processing, vol. 46, No. 4, pp. 1085-1093 (Apr. 1998).Applicant
- Sullivan, “Optimal Entropy Constrained Scalar Quantization for Exponential and Laplacian Random Variables,” ICASSP '94, pp. V-265-V-268 (1994).Applicant
- Trushkin, “On the Design on an Optimal Qunatizer,” IEEE Transactions on Information Theory, vol. 39, No. 4, pp. 1180-1194 (Jul. 1993).Applicant
- Westerink et al., “Two-pass MPEG-2 Variable-bit-rate Encoding,” IBM J. Res. Develop., vol. 43, No. 4, pp. 471-488 (1999).Applicant
- Wong, “Progressively Adaptive Scalar Quantization,” ICIP '96, pp. 357-360 (1996).Applicant
- Wu et al., “Entropy-Constrained Scalar Quantization and Minimum Entropy with Error Bound by Discrete Wavelet Transforms in Image Compression,” IEEE Transactions on Signal Processing, vol. 48, No. 4, pp. 1133-1143 (Apr. 2000).Applicant
- Wu et al., “Quantizer Monotonicities and Globally Optimally Scalar Quantizer Design,” IEEE Transactions on Information Theory, vol. 39, No. 3, pp. 1049-1053 (May 1993).Applicant
- Hsu et al., “Joint Selection of Source and Channel Rate for VBR Video Transmission Under ATM Policing Constraints,” IEEE Journal on Selected Areas in Communications, vol. 15, No. 6, pp. 1016-1028 (Aug. 1997).Applicant
- Pao, “Encoding Stored Video for Streaming Applications,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 11, No. 2, pp. 199-209 (Feb. 2001).Applicant
- Reed et al., “Constrained Bit-Rate Control for Very Low Bit-Rate Streaming-Video Applications,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 11, No. 7, pp. 882-889 (Jul. 2001).Applicant
- Reibman et al., “Constraints on Variable Bit-rate Video for ATM Networks,” IEEE Transactions on Circuits and Systems for Video Technology, No. 4, pp. 361-372 (1992).Applicant
- Sheu et al., “A Buffer Allocation Mechanism for VBR Video Playback,” Communication Tech. Proc. 2000, WCC-ICCT 2000, vol. 2, pp. 1641-1644 (2000).Applicant
- Walpole et al., “A Player for Adaptive MPEG Video Streaming over the Internet,” Proc. SPIE., vol. 3240, pp. 270-281 (1998).Applicant