|Numéro de publication||US5627938 A|
|Type de publication||Octroi|
|Numéro de demande||US 08/310,898|
|Date de publication||6 mai 1997|
|Date de dépôt||22 sept. 1994|
|Date de priorité||2 mars 1992|
|État de paiement des frais||Payé|
|Autre référence de publication||CA2090160A1, CA2090160C, EP0559348A2, EP0559348A3|
|Numéro de publication||08310898, 310898, US 5627938 A, US 5627938A, US-A-5627938, US5627938 A, US5627938A|
|Inventeurs||James D. Johnston|
|Cessionnaire d'origine||Lucent Technologies Inc.|
|Exporter la citation||BiBTeX, EndNote, RefMan|
|Citations de brevets (11), Citations hors brevets (6), Référencé par (222), Classifications (12), Événements juridiques (9)|
|Liens externes: USPTO, Cession USPTO, Espacenet|
This application is a continuation of application Ser. No. 07/844,811, filed on Mar. 2, 1992 now abandoned.
The following U.S. patent applications filed concurrently with the present application and assigned to the assignee of the present application are related to the present application and each is hereby incorporated herein as if set forth in its entirety: "A METHOD AND APPARATUS FOR THE PERCEPTUAL CODING OF AUDIO SIGNALS, " by A. Ferreira and J. D. Johnston, application Ser. No. 07/844,819, now abandoned, which in turn was parent of application Ser. No. 08/334,889, allowed Jul. 11, 1996: "A METHOD AND APPARATUS FOR CODING AUDIO SIGNALS BASED ON PERCEPTUAL MODEL," by J.D. Johnston, application Ser. No. 07/844,804, now U.S. Pat. No. 5,285,498, issued Feb. 8, 1994; and "AN ENTROPY CODER," by J.D. Johnston and J.A. Reeds, application Ser. No. 07/844,809, now U.S. Pat. No. 5,227,788, issued Jul. 13, 1993.
The present invention relates to processing of signals, and more particularly, to the efficient encoding and decoding of monophonic and stereophonic audio signals, including signals representative of voice and music for storage or transmission.
Consumer, industrial, studio and laboratory products for storing, processing and communicating high quality audio signals are in great demand. For example, so-called compact disc ("CD") and digital audio tape ("DAT") recordings for music have largely replaced the long-popular phonograph record and cassette tape. Likewise, recently available digital audio tape ("DAT") recording promise to provide greater flexibility and high storage density for high quality audio signals. See, also, Tan and Vermeulen, "Digital audio tape for data storage", IEEE Spectrum, pp. 34-38 (October 1989). A demand is also arising for broadcast applications of digital technology that offer CD-like quality.
While these emerging digital techniques are capable of producing high quality signals, such performance is often achieved only at the expense of considerable data storage capacity or transmission bandwidth. Accordingly, much work has been done in an attempt to compress high quality audio signals for storage and transmission.
Most of the prior work directed to compressing signals for transmission and storage has sought to reduce the redundancies that the source of the signals places on the signal. Thus, such techniques as ADPCM, sub-band coding and transform coding described, e.g., in N. S. Jayant and P. Noll, "Digital Codin of Waveforms," Prentice-Hall, Inc. 1984, have sought to eliminate redundancies that otherwise would exist in the source signals.
In other approaches, the irrelevant information in source signals is sought to be eliminated using techniques based on models of the human perceptual system. Such techniques are described, e.g., in E. F. Schroeder and J. J. Platte "`MSC`: Stereo Audio Coding with CD-Quality and 256 kBIT/SEC,"IEEE Trans. on Consumer Electronics, Vol. CE-33, No. 4, November 1987; and Johnston, Transform Coding of Audio Signals Using Noise Criteria, Vol. 6, No. 2, IEEE J.S.C.A. (February 1988).
Perceptual coding, as described, e.g., in the Johnston paper relates to a technique for lowering required bitrates (or reapportioning available bits) or total number of bits in representing audio signals. In this form of coding, a masking threshold for unwanted signals is identified as a function of frequency of the desired signal. Then, inter alia, the coarseness of quantizing used to represent a signal component of the desired signal is selected such that the quantizing noise introduced by the coding does not rise above the noise threshold, though it may be quite near this threshold. The introduced noise is therefore masked in the perception process. While traditional signal-to- noise ratios for such perceptually coded signals may be relatively low, the quality of these signals upon decoding, as perceived by a human listener, is nevertheless high.
Brandenburg et al, U.S. Pat. No. 5,040,217, issued Aug. 13, 1991, describes a system for efficiently coding and decoding high quality audio signals using such perceptual considerations. In particular, using a measure of the "noise-like" or "tone-like" quality of the input signals, the embodiments described in the latter system provides a very efficient coding for monophonic audio signals.
It is, of course, important that the coding techniques used to compress audio signals do not themselves introduce offensive components or artifacts. This is especially important when coding stereophonic audio information where coded information corresponding to one stereo channel, when decoded for reproduction, can interfere or interact with coding information corresponding to the other stereo channel. Implementation choices for coding two stereo channels include so-called "dual mono" coders using two independent coders operating at fixed bit rates. By contrast, "joint mono" coders use two monophonic coders but share one combined bit rate, i.e., the bit rate for the two coders is constrained to be less than or equal to a fixed rate, but trade- offs can be made between the bit rates for individual coders. "Joint stereo" coders are those that attempt to use interchannel properties for the stereo pair for realizing additional coding gain.
It has been found that the independent coding of the two channels of a stereo pair, especially at low bit-rates, can lead to a number of undesirable psychoacoustic artifacts. Among them are those related to the localization of coding noise that does not match the localization of the dynamically imaged signal. Thus the human stereophonic perception process appears to add constraints to the encoding process if such mismatched localization is to be avoided. This finding is consistent with reports on binaural masking-level differences that appear to exist, at least for low frequencies, such that noise may be isolated spatially. Such binaural masking-level differences are considered to unmask a noise component that would be masked in a monophonic system. See, for example, B.C.J. Morre, "An Introduction to the Psychology of Hearing, Second Edition," especially chapter 5, Academic Press, Orlando, Fla., 1982.
One technique for reducing psychoacoustic artifacts in the stereophonic context employs the ISO-WG11-MPEG-Audio Psychoacoustic II [ISO] Model. In this model, a second limit of signal-to-noise ratio ("SNR") is applied to signal-to-noise ratios inside the psychoacoustic model. However, such additional SNR constraints typically require the expenditure of additional channel capacity or (in storage applications) the use of additional storage capacity, at low frequencies, while also degrading the monophonic performance of the coding.
Limitations of the prior art are overcome and a technical advance is made in a method and apparatus for coding a stereo pair of high quality audio channels in accordance with aspects of the present invention. Interchannel redundancy and irrelevancy are exploited to achieve lower bit-rates while maintaining high quality reproduction after decoding. While particularly appropriate to stereophonic coding and decoding, the advantages of the present invention may also be realized in conventional dual monophonic stereo coders.
An illustrative embodiment of the present invention employs a filter bank architecture using a Modified Discrete Cosine Transform (MDCT). In order to code the full range of signals that may be presented to the system, the illustrative embodiment advantageously uses both L/R (Left and Right) and M/S (Sum/Difference) coding, switched in both frequency and time in a signal dependent fashion. A new stereophonic noise masking model advantageously detects and avoids binaural artifacts in the coded stereophonic signal. Interchannel redundancy is exploited to provide enhanced compression for without degrading audio quality.
The time behavior of both Right and Left audio channels is advantageously accurately monitored and the results used to control the temporal resolution of the coding process. Thus, in one aspect, an illustrative embodiment of the present invention, provides processing of input signals in terms of either a normal MDCT window, or, when signal conditions indicate, shorter windows. Further, dynamic switching between RIGHT/LEFT or SUM/DIFFERENCE coding modes is provided both in time and frequency to control unwanted binaural noise localization, to prevent the need for overcoding of SUM/DIFFERENCE signals, and to maximize the global coding gain.
A typical bitstream definition and rate control loop are described which provide useful flexibility in forming the coder output. Interchannel irrelevancies, are advantageously eliminated and stereophonic noise masking improved, thereby to achieve improved reproduced audio quality in jointly coded stereophonic pairs. The rate control method used in an illustrative embodiment uses an interpolation between absolute threshold and masking threshold for signals below the rate-limit of the coder, and a threshold elevation strategy under rate-limited conditions.
In accordance with an overall coder/decoder system aspect of the present invention, it proves advantageously to employ an improved Huffman- like entropy coder/decoder to further reduce the channel bit rate requirements, or storage capacity for storage applications. The noiseless compression method illustratively used employs Huffman coding along with a frequency-partitioning scheme to efficiently code the frequency samples for L,R,M and S, as may be dictated by the perceptual threshold.
The present invention provides a mechanism for determining the scale factors to be used in quantizing the audio signal (i.e., the MDCT coefficients output from the analysis filter bank) by using an approach different from the prior art, and while avoiding many of the restrictions and costs of prior quantizer/rate-loops. The audio signals quantized pursuant to the present invention introduce less noise and encode into fewer bits than the prior art.
These results are obtained in an illustrative embodiment of the present invention whereby the utilized scale factor, is iteratively derived by interpolating between a scale factor derived from a calculated threshold of hearing at the frequency corresponding to the frequency of the respective spectral coefficient to be quantized and a scale factor derived from the absolute threshold of hearing at said frequency until the quantized spectral coefficients can be encoded within permissible limits.
FIG. 1 presents an illustrative prior art audio communication/storage system of a type in which aspects of the present invention find application, and provides improvement and extension.
FIG. 2 presents an illustrative perceptual audio coder (PAC) in which the advances and teachings of the present invention find application, and provide improvement and extension.
FIG. 3 shows a representation of a useful masking level difference factor used in threshold calculations.
FIG. 4 presents an illustrative analysis filter bank according to an aspect of the present invention.
FIG. 5(a) through 5(e) illustrate the operation of various window functions.
FIG. 6 is a flow chart illustrating window switching functionality.
FIG. 7 is a block/flow diagram illustrating the overall processing of input signals to derive the output bitstream.
FIG. 8 illustrates certain threshold variations.
FIG. 9 is a flow chart representation of certain bit allocation functionality.
FIG. 10 shows bitstream organization.
FIGS. 11a through 11c illustrate certain Huffman coding operations.
FIG. 12 shows operations at a decoder that are complementary to those for an encoder.
FIG. 13 is a flowchart illustrating certain quantization operations in accordance with an aspect of the present invention.
FIG. 14(a) through 14(g) are illustrative windows for use with the filter bank of FIG. 4.
To simplify the present disclosure, the following patents, patent applications and publications are hereby incorporated by reference in the present disclosure as if fully set forth herein: U.S. Pat. No. 5,040,217, issued Aug. 13, 1991 by K. Brandenburg et al, U.S. patent application Ser. No. 07/292,598, entitled Perceptual Coding of Audio Signals, filed Dec. 30, 1988; J. D. Johnston, Transform Coding of Audio Signals Using Perceptual Noise Criteria, IEEE Journal on Selected Areas in Communications, Vol. 6, No. 2 February 1988); International Patent Application (PCT) WO 88/01811, filed Mar. 10, 1988; U.S. patent application Ser. No. 07/491,373, entitled Hybrid Perceptual Coding, filed Mar. 9, 1990, Brandenburg et al, Aspec: Adaptive Spectral Entropy Coding of High Quality Music Signals, AES 90th Convention (1991); Johnston, J., Estimation of Perceptual Entropy Using Noise Masking Criteria, ICASSP, (1988); J. D. Johnston, Perceptual Transform Coding of Wideband Stereo Signals, ICASSP (1989); E. F. Schroeder and J. J. Platte, "`MSC`: Stereo Audio Coding with CD-Quality and 256 kBIT/SEC, " IEEE Trans. on Consumer Electronics, Vol. CE-33, No. 4, November 1987; and Johnston, Transform Coding of Audio Signals Using Noise Criteria, Vol. 6, No. 2, IEEE J.S.C.A. (February 1988).
For clarity of explanation, the illustrative embodiment of the present invention is presented as comprising individual functional blocks (including functional blocks labeled as "processors"). The functions these blocks represent may be provided through the use of either shared or dedicated hardware, including, but not limited to, hardware capable of executing software. (Use of the term "processor" should not be construed to refer exclusively to hardware capable of executing software.) Illustrative embodiments may comprise digital signal processor (DSP) hardware, such as the AT&T DSP16 or DSP32C, and software performing the operations discussed below. Very large scale integration (VLSI) hardware embodiments of the present invention, as well as hybrid DSP/VLSI embodiments, may also be provided.
FIG. 1 is an overall block diagram of a system useful for incorporating an illustrative embodiment of the present invention. At the level shown, the system of FIG. 1 illustrates systems known in the prior art, but modifications, and extensions described herein will make clear the contributions of the present invention. In FIG. 1, an analog audio signal 101 is fed into a preprocessor 102 where it is sampled (typically at 48 KHz) and converted into a digital pulse code modulation ("PCM") signal 103 (typically 16 bits) in standard fashion. The PCM signal 103 is fed into a perceptual audio coder 104 ("PAC") which compresses the PCM signal and outputs the compressed PAC signal to a communications channel/storage medium 106. From the communications channel/storage medium the compressed PAC signal (105) is fed into a perceptual audio decoder 108 which decompresses the compressed PAC signal and outputs a PCM signal 107 which is representative of the compressed PAC signal 105. From the perceptual audio decoder, the PCM signal 108 is fed into a post-processor 110 which creates an analog representation of the PCM signal 107.
An illustrative embodiment of the perceptual audio coder 104 is shown in block diagram form in FIG. 2. As in the case of the system illustrated in FIG. 1, the system of FIG. 2, without more, may equally describe certain prior art systems, e.g., the system disclosed in the Brandenburg, et al U.S. Pat. No. 5,040,217. However, with the extensions and modifications described herein, important new results are obtained. The perceptual audio coder of FIG. 2 may advantageously be viewed as comprising an analysis filter bank 202, a perceptual model processor 204, a quantizer/rate-loop processor 206 and an entropy encoder 208.
The filter bank 202 in FIG. 2 advantageously transforms an input audio signal in time/frequency in such manner as to provide both some measure of signal processing gain (i.e. redundancy extraction) and a mapping of the filter bank inputs in a way that is meaningful in light of the human perceptual system. Advantageously, the well-known Modified Discrete Cosine Transform (MDCT) described, e.g., in J. P. Princen and A. B. Bradley, "Analysis/Synthesis Filter Bank Design Based on Time Domain Aliasing Cancellation," IEEE Trans. ASSP, Vol. 34, No. 5, October, 1986, may be adapted to perform such transforming of the input signals.
Features of the MDCT that make it useful in the present context include its critical sampling characteristic, i.e. for every n samples into the filter bank, n samples are obtained from the filter bank. Additionally, the MDCT typically provides half-overlap, i.e. the transform length is exactly twice the length of the number of samples, n, shifted into the filterbank. The half-overlap provides a good method of dealing with the control of noise injected independently into each filter tap as well as providing a good analysis window frequency response. In addition, in the absence of quantization, the MDCT provides exact reconstruction of the input samples, subject only to a delay of an integral number of samples.
One aspect in which the MDCT is advantageously modified for use in connection with a highly efficient stereophonic audio coder is the provision of the ability to switch the length of the analysis window for signal sections which have strongly non-stationary components in such a fashion that it retains the critically sampled and exact reconstruction properties. The incorporated U.S. patent application by Ferreira and Johnston, entitled "A METHOD AND APPARATUS FOR THE PERCEPTUAL CODING OF AUDIO SIGNALS," (referred to hereinafter as the "filter bank application") filed of even date with this application, describes a filter bank appropriate for performing the functions of element 202 in FIG. 2.
The perceptual model processor 204 shown in FIG. 2 calculates an estimate of the perceptual importance, noise masking properties, or just noticeable noise floor of the various signal components in the analysis bank. Signals representative of these quantities are then provided to other system elements to provide improved control of the filtering operations and organizing of the data to be sent to the channel or storage medium. Rather than using the critical band by critical band analysis described in J. D. Johnston, "Transform Coding of Audio Signals Using Perceptual Noise Criteria," IEEE J. on Selected Areas in Communications, February 1988, an illustrative embodiment of the present invention advantageously uses finer frequency resolution in the calculation of thresholds. Thus instead of using an overall tonality metric as in the last-cited Johnston paper, a tonality method based on that mentioned in K. Brandenburg and J. D. Johnston, "Second Generation Perceptual Audio Coding: The Hybrid Coder," AES 89th Convention, 1990 provides a tonality estimate that varies over frequency, thus providing a better fit for complex signals.
The psychoacoustic analysis performed in the perceptual model processor 204 provides a noise threshold for the L (Left), R (Right), M (Sum) and S (Difference) channels, as may be appropriate, for both the normal MDCT window and the shorter windows. Use of the shorter windows is advantageously controlled entirely by the psychoacoustic model processor.
In operation, an illustrative embodiment of the perceptual model processor 204 evaluates thresholds for the left and right channels, denoted THRl and THRr. The two thresholds are then compared in each of the illustrative 35 coder frequency partitions (56 partitions in the case of an active window-switched block). In each partition where the two thresholds vary between left and right by less than some amount, typically 2 dB, the coder is switched into M/S mode. That is, the left signal for that band of frequencies is replaced by M=(L+R)/2, and the right signal is replaced by S=(L-R)/2. The actual amount of difference that triggers the last-mentioned substitution will vary with bitrate constraints and other system parameters.
The same threshold calculation used for L and R thresholds is also used for M and S thresholds, with the threshold calculated on the actual M and S signals. First, the basic thresholds, denoted BTHRm and MLDs are calculated. Then, the following steps are used to calculate the stereo masking contribution of the M and S signals.
1. An additional factor is calculated for each of the M and S thresholds. This factor, called MLDm, and MLDs, is calculated by multiplying the spread signal energy, (as derived, e.g., in J. D. Johnston, "Transform Coding of Audio Signals Using Perceptual Noise Criteria," IEEE J. on Selected Areas in Communications, February 1988; K. Brandenburg and J. D. Johnston, "Second Generation Perceptual Audio Coding: The Hybrid Coder," AES 89th Convention, 1990; and Brandenburg, et al U.S. Pat. No. 5,040,217) by a masking level difference factor shown illustratively in FIG. 3. This calculates a second level of detectability of noise across frequency in the M and S channels, based on the masking level differences shown in various sources.
2. The actual threshold for M (THRm) is calculated as THRm =max(BTHRm, min(BTHRs,MLDs)) and the threshold m=max(BTHRm, min(BTHRs,MLDs)) and the threshold for S is calculated as THRs =max(BTHRs,min(BTHRm,MLDm)).
In effect, the MLD signal substitutes for the BTHR signal in cases where there is a chance of stereo unmasking. It is not necessary to consider the issue of M and S threshold depression due to unequal L and R thresholds, because of the fact that L and R thresholds are known to be equal.
The quantizer/rate loop processor 206 used in the illustrative coder of FIG. 2 takes the outputs from the analysis bank and the perceptual model, and allocates bits, noise, and controls other system parameters so as to meet the required bit rate for the given application. In some example coders this may consist of nothing more than quantization so that the just noticeable difference of the perceptual model is never exceeded, with no (explicit) attention to bit rate; in some coders this may be a complex set of iteration loops that adjusts distortion and bitrate in order to achieve a balance between bit rate and coding noise. Also desirably performed by the rate loop processor 206, and described in the rate loop application, is the function of receiving information from the quantized analyzed signal and any requisite side information, inserting synchronization and framing information. Again, these same functions are broadly described in the incorporated Brandenburg. et al, U.S. Pat. No. 5,040,217.
Entropy encoder 208 is used to achieve a further noiseless compression in cooperation with the rate loop processor 206. In particular, entropy encoder 208, in accordance with another aspect of the present invention, advantageously receives inputs including a quantized audio signal output from quantizer/rate loop 206, performs a lossless encoding on the quantized audio signal, and outputs a compressed audio signal to the communications channel/storage medium 106.
Illustrative entropy encoder 208 advantageously comprises a novel variation of the minimum-redundancy Huffman coding technique to encode each quantized audio signal. The Huffman codes are described, e.g., in D.A. Huffman, "A Method for the Construction of Minimum Redundancy Codes", Proc. IRE, 40: 1098-1101 (1952) and T. M. Cover and J. A. Thomas, .us Elements of Information Theory, pp. 92-101 (1991). The useful adaptations of the Huffman codes advantageously used in the context of the coder of FIG. 2 are described in more detail in the incorporated U.S. patent application by by J. D. Johnston and J. Reeds (hereinafter the "entropy coder application") filed of even date with the present application and assigned to the assignee of this application. Those skilled in the data communications arts will readily perceive how to implement alternative embodiments of entropy encoder 208 using other noiseless data compression techniques, including the well-known Lempel-Ziv compression methods.
The use of each of the elements shown in FIG. 2 will be described in greater detail in the context of the overall system functionality; details of operation will be provided for the perceptual model processor 204.
2.1. The Analysis Filter Bank
The analysis filter bank 202 of the perceptual audio coder 104 receives as input pulse code modulated ("PCM") digital audio signals (typically 16-bit signals sampled at 48 KHz), and outputs a representation of the input signal which identifies the individual frequency components of the input signal. Specifically, an output of the analysis filter bank 202 comprises a Modified Discrete Cosine Transform ("MDCT") of the input signal. See, J. Princen et al, "Sub-band Transform Coding Using Filter Bank Designs Based on Time Domain Aliasing Cancellation." IEEE ICASSP, pp. 2161-2164 (1987).
An illustrative analysis filter bank 202 according to one aspect of the present invention is presented in FIG. 4. Analysis filter bank 202 comprises an input signal buffer 302, a window multiplier 304, a window memory 306, an FFT processor 308, an MDCT processor 310, a concatenator 311, a delay memory 312 and a data selector 314.
The analysis filter bank 202 operates on frames. A frame is conveniently chosen as the 2N PCM input audio signal samples held by input signal buffer 302. As stated above, each PCM input audio signal sample is represented by M bits. Illustratively, N=512 and M=16.
Input signal buffer 302 comprises two sections: a first section comprising N samples in buffer locations 1 to N, and a second section comprising N samples in buffer locations N+1 to 2N. Each frame to be coded by the perceptual audio coder 104 is defined by shifting N consecutive samples of the input audio signal into the input signal buffer 302. Older samples are located at higher buffer locations than newer samples.
Assuming that, at a given time, the input signal buffer 302 contains a frame of 2N audio signal samples, the succeeding frame is obtained by (1) shifting the N audio signal samples in buffer locations 1 to N into buffer locations N+1 to 2N, respectively, (the previous audio signal samples in location N+1 to 2N may be either overwritten or deleted), and (2) by shifting into the input signal buffer 302, at buffer locations 1 to N, N new audio signal samples from preprocessor 102. Therefore, it can be seen that consecutive frames contain N samples in common: the first of the consecutive frames having the common samples in buffer locations 1 to N, and the second of the consecutive frames having the common samples in buffer locations N+1 to 2N. Analysis filter bank 202 is a critically sampled system (i.e., for every N audio signal samples received by the input signal buffer 302, the analysis filter bank 202 outputs a vector of N scalers to the quantizer/rate-loop 206).
Each frame of the input audio signal is provided to the window multiplier 304 by the input signal buffer 302 so that the window multiplier 304 may apply seven distinct data windows to the frame.
Each data window is a vector of scalers called "coefficients". While all seven of the data windows have 2N coefficients (i.e., the same number as there are audio signal samples in the frame), four of the seven only have N/2 non-zero coefficients (i.e., one-fourth the number of audio signal samples in the frame). As is discussed below, the data window coefficients may be advantageously chosen to reduce the perceptual entropy of the output of the MDCT processor 310.
The information for the data window coefficients is stored in the window memory 306. The window memory 306 may illustratively comprise a random access memory ("RAM"), read only memory ("ROM"), or other magnetic or optical media. Drawings of seven illustrative data windows, as applied by window multiplier 304, are presented in FIG. 14. Typical vectors of coefficients for each of the seven data windows presented in FIG. 14. As may be seen in FIG. 14, some of the data window coefficients may be equal to zero.
Keeping in mind that the data window is a vector of 2N scalers and that the audio signal frame is also a vector of 2N scalers, the data window coefficients are applied to the audio signal frame scalers through point-to-point multiplication (i.e., the first audio signal frame scaler is multiplied by the first data window coefficient, the second audio signal frame scaler is multiplied by the second data window coefficient, etc.). Window multiplier 304 may therefore comprise seven microprocessors operating in parallel, each performing 2N multiplications in order to apply one of the seven data window to the audio signal frame held by the input signal buffer 302. The output of the window multiplier 304 is seven vectors of 2N scalers to be referred to as "windowed frame vectors".
The seven windowed frame vectors are provided by window multiplier 304 to FFT processor 308. The FFT processor 308 performs an odd-frequency FFT on each of the seven windowed frame vectors. The odd-frequency FFT is an Discrete Fourier Transform evaluated at frequencies: ##EQU1## where k=1,3,5, . . . ,2N, and fH equals one half the sampling rate. The illustrative FFT processor 308 may comprise seven conventional decimation-in-time FFT processors operating in parallel, each operating on a different windowed frame vector. An output of the FFT processor 308 is seven vectors of 2N complex elements, to be referred to collectively as "FFT vectors".
FFT processor 308 provides the seven FFT vectors to both the perceptual model processor 204 and the MDCT processor 310. The perceptual model processor 204 uses the FFT vectors to direct the operation of the data selector 314 and the quantizer/rate-loop processor 206. Details regarding the operation of data selector 314 and perceptual model processor 204 are presented below.
MDCT processor 310 performs an MDCT based on the real components of each of the seven FFT vectors received from FFT processor 308. MDCT processor 310 may comprise seven microprocessors operating in parallel. Each such microprocessor determines one of the seven "MDCT vectors" of N real scalars based on one of the seven respective FFT vectors. For each FFT vector, F(k), the resulting MDCT vector, X(k), is formed as follows: ##EQU2## The procedure need run k only to N, not 2N, because of redundancy in the result. To wit, for N<k≦2N:
MDCT processor 310 provides the seven MDCT vectors to concatenator 311 and delay memory 312.
As discussed above with reference to window multiplier 304, four of the seven data windows have N/2 non-zero coefficients (see FIGS. 4c-f). This means that four of the windowed frame vectors contain only N/2 non-zero values. Therefore, the non-zero values of these four vectors may be concatenated into a single vector of length 2N by concatenator 311 upon output from MDCT processor 310. The resulting concatenation of these vectors is handled as a single vector for subsequent purposes. Thus, delay memory 312 is presented with four MDCT vectors, rather than seven.
Delay memory 312 receives the four MDCT vectors from MDCT processor 310 and concatenator 311 for the purpose of providing temporary storage. Delay memory 312 provides a delay of one audio signal frame (as defined by input signal buffer 302) on the flow of the four MDCT vectors through the filter bank 202. The delay is provided by (i) storing the two most recent consecutive sets of MDCT vectors representing consecutive audio signal frames and (ii) presenting as input to data selector 314 the older of the consecutive sets of vectors. Delay memory 312 may comprise random access memory (RAM) of size:
where 2 is the number of consecutive sets of vectors, 4 is the number of vectors in a set, N is the number of elements in an MDCT vector, and M is the number of bits used to represent an MDCT vector element.
Data selector 314 selects one of the four MDCT vectors provided by delay memory 312 to be output from the filter bank 202 to quantizer/rate-loop 206. As mentioned above, the perceptual model processor 204 directs the operation of data selector 314 based on the FFT vectors provided by the FFT processor 308. Due to the operation of delay memory 312, the seven FFT vectors provided to the perceptual model processor 204 and the four MDCT vectors concurrently provided to data selector 314 are not based on the same audio input frame, but rather on two consecutive input signal frames--the MDCT vectors based on the earlier of the frames, and the FFT vectors based on the later of the frames. Thus, the selection of a specific MDCT vector is based on information contained in the next successive audio signal frame. The criteria according to which the perceptual model processor 204 directs the selection of an MDCT vector is described in Section 2.2, below.
For purposes of an illustrative stereo embodiment, the above analysis filterbank 202 is provided for each of the left and right channels.
2.2. The Perceptual Model Processor
A perceptual coder achieves success in reducing the number of bits required to accurately represent high quality audio signals, in part, by introducing noise associated with quantization of information bearing signals, such as the MDCT information from the filter bank 202. The goal is, of course, to introduce this noise in an imperceptible or benign way. This noise shaping is primarily a frequency analysis instrument, so it is convenient to convert a signal into a spectral representation (e.g., the MDCT vectors provided by filter bank 202), compute the shape and amount of the noise that will be masked by these signals and injecting it by quantizing the spectral values. These and other basic operations are represented in the structure of the perceptual coder shown in FIG. 2.
The perceptual model processor 204 of the perceptual audio coder 104 illustratively receives its input from the analysis filter bank 202 which operates on successive frames. The perceptual model processor inputs then typically comprise seven Fast Fourier Transform (FFT) vectors from the analysis filter bank 202. These are the outputs of the FFT processor 308 in the form of seven vectors of 2N complex elements, each corresponding to one of the windowed frame vectors.
In order to mask the quantization noise by the signal, one must consider the spectral contents of the signal and the duration of a particular spectral pattern of the signal. These two aspects are related to masking in the frequency domain where signal and noise are approximately steady state--given the integration period of the hearing system- and also with masking in the time domain where signal and noise are subjected to different cochlear filters. The shape and length of these filters are frequency dependent.
Masking in the frequency domain is described by the concept of simultaneous masking. Masking in the time domain is characterized by the concept of premasking and postmasking. These concepts are extensively explained in the literature; see, for example, E. Zwicker and H. Fastl, "Psychoacoustics, Facts, and Models," Springer-Verlag, 1990. To make these concepts useful to perceptual coding, they are embodied in different ways.
Simultaneous masking is evaluated by using perceptual noise shaping models. Given the spectral contents of the signal and its description in terms of noise-like or tone-like behavior, these models produce an hypothetical masking threshold that rules the quantization level of each spectral component. This noise shaping represents the maximum amount of noise that may be introduced in the original signal without causing any perceptible difference. A measure called the PERCEPTUAL ENTROPY (PE) uses this hypothetical masking threshold to estimate the theoretical lower bound of the bitrate for transparent encoding. J. D. Jonston, Estimation of Perceptual Entropy Using Noise Masking Criteria," ICASSP, 1989.
Premasking characterizes the (in)audibility of a noise that starts some time before the masker signal which is louder than the noise. The noise amplitude must be more attenuated as the delay increases. This attenuation level is also frequency dependent. If the noise is the quantization noise attenuated by the first half of the synthesis window, experimental evidence indicates the maximum acceptable delay to be about 1 millisecond.
This problem is very sensitive and can conflict directly with achieving a good coding gain. Assuming stationary conditions--which is a false premiss--The coding gain is bigger for larger transforms, but, the quantization error spreads till the beginning of the reconstructed time segment. So, if a transform length of 1024 points is used, with a digital signal sampled at a rate of 48000 Hz, the noise will appear at most 21 milliseconds before the signal. This scenario is particularly critical when the signal takes the form of a sharp transient in the time domain commonly known as an "attack". In this case the quantization noise is audible before the attack. The effect is known as pre-echo.
Thus, a fixed length filter bank is a not a good perceptual solution nor a signal processing solution for non-stationary regions of the signal. It will be shown later that a possible way to circumvent this problem is to improve the temporal resolution of the coder by reducing the analysis/synthesis window length. This is implemented as a window switching mechanism when conditions of attack are detected. In this way, the coding gain achieved by using a long analysis/synthesis window will be affected only when such detection occurs with a consequent need to switch to a shorter analysis/synthesis window.
Postmasking characterizes the (in)audibility of a noise when it remains after the cessation of a stronger masker signal. In this case the acceptable delays are in the order of 20 milliseconds. Given that the bigger transformed time segment lasts 21 milliseconds (1024 samples), no special care is needed to handle this situation.
The PERCEPTUAL ENTROPY (PE)_measure of a particular transform segment gives the theoretical lower bound of bits/sample to code that segment transparently. Due to its memory properties, which are related to premasking protection, this measure shows a significant increase of the PE value to its previous value--related with the previous segment--when some situations of strong non-stationarity of the signal (e.g. an attack) are presented. This important property is used to activate the window switching mechanism in order to reduce pre-echo. This window switching mechanism is not a new strategy, having been used, e.g., in the ASPEC coder, described in the ISO/MPEG Audio Coding Report, 1990, but the decision technique behind it is new using the PE information to accurately localize the non-stationarity and define the right moment to operate the switch.
Two basic window lengths: 1024 samples and 256 samples are used. The former corresponds to a segment duration of about 21 milliseconds and the latter to a segment duration of about 5 milliseconds. Short windows are associated in sets of 4 to represent as much spectral data as a large window (but they represent a "different" number of temporal samples). In order to make the transition from large to short windows and vice-versa it proves convenient to use two more types of windows. A START window makes the transition from large (regular) to short windows and a STOP window makes the opposite transition, as shown in FIG. 5b. See the above-cited Princen reference for useful information on this subject. Both windows are 1024 samples wide. They are useful to keep the system critically sampled and also to guarantee the time aliasing cancellation process in the transition region.
In order to exploit interchannel redundancy and irrelevancy, the same type of window is used for RIGHT and LEFT channels in each segment.
The stationarity behavior of the signal is monitored at two levels. First by large regular windows, then if necessary, by short windows. Accordingly, the PE of large (regular) window is calculated for every segment while the PE of short windows are calculated only when needed. However, the tonality information for both types is updated for every segment in order to follow the continuous variation of the signal.
Unless stated otherwise, a segment involves 1024 samples which is the length of a large regular window.
The diagram of FIG. 5a represents all the monitoring possibilities when the segment from the point N/2 till the point 3N/2 is being analysed. Related to the diagram of FIG. 5 is the flowchart of FIG. 6 which describes the monitoring sequence and decision technique. We need to keep in buffer three halves of a segment in order to be able to insert a START window prior to a sequence of short windows when necessary. FIGs. 5a-e explicitly considers the 50% overlap between successive segments.
The process begins by analysing a "new" segment with 512 new temporal samples (the remaining 512 samples belong to the previous segment). As shown in FIG. 6, the PE of this new segment and the differential PE to the previous segment are calculated (601). If the latter value reaches a predefined threshold (602), then the existence of a non-stationarity inside the current segment is declared and details are obtained by processing four short windows with positions as represented in FIG. 5a. The PE value of each short window is calculated (603) resulting in the ordered sequence: PE1, PE2, PE3 and PE4. From these values, the exact beginning of the strong non-stationarity of the signal is deduced. Only five locations are possible. identified in FIG. 5a as L1, L2, L3, L4 and L5. As it will become evident, if the non-stationarity had occurred somewhere from the point N/2 till the point 15N/16, that situation would have been detected in the previous segment. It follows that the PE1 value does not contain relevant information about the stationarity of the current segment. The average PE of the short windows is compared with the PE of the large window of the same segment (605). A smaller PE reveals a more efficient coding situation. Thus if the former value is not smaller than the latter, then we assume that we are facing a degenerate situation and the window switching process is aborted.
It has been observed that for short windows the information about stationarity lies more on its PE value than on the differential to the PE value of the precedent window. Accordingly, the first window that has a PE value larger than a predefined threshold is detected. PE2 is identified with location L1, PE3 with L2 and PE4 with location L3. In either case, a START window (608) is placed before the current segment that will be coded with short windows. A STOP window is needed to complete the process (616). There are, however, two possibilities. If the identified location where the strong non-stationarity of the signal begins is L1 or L2 then, this is well inside the short window sequence, no coding artifacts result and the coding sequence is depicted in FIG. 5b. If the location if L4 (612), then, in the worst situation, the non-stationarity may begin very close to the right edge of the last short window. Previous results have consistently shown that placing a STOP window--in coding conditions--in these circumstances degrades significantly the reconstruction of the signal in this switching point. For this reason, another set of four short windows is placed before a STOP window (614). The resulting coding sequence is represented in FIG. 5e.
If none of the short PEs is above the threshold, the remaining possibilities are L4 or L5. In this case, the problem lies ahead of the scope of the short window sequence and the first segment in the buffer may be immediately coded using a regular large window.
To identify the correct location, another short window must be processed. It is represented in FIG. 5a by a dotted curve and its PE value, PE1n+1, is also computed. As it is easily recognized, this short window already belongs to the next segment. If PE1n+1 is above the threshold (611), then, the location is L4 and, as depicted in FIG. 5c, a START window (613) may be followed by a STOP window (615). In this case the spread of the quantization noise will be limited to the length of a short window, and a better coding gain is achieved. In the rare situation of the location being L5, then the coding is done according to the sequence of FIG. 5d. The way to prove that in this case that is right solution is by confirming that PE2n+1 will be above the threshold. PE2n+1 is the PE of the short window (not represented in FIG. 5) immediately following the window identified with PE1n+1.
As mentioned before for each segment, RIGHT and LEFT channels use the same type of analysis/synthesis window. This means that a switch is done for both channels when at least one channel requires it.
It has been observed that for low bitrate applications the solution of FIG. 5c, although representing a good local psychoacoustic solution, demands an unreasonably large number of bits that may adversely affect the coding quality of subsequent segments. For this reason, that coding solution may eventually be inhibited.
It is also evident that the details of the reconstructed signal when short windows are used are closer to the original signal than when only regular large window are used. This is so because the attack is basically a wide bandwidth signal and may only be considered stationary for very short periods of time. Since short windows have a greater temporal resolution than large windows, they are able to follow and reproduce with more fidelity the varying pattern of the spectrum. In other words, this is the difference between a more precise local (in time) quantization of the signal and a global (in frequency) quantization of the signal.
The final masking threshold of the stereophonic coder is calculated using a combination of monophonic and stereophonic thresholds. While the monophonic threshold is computed independently for each channel, the stereophonic one considers both channels.
The independent masking threshold for the RIGHT of the LEFT channel is computed using a psychoacoustic model that includes an expression for tone masking noise and noise masking tone. The latter is used as a conservative approximation for a noise masking noise expression. The monophonic threshold is calculated using the same procedure as previous work. In particular, a tonality measure considers the evolution of the power and the phase of each frequency coefficient across the last three segments to identify the signal as being more tone--like or noise--like. Accordingly, each psychoacoustic expression is more or less weighted than the other. These expressions found in the literature were updated for better performance. They are defined as: ##EQU3## where bark is the frequency in Bark scale. This scale is related to what we may call the cochlear filters or critical bands which, in turn, are identified with constant length segments of the basilar membrane. The final threshold is adjusted to consider absolute thresholds of masking and also to consider a partial premasking protection.
A brief description of the complete monophonic threshold calculation follows. Some terminology must be introduced in order to simplify the description of the operations involved.
The spectrum of each segment is organized in three different ways, each one following a different purpose.
1. First, it may be organized in partitions. Each partition has associated one single Bark value. These partitions provide a resolution of approximately either one MDCT line or 1/3 of a critical band, whichever is wider. At low frequenices a single line of the MDCT will constitute a coder partition. At high frequencies, many lines will be combined into one coder partition. In this case the Bark value associated is the median Bark point of the partition. This partitioning of the spectrum is necessary to insure an acceptable resolution for the spreading function. As will be shown later, this function represents the masking influence among neighboring critical bands.
2. Secondly, the spectrum may be organized in bands. Bands are defined by a parameter file. Each band groups a number of spectral lines that are associated with a single scale factor that results from the final masking threshold vector.
3. Finally, the spectrum may also be organized in sections. It will be shown later that sections involve an integer number of bands and represent a region of the spectrum coded with the same Huffman code book.
Three indices for data values are used. These are:
ω→indicates that the calculation is indexed by frequency in the MDCT line domain.
b→indicates that the calculation is indexed in the threshold calculation partition domain. In the case where we do a convolution or sum in that domain, bb will be used as the summation variable.
n→indicates that the calculation is indexed in the coder band domain.
Additionally some symbols are also used:
1. The index of the calculation partition, b.
2. The lowest frequency line in the partition, ωlowb.
3. The highest frequency line in the partition, ωhighb.
4. The median bark value of the partition, bvalb.
5. The value for tone masking noise (in dB) for the partition, TMNb.
6. The value for noise masking tone (in dB) for the partition, NMTb.
Several points in the following description refer to the "spreading function". It is calculated by the following method:
Where i is the bark value of the signal being spread, j the bark value of the band being spread into, and tmpx is a temporary variable.
Where x is a temporary variable, and minimum(a,b) is a function returning the more negative of a or b.
where tmpy is another temporary variable. ##EQU4## Steps in Threshold Calculation
The following steps are the necessary steps for calculation the SMRn used in the coder.
1. Concatenate 512 new samples of the input signal to form another 1024 samples segment. Please refer to FIG. 5a.
2. Calculate the complex spectrum of the input signal using the O-FFT as described in 2.0 and using a sine window.
3. Calculate a predicted r and φ.
The polar representation of the transform is calculated r.sub.ω and φ.sub.ω represent the magnitude and phase components of a spectral line of the transformed segment.
A predicted magnitude, r.sub.ω, and phase, φ.sub.ω, are calculated from the preceding two threshold calculation blocks' r and φ:
r.sub.ω =2r.sub.ω (t-1)-r.sub.ω (t-2)
φ.sub.ω =2φ.sub.ω (t-1)-φ.sub.ω (t-2)
where t represents the current block number, t-1 indexes the previous block's data, and t-2 indexes the data from the threshold calculation block before that.
4. Calculate the unpredictability measure c.sub.ω c.sub.ω, the unpredictability measure, is: ##EQU5## 5. Calculate the energy and unpredictability in the threshold calculation partitions.
The energy in each partition, eb, is: ##EQU6## and the weighted unpredictability, cb, is: ##EQU7## 6. Convolve the partitioned energy and unpredictability with the spreading function. ##EQU8##
Because ctb is weighted by the signal energy, it must be renormalized to cbb. ##EQU9## At the same time, due to the non-normalized nature of the spreading function, ecbb should be renormalized and the normalized energy enb, calculated. ##EQU10##
The normalization coefficient, rnormb is: ##EQU11## 7. Convert cbb to tbb.
tbb =-0.299-0.43 loge (cbb)
Each tbb is limited to the range of 0≦tbb ≦1.
8. Calculate the required SNR in each partition. ##EQU12##
Where TMNb is the tone masking noise in dB and NMTb is the noise masking tone value in dB.
The required signal to noise ratio, SNRb, is:
SNRb =tbb TMNb +(1-tbb)NMTb
9. Calculate the power ratio.
The power ratio, bcb, is: ##EQU13## 10. Calculation of actual energy threshold, nbb.
nbb =enb bcb
11. Spread the threshold energy over MDCT lines, yielding nb.sub.ω ##EQU14## 12. Include absolute thresholds, yielding the final energy threshold of audibility, thr.sub.ω
thr.sub.ω= max(nb.sub.ω, absthr.sub.ω).
The dB values of absthr shown in the "Absolute Threshold Tables" are relative to the level that a sine wave of ±1/2 lsb has in the MDCT used for threshold calculation. The dB values must be converted into the energy domain after considering the MDCT normalization actually used.
13. Pre-echo control
14. Calculate the signal to mask ratios, SMRn.
The table of "Bands of the Coder" shows
1. The index, n, of the band.
2. The upper index, ωhighn of the band n. The lower index, ωlown, is computed from the previous band as ωhighn-1 +1.
To further classify each band, another variable is created. The width index, widthn, will assume a value widthn =1 if n is a perceptually narrow band, and widthn =0 if n is a perceptually wide band. The former case occurs if
bval.sub.ωhigh.sbsb.b -bval.sub.ωlow.sbsb.b <bandlength
bandlength is a parameter set in the initialization routine. Otherwise the latter case is assumed.
Then, if (widthn =1), the noise level in the coder band, nbandn is calculated as: ##EQU15## else,
nbandn =minimum(thr.sub.ωlow.sbsb.n, . . . ,thr.sub.ωhigh.sbsb.n)
Where, in this case, minimum(a, . . . ,z) is a function returning the most negative or smallest positive argument of the arguments a . . . z.
The ratios to be sent to the decoder, SMRn, are calculated as: ##EQU16##
It is important to emphasize that since the tonality measure is the output of a spectrum analysis process, the analysis window has a sine form for all the cases of large or short segments. In particular, when a segment is chosen to be coded as a START or STOP window, its tonality information is obtained considering a sine window; the remaining operations, e.g. the threshold calculation and the quantization of the coefficients, consider the spectrum obtained with the appropriate window.
The stereophonic threshold has several goals. It is known that most of the time the two channels sound "alike". Thus, some correlation exists that may be converted in coding gain. Looking into the temporal representation of the two channels, this correlation is not obvious. However, the spectral representation has a number of interesting features that may advantageously be exploited. In fact, a very practical and useful possibility is to create a new basis to represent the two channels. This basis involves two orthogonal vectors, the vector SUM and the vector DIFFERENCE defined by the following linear combination: ##EQU17##
These vectors, which have the length of the window being used, are generated in the frequency domain since the transform process is by definition a linear operation. This has the advantage of simplifying the computational load.
The first goal is to have a more decorrelated representation of the two signals. The concentration of most of the energy in one of these new channels is a consequence of the redundancy that exists between RIGHT and LEFT channels and on average, leads always to a coding gain.
A second goal is to correlate the quantization noise of the RIGHT and LEFT channels and control the localization of the noise or the unmasking effect. This problem arises if RIGHT and LEFT channels are quantized and coded independently. This concept is exemplified by the following context: supposing that the threshold of masking for a particular signal has been calculated, two situations may be created. First we add to the signal an amount of noise that corresponds to the threshold. If we present this same signal with this same noise to the two ears then the noise is masked. However, if we add an amount of noise that corresponds to the threshold to the signal and present this combination to one ear; do the same operation for the other ear but with noise uncorrelated with the previous one, then the noise is not masked. In order to achieve masking again, the noise at both ears must be reduced by a level given by the masking level differences (MLD).
The unmasking problem may be generalized to the following form: the quantization noise is not masked if it does not follow the localization of the masking signal. Hence, in particular, we may have two limit cases: center localization of the signal with unmasking more noticeable on the sides of the listener and side localization of the signal with unmasking more noticeable on the center line.
The new vectors SUM and DIFFERENCE are very convenient because they express the signal localized on the center and also on both sides of the listener. Also, they enable to control the quantization noise with center and side image. Thus, the unmasking problem is solved by controlling the protection level for the MLD through these vectors. Based on some psychoacoustic information and other experiments and results, the MLD protection is particularly critical for very low frequencies to about 3 KHz. It appears to depend only on the signal power and not on its tonality properties. The following expression for the MLD proved to give good results: ##EQU18## where i is the partition index of the spectrum (see ), and b(i) is the bark frequency of the center of the partition i. This expression is only valid for b(i)≦16.0 i.e. for frequencies below 3 KHz. The expression for the MLD threshold is given by: ##EQU19##
C(i) is the spread signal energy on the basilar membrane, corresponding only to the partition i.
A third and last goal is to take advantage of a particular stereophonic signal image to extract irrelevance from directions of the signal that are masked by that image. In principle, this is done only when the stereo image is strongly defined in one direction, in order to not compromise the richness of the stereo signal. Based on the vectors SUM and DIFFERENCE, this goal is implemented by postulating the following two dual principles:
1. If there is a strong depression of the signal (and hence of the noise) on both sides of the listener, then an increase of the noise on the middle line (center image) is perceptually tolerated. The upper bound is the side noise.
2. If there is a strong localization of the signal (and hence of the noise) on the middle line, then an increase of the (correlated) noise on both sides is perceptually tolerated. The upper bound is the center noise.
However, any increase of the noise level must be corrected by the MLD threshold.
According to these goals, the final stereophonic threshold is computed as follows. First, the thresholds for channels SUM and DIFFERENCE are calculated using the monophonic models for noise-masking-tone and tone-masking-noise. The procedure is exactly the one presented in pages 25 and 26. At this point we have the actual energy threshold per band, nbb for both channels. By convenience, we call them THRnSUM and THRnDIF, respectively for the channel SUM and the channel DIFFERENCE.
Secondly, the MLD threshold for both channels i.e. THRnMLD,SUM and THRnMLD,DIF, are also calculated by: ##EQU20## The MLD protection and the stereo irrelevance are considered by computing:
nthrSUM =MAX[THRnSUM, MIN(THRnDIF, THRnMLD,DIF)]nthrDIF =MAX[THRnDIF, MIN(THRnSUM, THRnMLD,SUM)]
After these operations, the remaining steps after the 11th, as presented in 3.2 are also taken for both channels. In essence, these last thresholds are further adjusted to consider the absolute threshold and also a partial premasking protection. It must be noticed that this premasking protection was simply adopted from the monophonic case. It considers a monaural time resolution of about 2 milliseconds. However, the binaural time resolution is as accurate as 6 microseconds! To conveniently code stereo signals with relevant stereo image based on interchannel time differences, is a subject that needs further investigation.
The simplified structure of the stereophonic coder allows for the encoding of the stereo signals which are subsequently decoded by the stereophonic decoder which, is presented in FIG. 12. For each segment of data being analysed, detailed information about the independent and relative behavior of both signal channels may be available through the information given by large and short transforms. This information is used according to the necessary number of steps needed to code a particular segment. These steps involve essentially the selection of the analysis window, the definition on a band basis of the coding mode (R/L or S/D), the quantization (704) and Huffman coding (705) of the coefficients (708) and scale factors (707) and finally, the bitstream composing (706) with a bit stream organization as depicted in FIG. 10.
Coding Mode Selection
When a new segment is read, the tonality updating for large and short analysis windows is done. Monophonic thresholds and the PE values are calculated according to the technique described previously. This gives the first decision about the type of window to be used for both channels.
Once the window sequence is chosen, an orthogonal coding decision is then considered. It involves the choice between independent coding of the channels, mode RIGHT/LEFT (R/L) or joint coding using the SUM and DIFFERENCE channels (S/D). This decision is taken on a band basis of the coder. This is based on the assumption that the binaural perception is a function of the output of the same critical bands at the two ears. If the threshold at the two channels is very different, then there is no need for MLD protection and the signals will not be more decorrelated if the channels SUM and DIFFERENCE are considered. If the signals are such that they generate a stereo image, then a MLD protection must be activated and additional gains may be exploited by choosing the S/D coding mode. A convenient way to detect this latter situation is by comparing the monophonic threshold between RIGHT and LEFT channels. If the thresholds in a particular band do not differ by more than a predefined value, e.g. 2 dB, then the S/D coding mode is chosen. Otherwise the independent mode R/L is assumed. Associated which each band is a one bit flag that specifies the coding mode of that band and that must be transmitted to the decoder as side information. From now on it is called a coding mode flag.
The coding mode decision is adaptive in time since for the same band it may differ for subsequent segments, and is also adaptive in frequency since for the same segment, the coding mode for subsequent bands may be different. An illustration of a coding decision is given in FIG. 13. This illustration is valid for long and also short segments.
At this point it is clear that since the window switching mechanism involves only monphonic measures, the maximum number of PE measures per segment is 10 (2 channels *[1 large window+4 short windows]). However, the maximum number of thresholds that we may need to compute per segment is 20 and therefore 20 tonality measures must be always updated per segment (4 channels *[1 large window+4 short windows]).
It was previously said that the decisions for window switching and for coding mode selection are orthogonal in the sense that they do not depend on each other. Independent to these decisions is also the final step of the coding process that involves quantization, Huffman coding and bitstream composing; i.e. there is no feedback path. This fact has the advantage of reducing the whole coding delay to a minimum value (1024/48000=21.3 milliseconds) and also to avoid instabilities due to unorthodox coding situations.
The quantization process effects both spectral and coefficients and scale factors. Spectral coefficients are clustered in bands, each band having the same step size or scale factor. Each step size is directly computed from the masking threshold corresponding to its band. The quantized values, which are integer numbers, are then converted to variable word length or Huffman codes. The total number of bits to code the segment, considering additional fields of the bitstream, is computed. Since the bitrate must be kept constant, the quantization process must be iteratively done till that number of bits is within predefined limits. After the number of bits needed to code the whole segment, considering the basic masking threshold, the degree of adjustment is dictated by a buffer control unit. This control unit shares the deficit or credit of additional bits among several segments, according to the needs of each one.
The technique of the bitrate adjustment routine is represented by the flowchart of FIG. 9. It may be seen that after the total number of available bits to be used by the current segment is computed, an iterative procedure tries to find a factor α such that if all the initial thresholds are multiplied by this factor, the final total number of bits is smaller then and within an error δ of the available number of bits. Even if the approximation curve is so hostile that α is not found within the maximum number of iterations, one acceptable solution is always available.
The main steps of this routine are depicted in FIG. 7 and FIG. 9 as follows. First, an interval including the solution is found. Then, a loop seeks to rapidly converge to the best solution. At each iteration, the best solution is updated. Thus, the total number of bits to represent the present whole segment (710) using the basic masking threshold is evaluated. Next, the total number of bits available to be used by the current segment is computed based on the current buffer status from the buffer control (703). A comparison (903) is made between the total number of bits available in the buffer and the calculated total number of bits to represent the current whole segment. If the required number of bits is less than the available number of bits in the buffer, a further comparison is made to determine if the final total number of bits required is within an error factor of the available number of bits (904). If within the error factor, the total number of bits required to represent the current whole segment are transmitted (916) to the entropy encoder (208). If not within the error factor, an evaluation is done based upon the number of bits required to represent the whole segment at the absolute threshold values (905). If the required number of bits to represent the whole segment at the absolute threshold values are less than the total number of bits available (906) they are transmitted (916) to the entropy encoder (208).
If at this point, neither the basic masking threshold nor absolute thresholds have provided an acceptable bit representation of the whole segment, an iterative procedure (as shown in 907 through 915) is employed to establish the interpolation factor used as a multiplier and discussed previously. If successful, the iterative procedure will establish a bit representation of the whole segment which is within the buffer limit and associated error factor. Otherwise, after reaching a maximum number of iterations (908) the iterative process will return the last best approximation (915) of the whole segment as output (916).
In order to use the same procedure for segments coded with large and short windows, in this latter case, the coefficients of the 4 short windows are clustered by concatenating homologue bands. Scale factors are clustered in the same.
The bitrate adjustment routine (704) calls another routine that computes the total number of bits to represent all the Huffman coded words (705) (coefficients and scale factors). This latter routine does a spectrum partioning according to the amplitude distribution of the coefficients. The goal is to assign predefined Huffman code books to sections of the spectrum. Each section groups a variable number of bands and its coefficients are Huffman coded with a convenient book. The limits of the section and the reference of the code book must be sent to the decoder as side information.
The spectrum partioning is done using a minimum cost strategy. The main steps are as follows. First, all possible sections are defined -the limit is one section per band- each one having the code book that best matches the amplitude distribution of the coefficients within that section. As the beginning and the end of the whole spectrum is known, if K is the number of sections, there are K-1 separators between sections. The price to eliminate each separator is computed. The separator that has a lower price is eliminated (initial prices may be negative). Prices are computed again before the next iteration. This process is repeated till a maximum allowable number of sections is obtained and the smallest price to eliminate another separator is higher than a predefined value.
Aspects of the processing accomplished by quantizer/rate-loop 206 in FIG. 2 will now be presented. In the prior art, rate-loop mechanisms have contained assumptions related to the monophonic case. With the shift from monophonic to stereophonic perceptual coders, the demands placed upon the rate-loop are increased.
The inputs to quantizer/rate-loop 206 in FIG. 2 comprise spectral coefficients (i.e., the MDCT coefficients) derived by analysis filter bank 202, and outputs of perceptual model 204, including calculated thresholds corresponding to the spectral coefficients.
Quantizer/rate-loop 206 quantizes the spectral information based, in part, on the calculated thresholds and the absolute thresholds of hearing and in doing so provides a bitstream to entropy encoder 208. The bitstream includes signals divided into three part: (1) a first part containing the standardized side information; (2) a second part containing the scaling factors for the 35 or 56 bands and additional side information used for so-called adaptive-window switching, when used (the length of this part can vary depending on information in the first part) and (3) a third part comprising the quantized spectral coefficients.
A "utilized scale factor", Δ, is iteratively derived by interpolating between a calculated scale factor and a scale factor derived from the absolute threshold of hearing at the frequency corresponding to the frequency of the respective spectral coefficient to be quantized until the quantized spectral coefficients can be encoded within permissible limits.
An illustrative embodiment of the present invention can be seen in FIG. 13. As shown at 1301 quantizer/rate-loop receives a spectral coefficient, Cf, and an energy threshold, E, corresponding to that spectral coefficient. A "threshold scale factor", Δ0 is calculated by ##EQU21## An "absolute scale factor", ΔA, is also calculated based upon the absolute threshold of hearing (i.e., the quietest sound that can be heard at the frequency corresponding to the scale factor). Advantageously, an interpolation constant, α, and interpolation bounds αhigh and αlow are initialized to aid in the adjustment of the utilized scale factor.
Next, as shown in 1305, the utilized scale factor is determined from:
Next, as shown in 1307, the utilized scale factor is itself quantized because the utilized scale factor as computed above is not discrete but is advantageously discrete when transmitted and used.
Next, as shown in 1309, the spectral coefficient is quantized using the utilized scale factor to create a "quantized spectral coefficient" Q (Cf, Δ). ##EQU22## where "NINT" is the nearest integer function. Because quantizer/rate loop 206 must transmit both the quantized spectral coefficient and the utilized scale factor, a cost, C, is calculated which is associated with how many bits it will take to transmit them both. As shown in FIG. 1311,
C=FOO(Q(Cf, Δ), Q(Δ))
where FOO is a function which, depending on the specific embodiment, can be easily determined by persons having ordinary skill in the art of data communications. As shown in 1313, the cost, C is tested to determine whether it is in a permissible range PR. When the cost is within the permissible range, Q (Cf, Δ) and Q(Δ) are transmitted to entropy coder 208.
Advantageously, and depending on the relationship of the cost C to the permissible range PR the interpolation constant and bounds are adjusted until the utilized scale factor yields a quantized spectral coefficient which has a cost within the permissible range. Illustratively, as shown in FIG. 13 at 1313, the interpolation bounds are manipulated to produce a binary search. Specifically,
when C>PR, αhigh =α,
when C<PR, αlow =α.
In either case, a new interpolation constant is calculated by: ##EQU23## The process then continues at 1305 iteratively until the C comes within the permissible range PR.
The stereophonic decoder has a very simple structure as shown in FIG. 12. Its main functions are reading the incoming bitstream (1202), decoding all the data (1203), inverse quantization and reconstruction of RIGHT and LEFT channels (1204). The technique is represented in FIG. 12. Thus, the decoder is performing complementary operations to that of the encoder depicted in FIG. 7 such as operations that are complementary to quantization (704) and Huffman coding (705).
Illustrative embodiments may comprise digital signal processor (DSP) hardware, such as the AT&T DSP16 or DSP32C, and software performing the operations discussed below of the present invention. Very large scale integration (VLSI) hardware embodiments of the present invention, as well as hybrid DSP/VLSI embodiments, may also be provided. For example, an AT&T DSP16 may be employed to perform the operations of the rate loop processor depicted in FIG. 13. The DSP could receive the spectral coefficients and energy thresholds (1301) and perform the calculation of blocks 1303 and 1305 as described on page 31. Further, the DSP could calculate the utilized scale factor according to the equation given on page 32 and depicted in block 1305. The quantization blocks 1307 and 1308 can be carried out as described on page 32. Finally, the DSP may perform the cost calculation (1311) and comparison (1313) associated with quantization. The cost calculation is described on page 32 and illustrated further in FIG. 9. In this way, the interpolation factor may be adjusted (1315) according to the analysis carried out within the DSP or similar type hardware embodiments. It is to be understood that the above-described embodiments is merely illustrative of the principles of this invention. Other arrangements may be devised by those skilled in the art without departing from the spirit and scope of the invention.
|Brevet cité||Date de dépôt||Date de publication||Déposant||Titre|
|US4216354 *||29 nov. 1978||5 août 1980||International Business Machines Corporation||Process for compressing data relative to voice signals and device applying said process|
|US4860313 *||21 sept. 1987||22 août 1989||Eci Telecom Ltd.||Adaptive differential pulse code modulation (ADPCM) systems|
|US4953214 *||21 juil. 1988||28 août 1990||Matushita Electric Industrial Co., Ltd.||Signal encoding and decoding method and device|
|US4972484 *||20 nov. 1987||20 nov. 1990||Bayerische Rundfunkwerbung Gmbh||Method of transmitting or storing masked sub-band coded audio signals|
|US5014318 *||25 févr. 1989||7 mai 1991||Fraunhofer Gesellschaft Zur Forderung Der Angewandten Forschung E. V.||Apparatus for checking audio signal processing systems|
|US5054217 *||29 mai 1990||8 oct. 1991||Sandvik Ab||Hard insert for ice/snow clearing tool|
|US5079547 *||27 févr. 1991||7 janv. 1992||Victor Company Of Japan, Ltd.||Method of orthogonal transform coding/decoding|
|US5185800 *||24 juin 1992||9 févr. 1993||Centre National D'etudes Des Telecommunications||Bit allocation device for transformed digital audio broadcasting signals with adaptive quantization based on psychoauditive criterion|
|US5218435 *||20 févr. 1991||8 juin 1993||Massachusetts Institute Of Technology||Digital advanced television systems|
|US5285498 *||2 mars 1992||8 févr. 1994||At&T Bell Laboratories||Method and apparatus for coding audio signals based on perceptual model|
|EP0376553A2 *||14 déc. 1989||4 juil. 1990||AT&T Corp.||Perceptual coding of audio signals|
|1||J. D.Johnston, "Transform Coding of Audio Signals Using Perceptual Noise Criteria", IEEE J. on Selected Areas in Communications, vol. 6, No. 2, pp. 314 to 323 (1988).|
|2||*||J. D.Johnston, Transform Coding of Audio Signals Using Perceptual Noise Criteria , IEEE J. on Selected Areas in Communications , vol. 6, No. 2, pp. 314 to 323 (1988).|
|3||Musmann, H.G, "The Iso Audio Coding Standard," Globecom'90, vol. 1(3), Dec. 1990, NY, USA, pp. 511-517.|
|4||*||Musmann, H.G, The Iso Audio Coding Standard, Globecom 90, vol. 1(3), Dec. 1990, NY, USA, pp. 511 517.|
|5||R.N.J. Veldhuis et al., "Subband Coding of Digital Audio Signals," Philips Journal of Research, vol. 44, No. 2/3, Jul. 1989, pp. 329-343.|
|6||*||R.N.J. Veldhuis et al., Subband Coding of Digital Audio Signals, Philips Journal of Research, vol. 44, No. 2/3, Jul. 1989, pp. 329 343.|
|Brevet citant||Date de dépôt||Date de publication||Déposant||Titre|
|US5737721 *||6 nov. 1995||7 avr. 1998||Daewoo Electronics Co., Ltd.||Predictive technique for signal to mask ratio calculations|
|US5909467 *||10 juin 1997||1 juin 1999||Goldstar Co., Ltd.||Digital signal encoding/decoding apparatuses and related methods|
|US5913191 *||17 oct. 1997||15 juin 1999||Dolby Laboratories Licensing Corporation||Frame-based audio coding with additional filterbank to suppress aliasing artifacts at frame boundaries|
|US5918203 *||9 févr. 1996||29 juin 1999||Fraunhofer-Gesellschaft Zur Forderung Der Angewandten Forschung E.V.||Method and device for determining the tonality of an audio signal|
|US5956674 *||2 mai 1996||21 sept. 1999||Digital Theater Systems, Inc.||Multi-channel predictive subband audio coder using psychoacoustic adaptive bit allocation in frequency, time and over the multiple channels|
|US5974380 *||16 déc. 1997||26 oct. 1999||Digital Theater Systems, Inc.||Multi-channel audio decoder|
|US6037987 *||31 déc. 1997||14 mars 2000||Sarnoff Corporation||Apparatus and method for selecting a rate and distortion based coding mode for a coding system|
|US6091773 *||12 nov. 1997||18 juil. 2000||Sydorenko; Mark R.||Data compression method and apparatus|
|US6128593 *||4 août 1998||3 oct. 2000||Sony Corporation||System and method for implementing a refined psycho-acoustic modeler|
|US6161088 *||26 juin 1998||12 déc. 2000||Texas Instruments Incorporated||Method and system for encoding a digital audio signal|
|US6240379 *||24 déc. 1998||29 mai 2001||Sony Corporation||System and method for preventing artifacts in an audio data encoder device|
|US6263312||2 mars 1998||17 juil. 2001||Alaris, Inc.||Audio compression and decompression employing subband decomposition of residual signal and distortion reduction|
|US6424939||13 mars 1998||23 juil. 2002||Fraunhofer-Gesellschaft Zur Forderung Der Angewandten Forschung E.V.||Method for coding an audio signal|
|US6456963 *||20 mars 2000||24 sept. 2002||Ricoh Company, Ltd.||Block length decision based on tonality index|
|US6499010||4 janv. 2000||24 déc. 2002||Agere Systems Inc.||Perceptual audio coder bit allocation scheme providing improved perceptual quality consistency|
|US6594019 *||29 sept. 2000||15 juil. 2003||Ando Electric Co., Ltd.||Data processor and data processing method for wavemeter|
|US6600783 *||19 juin 2000||29 juil. 2003||Victor Company Of Japan, Ltd.||Apparatus and method of encoding moving picture signal|
|US6625574||25 août 2000||23 sept. 2003||Matsushita Electric Industrial., Ltd.||Method and apparatus for sub-band coding and decoding|
|US6650624||19 mai 2000||18 nov. 2003||Broadcom Corporation||Cable modem apparatus and method|
|US6678647 *||2 juin 2000||13 janv. 2004||Agere Systems Inc.||Perceptual coding of audio signals using cascaded filterbanks for performing irrelevancy reduction and redundancy reduction with different spectral/temporal resolution|
|US6741965 *||10 avr. 1998||25 mai 2004||Sony Corporation||Differential stereo using two coding techniques|
|US6771777 *||3 juin 1997||3 août 2004||Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V.||Process for coding and decoding stereophonic spectral values|
|US6772111 *||29 mai 2001||3 août 2004||Ricoh Company, Ltd.||Digital audio coding apparatus, method and computer readable medium|
|US6799164||4 août 2000||28 sept. 2004||Ricoh Company, Ltd.||Method, apparatus, and medium of digital acoustic signal coding long/short blocks judgement by frame difference of perceptual entropy|
|US6922442 *||5 juin 2003||26 juil. 2005||Victor Company Of Japan, Ltd.||Apparatus and method of encoding moving picture signal|
|US6934677 *||14 déc. 2001||23 août 2005||Microsoft Corporation||Quantization matrices based on critical band pattern information for digital audio wherein quantization bands differ from critical bands|
|US6961314||25 août 2000||1 nov. 2005||Broadcom Corporation||Burst receiver for cable modem system|
|US6980933 *||27 janv. 2004||27 déc. 2005||Dolby Laboratories Licensing Corporation||Coding techniques using estimated spectral magnitude and phase derived from MDCT coefficients|
|US6999919 *||20 févr. 2001||14 févr. 2006||Intervideo, Inc.||Fast convergence method for bit allocation stage of MPEG audio layer 3 encoders|
|US7103065||16 nov. 2000||5 sept. 2006||Broadcom Corporation||Data packet fragmentation in a cable modem system|
|US7110953 *||2 juin 2000||19 sept. 2006||Agere Systems Inc.||Perceptual coding of audio signals using separated irrelevancy reduction and redundancy reduction|
|US7120123||9 nov. 2000||10 oct. 2006||Broadcom Corporation||Pre-equalization technique for upstream communication between cable modem and headend|
|US7139283||9 févr. 2001||21 nov. 2006||Broadcom Corporation||Robust techniques for optimal upstream communication between cable modem subscribers and a headend|
|US7143030||17 févr. 2005||28 nov. 2006||Microsoft Corporation||Parametric compression/decompression modes for quantization matrices for digital audio|
|US7155383||17 févr. 2005||26 déc. 2006||Microsoft Corporation||Quantization matrices for jointly coded channels of audio|
|US7240001||14 déc. 2001||3 juil. 2007||Microsoft Corporation||Quality improvement techniques in an audio encoder|
|US7249016||17 févr. 2005||24 juil. 2007||Microsoft Corporation||Quantization matrices using normalized-block pattern of digital audio|
|US7269554 *||19 févr. 2004||11 sept. 2007||Intel Corporation||Method, apparatus, and system for efficient rate control in audio encoding|
|US7299190||15 août 2003||20 nov. 2007||Microsoft Corporation||Quantization and inverse quantization for audio|
|US7318028||31 août 2006||8 janv. 2008||Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V.||Method and apparatus for determining an estimate|
|US7502743||15 août 2003||10 mars 2009||Microsoft Corporation||Multi-channel audio encoding and decoding with multi-channel transform selection|
|US7505780||28 juil. 2003||17 mars 2009||Qualcomm Incorporated||Outer-loop power control for wireless communication systems|
|US7512154||11 oct. 2006||31 mars 2009||Broadcom Corporation||Data packet fragmentation in a wireless communication system|
|US7512946 *||21 mars 2002||31 mars 2009||International Business Machines Corporation||Scheduling method and system for controlling execution of processes|
|US7519082||2 déc. 2005||14 avr. 2009||Broadcom Corporation||Data packet fragmentation in a wireless communication system|
|US7539612||15 juil. 2005||26 mai 2009||Microsoft Corporation||Coding and decoding scale factor information|
|US7562021||15 juil. 2005||14 juil. 2009||Microsoft Corporation||Modification of codewords in dictionary used for efficient coding of digital media spectral data|
|US7565018||21 juil. 2009||Microsoft Corporation||Adaptive coding and decoding of wide-range coefficients|
|US7599840||15 juil. 2005||6 oct. 2009||Microsoft Corporation||Selectively using multiple entropy models in adaptive coding and decoding|
|US7613603||10 nov. 2005||3 nov. 2009||Fujitsu Limited||Audio coding device with fast algorithm for determining quantization step sizes based on psycho-acoustic model|
|US7630882||8 déc. 2009||Microsoft Corporation||Frequency segmentation to obtain bands for efficient coding of digital media|
|US7684981 *||15 juil. 2005||23 mars 2010||Microsoft Corporation||Prediction of spectral coefficients in waveform coding and decoding|
|US7693709||15 juil. 2005||6 avr. 2010||Microsoft Corporation||Reordering coefficients for waveform coding or decoding|
|US7761290||15 juin 2007||20 juil. 2010||Microsoft Corporation||Flexible frequency and time partitioning in perceptual transform coding of audio|
|US7801735||21 sept. 2010||Microsoft Corporation||Compressing and decompressing weight factors using temporal prediction for audio data|
|US7821954||23 oct. 2006||26 oct. 2010||Broadcom Corporation||Methods to compensate for noise in a wireless communication system|
|US7822601||16 mai 2008||26 oct. 2010||Microsoft Corporation||Adaptive vector Huffman coding and decoding based on a sum of values of audio data symbols|
|US7831434||20 janv. 2006||9 nov. 2010||Microsoft Corporation||Complex-transform channel coding with extended-band frequency coding|
|US7835904 *||3 mars 2006||16 nov. 2010||Microsoft Corp.||Perceptual, scalable audio compression|
|US7840403||23 nov. 2010||Microsoft Corporation||Entropy coding using escape codes to switch between plural code tables|
|US7843847||23 oct. 2006||30 nov. 2010||Broadcom Corporation||Compensating for noise in a wireless communication system|
|US7860720||15 mai 2008||28 déc. 2010||Microsoft Corporation||Multi-channel audio encoding and decoding with different window configurations|
|US7885819||8 févr. 2011||Microsoft Corporation||Bitstream syntax for multi-process audio decoding|
|US7899034||1 mars 2011||Broadcom Corporation||Methods for the synchronization of multiple base stations in a wireless communication system|
|US7917369||18 avr. 2007||29 mars 2011||Microsoft Corporation||Quality improvement techniques in an audio encoder|
|US7930171||23 juil. 2007||19 avr. 2011||Microsoft Corporation||Multi-channel audio encoding/decoding with parametric compression/decompression and weight factors|
|US7930185||19 avr. 2011||Fujitsu Limited||Apparatus and method for controlling audio-frame division|
|US7933337||26 avr. 2011||Microsoft Corporation||Prediction of transform coefficients for image compression|
|US7953604||20 janv. 2006||31 mai 2011||Microsoft Corporation||Shape and scale parameters for extended-band frequency coding|
|US8005072||30 mars 2006||23 août 2011||Broadcom Corporation||Synchronization of multiple base stations in a wireless communication system|
|US8023950||20 sept. 2011||Qualcomm Incorporated||Systems and methods for using selectable frame durations in a wireless communication system|
|US8046214||25 oct. 2011||Microsoft Corporation||Low complexity decoder for complex transform coding of multi-channel sound|
|US8069050||29 nov. 2011||Microsoft Corporation||Multi-channel audio encoding and decoding|
|US8069052||3 août 2010||29 nov. 2011||Microsoft Corporation||Quantization and inverse quantization for audio|
|US8081598||13 janv. 2004||20 déc. 2011||Qualcomm Incorporated||Outer-loop power control for wireless communication systems|
|US8090574||19 oct. 2010||3 janv. 2012||Microsoft Corporation||Entropy encoding and decoding using direct level and run-length/level context-adaptive arithmetic coding/decoding modes|
|US8099292||17 janv. 2012||Microsoft Corporation||Multi-channel audio encoding and decoding|
|US8135588 *||13 oct. 2006||13 mars 2012||Panasonic Corporation||Transform coder and transform coding method|
|US8150407||6 févr. 2004||3 avr. 2012||Qualcomm Incorporated||System and method for scheduling transmissions in a wireless communication system|
|US8179974||15 mai 2012||Microsoft Corporation||Multi-level representation of reordered transform coefficients|
|US8184710||22 mai 2012||Microsoft Corporation||Adaptive truncation of transform coefficient data in a transform-based digital media codec|
|US8190425||20 janv. 2006||29 mai 2012||Microsoft Corporation||Complex cross-correlation parameters for multi-channel audio|
|US8201039||12 juin 2012||Qualcomm Incorporated||Combining grant, acknowledgement, and rate control commands|
|US8224660 *||12 mars 2007||17 juil. 2012||France Telecom||Method of coding a source audio signal, corresponding coding device, decoding method and device, signal, computer program products|
|US8229741 *||24 juil. 2012||Intel Corporation||Method and apparatus for encoding audio data|
|US8249883||21 août 2012||Microsoft Corporation||Channel extension coding for multi-channel source|
|US8255229||27 janv. 2011||28 août 2012||Microsoft Corporation||Bitstream syntax for multi-process audio decoding|
|US8255230||14 déc. 2011||28 août 2012||Microsoft Corporation||Multi-channel audio encoding and decoding|
|US8255234||18 oct. 2011||28 août 2012||Microsoft Corporation||Quantization and inverse quantization for audio|
|US8265140||30 sept. 2008||11 sept. 2012||Microsoft Corporation||Fine-grained client-side control of scalable media delivery|
|US8311818||13 nov. 2012||Panasonic Corporation||Transform coder and transform coding method|
|US8325800||4 déc. 2012||Microsoft Corporation||Encoding streaming media as a high bit rate layer, a low bit rate layer, and one or more intermediate bit rate layers|
|US8370887||7 août 2008||5 févr. 2013||Microsoft Corporation||Media streaming with enhanced seek operation|
|US8379851||12 mai 2008||19 févr. 2013||Microsoft Corporation||Optimized client side rate control and indexed file layout for streaming media|
|US8386269||26 févr. 2013||Microsoft Corporation||Multi-channel audio encoding and decoding|
|US8391249||30 juin 2003||5 mars 2013||Qualcomm Incorporated||Code division multiplexing commands on a code division multiplexed channel|
|US8406307||22 août 2008||26 mars 2013||Microsoft Corporation||Entropy coding/decoding of hierarchically organized data|
|US8428943||23 avr. 2013||Microsoft Corporation||Quantization matrices for digital audio|
|US8457194||4 juin 2013||Microsoft Corporation||Processing real-time video|
|US8477592||24 mars 2004||2 juil. 2013||Qualcomm Incorporated||Interference and noise estimation in an OFDM system|
|US8489949||17 févr. 2004||16 juil. 2013||Qualcomm Incorporated||Combining grant, acknowledgement, and rate control commands|
|US8526966||19 juil. 2006||3 sept. 2013||Qualcomm Incorporated||Scheduled and autonomous transmission and acknowledgement|
|US8548387 *||2 janv. 2007||1 oct. 2013||Qualcomm Incorporated||Method and apparatus for providing uplink signal-to-noise ratio (SNR) estimation in a wireless communication system|
|US8554569 *||27 août 2009||8 oct. 2013||Microsoft Corporation||Quality improvement techniques in an audio encoder|
|US8576894||18 août 2010||5 nov. 2013||Qualcomm Incorporated||Systems and methods for using code space in spread-spectrum communications|
|US8589154||11 juin 2012||19 nov. 2013||Intel Corporation||Method and apparatus for encoding audio data|
|US8620674||31 janv. 2013||31 déc. 2013||Microsoft Corporation||Multi-channel audio encoding and decoding|
|US8645127||26 nov. 2008||4 févr. 2014||Microsoft Corporation||Efficient coding of digital media spectral data using wide-sense perceptual similarity|
|US8645146||27 août 2012||4 févr. 2014||Microsoft Corporation||Bitstream syntax for multi-process audio decoding|
|US8676128 *||17 sept. 2010||18 mars 2014||Qualcomm Incorporated||Method and apparatus for providing uplink signal-to-noise ratio (SNR) estimation in a wireless communication system|
|US8699452||17 déc. 2009||15 avr. 2014||Qualcomm Incorporated||Congestion control in a wireless data network|
|US8705588||20 févr. 2004||22 avr. 2014||Qualcomm Incorporated||Systems and methods for using code space in spread-spectrum communications|
|US8712783||29 nov. 2011||29 avr. 2014||Microsoft Corporation||Entropy encoding and decoding using direct level and run-length/level context-adaptive arithmetic coding/decoding modes|
|US8805696 *||7 oct. 2013||12 août 2014||Microsoft Corporation||Quality improvement techniques in an audio encoder|
|US8819754||10 janv. 2013||26 août 2014||Microsoft Corporation||Media streaming with enhanced seek operation|
|US8913668||29 sept. 2008||16 déc. 2014||Microsoft Corporation||Perceptual mechanism for the selection of residues in video coders|
|US8977283||26 sept. 2012||10 mars 2015||Qualcomm Incorporated||Scheduled and autonomous transmission and acknowledgement|
|US9026452||4 févr. 2014||5 mai 2015||Microsoft Technology Licensing, Llc||Bitstream syntax for multi-process audio decoding|
|US9055374||24 juin 2010||9 juin 2015||Arizona Board Of Regents For And On Behalf Of Arizona State University||Method and system for determining an auditory pattern of an audio segment|
|US9065409 *||25 mars 2011||23 juin 2015||Telefonaktiebolaget L M Ericsson (Publ)||Method and arrangement for processing of audio signals|
|US9066177 *||25 mars 2011||23 juin 2015||Telefonaktiebolaget L M Ericsson (Publ)||Method and arrangement for processing of audio signals|
|US9105271||19 oct. 2010||11 août 2015||Microsoft Technology Licensing, Llc||Complex-transform channel coding with extended-band frequency coding|
|US9153240||11 juil. 2013||6 oct. 2015||Telefonaktiebolaget L M Ericsson (Publ)||Transform coding of speech and audio signals|
|US9159331 *||14 mai 2012||13 oct. 2015||Samsung Electronics Co., Ltd.||Bit allocating, audio encoding and decoding|
|US9172965||27 avr. 2012||27 oct. 2015||Microsoft Technology Licensing, Llc||Multi-level representation of reordered transform coefficients|
|US9301310||2 juil. 2013||29 mars 2016||Broadcom Corporation||Robust techniques for upstream communication between subscriber stations and a base station|
|US9305558||26 mars 2013||5 avr. 2016||Microsoft Technology Licensing, Llc||Multi-channel audio encoding/decoding with parametric compression/decompression and weight factors|
|US9307236 *||12 mars 2013||5 avr. 2016||Broadcom Corporation||System and method for multi-row decoding of video with dependent rows|
|US9349376||9 avr. 2015||24 mai 2016||Microsoft Technology Licensing, Llc||Bitstream syntax for multi-process audio decoding|
|US9390720||31 mars 2014||12 juil. 2016||Microsoft Technology Licensing, Llc||Entropy encoding and decoding using direct level and run-length/level context-adaptive arithmetic coding/decoding modes|
|US20010032086 *||20 févr. 2001||18 oct. 2001||Shahab Layeghi||Fast convergence method for bit allocation stage of mpeg audio layer 3 encoders|
|US20010055319 *||9 févr. 2001||27 déc. 2001||Broadcom Corporation||Robust techniques for optimal upstream communication between cable modem subscribers and a headend|
|US20020022898 *||29 mai 2001||21 févr. 2002||Ricoh Company, Ltd.||Digital audio coding apparatus, method and computer readable medium|
|US20030115041 *||14 déc. 2001||19 juin 2003||Microsoft Corporation||Quality improvement techniques in an audio encoder|
|US20030215013 *||10 avr. 2002||20 nov. 2003||Budnikov Dmitry N.||Audio encoder with adaptive short window grouping|
|US20040044527 *||15 août 2003||4 mars 2004||Microsoft Corporation||Quantization and inverse quantization for audio|
|US20040049379 *||15 août 2003||11 mars 2004||Microsoft Corporation||Multi-channel audio encoding and decoding|
|US20040160922 *||28 juil. 2003||19 août 2004||Sanjiv Nanda||Method and apparatus for controlling data rate of a reverse link in a communication system|
|US20040160933 *||30 juin 2003||19 août 2004||Odenwalder Joseph P.||Code division multiplexing commands on a code division multiplexed channel|
|US20040162098 *||28 juil. 2003||19 août 2004||Yongbin Wei||Outer-loop power control for wireless communication systems|
|US20040162723 *||19 févr. 2004||19 août 2004||Lopez-Estrada Alex A.||Method, apparatus, and system for efficient rate control in audio encoding|
|US20040228389 *||20 févr. 2004||18 nov. 2004||Odenwalder Joseph P.||Systems and methods for using code space in spread-spectrum communications|
|US20050002324 *||24 mars 2004||6 janv. 2005||Arak Sutivong||Interference and noise estimation in an OFDM system|
|US20050003843 *||6 févr. 2004||6 janv. 2005||Ho Sai Yiu Duncan||System and method for scheduling transmissions in a wireless communication system|
|US20050007986 *||13 janv. 2004||13 janv. 2005||Malladi Durga P.||Outer-loop power control for wireless communication systems|
|US20050030911 *||17 févr. 2004||10 févr. 2005||Tiedemann Edward G.||Combining grant, acknowledgement, and rate control commands|
|US20050149323 *||17 févr. 2005||7 juil. 2005||Microsoft Corporation||Quantization matrices for digital audio|
|US20050149324 *||17 févr. 2005||7 juil. 2005||Microsoft Corporation||Quantization matrices for digital audio|
|US20050159947 *||17 févr. 2005||21 juil. 2005||Microsoft Corporation||Quantization matrices for digital audio|
|US20050165587 *||27 janv. 2004||28 juil. 2005||Cheng Corey I.||Coding techniques using estimated spectral magnitude and phase derived from mdct coefficients|
|US20050192750 *||21 mars 2002||1 sept. 2005||Maclellan Scot||Scheduling method and system for controlling execution of processes|
|US20060074693 *||10 nov. 2005||6 avr. 2006||Hiroaki Yamashita||Audio coding device with fast algorithm for determining quantization step sizes based on psycho-acoustic model|
|US20060088056 *||2 déc. 2005||27 avr. 2006||Broadcom Corporation||Data packet fragmentation in a cable modem system|
|US20060147124 *||15 févr. 2006||6 juil. 2006||Agere Systems Inc.||Perceptual coding of image signals using separated irrelevancy reduction and redundancy reduction|
|US20060182148 *||30 mars 2006||17 août 2006||Broadcom Corporation||Method and apparatus for the synchronization of multiple cable modern termination system devices|
|US20060264220 *||19 juil. 2006||23 nov. 2006||Tao Chen||Scheduled and autonomous transmission and acknowledgement|
|US20070016406 *||15 juil. 2005||18 janv. 2007||Microsoft Corporation||Reordering coefficients for waveform coding or decoding|
|US20070016412 *||15 juil. 2005||18 janv. 2007||Microsoft Corporation||Frequency segmentation to obtain bands for efficient coding of digital media|
|US20070016414 *||15 juil. 2005||18 janv. 2007||Microsoft Corporation||Modification of codewords in dictionary used for efficient coding of digital media spectral data|
|US20070016415 *||15 juil. 2005||18 janv. 2007||Microsoft Corporation||Prediction of spectral coefficients in waveform coding and decoding|
|US20070016418 *||15 juil. 2005||18 janv. 2007||Microsoft Corporation||Selectively using multiple entropy models in adaptive coding and decoding|
|US20070016948 *||15 juil. 2005||18 janv. 2007||Microsoft Corporation||Immunizing HTML browsers and extensions from known vulnerabilities|
|US20070036224 *||12 août 2005||15 févr. 2007||Microsoft Corporation||Prediction of transform coefficients for image compression|
|US20070036443 *||12 août 2005||15 févr. 2007||Microsoft Corporation||Adaptive coding and decoding of wide-range coefficients|
|US20070086484 *||11 oct. 2006||19 avr. 2007||Broadcom Corporation||Data packet fragmentation in a wireless communication system|
|US20070109995 *||23 oct. 2006||17 mai 2007||Broadcom Corporation||Compensating for noise in a wireless communication system|
|US20070111669 *||2 janv. 2007||17 mai 2007||Qualcomm, Inc.||Method and apparatus for providing uplink signal-to-noise ratio (snr) estimation in a wireless communication system|
|US20070140209 *||2 févr. 2007||21 juin 2007||Broadcom Corporation||Methods for the synchronization of multiple base stations in a wireless communication system|
|US20070172071 *||20 janv. 2006||26 juil. 2007||Microsoft Corporation||Complex transforms for multi-channel audio|
|US20070174063 *||20 janv. 2006||26 juil. 2007||Microsoft Corporation||Shape and scale parameters for extended-band frequency coding|
|US20070185706 *||18 avr. 2007||9 août 2007||Microsoft Corporation||Quality improvement techniques in an audio encoder|
|US20070208557 *||3 mars 2006||6 sept. 2007||Microsoft Corporation||Perceptual, scalable audio compression|
|US20080015850 *||23 juil. 2007||17 janv. 2008||Microsoft Corporation||Quantization matrices for digital audio|
|US20080021704 *||25 sept. 2007||24 janv. 2008||Microsoft Corporation||Quantization and inverse quantization for audio|
|US20080154589 *||3 mars 2008||26 juin 2008||Fujitsu Limited||Apparatus and method for encoding audio signals|
|US20080194286 *||22 avr. 2008||14 août 2008||Qualcomm Incorporated||Systems and methods for performing outer loop power control in wireless communication systems|
|US20080198933 *||29 juin 2007||21 août 2008||Microsoft Corporation||Adaptive truncation of transform coefficient data in a transform-based ditigal media codec|
|US20080228476 *||27 mai 2008||18 sept. 2008||Microsoft Corporation||Entropy coding by adapting coding between level and run length/level modes|
|US20080262855 *||16 mai 2008||23 oct. 2008||Microsoft Corporation||Entropy coding by adapting coding between level and run length/level modes|
|US20080319739 *||22 juin 2007||25 déc. 2008||Microsoft Corporation||Low complexity decoder for complex transform coding of multi-channel sound|
|US20090006103 *||29 juin 2007||1 janv. 2009||Microsoft Corporation||Bitstream syntax for multi-process audio decoding|
|US20090083043 *||12 mars 2007||26 mars 2009||France Telecom||Method of coding a source audio signal, corresponding coding device, decoding method and device, signal, computer program products|
|US20090083046 *||26 nov. 2008||26 mars 2009||Microsoft Corporation||Efficient coding of digital media spectral data using wide-sense perceptual similarity|
|US20090083602 *||13 oct. 2008||26 mars 2009||Qualcomm Incorporated||Operation of a forward link acknowledgement channel for the reverse link data|
|US20090112606 *||26 oct. 2007||30 avr. 2009||Microsoft Corporation||Channel extension coding for multi-channel source|
|US20090144054 *||25 nov. 2008||4 juin 2009||Kabushiki Kaisha Toshiba||Embedded system to perform frame switching|
|US20090273706 *||5 nov. 2009||Microsoft Corporation||Multi-level representation of reordered transform coefficients|
|US20090276210 *||29 mars 2007||5 nov. 2009||Panasonic Corporation||Stereo audio encoding apparatus, stereo audio decoding apparatus, and method thereof|
|US20090281811 *||13 oct. 2006||12 nov. 2009||Panasonic Corporation||Transform coder and transform coding method|
|US20090326962 *||31 déc. 2009||Microsoft Corporation||Quality improvement techniques in an audio encoder|
|US20100080283 *||1 avr. 2010||Microsoft Corporation||Processing real-time video|
|US20100080302 *||29 sept. 2008||1 avr. 2010||Microsoft Corporation||Perceptual mechanism for the selection of residues in video coders|
|US20100135156 *||17 déc. 2009||3 juin 2010||Qualcomm Incorporated||Congestion control in a wireless data network|
|US20100318368 *||3 août 2010||16 déc. 2010||Microsoft Corporation||Quantization and inverse quantization for audio|
|US20110009066 *||17 sept. 2010||13 janv. 2011||Qualcomm, Inc.||Method and apparatus for providing uplink signal-to-noise ratio (snr) estimation in a wireless communication system|
|US20110035212 *||26 août 2008||10 févr. 2011||Telefonaktiebolaget L M Ericsson (Publ)||Transform coding of speech and audio signals|
|US20110035225 *||19 oct. 2010||10 févr. 2011||Microsoft Corporation||Entropy coding using escape codes to switch between plural code tables|
|US20110035226 *||10 févr. 2011||Microsoft Corporation||Complex-transform channel coding with extended-band frequency coding|
|US20110054916 *||11 nov. 2010||3 mars 2011||Microsoft Corporation||Multi-channel audio encoding and decoding|
|US20110060597 *||10 nov. 2010||10 mars 2011||Microsoft Corporation||Multi-channel audio encoding and decoding|
|US20110071839 *||25 nov. 2010||24 mars 2011||Budnikov Dmitry N||Method and apparatus for encoding audio data|
|US20110150229 *||24 juin 2010||23 juin 2011||Arizona Board Of Regents For And On Behalf Of Arizona State University||Method and system for determining an auditory pattern of an audio segment|
|US20110166864 *||7 juil. 2011||Microsoft Corporation||Quantization matrices for digital audio|
|US20110196684 *||11 août 2011||Microsoft Corporation||Bitstream syntax for multi-process audio decoding|
|US20120101825 *||24 oct. 2011||26 avr. 2012||Samsung Electronics Co., Ltd.||Method and apparatus for encoding/decoding audio data with scalability|
|US20120243702 *||27 sept. 2012||Telefonaktiebolaget L M Ericsson (Publ)||Method and arrangement for processing of audio signals|
|US20120243706 *||25 mars 2011||27 sept. 2012||Telefonaktiebolaget L M Ericsson (Publ)||Method and Arrangement for Processing of Audio Signals|
|US20120290307 *||15 nov. 2012||Samsung Electronics Co., Ltd.||Bit allocating, audio encoding and decoding|
|US20130195175 *||12 mars 2013||1 août 2013||Broadcom Corporation||System and method for multi-row decoding of video with dependent rows|
|US20140316788 *||30 juin 2014||23 oct. 2014||Microsoft Corporation||Quality improvement techniques in an audio encoder|
|USRE39080||13 août 2002||25 avr. 2006||Lucent Technologies Inc.||Rate loop processor for perceptual encoder/decoder|
|USRE40280||12 oct. 2005||29 avr. 2008||Lucent Technologies Inc.||Rate loop processor for perceptual encoder/decoder|
|USRE42935 *||21 déc. 2007||15 nov. 2011||Dolby Laboratories Licensing Corporation||Coding techniques using estimated spectral magnitude and phase derived from MDCT coefficients|
|USRE44126 *||15 nov. 2011||2 avr. 2013||Dolby Laboratories Licensing Corporation||Coding techniques using estimated spectral magnitude and phase derived from MDCT coefficients|
|CN1938758B||17 févr. 2005||10 nov. 2010||弗兰霍菲尔运输应用研究公司||Method and apparatus for determining an estimate|
|CN101790757B||26 août 2008||30 mai 2012||爱立信电话股份有限公司||Improved transform coding of speech and audio signals|
|CN101853663B||30 mars 2009||23 mai 2012||华为技术有限公司||Bit allocation method, encoding device and decoding device|
|EP0986047A2 *||8 sept. 1999||15 mars 2000||Nds Limited||Audio encoding system|
|EP1074976A2 *||4 août 2000||7 févr. 2001||Ricoh Company, Ltd.||Block switching based subband audio coder|
|EP1117089A1 *||7 août 2000||18 juil. 2001||Lucent Technologies Inc.||Perceptual audio coder bit allocation scheme providing improved perceptual quality consistency|
|WO2005083680A1 *||17 févr. 2005||9 sept. 2005||Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V.||Device and method for determining an estimated value|
|WO2009029035A1 *||26 août 2008||5 mars 2009||Telefonaktiebolaget Lm Ericsson (Publ)||Improved transform coding of speech and audio signals|
|Classification aux États-Unis||704/200.1, 704/229|
|Classification internationale||G10L19/00, G10L11/00, H03M7/30, H03M7/40, G10L19/02, H03M7/36, H04B1/66, H03M1/12|
|7 juin 1995||AS||Assignment|
Owner name: AT&T IPM CORP., FLORIDA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:AT&T CORP.;REEL/FRAME:007528/0038
Effective date: 19950523
Owner name: AT&T CORP., NEW YORK
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:AMERICAN TELELPHONE AND TELEGRAPH COMPANY;REEL/FRAME:007527/0274
Effective date: 19940420
|19 févr. 1997||AS||Assignment|
Owner name: LUCENT TECHNOLOGIES INC., NEW JERSEY
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:AT&T CORP.;REEL/FRAME:008502/0735
Effective date: 19960329
|28 sept. 2000||FPAY||Fee payment|
Year of fee payment: 4
|28 mars 2001||AS||Assignment|
Owner name: LUCENT TECHNOLOGIES, INC., NEW JERSEY
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:AT&T CORP.;REEL/FRAME:011658/0857
Effective date: 19960329
|5 avr. 2001||AS||Assignment|
Owner name: THE CHASE MANHATTAN BANK, AS COLLATERAL AGENT, TEX
Free format text: CONDITIONAL ASSIGNMENT OF AND SECURITY INTEREST IN PATENT RIGHTS;ASSIGNOR:LUCENT TECHNOLOGIES INC. (DE CORPORATION);REEL/FRAME:011722/0048
Effective date: 20010222
|29 oct. 2002||RF||Reissue application filed|
Effective date: 20020813
|22 sept. 2004||FPAY||Fee payment|
Year of fee payment: 8
|6 déc. 2005||RF||Reissue application filed|
Effective date: 20051012
|6 déc. 2006||AS||Assignment|
Owner name: LUCENT TECHNOLOGIES INC., NEW JERSEY
Free format text: TERMINATION AND RELEASE OF SECURITY INTEREST IN PATENT RIGHTS;ASSIGNOR:JPMORGAN CHASE BANK, N.A. (FORMERLY KNOWN AS THE CHASE MANHATTAN BANK), AS ADMINISTRATIVE AGENT;REEL/FRAME:018590/0287
Effective date: 20061130
Owner name: LUCENT TECHNOLOGIES INC., NEW JERSEY
Free format text: TERMINATION AND RELEASE OF SECURITY INTEREST IN PATENT RIGHTS;ASSIGNOR:JPMORGAN CHASE BANK, N.A. (FORMERLY KNOWN AS THE CHASE MANHATTAN BANK), AS ADMINISTRATIVE AGENT;REEL/FRAME:018584/0446
Effective date: 20061130