US 7,027,982 B2Grant
Quality and rate control strategy for digital audio
Issue Date:2006-04-11
•14 Claims
•14 Drawing Sheets
Abstract
An audio encoder regulates quality and bitrate with a control strategy. The strategy includes several features. First, an encoder regulates quantization using quality, minimum bit count, and maximum bit count parameters. Second, an encoder regulates quantization using a noise measure that indicates reliability of a complexity measure. Third, an encoder normalizes a control parameter value according to block size for a variable-size block. Fourth, an encoder uses a bit-count control loop de-linked from a quality control loop. Fifth, an encoder addresses non-monotonicity of quality measurement as a function of quantization level when selecting a quantization level. Sixth, an encoder uses particular interpolation rules to find a quantization level in a quality or bit-count control loop. Seventh, an encoder filters a control parameter value to smooth quality. Eighth, an encoder corrects model bias by adjusting a control parameter value in view of current buffer fullness.
Metadata
Assignee
- Microsoft Corporation
Inventors
- Wei-Ge Chen
- Naveen Thumpudi
- Ming-Chieh Lee
Application Information
Application Number:US 10/017,694
Filing Date:2001-12-14
Priority Date:2001-12-14
Art Unit:2654
Classifications
IPC:
G10L19/00
Patent Drawings (14 sheets)
Description
Related Application Information
[0001] The following concurrently filed U.S. patent applications relate to the present application: 1) U.S. patent application Ser. No. 10/020,708, entitled, “Adaptive Window-Size Selection in Transform Coding,” filed Dec. 14, 2001, the disclosure of which is hereby incorporated by reference; 2) U.S. patent application Ser. No. 10/016,918, entitled, “Quality Improvement Techniques in an Audio Encoder,” filed Dec. 14, 2001, the disclosure of which is hereby incorporated by reference; 3) U.S. patent application Ser. No. 10/017,702, entitled “Quantization Matrices for Digital Audio,” filed Dec. 14, 2001, the disclosure of which is hereby incorporated by reference; and 4) U.S. patent application Ser. No. 10/017,861, entitled, “Techniques for Measurement of Perceptual Audio Quality,” filed Dec. 14, 2001, the disclosure of which is hereby incorporated by reference.
Technical Field
[0002] The present invention relates to a quality and rate control strategy for digital audio. In one embodiment, an audio encoder controls quality and bitrate by adjusting quantization of audio information.
Background
[0003] 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
[0004] 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.
[0005] 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.
[0006] 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.
[0007] 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.
[0008]
| 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 | ||||
[0009] 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.
[0010] 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). Decompression (also called decoding) extracts a reconstructed version of the original information from the compressed form.
[0011] Quantization is a conventional lossy compression technique. There are many different kinds of quantization including uniform and non-uniform quantization, scalar and vector quantization, and adaptive and non-adaptive quantization. Quantization maps ranges of input values to single values. For 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. Quantization can dramatically improve the effectiveness of subsequent lossless compression, however, thereby reducing bitrate.
[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] 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. Transform coding techniques typically convert information into the frequency (or spectral) domain. For example, a transform coder converts a time series of audio samples into frequency coefficients. Transform coding techniques include Discrete Cosine Transform [“DCT”], Modulated Lapped Transform [“MLT”], and Fast Fourier Transform [“FFT”]. In practice, the input to a transform coder is partitioned into blocks, and each block is transform coded. Blocks may have varying or fixed sizes, and may or may not overlap with an adjacent block. After transform coding, a frequency range of coefficients may be grouped for the purpose of quantization, in which case each coefficient is quantized like the others in the group, and the frequency range is called a quantization band. For more information about transform coding and MLT in particular, see Gibson et al., Digital Compression for Multimedia, “Chapter 7: Frequency Domain Coding,” Morgan Kaufman Publishers, Inc., pp. 227–262 (1998); U.S. Pat. No. 6,115,689 to Malvar; H. S. Malvar, Signal Processing with Lapped Transforms, Artech House, Norwood, Mass., 1992; or Seymour Schein, “The Modulated Lapped Transform, Its Time-Varying Forms, and Its Application to Audio Coding Standards,” IEEE Transactions on Speech and Audio Processing, Vol. 5, No. 4, pp. 359–66, July 1997.
[0014] In addition to the factors that determine objective audio quality, perceived audio quality also depends on how the human body processes audio information. For this reason, audio processing tools often process audio information according to an auditory model of human perception.
[0015] Typically, an auditory model considers the range of human hearing and critical bands. Humans can hear sounds ranging from roughly 20 Hz to 20 kHz, and are most sensitive to sounds in the 2–4 kHz range. The human nervous system integrates sub-ranges of frequencies. For this reason, an auditory model may organize and process audio information by 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. An auditory model typically incorporates other factors relating to physical or neural aspects of human perception of sound.
[0016] 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.
II. Controlling Rate and Quality of Audio Information
[0017] Different audio applications have different quality and bitrate requirements. Certain applications require constant quality over time for compressed audio information. Other applications require variable quality and bitrate. Still other applications require constant or relatively constant bitrate [collectively, “constant bitrate” or “CBR”]. One such CBR application is encoding audio for streaming over the Internet.
[0018] A CBR encoder outputs 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. For the CBR encoder 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.
[0019] While adjustment of quantization and audio quality is necessary at times to satisfy constant bitrate requirements, current 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, current CBR encoders often cause abrupt changes, which are more noticeable and objectionable than smooth changes.
[0020] Microsoft Corporation's Windows Media Audio version 7.0 [“WMA7”] includes an audio encoder that can be used to compress audio information for streaming at a constant bitrate. The WMA7 encoder uses a virtual buffer and rate control to handle variations in bitrate due to changes in the complexity of audio information.
[0021] 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.
[0022] 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.
[0023] 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.
[0024] 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.
[0025] 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.
[0026] Several international standards describe audio encoders that incorporate distortion and rate control. The Motion Picture Experts Group, Audio Layer 3 [“MP3”] and Motion Picture Experts Group 2, Advanced Audio Coding [“AAC”] standards each describe techniques for controlling distortion and bitrate of compressed audio information.
[0027] 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.
[0028] 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).
[0029] 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.
[0030] 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.
[0031] 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.
[0032] Although MP3 encoding has achieved widespread adoption, it is unsuitable for some applications (for example, real-time audio streaming at very low to mid bitrates) for several reasons. First, the nested quantization loops can be too time-consuming. Second, the nested quantization loops are designed for high quality applications, and do not work as well for lower bitrates which require the introduction of some audible distortion. Third, the MP3 control strategy assumes predictable rate-distortion characteristics in the audio (in which distortion decreases with the number of bits allocated), and does not address situations in which distortion increases with the number of bits allocated.
[0033] Other audio encoders use a combination of filtering and zero tree coding to jointly control quality and bitrate. 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).
[0034] While this strategy works for high quality, high complexity applications, it does not work as well for very low to mid-bitrate applications. Moreover, the strategy assumes predictable rate-distortion characteristics in the audio, and does not address situations in which distortion increases with the number of bits allocated.
[0035] 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); and Ribas-Corbera et al., “Rate Control in DCT Video Coding for Low-Delay Communications,” IEEE Trans Circuits and Systems for Video Technology, Vol. 9, No 1, (February 1999).
[0036] As one might expect given the importance of quality and rate control to encoder performance, the fields of quality and rate control for audio and video applications 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
[0037] The present invention relates to a strategy for jointly controlling the quality and bitrate of audio information. The control strategy regulates the bitrate of audio information while also reducing quality changes and smoothing quality changes over time. The joint quality and bitrate control strategy includes various techniques and tools, which can be used in combination or independently.
[0038] According to a first aspect of the control strategy, quantization of audio information in an audio encoder is based at least in part upon values of a target quality parameter, a target minimum-bits parameter, and a target maximum-bits parameter. For example, the target minimum- and maximum-bits parameters define a range of acceptable numbers of produced bits within which the audio encoder has freedom to satisfy the target quality parameter.
[0039] According to a second aspect of the control strategy, an audio encoder regulates quantization of audio information based at least in part upon the value of a complexity estimate reliability measure. For example, the complexity estimate reliability measure indicates how much weight the audio encoder should give to a measure of past or future complexity when regulating quantization of the audio information.
[0040] According to a third aspect of the control strategy, an audio encoder normalizes according to block size when computing the value of a control parameter for a variable-size block. For example, the audio encoder multiplies the value by the ratio of the maximum block size to the current block size, which provides continuity in the values for the control parameter from block to block despite changes in block size.
[0041] According to a fourth aspect of the control strategy, an audio encoder adjusts quantization of audio information using a bitrate control quantization loop following and outside of a quality control quantization loop. The de-linked quantization loops help the encoder quickly adjust quantization in view of quality and bitrate goals. For example, the audio encoder finds a quantization step size that satisfies quality criteria in the quality control loop. The audio encoder then finds a quantization step size that satisfies bitrate criteria in the bit-count control loop, starting the testing with the step size found in the quality control loop.
[0042] According to a fifth aspect of the control strategy, an audio encoder selects a quantization level (e.g., a quantization step size) in a way that accounts for non-monotonicity of quality measure as a function of quantization level. This helps the encoder avoid selection of inferior quantization levels.
[0043] According to a sixth aspect of the control strategy, an audio encoder uses interpolation rules for a quantization control loop or bit-count control loop to find a quantization level in the loop. The particular interpolation rules help the encoder quickly find a satisfactory quantization level.
[0044] According to a seventh aspect of the control strategy, an audio encoder filters a value of a control parameter. For example, the audio encoder lowpass filters the value as part of a sequence of previously computed values for the control parameter, which smoothes the sequence of values, thereby smoothing quality in the encoder.
[0045] According to a eighth aspect of the control strategy, an audio encoder corrects bias in a model by adjusting the value of a control parameter based at least in part upon current buffer fullness. This can help the audio encoder compensate for systematic mismatches between the model and this audio information being compressed.
[0046] Additional features and advantages of the invention will be made apparent from the following detailed description of an illustrative embodiment that proceeds with reference to the accompanying drawings.
Brief Description of the Drawings
[0047] FIG. 1 is a block diagram of a suitable computing environment in which the illustrative embodiment may be implemented.
[0048] FIG. 2 is a block diagram of a generalized audio encoder according to the illustrative embodiment.
[0049] FIG. 3 is a block diagram of a generalized audio decoder according to the illustrative embodiment.
[0050] FIG. 4 is a block diagram of a joint rate/quality controller according to the illustrative embodiment.
[0051] FIGS. 5 a and 5b are tables showing a non-linear function used in computing a value for a target maximum-bits parameter according to the illustrative embodiment.
[0052] FIG. 6 is a table showing a non-linear function used in computing a value for a target minimum-bits parameter according to the illustrative embodiment.
[0053] FIGS. 7 a and 7b are tables showing a non-linear function used in computing a value for a desired buffer fullness parameter according to the illustrative embodiment.
[0054] FIGS. 8 a and 8b are tables showing a non-linear function used in computing a value for a desired transition time parameter according to the illustrative embodiment.
[0055] FIG. 9 is a flowchart showing a technique for normalizing block size when computing values for a control parameter for a block according to the illustrative embodiment.
[0056] FIG. 10 is a block diagram of a quantization loop according to the illustrative embodiment.
[0057] FIG. 11 is a chart showing a trace of noise to excitation ratio as a function of quantization step size for a block according to the illustrative embodiment.
[0058] FIG. 12 is a chart showing a trace of number of bits produced as a function of quantization step size for a block according to the illustrative embodiment.
[0059] FIG. 13 is a flowchart showing a technique for controlling quality and bitrate in de-linked quantization loops according to the illustrative embodiment.
[0060] FIG. 14 is a flowchart showing a technique for computing a quantization step size in a quality control quantization loop according to the illustrative embodiment.
[0061] FIG. 15 is a flowchart showing a technique for computing a quantization step size in a bit-count control quantization loop according to the illustrative embodiment.
[0062] FIG. 16 is a table showing a non-linear function used in computing a value for a bias-corrected bit-count parameter according to the illustrative embodiment.
[0063] FIG. 17 is a flowchart showing a technique for correcting model bias by adjusting a value of a control parameter according to the illustrative embodiment.
[0064] FIG. 18 is a flowchart showing a technique for lowpass filtering a value of a control parameter according to the illustrative embodiment.
Detailed Description
[0065] The illustrative embodiment of the present invention is directed to an audio encoder that jointly controls the quality and bitrate of audio information. The audio encoder adjusts quantization of the audio information to satisfy constant or relatively constant bitrate [collectively, “constant bitrate”] requirements, while reducing unnecessary variations in quality and ensuring that any necessary variations in quality are smooth over time.
[0066] The audio encoder uses several techniques to control the quality and bitrate of audio information. 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.
[0067] In the illustrative embodiment, an audio encoder implements the various techniques of the joint quality and rate control strategy. 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.
[0068] The illustrative embodiment relates to a quality and bitrate control strategy for audio compression. In alternative embodiments, a video encoder applies one or more of the control strategy techniques to control the quality and bitrate of video information
I. Computing Environment
[0069] FIG. 1 illustrates a generalized example of a suitable computing environment (100) in which the illustrative embodiment may be implemented. The computing environment (100) 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.
[0070] With reference to FIG. 1 , the computing environment (100) includes at least one processing unit (110) and memory (120). In FIG. 1 , this most basic configuration (130) is included within a dashed line. The processing unit (110) 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 (120) 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 (120) stores software (180) implementing an audio encoder with joint rate/quality control.
[0071] A computing environment may have additional features. For example, the computing environment (100) includes storage (140), one or more input devices (150), one or more output devices (160), and one or more communication connections (170). An interconnection mechanism (not shown) such as a bus, controller, or network interconnects the components of the computing environment (100). Typically, operating system software (not shown) provides an operating environment for other software executing in the computing environment (100), and coordinates activities of the components of the computing environment (100).
[0072] The storage (140) 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 (100). The storage (140) stores instructions for the software (180) implementing the audio encoder with joint rate/quality control.
[0073] The input device(s) (150) 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 (100). For audio, the input device(s) (150) 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) (160) may be a display, printer, speaker, CD-writer, or another device that provides output from the computing environment (100).
[0074] The communication connection(s) (170) 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.
[0075] 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 (100), computer-readable media include memory (120), storage (140), communication media, and combinations of any of the above.
[0076] 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.
[0077] 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. Generalized Audio Encoder and Decoder
[0078] FIG. 2 is a block diagram of a generalized audio encoder (200). The encoder (200) adaptively adjusts quantization of an audio signal based upon quality and bitrate constraints. This helps ensure that variations in quality are smooth over time while maintaining constant bitrate output. FIG. 3 is a block diagram of a generalized audio decoder (300).
[0079] The relationships shown between modules within the encoder and decoder indicate the main flow of information in the encoder and decoder; other relationships are not shown for the sake of simplicity. Depending on implementation and the type of compression desired, modules of the encoder or decoder can be added, omitted, split into multiple modules, combined with other modules, and/or replaced with like modules. In alternative embodiments, an encoder with different modules and/or other configurations of modules control quality and bitrate of compressed audio information.
[0080] A. Generalized Audio Encoder
[0081] The generalized audio encoder (200) includes a frequency transformer (210), a multi-channel transformer (220), a perception modeler (230), a weighter (240), a quantizer (250), an entropy encoder (260), a rate/quality controller (270), and a bitstream multiplexer [“MUX”] (280).
[0082] The encoder (200) receives a time series of input audio samples (205) in a format such as one shown in Table 1. For input with multiple channels (e.g., stereo mode), the encoder (200) processes channels independently, and can work with jointly coded channels following the multi-channel transformer (220). The encoder (200) compresses the audio samples (205) and multiplexes information produced by the various modules of the encoder (200) to output a bitstream (295) in a format such as Windows Media Audio [“WMA”] or Advanced Streaming Format [“ASF”]. Alternatively, the encoder (200) works with other input and/or output formats.
[0083] The frequency transformer (210) receives the audio samples (205) and converts them into information in the frequency domain. The frequency transformer (210) splits the audio samples (205) 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 (205), 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, in part because frame header and side information is proportionally less than in small blocks. Blocks can overlap to reduce perceptible discontinuities between blocks that could otherwise be introduced by later quantization. The frequency transformer (210) outputs blocks of frequency coefficients to the multi-channel transformer (220) and outputs side information such as block sizes to the MUX (280). The frequency transformer (210) outputs both the frequency coefficients and the side information to the perception modeler (230).
[0084] In the illustrative embodiment, the frequency transformer (210) partitions a frame of audio input samples (305) into overlapping sub-frame blocks with time-varying size and applies a time-varying MLT to the sub-frame blocks. Possible sub-frame sizes include 256, 512, 1024, 2048, and 4096 samples. The MLT operates like a DCT modulated by a time window function, where the window function is time varying and depends on the sequence of sub-frame sizes. The MLT transforms a given overlapping block of samples x[n],0≦n<subframe_size into a block of frequency coefficients X[k],0≦k<subframe_size/2. The frequency transformer (210) also outputs estimates of the transient strengths of samples in the current and future frames to the rate/quality controller (270). Alternative embodiments use other varieties of MLT. In still other alternative embodiments, the frequency transformer (210) applies a DCT, FFT, or other type of modulated or non-modulated, overlapped or non-overlapped frequency transform, or use subband or wavelet coding.
[0085] For multi-channel audio, the multiple channels of frequency coefficients produced by the frequency transformer (210) often correlate. To exploit this correlation, the multi-channel transformer (220) can convert the multiple original, independently coded channels into jointly coded channels. For example, if the input is stereo mode, the multi-channel transformer (220) can convert the left and right channels into sum and difference channels:
[0086]
[0087] Or, the multi-channel transformer (220) can pass the left and right channels through as independently coded channels. More generally, for a number of input channels greater than one, the multi-channel transformer (220) passes original, independently coded channels through unchanged or converts the original channels into jointly coded channels. The decision to use independently or jointly coded channels can be predetermined, or the decision can be made adaptively on a block by block or other basis during encoding. The multi-channel transformer (220) produces side information to the MUX (280) indicating the channel mode used.
[0088] The perception modeler (230) models properties of the human auditory system to improve the quality of the reconstructed audio signal for a given bitrate. The perception modeler (230) computes the excitation pattern of a variable-size block of frequency coefficients. First, the perception modeler (230) normalizes the size and amplitude scale of the block. This enables subsequent temporal smearing and establishes a consistent scale for quality measures. Optionally, the perception modeler (230) attenuates the coefficients at certain frequencies to model the outer/middle ear transfer function. The perception modeler (230) computes the energy of the coefficients in the block and aggregates the energies by, for example, 25 critical bands. Alternatively, the perception modeler (230) uses another number of critical bands (e.g., 55 or 109). The frequency ranges for the critical bands are implementation-dependent, and numerous options are well known. For example, see ITU, Recommendation ITU-R BS 1387, Method for Objective Measurements of Perceived Audio Quality, 1998, the MP3 standard, or references mentioned therein. The perception modeler (230) processes the band energies to account for simultaneous and temporal masking. In alternative embodiments, the perception modeler (230) processes the audio information according to a different auditory model, such as one described or mentioned in ITU-R BS 1387 or the MP3 standard.
[0089] The weighter (240) generates weighting factors for a quantization matrix based upon the excitation pattern received from the perception modeler (230) and applies the weighting factors to the information received from the multi-channel transformer (220). The weighting factors include a weight for each of multiple quantization bands in the audio information. The quantization bands can be the same or different in number or position from the critical bands used elsewhere in the encoder (200). 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. In one implementation, the number of quantization bands varies according to block size; smaller blocks have fewer quantization bands than larger blocks. For example, blocks with 128 coefficients have 13 quantization bands, blocks with 256 coefficients have 15 quantization bands, up to 25 quantization bands for blocks with 2048 coefficients. In one implementation, the weighter (240) generates a set of weighting factors for each channel of multi-channel audio in independently coded channels, or generates a single set of weighting factors for jointly coded channels. In alternative embodiments, the weighter (240) generates the weighting factors from information other than or in addition to excitation patterns. Instead of applying the weighting factors, the weighter (240) can pass the weighting factors to the quantizer (250) for application in the quantizer (250).
[0090] The weighter (240) outputs weighted blocks of coefficients to the quantizer (250) and outputs side information such as the set of weighting factors to the MUX (280). The weighter (240) can also output the weighting factors to the rate/quality controller (270) or other modules in the encoder (200). 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 coefficients. If audio information in a band of a block is completely eliminated for some reason (e.g., noise substitution or band truncation), the encoder (200) may be able to further improve the compression of the quantization matrix for the block.
[0091] The quantizer (250) quantizes the output of the weighter (240), producing quantized coefficients to the entropy encoder (260) and side information including quantization step size to the MUX (280). Quantization introduces irreversible loss of information, but also allows the encoder (200) to regulate the quality and bitrate of the output bitstream (295) in conjunction with the rate/quality controller (270), as described below. In FIG. 2 , the quantizer (250) is an adaptive, uniform, scalar quantizer. The quantizer (250) 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 the bitrate of the entropy encoder (260) output. In alternative embodiments, the quantizer is a non-uniform quantizer, a vector quantizer, and/or a non-adaptive quantizer.
[0092] The entropy encoder (260) losslessly compresses quantized coefficients received from the quantizer (250). For example, the entropy encoder (260) uses multi-level run length coding, variable-to-variable length coding, run length coding, Huffman coding, dictionary coding, arithmetic coding, LZ coding, a combination of the above, or some other entropy encoding technique. The entropy encoder (260) can compute the number of bits spent encoding audio information and pass this information to the rate/quality controller (270).
[0093] The rate/quality controller (270) works with the quantizer (250) to regulate the bitrate and quality of the output of the encoder (200). The rate/quality controller (270) receives information from other modules of the encoder (200). As described below, in one implementation, the rate/quality controller (270) receives 1) transient strengths from the frequency transformer (210), 2) sampling rate, block size information, and the excitation pattern of original audio information from the perception modeler (230), 3) weighting factors from the weighter (240), 4) a block of quantized audio information in some form (e.g., quantized, reconstructed), 5) bit count information for the block; and 6) buffer status information from the MUX (280). The rate/quality controller (270) can include an inverse quantizer, an inverse weighter, an inverse multi-channel transformer, and potentially other modules to reconstruct the audio information or compute information about the block.
[0094] The rate/quality controller (270) processes the received information to determine a desired quantization step size given current conditions. The rate/quality controller (270) outputs the quantization step size to the quantizer (250). The rate/quality controller (270) measures the quality of a block of reconstructed audio information as quantized with the quantization step size. Using the measured quality as well as bitrate information, the rate/quality controller (270) adjusts the quantization step size with the goal of satisfying bitrate and quality constraints, both instantaneous and long-term. For example, for a streaming audio application, the rate/quality controller (270) sets the quantization step size for a block such that 1) virtual buffer underflow and overflow are avoided, 2) bitrate over a certain period is relatively constant, and 3) any necessary changes to quality are smooth. In alternative embodiments, the rate/quality controller (270) works with different or additional information, or applies different techniques to regulate quality and/or bitrate.
[0095] The encoder (200) can apply noise substitution, band truncation, and/or multi-channel rematrixing to a block of audio information. At low and mid-bitrates, the audio encoder (200) 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 (200) can completely eliminate the coefficients in certain (usually higher frequency) bands to improve the overall quality in the remaining bands. In multi-channel rematrixing, for low bitrate, multi-channel audio in jointly coded channels, the encoder (200) can suppress information in certain channels (e.g., the difference channel) to improve the quality of the remaining channel(s) (e.g., the sum channel).
[0096] The MUX (280) multiplexes the side information received from the other modules of the audio encoder (200) along with the entropy encoded information received from the entropy encoder (260). The MUX (280) outputs the information in WMA format or another format that an audio decoder recognizes.
[0097] The MUX (280) includes a virtual buffer that stores the bitstream (295) to be output by the encoder (200). The virtual buffer stores a pre-determined duration of audio information (e.g., 5 seconds for streaming audio) in order to smooth over short-term fluctuations in bitrate due to complexity changes in the audio. The virtual buffer then outputs data at a constant bitrate. The current fullness of the buffer, the rate of change of fullness of the buffer, and other characteristics of the buffer can be used by the rate/quality controller (270) to regulate quality and/or bitrate.
[0098] B. Generalized Audio Decoder
[0099] With reference to FIG. 3 , the generalized audio decoder (300) includes a bitstream demultiplexer [“DEMUX”] (310), an entropy decoder (320), an inverse quantizer (330), a noise generator (340), an inverse weighter (350), an inverse multi-channel transformer (360), and an inverse frequency transformer (370). The decoder (300) is simpler than the encoder (200) because the decoder (300) does not include modules for rate/quality control.
[0100] The decoder (300) receives a bitstream (305) of compressed audio information in WMA format or another format. The bitstream (305) includes entropy encoded information as well as side information from which the decoder (300) reconstructs audio samples (395). For audio information with multiple channels, the decoder (300) processes each channel independently, and can work with jointly coded channels before the inverse multi-channel transformer (360).
[0101] The DEMUX (310) parses information in the bitstream (305) and sends information to the modules of the decoder (300). The DEMUX (310) includes one or more buffers to compensate for short-term variations in bitrate due to fluctuations in complexity of the audio, network jitter, and/or other factors.
[0102] The entropy decoder (320) losslessly decompresses entropy codes received from the DEMUX (310), producing quantized frequency coefficients. The entropy decoder (320) typically applies the inverse of the entropy encoding technique used in the encoder.
[0103] The inverse quantizer (330) receives a quantization step size from the DEMUX (310) and receives quantized frequency coefficients from the entropy decoder (320). The inverse quantizer (330) applies the quantization step size to the quantized frequency coefficients to partially reconstruct the frequency coefficients. In alternative embodiments, the inverse quantizer applies the inverse of some other quantization technique used in the encoder.
[0104] From the DEMUX (310), the noise generator (340) receives information indicating which bands in a block are noise substituted as well as any parameters for the form of the noise. The noise generator (340) generates the patterns for the indicated bands, and passes the information to the inverse weighter (350).
[0105] The inverse weighter (350) receives the weighting factors from the DEMUX (310), patterns for any noise-substituted bands from the noise generator (340), and the partially reconstructed frequency coefficients from the inverse quantizer (330). As necessary, the inverse weighter (350) decompresses the weighting factors. The inverse weighter (350) applies the weighting factors to the partially reconstructed frequency coefficients for bands that have not been noise substituted. The inverse weighter (350) then adds in the noise patterns received from the noise generator (340) for the noise-substituted bands.
[0106] The inverse multi-channel transformer (360) receives the reconstructed frequency coefficients from the inverse weighter (350) and channel mode information from the DEMUX (310). If multi-channel audio is in independently coded channels, the inverse multi-channel transformer (360) passes the channels through. If multi-channel audio is in jointly coded channels, the inverse multi-channel transformer (360) converts the audio into independently coded channels.
[0107] The inverse frequency transformer (370) receives the frequency coefficients output by the multi-channel transformer (360) as well as side information such as block sizes from the DEMUX (310). The inverse frequency transformer (370) applies the inverse of the frequency transform used in the encoder and outputs blocks of reconstructed audio samples (395).
III. Jointly Controlling Quality and Bitrate of Audio Information
[0108] According to the illustrative embodiment, an audio encoder produces a compressed bitstream of audio information for streaming over a network at a constant bitrate. By controlling both the quality of the reconstructed audio information and the bitrate of the compressed audio information, the audio encoder reduces unnecessary quality changes and ensures that any necessary quality changes are smooth as the encoder satisfies the constant bitrate requirement. For example, when the encoder encounters a prolonged period of complex audio information, the encoder may need to decrease quality. At such times, the encoder smoothes the transition between qualities to make such transitions less objectionable and noticeable.
[0109] FIG. 4 shows a joint rate/quality controller (400). The controller (400) can be realized within the audio encoder (200) shown in FIG. 2 or, alternatively, within another audio encoder
[0110] The joint rate/quality controller (400) includes a future complexity estimator (410), a target setter (430), a quantization loop (450), and a model parameter updater (470). FIG. 4 shows the main flow of information into, out of, and within the controller (400); other relationships are not shown for the sake of simplicity. Depending on implementation, modules of the controller (400) can be added, omitted, split into multiple modules, combined with other modules, and/or replaced with like modules. In alternative embodiments, a controller with different modules and/or other configurations of modules controls quality and/or bitrate using one or more of the following techniques.
[0111] The controller (400) receives information about the audio signal, a current block of audio information, past blocks, and future blocks. Using this information, the controller (400) sets a quality target and determines bitrate requirements for the current block. The controller (400) regulates quantization of the current block with the goal of satisfying the quality target and the bitrate requirements. The bitrate requirements incorporate fullness constraints of the virtual buffer (490), which are necessary to make the compressed audio information streamable at a constant bitrate.
[0112] With reference to FIG. 4 , a summary of each of the modules of the controller (400) follows. The details of each of the modules of the controller (400) are described below.
[0113] Several modules of the controller (400) compute or use a complexity measure which roughly indicates the coding complexity for a block, frame, or other window of audio information. In some modules, complexity relates to the strengths of transients in the signal. In other modules, complexity is the product of the bits produced by coding a block and the quality achieved for the block, normalized to the largest block size. In general, modules of the controller (400) compute complexity based upon available information, and can use formulas for complexity other than or in addition to the ones mentioned above.
[0114] Several modules of the controller (400) compute or use a quality measure for a block that indicates the perceptual quality for the block. Typically, the quality measure is expressed in terms of Noise-to-Excitation Ratio [“NER”]. In some modules, actual NER values are computed from noise patterns and excitation patterns for blocks. In other modules, suitable NER values for blocks are estimated based upon complexity, bitrate, and other factors. For additional detail about NER, see the related U.S. patent application entitled, “Techniques for Measurement of Perceptual Audio Quality,” referenced above. In general, modules of the controller (400) compute quality measures based upon available information, and can use techniques other than NER to measure objective or perceptual quality, for example, a technique described or mentioned in ITU-R BS 1387.
[0115] The future complexity estimator (410) receives information about transient positions and strengths for the current frame as well as a few future frames. The future complexity estimator (410) estimates the complexity of the current and future frames, and provides a complexity estimates αfuture to the target setter (430).
[0116] The target setter (430) sets bit-count and quality targets. In addition to the future complexity estimate, the target setter (430) receives information about the size of the current block, maximum block size, sampling rate for the audio signal, and average bitrate for the compressed audio information. From the model parameter updater (470), the target setter (430) receives a complexity estimate αpastfilt for past blocks and noise measures γpastfilt and γfuturefilt for the past and future complexity estimates. From the virtual buffer (490), the target setter (430) receives a measure of current buffer fullness BF. From all of this information, the target setter (430) computes minimum-bits bmin and maximum-bits bmax for the block as well as a target quality in terms of target NER [“NERtarget”] for the block. The target setter (430) sends the parameters bmin, bmax, and NERtarget for the block to the quantization loop (450).
[0117] The quantization loop (450) tries different quantization step sizes to achieve the quality then bit-count targets. Modules of the quantization loop (450) receive the current block of audio information, apply the weighting factors to the current block (if the weighting factors have not already been applied), and iteratively select a quantization step size and apply it to the current block. After the quantization loop (450) finds a satisfactory quantization step size for the quality and bit-count targets, the quantization loop (450) outputs the total number of bits bachieved, header bits bheader, and achieved quality (in terms of NER) NERachieved for the current block. To the virtual buffer (490), the quantization loop (450) outputs the compressed audio information for the current block.
[0118] Using the parameters received from the quantization loop (450) and the measure of current buffer fullness BF, the model parameter updater (470) updates the past complexity estimate αpastfilt and the noise measures γpastfilt and γfuturefilt for the past and future complexity estimates. The target setter (430) uses the updated parameters when generating bit-count and quality targets for the next block of audio information to be compressed.
[0119] The virtual buffer (490) stores compressed audio information for streaming at a constant bitrate, so long as the virtual buffer neither underflows nor overflows. The virtual buffer (490) smoothes out local variations in bitrate due to fluctuations in the complexity/compressibility of the audio signal. This lets the encoder allocate more bits to more complex portions of the signal and allocate less bits to less complex portions of the signal, which reduces variations in quality over time while still providing output at the constant bitrate. The virtual buffer (490) provides information such as current buffer fullness BF to modules of the controller (400), which can then use the information to regulate quantization within quality and bitrate constraints.
[0120] A. Future Complexity Estimator
[0121] The future complexity estimator (410) estimates the complexities of the current and future frames in order to determine how many bits the encoder can responsibly spend encoding the current block. In general, if future audio information is complex, the encoder allocates fewer bits to the current block with increased quantization, saving the bits for the future. Conversely, if future audio information is simple, the encoder borrows bits from the future to get better quality for the current block with decreased quantization.
[0122] The most direct way to determine the complexity of the current and future audio information is to encode the audio information. The controller (400) typically lacks the computational resources to encode for this purpose, however, so the future complexity estimator (410) uses an indirect mechanism to estimate the complexity of the current and future audio information. The number of future frames for which the future complexity estimator (410) estimates complexity is flexible (e.g., 4, 8, 16), and can be pre-determined or adaptively adjusted.
[0123] A transient detection module analyzes incoming audio samples of the current and future frames to detect transients. The transients represent sudden changes in the audio signal, which the encoder typically encodes using blocks of smaller size for better temporal resolution. The transient detection module also determines the strengths of the transients.
[0124] In one implementation, the transient detection module is outside of the controller (400) and associated with a frequency transformer that adaptively uses time-varying block sizes. The transient detection module bandpass filters a frame of audio samples into one or more bands (e.g., low, middle, and high bands). The module squares the filtered values to determine power outputs of the bands. From the power output of each band, the module computes at each sample 1) a lowpass-filtered power output of the band and 2) a local power output (in a smaller window than the lowpass filter) at each sample for the bands. For each sample, the module then calculates in each band the ratio between the local power output and the lowpass-filtered power output. For a sample, if the ratio in any band exceeds the threshold for that band, the module marks the sample as a transient. For additional detail about the transient detection module of this implementation, see the related U.S. patent application entitled, “Adaptive Window-Size Selection in Transform Coding,” referenced above. Alternatively, the transient detection module is within the future complexity estimator (410).
[0125] The transient detection module computes the transient strength for each sample or only for samples marked as transients. The module can compute transient strength for a sample as the average of the ratios for the bands for the sample, the sum of the ratios, the maximum of the ratios, or some other linear or non-linear combination of the ratios. To compute transient strength for a frame, the module takes the average of the computed transient strengths for the samples of the frame or the samples following the current block in the frame. Or, the module can take the sum of the computed transient strengths, or some other linear or non-linear combination of the computed transient strengths. Rather than the module, the future complexity estimator (410) can compute transient strengths for frames from the transient strength information for samples.
[0126] From the transient strength information for the current and future frames, the future complexity estimator (410) computes a composite strength:
[0127]
CompositeStrength=eTS (4),
CompositeStrength=eTS (4),
[0128] where TransientStrength[Frame] is an array of the transient strengths for frames, and where μ and σ are implementation-dependent normalizing constants derived experimentally. In one implementation, μ is 0 and σ is the number of current and future frames in the summation (or the number of frames times the number of channels, if the controller (400) is processing multiple channels).
[0129] The future complexity estimator (410) next maps the composite strength to a complexity estimate using a control parameter βfilt received from the target parameter updater (470).
αfuture=βfilt·CompositeStrength (5).
αfuture=βfilt·CompositeStrength (5).
[0130] Based upon the actual results of recent encoding, the control parameter βfilt indicates the historical relationship between complexity estimates and composite strengths. Extrapolating from this historical relationship to the present, the future complexity estimator (410) maps the composite strength of the current and future frames to a complexity estimate αfuture. The target parameter updater (470) updates βfilt on a block-by-block basis, as described below.
[0131] In alternative embodiments, the future complexity estimator (410) uses a direct technique (i.e., actual encoding, and complexity equals the product of achieved bits and achieved quality) or a different indirect technique to determine the complexity of samples to be coded in the future, potentially using parameters other than or in addition to the parameters given above. For example, the future complexity estimator (410) uses transient strengths of windows of samples other than frames, uses a measure other than transient strength, or computes composite strength using a different formula (e.g., 2eTS instead of eTS, different TS).
[0132] B. Target Setter
[0133] The target setter (430) sets target quality and bit-count parameters for the controller (400). By using a target quality, the controller (400) reduces quality variation from block to block, while still staying within the bit-count parameters for the block. In one implementation, the target setter (430) computes a target quality parameter, a target minimum-bits parameter, and a target maximum-bits parameter. Alternatively, the target setter (430) computes target parameters other than or in addition to these parameters.
[0134] The target setter (430) computes the target quality and bit-count parameters from a variety of other control parameters. For some control parameters, the target setter (430) normalizes values for the control parameters according to current block size. This provides continuity in the values for the control parameters despite changes in transform block size.
[0135] 1. Target Bit-Count Parameters
[0136] The target setter (430) sets a target minimum-bits parameter and a target maximum-bits parameter for the current block. The target minimum-bits parameter helps avoid underflow of the virtual buffer (490) and also guards against deficiencies in quality measurement, particularly at low bitrates. The target maximum-bits parameter prevents overflow of the virtual buffer (490) and also constrains the number of bits the controller (400) can use when trying to meet a target quality. The target minimum- and maximum-bits parameters define a range of acceptable numbers of bits producable by the current block. The range usually gives the controller (400) some flexibility in finding a quantization level that meets the target quality while also satisfying bitrate constraints.
[0137] When setting the target minimum- and maximum-bits parameters, the target setter (430) considers buffer fullness and target average bit count for the current block. In one implementation, buffer fullness BF is measured in terms of fractional fullness of the virtual buffer (490), with the range of BF extending from 0 (empty) to 1 (full). Target average bit count for the current block (the average number of bits that can be spent encoding a block the size of the current block while maintaining constant bitrate) is:
[0138]
where Nc is the number of transform coefficients (per channel) to be coded in the current block, average_bitrate is the overall, constant bitrate in bits per second, and sample_rate is in samples per second. The target setter (430) also considers the number of transform coefficients (per channel) in the largest possible size block, Nmax.
where Nc is the number of transform coefficients (per channel) to be coded in the current block, average_bitrate is the overall, constant bitrate in bits per second, and sample_rate is in samples per second. The target setter (430) also considers the number of transform coefficients (per channel) in the largest possible size block, Nmax.
[0139] a. Target Maximum-Bits
[0140] The target maximum-bits parameter prevents buffer overflow and also prevents the target setter (430) from spending too many bits on the current block when trying to a meet a target quality for the current block. Typically, the target maximum-bits parameter is a loose bound.
[0141] In one implementation, the target maximum-bits parameter is:
bmax=bavg·ƒ1(BF, BFSP, Nc, Nmaxx) (7),
where BFSP indicates the sweet spot for fullness of the virtual buffer (490) and ƒ1 is a function that relates input parameters to a factor for mapping the target average bits for the current block to the target maximum-bits parameter for the current block. In most applications, the buffer sweet spot is the mid-point of the buffer (e.g., 0.5 in a range of 0 to 1), but other values are possible. The range of output values for the function ƒ1 in one implementation is from 1 to 10. Typically, the output value is high when BF is close to 0 or otherwise far below BFSP, low when BF is close to 1 or otherwise far above BFSP, and average when BF is close to BFSP. Also, output values are slightly larger when Nc is less than Nmax, compared to output values when Nc is equal to Nmax. The function ƒ1 can be implemented with one or more lookup tables.FIG. 5 a shows a lookup table for ƒ1 when BFSP≦0.5. FIG. 5 b shows a lookup table for ƒ1 for other values of BFSP. Alternatively, the function ƒ1 is a linear function or a different non-linear function of the input parameters listed above, more or fewer parameters, or other input parameters. The function ƒ1 can have a different range of output values or modify parameters other than or in addition to target average bits for the current block.
bmax=bavg·ƒ1(BF, BFSP, Nc, Nmaxx) (7),
where BFSP indicates the sweet spot for fullness of the virtual buffer (490) and ƒ1 is a function that relates input parameters to a factor for mapping the target average bits for the current block to the target maximum-bits parameter for the current block. In most applications, the buffer sweet spot is the mid-point of the buffer (e.g., 0.5 in a range of 0 to 1), but other values are possible. The range of output values for the function ƒ1 in one implementation is from 1 to 10. Typically, the output value is high when BF is close to 0 or otherwise far below BFSP, low when BF is close to 1 or otherwise far above BFSP, and average when BF is close to BFSP. Also, output values are slightly larger when Nc is less than Nmax, compared to output values when Nc is equal to Nmax. The function ƒ1 can be implemented with one or more lookup tables.
[0142] The target setter (430) makes an additional comparison against the true maximum number of bits still available in the buffer:
bmax=min(bmax, available_buffer_bits) (8).
bmax=min(bmax, available_buffer_bits) (8).
[0143] This comparison prevents the target maximum-bits parameter from allowing more bits for the current block than the virtual buffer (490) can store. Alternatively, the target setter (430) uses another technique to compute a target maximum-bits, potentially using parameters other than or in addition to the parameters given above.
[0144] b. Target Minimum-Bits
[0145] The target minimum-bits parameter helps guard against buffer underflow and also prevents the target setter (430) from over relying on the target quality parameter. Quality measurement in the controller (400) is not perfect. For example, the measure NER is a non-linear measure and is not completely reliable, particularly in low bitrate, high degradation situations. Similarly, other quality measures that are accurate for high bitrate might be inaccurate for lower bitrates, and vice versa. In view of these limitations, the target minimum-bits parameter sets a minimum bound for the number of bits spent encoding (and hence the quality of) the current block.
[0146] In one implementation, the target minimum-bits parameter is:
bmin=bavg·ƒ2(BF, BFSP, Nc, Nmax) (9),
where ƒ2 is a function that relates input parameters to a factor for mapping the target average bits to the target minimum-bits parameter for the current block. The range of output values for the function ƒ2 is from 0 to 1. Typically, output values are larger when Nc is much less than Nmax, compared to when Nc is close to or equal to Nmax. Also, output values are higher when BF is low than when BF is high, and average when BF is close to BFSP. The function ƒ2 can be implemented with one or more lookup tables.FIG. 6 shows a lookup table for ƒ2 which is independent of BFSP. Alternatively, the function ƒ2 is a linear function or a different non-linear function of the input parameters listed above, more or fewer parameters, or other input parameters. The function ƒ2 can have a different range of output values or modify parameters other than or in addition to target average bits for the current block.
bmin=bavg·ƒ2(BF, BFSP, Nc, Nmax) (9),
where ƒ2 is a function that relates input parameters to a factor for mapping the target average bits to the target minimum-bits parameter for the current block. The range of output values for the function ƒ2 is from 0 to 1. Typically, output values are larger when Nc is much less than Nmax, compared to when Nc is close to or equal to Nmax. Also, output values are higher when BF is low than when BF is high, and average when BF is close to BFSP. The function ƒ2 can be implemented with one or more lookup tables.
[0147] The target setter (430) makes an additional comparison against the true maximum number of bits still available in the buffer:
bmin=min(bmin, bmax) (10).
bmin=min(bmin, bmax) (10).
[0148] This comparison prevents the target minimum-bits parameter from allowing more bits for the current block than the virtual buffer (490) can store (if bmax=available_buffer_bits) or exceeding the target maximum-bits parameter (if bmax<available_buffer_bits ). Alternatively, the target setter (430) uses another technique to compute a target minimum-bits, potentially using parameters other than or in addition to the parameters given above.
[0149] 2. Target Quality Parameter
[0150] The target setter (430) sets a target quality for the current block. Use of the target quality reduces the number and degree of changes in quality from block to block in the encoder, which makes the transitions between different quality levels smoother and less noticeable.
[0151] In one implementation, the quantization loop (450) measures achieved quality in terms of NER (namely, NERachieved). Accordingly, the target setter (430) estimates a comparable quality measure (namely, NERtarget) for the current block based upon various available information, including the complexity of past audio information, an estimate of the complexity of future audio information, current buffer fullness, current block size. Specifically, the target setter (430) computes NERtarget as the ratio of a composite complexity estimate for the current block to a goal number of bits for the current block:
[0152]
[0153] where btmp, the goal number of bits, is defined in equation (14) or (15).
[0154] The series of NERtarget values determined this way are fairly smooth from block to block, ensuring smooth quality of reproduction while satisfying buffer constraints.
[0155] a. Goal Number of Bits
[0156] For the goal number of bits, the target setter (430) computes the desired trajectory of buffer fullness—the desired rate for buffer fullness to approach the buffer sweet spot. Specifically, the target setter (430) computes the desired buffer fullness BFdesired for the current time:
BFdesired=ƒ3(BF, BFSP) (12).
BFdesired=ƒ3(BF, BFSP) (12).
[0157] The function ƒ3 relates the current buffer fullness BF and the buffer sweet spot BFSP to the desired buffer fullness, which is typically somewhere between the current buffer fullness and the buffer sweet spot. The function ƒ3 can be implemented with one or more lookup tables. FIG. 7 a shows a lookup table for the function ƒ3 when BFSP≦0.5. FIG. 7 b shows a lookup table for the function ƒ3 for other values of BFSP. Alternatively, the function ƒ3 is a linear function or a different non-linear function of the input parameters listed above, more or fewer parameters, or other input parameters.
[0158] The target setter (430) also computes the number of frames Nb it should take to arrive at the desired buffer fullness:
Nb=ƒ4(BF, BFSP) (13),
where the function ƒ4 relates the current buffer fullness BF and the buffer sweet spot BFSP to the reaction time (in frames) that the controller should follow to reach the desired buffer fullness. The reaction time is set to be neither too fast (which could cause too much fluctuation between quality levels) nor too slow (which could cause unresponsiveness). In general, when the buffer fullness is within a safe zone around the buffer sweet spot, the target setter (430) focuses more on quality than bitrate and allows a longer reaction time. When the buffer fullness is near an extreme, the target setter (430) focuses more on bitrate than quality and requires a quicker reaction time. The range of output values for the function in one implementation of ƒ4 is from 6 to 60 frames. The function ƒ4 can be implemented with one or more lookup tables.FIG. 8 a shows a lookup table for the function ƒ4 when BFSP≦0.5. FIG. 8 b shows a lookup table for the function ƒ4 for other values of BFSP. Alternatively, the function ƒ4 is a linear function or a different non-linear function of the input parameters listed above, more or fewer parameters, or other input parameters. The function ƒ4 can have a different range of output values.
Nb=ƒ4(BF, BFSP) (13),
where the function ƒ4 relates the current buffer fullness BF and the buffer sweet spot BFSP to the reaction time (in frames) that the controller should follow to reach the desired buffer fullness. The reaction time is set to be neither too fast (which could cause too much fluctuation between quality levels) nor too slow (which could cause unresponsiveness). In general, when the buffer fullness is within a safe zone around the buffer sweet spot, the target setter (430) focuses more on quality than bitrate and allows a longer reaction time. When the buffer fullness is near an extreme, the target setter (430) focuses more on bitrate than quality and requires a quicker reaction time. The range of output values for the function in one implementation of ƒ4 is from 6 to 60 frames. The function ƒ4 can be implemented with one or more lookup tables.
[0159] The target setter (430) then computes the goal number of bits that should be spent encoding the current block while following the desired trajectory:
[0160]
where buffer_size is the size of the virtual buffer in bits. The target setter (430) normalizes the target average number of bits for the current block to the largest block size, and then further adjusts that amount according to the desired trajectory to reach the buffer sweet spot. By normalizing the target average number of bits for the current block to the largest block size, the target setter (430) makes estimation of the goal number of bits from block to block more continuous when the blocks have variable size.
where buffer_size is the size of the virtual buffer in bits. The target setter (430) normalizes the target average number of bits for the current block to the largest block size, and then further adjusts that amount according to the desired trajectory to reach the buffer sweet spot. By normalizing the target average number of bits for the current block to the largest block size, the target setter (430) makes estimation of the goal number of bits from block to block more continuous when the blocks have variable size.
[0161] In some embodiments, computation of the goal number of bits btmp ends here. In an alternative embodiment, the target setter (430) checks that the goal number of bits btmp for the current block has not fallen below the target minimum number of bits bmin for the current block, normalized to the largest block size:
[0162]
[0163] FIG. 9 shows a technique (900) for normalizing block size when computing values for a control parameter for variable-size blocks, in a broader context than the target setter (430) of FIG. 4 . A tool such as an audio encoder gets (910) a first variable-size block and determines (920) the size of the variable-size block. The variable-size block is, for example, a variable-size transform block of frequency coefficients.
[0164] Next, the tool computes (930) a value of a control parameter for the block, where normalization compensates for variation in block size in the value of the control parameter. For example, the tool weights a value of a control parameter by the ratio between the maximum block size and the current block size. Thus, the influence of varying block sizes is reduced in the values of the control parameter from block to block. The control parameter can be a goal number of bits, a past complexity estimate parameter, or another control parameter.
[0165] If the tool determines (940) that there are no more blocks to compute values of the control parameter for, the technique ends. Otherwise, the tool gets (950) the next block and repeats the process. For the sake of simplicity, FIG. 9 does not show the various ways in which the technique (900) can be used in conjunction with other techniques in a rate/quality controller or encoder.
[0166] b. Composite Complexity Estimate
[0167] The target setter (430) also computes a composite complexity estimate for the current block:
[0168]
where αfuture is the future complexity estimate from the future complexity estimator (410) and αpastfilt is a past complexity measure. Although αfuture is not filtered per se, in one implementation it is computed as an average of transient strengths. The noise measures γpastfilt and γfuturefilt indicate the reliability of the past and future complexity parameters, respectively, where a value of 1 indicates complete unreliability and a value of 0 indicates complete reliability. The noise measures affect the weight given to past and future information in the composite complexity based upon the estimated reliabilities of the past and future complexity parameters. The parameters x and y are implementation-dependent factors that control the relative weights given to past and future complexity measures, aside from the reliabilities of those measures. In one implementation, the parameters x and y are derived experimentally and given equal values. The denominator of equation 15 can include an additional small value to guard against division by zero.
where αfuture is the future complexity estimate from the future complexity estimator (410) and αpastfilt is a past complexity measure. Although αfuture is not filtered per se, in one implementation it is computed as an average of transient strengths. The noise measures γpastfilt and γfuturefilt indicate the reliability of the past and future complexity parameters, respectively, where a value of 1 indicates complete unreliability and a value of 0 indicates complete reliability. The noise measures affect the weight given to past and future information in the composite complexity based upon the estimated reliabilities of the past and future complexity parameters. The parameters x and y are implementation-dependent factors that control the relative weights given to past and future complexity measures, aside from the reliabilities of those measures. In one implementation, the parameters x and y are derived experimentally and given equal values. The denominator of equation 15 can include an additional small value to guard against division by zero.
[0169] Alternatively, the target setter (430) uses another technique to compute a composite complexity estimate, goal number of bits, and/or target quality for the current block, potentially using parameters other than or in addition to the parameters given above.
[0170] C. Quantization Loop
[0171] The main goal of the quantization loop (450) is to achieve the target quality and bit-count parameters. A secondary goal is to satisfy these parameters in as few iterations as possible.
[0172] FIG. 10 shows a diagram of a quantization loop (450). The quantization loop (450) includes a target achiever (1010) and one or more test modules (1020) (or calls to test modules (1020)) for testing candidate quantization step sizes. The quantization loop (450) receives the parameters NERtarget, bmin, and bmax as well as a block of frequency coefficients. The quantization loop (450) tries various quantization step sizes for the block until all target parameters are met or the encoder determines that all target parameters cannot be simultaneously satisfied. The quantization loop (450) then outputs the coded block of frequency coefficients as well as parameters for the achieved quality (NERachieved), achieved bits (bachieved), and header bits (bheader) for the block.
[0173] 1. Test Modules
[0174] One or more of the test modules (1020) receive a test step size st from the target achiever (1010) and apply the test step size to a block of frequency coefficients. The block was previously frequency transformed and, optionally, multi-channel transformed for multi-channel audio. If the block has not been weighted by its quantization matrix, one of the test modules (1020) applies the quantization matrix to the block before quantization with the test step size.
[0175] One or more of the test modules (1020) measure the result. For example, depending on the stage of the quantization loop (450), different test modules (1020) measure the quality (NERachieved) of a reconstructed version of the frequency coefficients or count the bits spent entropy encoding the quantized block of frequency coefficients (bachieved).
[0176] The test modules (1020) include or incorporate calls to: 1) a quantizer for applying the test step size (and, optionally, the quantization matrix) to the block of frequency coefficients; 2) an entropy encoder for entropy encoding the quantized frequency coefficients, adding header information, and counting the bits spent on the block; 3) one or reconstruction modules (e.g., inverse quantizer, inverse weighter, inverse multi-channel transformer) for reconstructing quantized frequency coefficients into a form suitable for quality measurement; and 4) a quality measurement module for measuring the perceptual quality (NER) of reconstructed audio information. The quality measurement module also takes as input the original frequency coefficients. Not all test modules (1020) are needed in every measurement operation. For example, the entropy-encoder is not needed for quality measurement, nor are the reconstruction modules or quality measurement module needed to evaluate bitrate.
[0177] 2. Target Achiever
[0178] The target achiever (1010) selects a test step size and determines whether the results for the test step size satisfy target quality and/or bit-count parameters. If not, the target achiever (1010) selects a new test step size for another iteration.
[0179] Typically, the target achiever (1010) finds a quantization step size that satisfies both target quality and target bit-count constraints. In rare cases, however, the target achiever (1010) cannot find such a quantization step size, and the target achiever (1010) satisfies the bit-count targets but not the quality target. The target setter (1010) addresses this complication by de-linking a quality control quantization loop and a bit-count control quantization loop.
[0180] Another complication for the target achiever (1010) is that measured quality is not necessarily a monotonic function of quantization step size, due to limitations of the rate/quality model. For example, FIG. 11 shows a trace (1100) of NERachieved as a function of quantization step size for a block of frequency coefficients. For most quantization step sizes, NER increases (i.e., perceived quality worsens) as quantization step size increases. For certain step sizes, however, NER decreases (i.e., perceived quality improves) as quantization step size increases. To address this complication, the target setter (1010) checks for non-monotonicity and judiciously selects step sizes and search ranges in the quality control quantization loop.
[0181] For comparison, FIG. 12 shows a trace (1200) of bachieved as a function of quantization step size for the block of frequency coefficients. Bits generated for the block is a monotonically decreasing function with increasing quantization step size; bachieved for the block always decreases or stays the same as step size increases.
[0182] 3. De-Linked Quantization Loops
[0183] The controller (400) attempts to satisfy the target quality and bit-count constraints using de-linked quantization loops. Each iteration of one of the de-linked quantization loops involves the target achiever (1010) and one or more of the test modules (1020). FIG. 13 shows a technique (1300) for determining a quantization step size in a bit-count control quantization loop following and de-linked from a quality control quantization loop.
[0184] The controller (400) first computes (1310) a quantization step size in a quality control quantization loop. In the quality control loop, the controller (400) tests step sizes until it finds one (SNER) that satisfies the target quality constraint. An example of a quality control quantization loop is described below.
[0185] The controller (400) then computes (1320) a quantization step size in a bit-count control quantization loop. In the bit-count control loop, the controller (400) first tests the step size (SNER) found in the quality control loop against the target-bit (minimum- and maximum-bit) constraints. If the target-bit constraints are satisfied, the bit-count control loop ends (sfinal=sNER). Otherwise, the controller (400) tests other step sizes until it finds one that satisfies the bit-count constraints. An example of a bit-count control quantization loop is described below.
[0186] In most cases, the quantization step size that satisfies the target quality constraint also satisfies the target bit-count constraints. This is especially true if the target bit-count constraints define a wide range of acceptable bits produced, as is common with target minimum- and maximum-bits parameters.
[0187] In rare cases, the quantization step size that satisfies the target quality constraint does not also satisfy the target-bit constraints. In such cases, the bit-count control loop continues to search for a quantization step size that satisfies the target-bit constraints, without additional processing overhead of the quality control loop.
[0188] The output of the de-linked quantization loops includes the achieved quality (NERachieved) and achieved bits (bachieved) for the block as quantized with the final quantization step size sfinal.
[0189] a. Quality Control Quantization Loop
[0190] FIG. 14 shows a technique (1400) for an exemplary quality control quantization loop in an encoder. In the quality control loop, the encoder addresses non-monotonicity of quality as a function of step size when selecting step sizes and search ranges.
[0191] The encoder first initializes the quality control loop. The encoder clears (1410) an array that stores pairs of step sizes and corresponding achieved NER measures (i.e., an [s,NER] array).
[0192] The encoder selects (1412) an initial step size st. In one implementation, the encoder selects (1412) the initial step size based upon the final step size of the previous block as well as the energies and target qualities of the current and previous blocks. For example, starting from the final step size of the previous block, the encoder adjusts the initial step size based upon the relative energies and target qualities of the current and previous blocks.
[0193] The encoder then selects (1414) an initial bracket [sl, sh] for a search range for step sizes. In one implementation, the initial bracket is based upon the initial step size and the overall limits on allowable step sizes. For example, the initial bracket is centered at the initial step size, extends upward to the step size nearest to 1.25·st, and extends downward to the step size nearest to 0.75·st, but not past the limits of allowable step sizes.
[0194] The encoder next quantizes (1420) the block with the step size st. For example, the encoder quantizes each frequency coefficient of a block by a uniform, scalar quantization step size.
[0195] In order to evaluate the achieved quality given the step size st, the encoder reconstructs (1430) the block. For example, the encoder applies an inverse quantization, inverse weighting, and inverse multi-channel transformation. The encoder then measures (1440) the achieved NER given the step size st (i.e., NERt).
[0196] The encoder evaluates (1450) the acceptability of the achieved quality NERt for the step size st in comparison to the target quality measure NERtarget. If the achieved quality is acceptable, the encoder sets (1490) the final step size for the quality control loop equal to the test step size (i.e., sNER=st). In one implementation, the encoder evaluates (1450) the acceptability of the achieved quality by checking whether it falls within a tolerance range around the target quality:
|NERtarget−NERt|≦ToleranceNER·NERtarget (17),
where ToleranceNER is a pre-defined or adaptive factor that defines the tolerance range around the target quality measure. In one implementation, ToleranceNER is 0.05, so the NERt is acceptable if it is within ±5% of NERtarget.
|NERtarget−NERt|≦ToleranceNER·NERtarget (17),
where ToleranceNER is a pre-defined or adaptive factor that defines the tolerance range around the target quality measure. In one implementation, ToleranceNER is 0.05, so the NERt is acceptable if it is within ±5% of NERtarget.
[0197] If the achieved quality for the test step size is not acceptable, the encoder records (1460) the pair [st, NERt] in the [s, NER] array. The pair [st, NERt] represents a point on a trajectory of NER as a function of quantization step size. The encoder checks (1462) for non-monotonicity in the recorded pairs in the [s, NER] array. For example, the encoder checks that NER does not decrease with any increase between step sizes. If a particular trajectory point has larger NER at a lower step size than another point on the trajectory, the encoder detects non-monotonicity and marks the particular trajectory point as inferior so that the point is not selected as a final step size.
[0198] If the trajectory is monotonic, the encoder updates (1470) the bracket [sl,sh] to be the sub-bracket [sl,st] or [st,sh], depending on the relation of NERt to the target quality. In general, if NERt is higher (worse quality) than NERtarget, the encoder selects the sub-bracket [sl,st] so that the next st is lower, and vice versa. An exception to this rule applies if the encoder determines that the final step size is outside the bracket [sl,sh]. If NER at the lowest step size in the bracket is still higher than NERtarget, the encoder slides the bracket [sl,sh] by updating it to be [sl−x,sl, ], where x is an implementation-dependent constant. In one implementation, x is 1 or 2. Similarly, if NER at the highest step size in the bracket is still lower (better quality) than NERtarget, the bracket [sl,sh] is updated to be [sh,sh+x].
[0199] If the trajectory is non-monotonic, the encoder does not update the bracket, but instead selects the next step size from within the old bracket as described below.
[0200] If the bracket was updated, the encoder checks (1472) for non-monotonicity in the updated bracket. For example, the encoder checks the recorded [s, NER] points for the updated bracket.
[0201] The encoder next adjusts (1480) the step size st for the next iteration of the quality control loop. The adjustment technique differs depending on the monotonicity of the bracket, how many points of the bracket are known, and whether any endpoints are marked as inferior points. By switching between adjustment techniques, the encoder finds a satisfactory step size faster than with methods such as binary search, while also accounting for non-monotonicity in quality as a function of step size.
[0202] If all the step sizes in the range [sl,sh] have been tested, the encoder selects one of the step sizes as the final step size SNER for the quality control loop. For example, the encoder selects the step size with NER closest to NERtarget.
[0203] Otherwise, the encoder selects the next step size st from within the range [sl,sh]. This process is different depending on the monotonicity of the bracket.
[0204] If the trajectory of the bracket is monotonic, and sl or sh is untested or marked inferior, the encoder selects the midpoint of the bracket as the next test step size:
[0205]
[0206] Otherwise, if the trajectory of the bracket is monotonic, and both sl and sh have been tested and are not marked inferior, the encoder estimates that the step size sNER lies within the bracket [sl,sh]. The encoder selects the next test step size st according to an interpolation rule using [sl, NERl] and [sh,NERh] as data points. In one implementation, the interpolation rule assumes a linear relation between log 10 NER and 10−s/20 (with a negative slope) for points between [sl, NERl] and [sh, NERh]. The encoder plots NERtarget on this estimated relation to find the next test step size st.
[0207] If the trajectory is non-monotonic, the encoder selects as the next test step size st one of the step sizes yet to be tested in the bracket [sl,sh]. For example, for a first sub-range between sl and an inferior point and a second sub-range between the inferior point and sh, the encoder selects a trajectory point in a sub-range that the encoder knows or estimates to span the target quality. If the encoder knows or estimates that both sub-ranges span the target quality, the encoder selects a trajectory point in the higher sub-range.
[0208] Alternatively, the encoder uses a different quality control quantization loop, for example, one with different data structures, a quality measure other than NER, different rules for evaluating acceptability, different step size selection rules, and/or different bracket updating rules.
[0209] b. Bit-Count Control Quantization Loop
[0210] FIG. 15 shows a technique (1500) for an exemplary bit-count control quantization loop in an encoder. The bit-count control loop is simpler than the quality control loop because bit count is a monotonically decreasing function of increasing quantization step size, and the encoder need not check for non-monotonicity. Another major difference between the bit-count control loop and the quality control loop is that the bit-count control loop does not include reconstruction/quality measurement, but instead includes entropy encoding/bit counting. In practice, the quality control loop usually includes more iterations than the bit-count control loop (especially for wider ranges of acceptable bit counts) and the final step size SNER of the quality control loop is acceptable or close to an acceptable step size in the bit-count control loop.
[0211] The encoder first initializes the bit-count control loop. The encoder clears (1510) an array that stores pairs of step sizes and corresponding achieved bit-count measures (i.e., an [s,b] array). The encoder selects (1512) an initial step size st for the bit-count loop to be the final step size SNER of the quality control loop.
[0212] The encoder then selects (1514) an initial bracket [sl,sh] for a search range for step sizes. In one implementation, the initial bracket [sl,sh] is based upon the initial step size and the overall limits on allowable step sizes. For example, the initial bracket is centered at the initial step size and extends outward for two step sizes up and down, but not past the limits of allowable step sizes.
[0213] The encoder next quantizes (1520) the block with the step size st. For example, the encoder quantizes each frequency coefficient of a block by a uniform, scalar quantization step size. Alternatively, for the first iteration of the bit-count control loop, the encoder uses already quantized data from the final iteration of the quality control loop.
[0214] Before measuring the bits spent encoding the block given the step size st, the encoder entropy encodes (1530) the block. For example, the encoder applies a run-level Huffman coding and/or another entropy encoding technique to the quantized frequency coefficients. The encoder then counts (1540) the number of produced bits, given the test step size st (i.e., bt).
[0215] The encoder evaluates (1550) the acceptability of the produced bit count bt for the step size st in comparison to each of the target-bits parameters. If the produced bits satisfy target-bit constraints, the encoder sets (1590) the final step size for the bit-count control loop equal to the test step size (i.e., sfinal=st). In one implementation, the encoder evaluates (1550) the acceptability of the produced bit count bt by checking whether it satisfies the target minimum-bits parameter bmin and the target maximum-bits parameter bmax:
bt≧bmin (19),
bt≦bmax (20).
bt≧bmin (19),
bt≦bmax (20).
[0216] Satisfaction of the target maximum-bits parameter bmax is a necessary condition to guard against buffer overflow. Satisfaction of the target minimum-bits parameter bmin may not be possible, however, for a block such as a silence block. In such cases, if the step size cannot be lowered anymore, the lowest step size is accepted.
[0217] If the produced bit count for the test step size is not acceptable, the encoder records (1560) the pair [st,bt] in the [s,b] array. The pair [st,bt] represents a point on a trajectory of bit count as a function of quantization step size.
[0218] The encoder updates (1570) the bracket [sl,sh] to be the sub-bracket [sl,st] or [st,sh], depending on which of the target-bits parameters bt fails to satisfy. If bt is higher than bmax, the encoder selects the sub-bracket [st,sh] so that the next st is higher, and if bt is lower than bmin, the encoder selects the sub-bracket [sl,st] so that the next st is lower.
[0219] An exception to this rule applies if the encoder determines that the final step size is outside the bracket [sl,sh]. If the produced bit count at the lowest step size in the bracket is lower than bmin, the encoder slides the bracket [sl, sh] by updating it to be [sl−x,sl], where x is an implementation-dependent constant. In one implementation, x is 1 or 2. Similarly, if the produced bit count at the highest step size in the bracket is higher than bmax, the encoder slides the bracket [sl,sh] is updated to be [sh,sh+x]. This exception to the bracket-updating rule is more likely for small initial bracket sizes.
[0220] The encoder adjusts (1580) the step size st for the next iteration of the bit-count control loop. The adjustment technique differs depending upon how many points of the bracket are known. By switching between adjustment techniques, the encoder finds a satisfactory step size faster than with methods such as binary search.
[0221] If all the step sizes in the range [sl,sh] have been tested, the encoder selects one of the step sizes as the final step size sfinal for the bit-count control loop. For example, the encoder selects the step size with corresponding bit count closest to being within the range of acceptable bit counts.
[0222] Otherwise, the encoder selects the next step size st from within the range [sl,sh]. If sl or sh is untested, the encoder selects the midpoint of the bracket as the next test step size:
[0223]
[0224] Otherwise, both sl and sh have been tested, and the encoder estimates that the final step size lies within the bracket [sl,sh]. The encoder selects the next test step size st according to an interpolation rule using [sl,bl] and [sh, bh] as data points. In one implementation, the interpolation rule assumes a linear relation between bit count and 10−s/20 for points between [sl, bh] and [sh,bh]. The encoder plots a bit count that satisfies the target-bits parameters on this estimated relation to find the next test step size st.
[0225] Alternatively, the encoder uses a different bit-count control quantization loop, for example, one with different data structures, different rules for evaluating acceptability, different step size selection rules, and/or different bracket updating rules.
[0226] D. Model Updater
[0227] The model parameter updater (470) tracks several control parameters used in the controller (400). The model parameter updater (470) updates certain control parameters from block to block, improving the smoothness of quality in the encoder. In addition, the model parameter updater (470) detects and corrects systematic mismatches between the model used by the controller (400) and the audio information being compressed, which prevents the accumulation of errors in the controller (400).
[0228] The model parameter updater (470) receives various control parameters for the current block, including: the total number of bits bachieved spent encoding the block as quantized by the final step size of the quantization loop, the total number of header bits bheader, the final achieved quality NERachieved, and the number of transform coefficients (per channel) Nc. The model parameter updater (470) also receives various control parameters indicating the current state of the encoder or encoder settings, including: current buffer fullness BF, buffer fullness sweet spot BFSP, and the number of transform coefficients (per channel) in the largest possible size block Nmax.
[0229] 1. Bias Correction
[0230] To reduce the impact of systematic mismatches between the rate/quality model used in the controller (400) and audio information being compressed, the model parameter updater (470) detects and corrects biases in the fullness of the virtual buffer (490). This prevents the accumulation of errors in the controller (400) that could otherwise hurt quality.
[0231] One possible source of systematic mismatches is the number of header bits bheader generated for the current block. The number of header bits does not relate to quantization step size in the same way as the number of payload bits (e.g., bits for frequency coefficients). Varying step size to satisfy quality and bit-count constraints can dramatically alter bachieved for a block, while altering bheader much less or not at all. At low bitrates in particular, the high proportion of bheader within bachieved can cause errors in target quality estimation. Accordingly, the encoder corrects bias in bachieved:
bcorrected=bachieved+ƒ5(BF, BFSP, bheader, bachieved) (22),
where the function ƒ5 relates the input parameters to an amount of bits by which bachieved should be corrected. In general, the bias correction relates to the difference between BFSP and BF, and to the proportion of bheader to bachieved. The function ƒ5 can be implemented with one or more lookup tables.FIG. 16 shows a lookup table for the function ƒ5 in which the amount of bias correction depends mainly on bheader if bheader is a large proportion of bachieved, and mainly on bachieved if bheader is a small proportion of bachieved. The direction of the bias correction depends on BF and BFSP. If BF is high, the bias correction is used for a downward adjustment of bachieved, and vice versa. If BF is close to BFSP, no adjustment of bachieved occurs. Alternatively, the function ƒ5 is a linear function or a different non-linear function of the input parameters listed above, more or fewer parameters, or other input parameters.
bcorrected=bachieved+ƒ5(BF, BFSP, bheader, bachieved) (22),
where the function ƒ5 relates the input parameters to an amount of bits by which bachieved should be corrected. In general, the bias correction relates to the difference between BFSP and BF, and to the proportion of bheader to bachieved. The function ƒ5 can be implemented with one or more lookup tables.
[0232] In alternative embodiments, the model parameter updater (470) corrects a source of systematic mismatches other than the number of header bits bheader generated for the current block.
[0233] FIG. 17 shows a technique (1700) for correcting model bias by adjusting the values of a control parameter from block to block, in a broader context than the model parameter updater (470) of FIG. 4 . A tool such as an audio encoder gets (1710) a first block and computes (1720) a value of a control parameter for the block. For example, the tool computes the number of bits achieved coding a block of frequency coefficients quantized at a particular step size.
[0234] The tool checks (1730) a (virtual) buffer. For example, the tool determines the current fullness of the buffer. The tool then corrects (1740) bias in the model, for example, using the current buffer fullness information and other information to adjust the value computed for the control parameter. Thus, the tool corrects model bias by adjusting the value of the control parameter based upon actual buffer feedback, where the adjustment tends to correct bias in the model for subsequent blocks.
[0235] If the tool determines (1750) that there are no more blocks to compute values of the control parameter for, the technique ends. Otherwise, the tool gets (1760) the next block and repeats the process. For the sake of simplicity, FIG. 17 does not show the various ways in which the technique (1700) can be used in conjunction with other techniques in a rate/quality controller or encoder.
[0236] 2. Control Parameter Updating
[0237] The target parameter updater (470) computes the complexity of the just encoded block, normalized to the maximum block size:
[0238]
[0239] The target parameter updater (470) filters the value for αpast as part of a sequence of zero or more previously computed values for αpast, producing a filtered past complexity measure value αpastfilt. In one implementation, the target parameter updater (470) uses a lowpass filter to smooth the values of αpast over time. Smoothing the values of αpast leads to smoother quality. (Outlier values for αpast can cause inaccurate estimation of target quality for subsequent blocks, resulting in unnecessary variations in the achieved quality of the subsequent blocks.)
[0240] The target parameter updater (470) then computes a past complexity noise measure γpast, which indicates the reliability of the past complexity measure. When used in computing another control parameter such as composite complexity of a block, the noise measure γpast can indicate how much weight should be given to the past complexity measure. In one implementation, the target parameter updater (470) computes the past complexity noise measure based upon the variation between the past complexity measure and the filtered past complexity measure:
[0241]
where ε is small value that prevents a divide by zero. The target parameter updater (470) then constrains the past complexity noise measure to be within 0 and 1:
γpast=max(0,min(1,γpast)) (25),
where 0 indicates a reliable past complexity measure and 1 indicates an unreliable past complexity measure.
where ε is small value that prevents a divide by zero. The target parameter updater (470) then constrains the past complexity noise measure to be within 0 and 1:
γpast=max(0,min(1,γpast)) (25),
where 0 indicates a reliable past complexity measure and 1 indicates an unreliable past complexity measure.
[0242] The target parameter updater (470) filters the value for the γpast as part of a sequence of zero or more previously computed γpast values, producing a filtered past complexity noise measure value γpastfilt. In one implementation, the target parameter updater (470) uses a lowpass filter to smooth the values of γpast over time. Smoothing the values of γpast leads to smoother quality by moderating outlier values that might otherwise cause unnecessary variations in the achieved quality of the subsequent blocks.
[0243] Having computed control parameters for the complexity of the just encoded block, the target parameter updater (470) next computes control parameters for modeling the complexity of future audio information. In general, the control parameters for modeling future complexity extrapolate past and current trends in the audio information into the future.
[0244] The target parameter updater (470) maps the relation between the past complexity measure and the composite strength for the block (which was estimated in the future complexity estimator (470)):
[0245]
[0246] The target parameter updater (470) filters the value for β as part of a sequence of zero or more previously computed values for β, producing a filtered mapped relation value βfilt. In one implementation, the target parameter updater (470) uses a lowpass filter to smooth the values of β over time, which leads to smoother quality by moderating outlier values. The future complexity estimator (470) uses βfilt to scale composite strength for a subsequent block into a future complexity measure for the subsequent block.
[0247] The target parameter updater (470) then computes a future complexity noise measure γfuture, which indicates the expected reliability of a future complexity measure. When used in computing another control parameter such as composite complexity of a block, the noise measure γfuture can indicate how much weight should be given to the future complexity measure. In one implementation, the target parameter updater (470) computes the future complexity noise measure based upon the variation between a prediction of the future complexity measure (here, the past complexity measure) and the filtered past complexity measure:
[0248]
where ε is small value that prevents a divide by zero. The target parameter updater (470) then constrains the future complexity noise measure to be within 0 and 1:
γfuture=max(0, min(1,γfuture)) (28),
where 0 indicates a reliable future complexity measure and 1 indicates an unreliable future complexity measure.
where ε is small value that prevents a divide by zero. The target parameter updater (470) then constrains the future complexity noise measure to be within 0 and 1:
γfuture=max(0, min(1,γfuture)) (28),
where 0 indicates a reliable future complexity measure and 1 indicates an unreliable future complexity measure.
[0249] The target parameter updater (470) filters the value for γfuture as part of a sequence of zero or more previously computed values for γfuture, producing a filtered future complexity noise measure γfuturefilt. In one implementation, the target parameter updater (470) uses a lowpass filter to smooth the values of γfuture over time, which leads to smoother quality by moderating outlier values for γfuture that might otherwise cause unnecessary variations in the achieved quality of the subsequent blocks.
[0250] The target parameter updater (470) can use the same filter to filter each of the control parameters, or use different filters for different control parameters. In the lowpass filter implementations, the bandwidth of the lowpass filter can be pre-determined for the encoder. Alternatively, the bandwidth can vary to control quality smoothness according to encoder settings, current buffer fullness, or another criterion. In general, wider bandwidth for the lowpass filter leads to smoother values for the control parameter, and narrower bandwidth leads to more variance in the values.
[0251] In alternative embodiments, the model parameter updater (470) updates control parameters different than or in addition to the control parameters described above, or uses different techniques to compute the control parameters, potentially using input control parameters other than or in addition to the parameters given above.
[0252] FIG. 18 shows a technique (1800) for lowpass filtering values of a control parameter from block to block, in a broader context than the model parameter updater (470) of FIG. 4 . A tool such as an audio encoder gets (1810) a first block and computes (1820) a value for a control parameter for the block. For example, the control parameter can be a past complexity measure, mapped relation between complexity and composite strength, past complexity noise measure, future complexity noise measure, or other control parameter.
[0253] The tool optionally adjusts (1830) the lowpass filter. For example, the tool changes the number of filter taps or amplitudes of filter taps in a finite impulse response filter, or switches to an infinite impulse response filter. By changing the bandwidth of the filter, the tool controls smoothness in the series of values of the control parameter, where wider bandwidth leads to a smoother series. The tool can adjust (1830) the lowpass filter based upon encoder settings, current buffer fullness, or another criterion. Alternatively, the lowpass filter has pre-determined settings and the tool does not adjust it.
[0254] The tool then lowpass filters (1840) the value of the control parameter, producing a lowpass filtered value. Specifically, the tool filters the value as part of a series of zero or more previously computed values for the control parameter.
[0255] If the tool determines (1850) that there are no more blocks to compute values of the control parameter for, the technique ends. Otherwise, the tool gets (1860) the next block and repeats the process. For the sake of simplicity, FIG. 18 does not show the various ways in which the technique (1800) can be used in conjunction with other techniques in a rate/quality controller or encoder.
[0256] Having described and illustrated the principles of our invention with reference to an illustrative embodiment, it will be recognized that the illustrative embodiment 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 illustrative embodiment shown in software may be implemented in hardware and vice versa.
[0257] 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
Certificate of Correction present
The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.
We claim:
1. In a spectral audio encoder, a computer-implemented method comprising:
performing a frequency transform on plural time domain audio samples to produce a block of frequency coefficients; and
compressing the block of frequency coefficients, wherein the compressing includes,
quantizing the block of frequency coefficients;
comparing a quality measure for the block to a quality target; and
comparing a bit-count measure for the block to a minimum-bits target and to a maximum-bits target;
wherein a first quantization loop includes the quantizing and the comparing the quality measure, and wherein a second quantization loop de-linked from the first quantization loop includes the comparing the bit-count measure.
2. The method of claim 1 wherein the quality target, the minimum-bits target, and the maximum-bits target are for the block.
3. In a spectral audio encoder, a computer-implemented method comprising:
performing a frequency transform on plural time domain audio samples to produce a block of frequency coefficients; and
compressing the block of frequency coefficients; wherein the compressing includes,
quantizing the block of frequency coefficients;
computing a quality measure for the quantized block based upon the quantized block of frequency coefficients;
entropy encoding the quantized block of frequency coefficients;
computing a bit-count measure for the entropy encoded block based upon the entropy encoded quantized block of frequency coefficients;
comparing the quality measure for the quantized block to a quality target; and
comparing the bit-count measure for the entropy encoded block to a minimum-bits target and to a maximum-bits target.
4. The method of claim 3 wherein a first quantization loop includes the quantizing and the comparing the quality measure, and wherein a second quantization loop de-linked from the first quantization loop includes the comparing the bit-count measure.
5. The method of claim 3 wherein the quality target is for the entropy encoded block, the minimum-bits target, and the maximum-bits target is for the entropy encoded block.
6. A computer-readable medium encoded with computer-executable instructions for causing a computer programmed thereby to perform a method of controlling quality and bitrate in a spectral audio encoder, the method comprising:
performing a frequency transform on plural time domain audio samples, producing a block of frequency coefficients;
determining one or more target quality parameters, a first target quality parameter of the one or more target quality parameters indicating an acceptable audio quality;
determining plural target bitrate parameters, a first target bitrate parameter of the plural target bitrate parameters indicating a minimum acceptable number of bits produced, and a second target bitrate parameter of the plural target bitrate parameters indicating a maximum acceptable number of bits produced; and
compressing audio information, wherein the audio information is the block of frequency coefficients wherein quantization of the audio information is based at least in part upon the first target quality parameter, the first target bitrate parameter, and the second target bitrate parameter, and wherein the compressing includes:
quantizing the audio information;
computing a quality measure based upon the quantized audio information;
comparing the quality measure to the first target quality parameter;
entropy encoding the quantized audio information;
computing a bit-count measure based upon the entropy encoded audio information; and
comparing the bit-count measure to the first and second target bitrate parameters.
7. The computer-readable medium of claim 6 wherein the first target quality parameter, the first target bitrate parameter, and the second target bitrate parameter are for the block.
8. The computer-readable medium of claim 6 wherein the compressing includes:
in a first quantization loop, adjusting the quantization until satisfaction of the first target quality parameter; and
in a second quantization loop, adjusting the quantization until satisfaction of the first and second target bitrate parameters.
9. The computer-readable medium of claim 6 wherein the first target bitrate parameter is a function of factors comprising an average bit count estimate, buffer fullness, and buffer sweet spot.
10. The computer-readable medium of claim 6 wherein the second target bitrate parameter is a function of factors comprising an average bit count estimate, buffer fullness, and buffer sweet spot.
11. The computer-readable medium of claim 6 wherein the first target quality parameter is a function of factors comprising a complexity estimate and goal bit count.
12. The computer-readable medium of claim 11 wherein the complexity estimate is a composite of a past complexity estimate and a future complexity estimate.
13. The computer-readable medium of claim 11 wherein the complexity estimate is based at least in part upon a complexity estimate reliability measure.
14. The computer-readable medium of claim 11 wherein the goal bit count is based at least in part upon size of the block and maximum block size.
Patent Citations (36)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4051470(A) | 1977-09-01 | Esteban et al. | Applicant |
| US5317672(A) | 1994-05-01 | Crossman et al. | Examiner |
| US5414796(A) | 1995-05-01 | Jacobs et al. | Examiner |
| US5457495(A) | 1995-10-01 | Hartung | Applicant |
| US5467134(A) | 1995-11-01 | Laney et al. | Applicant |
| US5579430(A) | 1996-11-01 | Grill et al. | Applicant |
| US5586200(A) | 1996-12-01 | Devaney et al. | Applicant |
| US5623424(A) | 1997-04-01 | Azadegan et al. | Examiner |
| US5686964(A) | 1997-11-01 | Tabatabai et al. | Applicant |
| US5742735(A) | 1998-04-01 | Eberlein et al. | Applicant |
| US5819215(A) | 1998-10-01 | Dobson et al. | Applicant |
| US5825310(A) | 1998-10-01 | Tsutsui | Examiner |
| US5835149(A) | 1998-11-01 | Astle | Applicant |
| US5845243(A) | 1998-12-01 | Smart et al. | Applicant |
| US5926226(A) | 1999-07-01 | Proctor et al. | Examiner |
| US5995151(A) | 1999-11-01 | Naveen et al. | Applicant |
| US6029126(A) | 2000-02-01 | Malvar | Applicant |
| US6111914(A) | 2000-08-01 | Bist | Applicant |
| US6115689(A) | 2000-09-01 | Malvar | Applicant |
| US6160846(A) | 2000-12-01 | Chiang et al. | Examiner |
| US6182034(B1) | 2001-01-01 | Malvar | Applicant |
| US6212232(B1) | 2001-04-01 | Reed et al. | Examiner |
| US6243497(B1) | 2001-06-01 | Chiang et al. | Examiner |
| US6278735(B1) | 2001-08-01 | Mohsenian | Examiner |
| US6370502(B1) | 2002-04-01 | Wu et al. | Applicant |
| US6522693(B1) | 2003-02-01 | Lu et al. | Applicant |
| US6574593(B1) | 2003-06-01 | Gao et al. | Applicant |
| US6654417(B1) | 2003-11-01 | Hui | Examiner |
| US6654419(B1) | 2003-11-01 | Sriram et al. | Applicant |
| US6810083(B1) | 2004-10-01 | Chen et al. | Examiner |
| US6895050(B1) | 2005-05-01 | Lee | Examiner |
| US2002/0143556(A1) | 2002-10-01 | Kadatch | Applicant |
| US2002/0176624(A1) | 2002-11-01 | Kostrzewski et al. | Applicant |
| US2003/0110236(A1) | 2003-06-01 | Yang et al. | Applicant |
| US2005/0015528(A1) | 2005-01-01 | Du | Applicant |
| US2005/0084166(A1) | 2005-04-01 | Boneh et al. | Applicant |
Non-Patent Literature (63)
- Gibson et al., Digital Compression for Multimedia, Title Page, Contents,“Chapter 7: Frequency Domain Coding,” Morgan Kaufman Publishers, Inc., pp. iii, v-xi, and 227-262 (1998).Applicant
- H.S. Malvar, Signal Processing with Lapped Transforms, Artech House, Norwood, MA, pp. iv, vii-xi, 175-218, and 353-57 (1992).Applicant
- H.S. Malvar, “Lapped Transforms for Efficient Transform/Subband Coding,” IEEE Transactions on Acoustics, Speech and Signal Processing, vol. 38, No.-6, pp. 969-78 (1990).Applicant
- Seymour Schlien, “The Modulated Lapped Transform, Its Time-Varying Forms, and Its Application to Audio Coding Standards,” IEEE Transactions on Speech and Audio Processing, vol. 5, No. 4, pp. 359-66 (Jul. 1997).Applicant
- de Queiroz et al., “Time-Varying Lapped Transforms and Wavelet Packets,” IEEE Transactions on Signal Processing, vol. 41, pp. 3293-3305 (1993).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-59 (1993).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
- Dolby Laboratories, “AAC Technology,” 4 pp. [Downloaded from the web site aac-audio.com on World Wide Web on Nov. 21, 2001.].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-93 (Apr. 1998).Applicant
- Caetano et al., “Rate Control Strategy for Embedded Wavelet Video Coders,” Electronics Letters, pp. 1815-17 (Oct. 14, 1999).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-85 (Feb. 1999).Applicant
- Zwicker et al., Das Ohr als Nachrichtenempfanger, Title Page, Table of Contents, “I: Schallschwingungen,” Index, Hirzel-Verlag, Stuttgart, pp. III, IX-XI, I-26, and 231-32 (1967).Applicant
- Terhardt, “Calculating Virtual Pitch,” Hearing Research, 1:155-182 (1979).Applicant
- Lufti, “Additivity of Simultaneous Masking,” Journal of Acoustic Society of America, 73:262-267 (1983).Applicant
- Jesteadt et al., “Forward Masking as a Function of Frequency, Masker Level, and Signal Delay,” Journal of Acoustical Society of America, 71:950-962 (1982).Applicant
- ITU, Recommendation ITU-R BS 1387, Method for Objective Measurements of Perceived Audio Quality, 89 pp. (1998).Applicant
- ITU, Recommendation ITU-R BS 1115, Low Bit-Rate Audio Coding, 9 pp. (1994).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
- Zwicker, Psychoakustik, Title Page, Table of Contents, “Teil I: Einfuhrung,” Index, Springer-Verlag, Berlin Heidelberg, New York, pp. II, IX-XI, 1-30, and 157-162 (1982).Applicant
- Solari, Digital Video and Audio Compression, Title Page, Contents, “Chapter 8: Sound and Audio,” McGraw-Hill, Inc., pp. iii, v-vi, and 187-211 (1997).Applicant
- A.M. 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
- Kadatch, U.S. Appl. No. 09/771,371, entitled, “Quantization Loop with Heuristic Approach,” filed Jan. 26, 2001.Applicant
- Chen et al., U.S. Appl. No. 10/017,702, entitled, “Quantization Matrices for Digital Audio,” filed Dec. 14, 2001.Applicant
- Chen et al., U.S. Appl. No. 10/017,861, entitled, “Techniques for Measurement of Perceptual Audio Quality,” filed Dec. 14, 2001.Applicant
- Chen et al., U.S. Appl. No. 10/020,708, entitled. “Adaptive Window-Size Selection in Transform Coding,” filed Dec. 14, 2001.Applicant
- Chen et al., U.S. Appl. No. 10/016,918, entitled, “Quality Improvement Techniques in an Audio Encoder,” filed Dec. 14, 2001.Applicant
- Wragg et al., “An Optimised Software Solution for an ARM Powered™ MP3 Decoder,” 9 pp. [Downloaded from the World Wide Web on Oct. 27, 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
- OPTICOM GmbH, “Objective Perceptual Measurement,” 14 pp. [Downloaded from the World Wide Web on Oct. 24, 2001.].Applicant
- De Luca, “AN1090 Application Note: STA013 MPEG 2.5 Layer III Source Decoder,” STMicroelectronics, 17 pp. (1999).Applicant
- Phamdo, “Speech Compression,” 13 pp. [Downloaded from the World Wide Web on Nov. 25, 2001.].Applicant
- Malvar, “Biorthogonal and Nonuniform Lapped Transforms for Transform Coding with Reduced Blocking and Ringing Artifacts,” appeared in IEEE Transactions on Signal Processing, Special Issue on Multirate Systems, Filter Banks, Wavelets, and Applications, vol. 46, 29 pp. (1998).Applicant
- Li et al., “Optimal Linear Interpolation Coding for Server-Based Computing,” Proc. IEEE Int'l Conf. on Communications, 5 pp. (2002).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
- Advanced Television Systems Committee, “ATSC Standard: Digital Audio Compression (AC-3), Revision A,” pp. 1-140 (Aug. 2001).Applicant
- Baron et al., “Coding the Audio Signal,” Digital Image and Audio Communications, pp. 101-128, (1998).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
- Gibson et al., “Quantization,” Digital Compression for Multimedia, Chapter 4, pp. 113-138 (1998).Applicant
- Gibson et al., “Frequency Domain Speech and Audio Coding Standards,” Digital Compression for Multimedia, Chapter 8, pp. 263-290 (1998).Applicant
- Gibson et al., “MPEG Audio,” Digital Compression for Multimedia, Chapter 11.4, pp. 398-402 (1998).Applicant
- Gibson et al., “More MPEG,” Digital Compression for Multimedia, Chapter 11.6.2-11.6.4, pp. 415-416 (1998).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 (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 (1997).Applicant
- ISO, “MPEG-4 Video Verification Model version 18.0,” ISO/IEC JTC1/SC29/WG11 N3908, Pisa, pp. 1-10, 299-311 (Jan. 2001).Applicant
- Jafarkhani, H., et al. “Entropy-Constrained Successively Refinable Scalar Quantization,” IEEE Data Compression Conference, pp. 337-346 (1997).Applicant
- Jayant et al., “Digital Coding of Waveforms, Principles and Applications to Speech and Video,” Prentice Hall, pp. 428-445 (1984).Applicant
- Naveen et al., “Subband Finite State Scalar Quantization,” IEEE Transactions on Image Processing, vol. 5, No. 1, pp. 150-155 (Jan. 1996).Applicant
- Ortega et al., “Optimal Buffer-Constrained Source Quantization and Fast Approximation,” IEEE, pp. 192-195 (1992).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
- 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 Effieient Algorithm for Optimization DCT Quantization Tables,” 11 pp.Applicant
- Sidiropoulos, “Optimal Adaptive Scalar Quantization and Image Compression,” ICIP, pp. 574-578, (1998).Applicant
- Sullivan, “Optimal Entropy Constrained Scalar Quantization for Exponential and Laplacian Random Variables,” ICASSP, pp. V-265—V-268 (1994).Applicant
- Trushkin, “On the Design on an Optimal Quantizer,” 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, 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 Image 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 Theoryvol. 39, No. 3, pp. 1049-1053 (May 1993).Applicant