USRE40280E1 - Rate loop processor for perceptual encoder/decoder - Google Patents
Rate loop processor for perceptual encoder/decoder Download PDFInfo
- Publication number
- USRE40280E1 USRE40280E1 US11/248,622 US24862205A USRE40280E US RE40280 E1 USRE40280 E1 US RE40280E1 US 24862205 A US24862205 A US 24862205A US RE40280 E USRE40280 E US RE40280E
- Authority
- US
- United States
- Prior art keywords
- coefficients
- frequency
- threshold
- step size
- quantization step
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Lifetime
Links
Images
Classifications
-
- G—PHYSICS
- G10—MUSICAL INSTRUMENTS; ACOUSTICS
- G10L—SPEECH ANALYSIS OR SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING; SPEECH OR AUDIO CODING OR DECODING
- G10L19/00—Speech or audio signals analysis-synthesis techniques for redundancy reduction, e.g. in vocoders; Coding or decoding of speech or audio signals, using source filter models or psychoacoustic analysis
- G10L19/02—Speech or audio signals analysis-synthesis techniques for redundancy reduction, e.g. in vocoders; Coding or decoding of speech or audio signals, using source filter models or psychoacoustic analysis using spectral analysis, e.g. transform vocoders or subband vocoders
- G10L19/032—Quantisation or dequantisation of spectral components
-
- G—PHYSICS
- G10—MUSICAL INSTRUMENTS; ACOUSTICS
- G10L—SPEECH ANALYSIS OR SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING; SPEECH OR AUDIO CODING OR DECODING
- G10L19/00—Speech or audio signals analysis-synthesis techniques for redundancy reduction, e.g. in vocoders; Coding or decoding of speech or audio signals, using source filter models or psychoacoustic analysis
- G10L19/0017—Lossless audio signal coding; Perfect reconstruction of coded audio signal by transmission of coding error
Definitions
- 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.
- CD compact disc
- DAT digital audio tape
- DAT digital audio tape
- 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.
- a masking threshold for unwanted signals is identified as a function of frequency of the desired signal.
- 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.
- 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.
- “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.
- SNR signal-to-noise ratio
- An illustrative embodiment of the present invention employs a filter bank architecture using a Modified Discrete Cosine Transform (MDCT).
- MDCT Modified Discrete Cosine Transform
- 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.
- L/R Left and Right
- M/S Quantum/Difference
- 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.
- 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.
- 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 cost 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.
- 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.
- PAC perceptual audio coder
- 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 .
- 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.
- DSP digital signal processor
- VLSI Very large scale integration
- FIG. 1 is an overall block diagram of a system useful for incorporating an illustrative embodiment of the present invention.
- 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.
- 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.
- 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 .
- PCM digital pulse code modulation
- 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 .
- the PCM signal 108 is fed into a post-processor 110 which creates an analog representation of the PCM signal 107 .
- FIG. 2 An illustrative embodiment of the perceptual audio coder 104 is shown in block diagram form in FIG. 2 .
- the system of FIG. 2 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.
- MDCT Modified Discrete Cosine Transform
- the well-known Modified Discrete Cosine Transform (MDCT) described, e.g., in J. P. Pricen 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.
- 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.
- 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 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.
- an illustrative embodiment of the present invention advantageously uses finer frequency resolution in the calculation of thresholds.
- 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.
- an illustrative embodiment of the perceptual model processor 204 evaluates thresholds for the left and right channels, denoted THR l and THR r .
- 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).
- 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.
- the basic thresholds, denoted BTHR m and MLD s are calculated.
- the following steps are used to calculate the stereo masking contribution of the M and S signals.
- MLD m An additional factor is calculated for each of the M and S thresholds.
- MLD m 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.
- 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.
- 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.
- rate loop processor 206 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 .
- 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 adaptation 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.
- entropy coder application filed of even date with the present application and assigned to the assignee of this application.
- entropy coder application filed of even date with the present application and assigned to the assignee of this application.
- entropy coder 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 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.
- PCM pulse code modulated
- an output of the analysis filter bank 202 comprises a Modified Discrete Cosine Transform (“MDCT”) of the input signal.
- MDCT Modified Discrete Cosine Transform
- 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 .
- each PCM input audio signal sample is represented by M bits.
- 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.
- 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.
- 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 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.
- F(k) the resulting MDCT vector, X(k)
- X(k) Re ⁇ [ F ⁇ ( k ) ] ⁇ cos ⁇ [ ⁇ ⁇ ( 2 ⁇ k + 1 ) ⁇ ( 1 + N ) 4 ⁇ N ] ⁇ 1 ⁇ k ⁇ N .
- MDCT processor 310 provides the seven MDCT vectors to concatenator 311 and delay memory 312 .
- 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: M ⁇ 2 ⁇ 4 ⁇ N 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.
- RAM random access memory
- 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 .
- 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.
- the above analysis filterbank 202 is provided for each of the left and right channels.
- 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.
- 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.
- FFT Fast Fourier Transform
- 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.
- 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.
- PE PERCEPTUAL ENTROPY
- 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.
- 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.
- the acceptable delays are in the order of 20 milliseconds. Given that the bigger transformation 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 PB 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.
- PE PERCEPTUAL ENTROPY
- 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. 5 b. 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.
- 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.
- a segment involves 1024 samples which is the length of a large regular window.
- FIG. 5a represents all the monitoring possibilities when the segment from the point N/2 till the point 3N/2 is being analysed.
- 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. 5 a. The PE value of each short window is calculated ( 603 ) resulting in the ordered sequence: PE 1 , PE 2 , PE 3 and PE 4 . From these values, the exact beginning of the strong non-stationarity of the signal is deduced. Only five locations are possible, identified in FIG.
- 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. PE 2 is identified with location L 1 , PE 3 with L 2 and PE 4 with location L 3 . 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 then, this is well inside the short window sequence, no coding artifacts result and the coding sequence is depicted in FIG. 5 b.
- the remaining possibilities are L 4 or L 5 .
- 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.
- PE 1 n+1 is also computed. As it is easily recognized, this short window already belongs to the next segment. If PE 1 n+1 is above the threshold ( 611 ), then, the location is L 4 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 L 5 , then the coding is done according to the sequence of FIG. 5 d. The way to prove that in this case that is right solution is by confirming that PE 2 n+1 will be above the threshold. PE 2 n+1 is the PE of the short window (not represented in FIG. 5 ) immediately following the window identified with PE 1 n+1 .
- RIGHT and LEFT channels use the same type of analysis/synthesis window. This means that switch is done for both channels when at least one channel requires it.
- 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.
- 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.
- 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.
- 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 frequencies 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.
- 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.
- the spectrum may 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.
- tmpx 1.05(j ⁇ i), 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.
- x 8minimum((tmpx ⁇ 0.5) 2 ⁇ 2(tmpx ⁇ 0.5),0) Where x is a temporary variable, and minimum(a,b) is a function returning the more negative of a or b.
- tmpy 15.811389+7.5(tmpx+0.474) ⁇ 17.5(1.+(tmpx+0.474) 2 ) 0.5 where tmpy is another temporary variable.
- the following steps are the necessary steps for calculation the SMR n used in the coder.
- the polar representation of the transform is calculated r ⁇ and ⁇ ⁇ represent the magnitude and phase components of a spectral line of the transformed segment.
- ct b is weighted by the signal energy, it must be renormalized to cb b .
- cb b c ⁇ ⁇ t b e ⁇ cb b
- ecb b should be renormalized and the normalized energy en b , calculated.
- e ⁇ n b e ⁇ cb b r ⁇ ⁇ n ⁇ ⁇ o ⁇ ⁇ r ⁇ m b
- Each tb b is limited to the range of 0 ⁇ tb b ⁇ 1.
- TMN b is the tone masking noise in dB and NMT b is the noise masking tone value in dB.
- SNR b The required signal to noise ratio, SNR b , is: SNR b tb b TMN b +(1 ⁇ tb b )NMR b
- the dB values of absthr shown in the “Absolute Threshold Tables” are relative to the level that a sine wave of ⁇ 1 ⁇ 2 1sb 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.
- the former case occurs if bval ⁇ high b ⁇ bval ⁇ low b ⁇ bandlength bandlength is a parameter set in the initialization routine. Otherwise the latter case is assumed.
- minimum(a, . . . ,z) is a function returning the most negative or smallest positive argument of the arguments a . . . z.
- SMR n 10 ⁇ log 10 ⁇ ( [ 12.0 * nband n ] 0.5 minimum ( absthr ) )
- the analysis window has a sine form for all the cases of large or short segments.
- 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 first goal is to have a more decorrelated representation of the two signals.
- 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 difference (MLD).
- MLD masking level difference
- 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.
- the quantization noise is not masked if it does not follow the localization of the masking signal.
- 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.
- MLD dB ⁇ ( i ) 25.5 ⁇ [ cos ⁇ ⁇ b ⁇ ( i ) 32.0 ] 2
- i the partition index of the spectrum (see [7])
- b(i) 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.
- 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:
- the final stereophonic threshold is computed as follows.
- 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.
- nb b the actual energy threshold per band, nb b for both channels.
- THRn SUM and THRn DIF we call them THRn SUM and THRn DIF , respectively for the channel SUM and the channel DIFFERENCE.
- the MLD threshold for both channels i.e. THRn MLD,SUM and THRn MLD,DIF .
- nthr SUM MAX[THRn SUM , MIN(THRn DIF , THRn MLD,DIF )]
- nthr DIF MAX[THRn DIF , MIN(THRn SUM , THRn MLD,SUM )]
- 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 .
- 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.
- 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.
- a predefined value e.g. 2 dB
- R/L independent mode
- 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.
- the maximum number of PE measures per segment is 10 (2 channels *[1 large window+4 short windows]).
- 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]).
- 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.
- 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.
- 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 ).
- 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 ).
- 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 hand- 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.
- 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.
- spectral coefficients i.e., the MDCT 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 derivated 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.
- quantizer/rate-loop receives a spectral coefficient, C f , and an energy threshold, E, corresponding to that spectral coefficient.
- 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).
- an interpolation constant, ⁇ , and interpolation bounds ⁇ high and ⁇ low are initialized to aid in the adjustment of the utilized scale factor.
- the spectral coefficient is quantized using the utilized scale factor to create a “quantized spectral coefficient” Q (C f , ⁇ ).
- Q ( C f , ⁇ ) NINT ⁇ ( C f ⁇ ) where “NINT” is the nearest integer function.
- a cost, C is calculated which is associated with how many bits it will take to transmit them both.
- C FOO(Q(C f , ⁇ ), 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.
- the cost, C is tested to determine whether it is in a permissible range PR.
- Q (C f , ⁇ ) and Q( ⁇ ) are transmitted to entropy coder 208 .
- 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.
- 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.
- DSP digital signal processor
- VLSI Very large scale integration
- 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 .
- 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 .
- the interpolation factor may be adjusted ( 1315 ) according to the analysis carried out within the DSP or similar type hardware embodiments.
Abstract
Description
where k=1,3,5, . . . ,2N, and fH equals one half the sampling rate. The
The procedure need run k only to N, not 2N, because of redundancy in the result. To wit, for N<k≦2N:
X(k)=−X(2N−k).
M×2×4×N
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.
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.
-
- 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.
tmpx=1.05(j−i),
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.
x=8minimum((tmpx−0.5)2−2(tmpx−0.5),0)
Where x is a temporary variable, and minimum(a,b) is a function returning the more negative of a or b.
tmpy=15.811389+7.5(tmpx+0.474)−17.5(1.+(tmpx+0.474)2)0.5
where tmpy is another temporary variable.
Steps in Threshold Calculation
-
- 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 φ.
{circumflex over (r)}ω=2rω(t−1)−rω(t−2)
{circumflex over (φ)}ω=2φω(t−1)−φω(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ωcω, the unpredictability measure, is:
- 5. Calculate the energy and unpredictability in the threshold calculation partitions.
- 4. Calculate the unpredictability measure cωcω, the unpredictability measure, is:
and the weighted unpredictability, cb, is:
-
- 6. Convolve the partitioned energy and unpredictability with the spreading function.
- 6. Convolve the partitioned energy and unpredictability with the spreading function.
At the same time, due to the non-normalized nature of the spreading function, ecbb should be renormalized and the normalized energy enb, calculated.
-
- 7. Covert cbb to tbb.
tbb=−0.299−0.43 loge(cbb)
- 7. Covert cbb to tbb.
-
- 8. Calculate the required SNR in each partition.
- 8. Calculate the required SNR in each partition.
SNRbtbbTMNb+(1−tbb)NMRb
-
- 9. Calculate the power ratio.
-
- 10. Calculation of actual energy threshold, nbb.
nbb=enbbcb - 11. Spread the threshold energy over MDCT lines, yielding nbω
- 12. Include absolute thresholds, yielding the final energy threshold of audibility, thrω
thr107 =max(nb107 , absthr107 ).
- 10. Calculation of actual energy threshold, nbb.
-
- 13. Pre-echo control
- 14. Calculate the signal to mask ratios. SMRn.
-
- 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.
bvalωhigh
bandlength is a parameter set in the initialization routine. Otherwise the latter case is assumed.
else,
nbandn=minimum(thrωlow
where i is the partition index of the spectrum (see [7]), 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:
-
- 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.
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)]
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.
Δ=Δ0 α×ΔA (1−alpha)
Δ=Q−1(Q(Δ))
where “NINT” is the nearest integer function. Because quantizer/
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
when C>PR, αhigh=α,
alternately,
when C<PR, αlow=α,
In either case, a new interpolation constant is calculated by:
The process then continues at 1305 iteratively until the C comes within the permissible range PR.
STEREOPHONIC DECODER
Claims (8)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US11/248,622 USRE40280E1 (en) | 1988-12-30 | 2005-10-12 | Rate loop processor for perceptual encoder/decoder |
Applications Claiming Priority (6)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US29259888A | 1988-12-30 | 1988-12-30 | |
US84496792A | 1992-02-28 | 1992-02-28 | |
US84481192A | 1992-03-02 | 1992-03-02 | |
US08/310,898 US5627938A (en) | 1992-03-02 | 1994-09-22 | Rate loop processor for perceptual encoder/decoder |
US10/218,232 USRE39080E1 (en) | 1988-12-30 | 2002-08-13 | Rate loop processor for perceptual encoder/decoder |
US11/248,622 USRE40280E1 (en) | 1988-12-30 | 2005-10-12 | Rate loop processor for perceptual encoder/decoder |
Related Parent Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US08/310,898 Reissue US5627938A (en) | 1988-12-30 | 1994-09-22 | Rate loop processor for perceptual encoder/decoder |
Publications (1)
Publication Number | Publication Date |
---|---|
USRE40280E1 true USRE40280E1 (en) | 2008-04-29 |
Family
ID=36191229
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US11/248,622 Expired - Lifetime USRE40280E1 (en) | 1988-12-30 | 2005-10-12 | Rate loop processor for perceptual encoder/decoder |
Country Status (1)
Country | Link |
---|---|
US (1) | USRE40280E1 (en) |
Cited By (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20060176979A1 (en) * | 2003-03-19 | 2006-08-10 | Satoshi Takahashi | Wave detection device, method, program, and recording medium |
US20080027721A1 (en) * | 2006-07-26 | 2008-01-31 | Preethi Konda | System and method for measurement of perceivable quantization noise in perceptual audio coders |
US20090006081A1 (en) * | 2007-06-27 | 2009-01-01 | Samsung Electronics Co., Ltd. | Method, medium and apparatus for encoding and/or decoding signal |
US20100272285A1 (en) * | 2009-04-22 | 2010-10-28 | General Electric Company | Masking of pure tones within sound from a noise generating source |
US20110035212A1 (en) * | 2007-08-27 | 2011-02-10 | Telefonaktiebolaget L M Ericsson (Publ) | Transform coding of speech and audio signals |
Citations (48)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US3989897A (en) | 1974-10-25 | 1976-11-02 | Carver R W | Method and apparatus for reducing noise content in audio signals |
US4216354A (en) | 1977-12-23 | 1980-08-05 | International Business Machines Corporation | Process for compressing data relative to voice signals and device applying said process |
US4349698A (en) | 1979-06-19 | 1982-09-14 | Victor Company Of Japan, Limited | Audio signal translation with no delay elements |
US4356349A (en) | 1980-03-12 | 1982-10-26 | Trod Nossel Recording Studios, Inc. | Acoustic image enhancing method and apparatus |
US4516258A (en) | 1982-06-30 | 1985-05-07 | At&T Bell Laboratories | Bit allocation generator for adaptive transform coder |
US4535472A (en) | 1982-11-05 | 1985-08-13 | At&T Bell Laboratories | Adaptive bit allocator |
EP0193143A2 (en) | 1985-02-27 | 1986-09-03 | TELEFUNKEN Fernseh und Rundfunk GmbH | Audio signal transmission method |
US4646061A (en) | 1985-03-13 | 1987-02-24 | Racal Data Communications Inc. | Data communication with modified Huffman coding |
JPS637023A (en) | 1986-06-27 | 1988-01-12 | トムソン コンシューマー エレクトロニクス セイルズ ゲゼルシャフト ミット ベシュレンクテル ハフツング | Method of audio signal transmission |
US4790016A (en) | 1985-11-14 | 1988-12-06 | Gte Laboratories Incorporated | Adaptive method and apparatus for coding speech |
US4803727A (en) | 1986-11-24 | 1989-02-07 | British Telecommunications Public Limited Company | Transmission system |
US4821260A (en) | 1986-12-17 | 1989-04-11 | Deutsche Thomson-Brandt Gmbh | Transmission system |
US4860313A (en) | 1986-09-21 | 1989-08-22 | Eci Telecom Ltd. | Adaptive differential pulse code modulation (ADPCM) systems |
US4860360A (en) | 1987-04-06 | 1989-08-22 | Gte Laboratories Incorporated | Method of evaluating speech |
US4881267A (en) | 1987-05-14 | 1989-11-14 | Nec Corporation | Encoder of a multi-pulse type capable of optimizing the number of excitation pulses and quantization level |
US4896362A (en) | 1987-04-27 | 1990-01-23 | U.S. Philips Corporation | System for subband coding of a digital audio signal |
US4912763A (en) | 1986-10-30 | 1990-03-27 | International Business Machines Corporation | Process for multirate encoding signals and device for implementing said process |
US4914701A (en) | 1984-12-20 | 1990-04-03 | Gte Laboratories Incorporated | Method and apparatus for encoding speech |
EP0376553A2 (en) | 1988-12-30 | 1990-07-04 | AT&T Corp. | Perceptual coding of audio signals |
US4941152A (en) | 1985-09-03 | 1990-07-10 | International Business Machines Corp. | Signal coding process and system for implementing said process |
US4945567A (en) | 1984-03-06 | 1990-07-31 | Nec Corporation | Method and apparatus for speech-band signal coding |
US4949383A (en) | 1984-08-24 | 1990-08-14 | Bristish Telecommunications Public Limited Company | Frequency domain speech coding |
US4953214A (en) | 1987-07-21 | 1990-08-28 | Matushita Electric Industrial Co., Ltd. | Signal encoding and decoding method and device |
US4972484A (en) | 1986-11-21 | 1990-11-20 | Bayerische Rundfunkwerbung Gmbh | Method of transmitting or storing masked sub-band coded audio signals |
US5014318A (en) | 1988-02-25 | 1991-05-07 | Fraunhofer Gesellschaft Zur Forderung Der Angewandten Forschung E. V. | Apparatus for checking audio signal processing systems |
US5040217A (en) | 1989-10-18 | 1991-08-13 | At&T Bell Laboratories | Perceptual coding of audio signals |
US5079547A (en) | 1990-02-28 | 1992-01-07 | Victor Company Of Japan, Ltd. | Method of orthogonal transform coding/decoding |
US5109417A (en) | 1989-01-27 | 1992-04-28 | Dolby Laboratories Licensing Corporation | Low bit rate transform coder, decoder, and encoder/decoder for high-quality audio |
US5151941A (en) | 1989-09-30 | 1992-09-29 | Sony Corporation | Digital signal encoding apparatus |
US5185800A (en) | 1989-10-13 | 1993-02-09 | Centre National D'etudes Des Telecommunications | Bit allocation device for transformed digital audio broadcasting signals with adaptive quantization based on psychoauditive criterion |
US5218435A (en) | 1991-02-20 | 1993-06-08 | Massachusetts Institute Of Technology | Digital advanced television systems |
US5227788A (en) | 1992-03-02 | 1993-07-13 | At&T Bell Laboratories | Method and apparatus for two-component signal compression |
US5230038A (en) | 1989-01-27 | 1993-07-20 | Fielder Louis D | Low bit rate transform coder, decoder, and encoder/decoder for high-quality audio |
US5235671A (en) | 1990-10-15 | 1993-08-10 | Gte Laboratories Incorporated | Dynamic bit allocation subband excited transform coding method and apparatus |
EP0559383A1 (en) | 1992-03-02 | 1993-09-08 | AT&T Corp. | A method and apparatus for coding audio signals based on perceptual model |
US5274740A (en) | 1991-01-08 | 1993-12-28 | Dolby Laboratories Licensing Corporation | Decoder for variable number of channel presentation of multidimensional sound fields |
US5297236A (en) | 1989-01-27 | 1994-03-22 | Dolby Laboratories Licensing Corporation | Low computational-complexity digital filter bank for encoder, decoder, and encoder/decoder |
US5341457A (en) | 1988-12-30 | 1994-08-23 | At&T Bell Laboratories | Perceptual coding of audio signals |
US5357594A (en) | 1989-01-27 | 1994-10-18 | Dolby Laboratories Licensing Corporation | Encoding and decoding using specially designed pairs of analysis and synthesis windows |
US5394473A (en) | 1990-04-12 | 1995-02-28 | Dolby Laboratories Licensing Corporation | Adaptive-block-length, adaptive-transforn, and adaptive-window transform coder, decoder, and encoder/decoder for high-quality audio |
US5479562A (en) | 1989-01-27 | 1995-12-26 | Dolby Laboratories Licensing Corporation | Method and apparatus for encoding and decoding audio information |
US5583962A (en) | 1991-01-08 | 1996-12-10 | Dolby Laboratories Licensing Corporation | Encoder/decoder for multidimensional sound fields |
US5592584A (en) | 1992-03-02 | 1997-01-07 | Lucent Technologies Inc. | Method and apparatus for two-component signal compression |
US5627938A (en) | 1992-03-02 | 1997-05-06 | Lucent Technologies Inc. | Rate loop processor for perceptual encoder/decoder |
EP0446037B1 (en) | 1990-03-09 | 1997-10-08 | AT&T Corp. | Hybrid perceptual audio coding |
US5752225A (en) | 1989-01-27 | 1998-05-12 | Dolby Laboratories Licensing Corporation | Method and apparatus for split-band encoding and split-band decoding of audio information using adaptive bit allocation to adjacent subbands |
JP2796673B2 (en) | 1986-08-29 | 1998-09-10 | カール―ハインツ ブランデンブルク | Digital coding method |
US5924060A (en) | 1986-08-29 | 1999-07-13 | Brandenburg; Karl Heinz | Digital coding process for transmission or storage of acoustical signals by transforming of scanning values into spectral coefficients |
-
2005
- 2005-10-12 US US11/248,622 patent/USRE40280E1/en not_active Expired - Lifetime
Patent Citations (54)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US3989897A (en) | 1974-10-25 | 1976-11-02 | Carver R W | Method and apparatus for reducing noise content in audio signals |
US4216354A (en) | 1977-12-23 | 1980-08-05 | International Business Machines Corporation | Process for compressing data relative to voice signals and device applying said process |
US4349698A (en) | 1979-06-19 | 1982-09-14 | Victor Company Of Japan, Limited | Audio signal translation with no delay elements |
US4356349A (en) | 1980-03-12 | 1982-10-26 | Trod Nossel Recording Studios, Inc. | Acoustic image enhancing method and apparatus |
US4516258A (en) | 1982-06-30 | 1985-05-07 | At&T Bell Laboratories | Bit allocation generator for adaptive transform coder |
US4535472A (en) | 1982-11-05 | 1985-08-13 | At&T Bell Laboratories | Adaptive bit allocator |
US4945567A (en) | 1984-03-06 | 1990-07-31 | Nec Corporation | Method and apparatus for speech-band signal coding |
US4949383A (en) | 1984-08-24 | 1990-08-14 | Bristish Telecommunications Public Limited Company | Frequency domain speech coding |
US4914701A (en) | 1984-12-20 | 1990-04-03 | Gte Laboratories Incorporated | Method and apparatus for encoding speech |
EP0193143A2 (en) | 1985-02-27 | 1986-09-03 | TELEFUNKEN Fernseh und Rundfunk GmbH | Audio signal transmission method |
US4646061A (en) | 1985-03-13 | 1987-02-24 | Racal Data Communications Inc. | Data communication with modified Huffman coding |
US4941152A (en) | 1985-09-03 | 1990-07-10 | International Business Machines Corp. | Signal coding process and system for implementing said process |
US4790016A (en) | 1985-11-14 | 1988-12-06 | Gte Laboratories Incorporated | Adaptive method and apparatus for coding speech |
JP2792853B2 (en) | 1986-06-27 | 1998-09-03 | トムソン コンシューマー エレクトロニクス セイルズ ゲゼルシャフト ミット ベシュレンクテル ハフツング | Audio signal transmission method and apparatus |
JPS637023A (en) | 1986-06-27 | 1988-01-12 | トムソン コンシューマー エレクトロニクス セイルズ ゲゼルシャフト ミット ベシュレンクテル ハフツング | Method of audio signal transmission |
JP2796673B2 (en) | 1986-08-29 | 1998-09-10 | カール―ハインツ ブランデンブルク | Digital coding method |
US5924060A (en) | 1986-08-29 | 1999-07-13 | Brandenburg; Karl Heinz | Digital coding process for transmission or storage of acoustical signals by transforming of scanning values into spectral coefficients |
US4860313A (en) | 1986-09-21 | 1989-08-22 | Eci Telecom Ltd. | Adaptive differential pulse code modulation (ADPCM) systems |
US4912763A (en) | 1986-10-30 | 1990-03-27 | International Business Machines Corporation | Process for multirate encoding signals and device for implementing said process |
US4972484A (en) | 1986-11-21 | 1990-11-20 | Bayerische Rundfunkwerbung Gmbh | Method of transmitting or storing masked sub-band coded audio signals |
US4803727A (en) | 1986-11-24 | 1989-02-07 | British Telecommunications Public Limited Company | Transmission system |
US4821260A (en) | 1986-12-17 | 1989-04-11 | Deutsche Thomson-Brandt Gmbh | Transmission system |
US4860360A (en) | 1987-04-06 | 1989-08-22 | Gte Laboratories Incorporated | Method of evaluating speech |
US4896362A (en) | 1987-04-27 | 1990-01-23 | U.S. Philips Corporation | System for subband coding of a digital audio signal |
US4881267A (en) | 1987-05-14 | 1989-11-14 | Nec Corporation | Encoder of a multi-pulse type capable of optimizing the number of excitation pulses and quantization level |
US4953214A (en) | 1987-07-21 | 1990-08-28 | Matushita Electric Industrial Co., Ltd. | Signal encoding and decoding method and device |
US5014318A (en) | 1988-02-25 | 1991-05-07 | Fraunhofer Gesellschaft Zur Forderung Der Angewandten Forschung E. V. | Apparatus for checking audio signal processing systems |
EP0376553A2 (en) | 1988-12-30 | 1990-07-04 | AT&T Corp. | Perceptual coding of audio signals |
US5535300A (en) | 1988-12-30 | 1996-07-09 | At&T Corp. | Perceptual coding of audio signals using entropy coding and/or multiple power spectra |
US5341457A (en) | 1988-12-30 | 1994-08-23 | At&T Bell Laboratories | Perceptual coding of audio signals |
US5357594A (en) | 1989-01-27 | 1994-10-18 | Dolby Laboratories Licensing Corporation | Encoding and decoding using specially designed pairs of analysis and synthesis windows |
US5297236A (en) | 1989-01-27 | 1994-03-22 | Dolby Laboratories Licensing Corporation | Low computational-complexity digital filter bank for encoder, decoder, and encoder/decoder |
US5230038A (en) | 1989-01-27 | 1993-07-20 | Fielder Louis D | Low bit rate transform coder, decoder, and encoder/decoder for high-quality audio |
US5109417A (en) | 1989-01-27 | 1992-04-28 | Dolby Laboratories Licensing Corporation | Low bit rate transform coder, decoder, and encoder/decoder for high-quality audio |
US5479562A (en) | 1989-01-27 | 1995-12-26 | Dolby Laboratories Licensing Corporation | Method and apparatus for encoding and decoding audio information |
US5752225A (en) | 1989-01-27 | 1998-05-12 | Dolby Laboratories Licensing Corporation | Method and apparatus for split-band encoding and split-band decoding of audio information using adaptive bit allocation to adjacent subbands |
US5151941A (en) | 1989-09-30 | 1992-09-29 | Sony Corporation | Digital signal encoding apparatus |
US5185800A (en) | 1989-10-13 | 1993-02-09 | Centre National D'etudes Des Telecommunications | Bit allocation device for transformed digital audio broadcasting signals with adaptive quantization based on psychoauditive criterion |
US5040217A (en) | 1989-10-18 | 1991-08-13 | At&T Bell Laboratories | Perceptual coding of audio signals |
USRE36714E (en) | 1989-10-18 | 2000-05-23 | Lucent Technologies Inc. | Perceptual coding of audio signals |
US5079547A (en) | 1990-02-28 | 1992-01-07 | Victor Company Of Japan, Ltd. | Method of orthogonal transform coding/decoding |
EP0446037B1 (en) | 1990-03-09 | 1997-10-08 | AT&T Corp. | Hybrid perceptual audio coding |
US5394473A (en) | 1990-04-12 | 1995-02-28 | Dolby Laboratories Licensing Corporation | Adaptive-block-length, adaptive-transforn, and adaptive-window transform coder, decoder, and encoder/decoder for high-quality audio |
US5235671A (en) | 1990-10-15 | 1993-08-10 | Gte Laboratories Incorporated | Dynamic bit allocation subband excited transform coding method and apparatus |
US5400433A (en) | 1991-01-08 | 1995-03-21 | Dolby Laboratories Licensing Corporation | Decoder for variable-number of channel presentation of multidimensional sound fields |
US5274740A (en) | 1991-01-08 | 1993-12-28 | Dolby Laboratories Licensing Corporation | Decoder for variable number of channel presentation of multidimensional sound fields |
US5583962A (en) | 1991-01-08 | 1996-12-10 | Dolby Laboratories Licensing Corporation | Encoder/decoder for multidimensional sound fields |
US5633981A (en) | 1991-01-08 | 1997-05-27 | Dolby Laboratories Licensing Corporation | Method and apparatus for adjusting dynamic range and gain in an encoder/decoder for multidimensional sound fields |
US5218435A (en) | 1991-02-20 | 1993-06-08 | Massachusetts Institute Of Technology | Digital advanced television systems |
US5285498A (en) | 1992-03-02 | 1994-02-08 | At&T Bell Laboratories | Method and apparatus for coding audio signals based on perceptual model |
US5627938A (en) | 1992-03-02 | 1997-05-06 | Lucent Technologies Inc. | Rate loop processor for perceptual encoder/decoder |
US5592584A (en) | 1992-03-02 | 1997-01-07 | Lucent Technologies Inc. | Method and apparatus for two-component signal compression |
US5227788A (en) | 1992-03-02 | 1993-07-13 | At&T Bell Laboratories | Method and apparatus for two-component signal compression |
EP0559383A1 (en) | 1992-03-02 | 1993-09-08 | AT&T Corp. | A method and apparatus for coding audio signals based on perceptual model |
Non-Patent Citations (51)
Title |
---|
"ASPEC," AT&T Bell Laboratories, 121 pages, Paris, Oct. 1989. |
"FX/FORTRAN Programmer's Handbook," Table of Contents, 8 pages, Alliant Computer Systems Corp., Jul. 1988. |
AT&T Bell Laboratories et al., "ASPEC," ISO-MPEG Audio Coding Submission, 130 pages, submitted Oct. 18, 1989, amended Dec. 11, 1989, revised Jun. 18, 1990. |
Brandenberg, K., "Evaluation Of Quality For Audio Encoding At Low Bit Rates," AES 82<SUP>ND </SUP>Convention, pp. 1-11, Mar. 1987. |
Brandenburg, K. et al., "A Contribution on the Methods of and Evaluation of the Quality of High-Quality Music Coding," The Department of Engineering at the University of Erlangen-Nuremberg, Doctor of Engineering Thesis, pp. 1-199, Erlangen University Library, Erlangen, Germany, Jan. 1989. |
Brandenburg, K. et al., "OCF: Coding High Quality Audio with Data Rates of 64kbit/sec," AES Convention, Nov. 3-6, 1988, Los Angeles, California, 12 pages, Audio Engineering Society, New York. |
Brandenburg, K. et al., "Transmission of High Quality Audio Signals with Bit Rates in the Range of 64-144 KBIT/SEC," ITG-Conference Proceedings, Information Technology Society, pp. 217-222, VDE-Verlag GmbH, Berlin, Nov. 1988. |
Brandenburg, K., "Aspec Coding," AES 10<SUP>th </SUP>International Conf., pp. 81-90, Sep. 1991. |
Brandenburg, K., "High quality sound coding at 2.5 bit/sample," 84<SUP>th </SUP>Convention, AES (Audio Engineering Society) Mar. 1-4, 1988, Paris, Preprint 2582 (D-2), 8 pages, Audio Engineering Society, New York, 1988. |
Brandenburg, K., "OCF-A New Coding Algorithm For High Quality Sound Signals," IEEE ICASSP, pp. 141-144, 1987. |
Brandenburg, K., et al., "Aspec: Adaptive Spectral Entropy Coding of High Quality Music Signals," AES 90<SUP>th </SUP>Convention, 7 pages, 1991. |
Brandenburg, K., et al., "Low Bit Rate Coding of High-Quality Digital Audio: Algorithms and Evaluation of Quality," AES Conference, May 14-17, 1989, Toronto, Canada, pp. 1-25, Audio Engineering Society, New York. |
Brandenburg, K., et al., "Second Generation Perpetual Audio Coding: The Hybrid Coder," AES 88<SUP>th </SUP>Convention, 7 pages, 1990. |
Brandenburg, K.H. et al., A Digital Signal Processor For Real Time Adaptive Transform Coding Of Audio Signals Up to 20 KHZ Bandwidth, IEEE Int'l Conf. On Circuits and Computers, pp. 474-477, 1982. |
Crochiere, R.E. et al., Frequency Domain Techniques For Speech Coding, J. Acoust. Soc. Of Amer., pp. 1642-1646, Dec. 1979. |
Crochiere, R.E., "Sub-Band Coding," The Bell System Technical Journal, vol. 60, No. 7, pp. 1633-1653, Sep. 1981. |
Eberlein, E. et al., "Psychoacoustically Based Measuring Device For Optimizing Data Reduction Methods," Tonmeistertagung '88, pp. 552-564. Nov. 19, 1988. |
Flanagan, J.L. et al., "Speech Coding," IEEE Transactions on Communications, vol. COM-27, No. 4, pp. 710-736, Apr. 1979. |
Fletcher, H., "Auditory Patterns," Reviews of Modern Physics, vol. 12, pp. 47-65, 1940. |
Grauel, C., "Sub-Band Coding With Adaptive Bit Allocation," Signal Processing 2, North-Holland Publishing Co., pp. 23-30, 1980. |
Hellman, R.P., "Assymmetry of Masking Between Noise and Tone," Perception and Psychophysics II, pp. 241-246, 1972. |
Heron, C.D. et al., A 32 Band Sub-band/Transform Coder Incorporating Vector Quantization For Dynamicc Bit Allocation, Proceedings IEEE ICASSP, pp. 1276-1279, 1983. |
Jayant, N.S. et al., "Digital Coding of Waveforms," Prentice-Hall, pp. 56-58, 1984. |
Jayant, N.S. et al., "Digital Coding of Waveforms-Principals and Applications to Speech and Video," Chapter 12, pp. 511-590, Transform Coding, 1987. |
Jetzt, "Critical Distance Measurement of Rooms From the Sound Energy Spectral Response," Journal of the Acoustical Society of America, vol. 65, pp. 1204-1211, 1979. |
Johnston, J.D., "Estimation of Perceptual Entropy Using Noise Masking Criteria," IEEE UCASSP, pp. 2524-2527, 1989. |
Johnston, J.D., "Perceptual Transform Coding of Wideband Stereo Signals," IEEE ICASSP, pp. 1993-1996, 1989. |
Johnston, J.D., "Transform Coding of Audio Signals Using Perceptual Noise Criteria," IEEE Journal On Selected Areas in Communications, vol. 6, No. 2, pp. 314-323, Feb. 1988. |
Knuth, D.E. et al., "The Art of Computer Programming," 2<SUP>nd </SUP>Ed., vol. 2, Reading, Mass., pp. 268-278, 1981. |
Krahe, D., New Source Coding Method For High Quality Digital Audio Signals, University Duisburg, (Original-11 pages and English Translation-13 pages), Nov. 1985. |
Krasner,M. A. Digital Encoding of Speech and Audio Signals Based on the Perceptual Requirements of the Auditory System, MIT Lincoln Laboratory, Technical Repport 535, 74 pages, Jun. 18, 1979. |
Musmann, H.G., "The ISO Audio Coding Standard," Globe-come '90, vol. 1(3), Dec. 1990, N.Y., pp. 511-517. |
Press, W.H. et al., "Numerical Recipies," Cambridge University Press, pp. 77-92, 240-247 and 595, 1986. |
Princen, J. et al., "Analysis/Synthesis Filter Bank Design Based on Time Domain Aliasing Canacellation," IEEE ICASSP, vol. AASP-34, No. 5, pp. 1153-1161, 1986. |
Princen, J. et al., "Subband/Transform Coding Using Filter Bank Designs Based on Time Domain Aliasing Cancellation," IEEE ICASSP, pp. 2161-2164, 1987. |
Ramstad, T.A., "Sub-band Coder With A Simple Adaptive Bit-Allocation Algorithm: A Possible Candidate for Digital Mobile Telephony?" Proceedings IEEE ICASSP, vol. 1, pp. 203-207, 1982. |
Scharf, B., "Foundations of Modem Auditory Theory," edited by Jerry V. Tobias, Chapter 5, Academic Press, N.Y., N.Y., pp. 157-202, 1970. |
Schroeder, E.F. et al., "MSC: Stereo Audio Coding With CD-Quality and 256 kBIT/SEC," IEEE Transactions on Consumer Electronics, vol. CE-33, No. 4, pp. 512-519, Nov. 1987. |
Schroeder, M.R. et al., "Optimizing Digital Speech Coders by Exploiting Masking Properties of the Human Ear," Journal of Acoustical Society of America, vol. 66 (6), pp. 1647-1652, Dec. 1979. |
Seitzer, D., et al., "Digital Coding of High Quality Audio," Proceedings Advanced Computer Technology, Reliable Systems and Applications, 5<SUP>th </SUP>Annual European Computer Conference, Bologna, May 13-16, 1991, pp. 148-154, IEEE Computer Society Press, Los Alamitos, Californa, 1991. |
Tan, E., et al., "Digital Audio Tape for Data Storage," IEEE Spectrum, pp. 34-38, Oct. 1989. |
Terhardt, E. et al., Algorithm For Extraction Of Pitch And Pitch Salience From Complex Tonal Signals, J. Acoust. Soc. Am., 71(3), Mar. 1982, pp. 679-688. |
Thiele, G. et al., "Low Bit-Rate Coding of High Quality Audio Signals An Introduction to the MASCAM System," AES 7<SUP>th </SUP>International Conf. EBU Review-Techical, No. 230, pp. 158-209, Aug. 1988. |
Thiele, G. et al., "Low Bit-Rate Coding of High Quality Audio Signals," AES 82<SUP>nd </SUP>Convention, pp. 1-31, Mar. 1987. |
Tribolet, J.M. et al., Frequency Domain Coding of Speech, IEEE Transactions on Acoustics, Speech, and Signal Processing, vol. ASSP-27, No. 5, pp. 512-530, Oct. 1979. |
van der Waal, R.G. et al., "Subband Coding of Sterophonic Digital Audio Signals," IEEE, pp. 3601-3604, Jul. 1991. |
Veldhuis, R.N.J. et al., "Subband Coding of Digital Audio Signals," Phillips Journal of Research, vol. 44, Nos. 2, 3, pp. 329-343, Jul. 1989. |
Zelinski, R. et al., "Adaptive Transform Coding of Speech Signals," IEEE Transactions on Acoustics, Speech and Signal Processing, vol. ASSP-25, No. 4, pp. 299-309, Aug. 1977. |
Zwicker, E. et al., "Facts And Models in Hearing," Springer-Verlag, pp. 251-257, 1974. |
Zwicker, E. et al., "The Ear As A Communication Receiver," S. Herzel Velag, pp. 65-81, Stuttgart, 1967, TOC. |
Zwicker, E., "Psychoakustic," 1982, pp. 31-35, subject index and glossary (German language document). |
Cited By (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20060176979A1 (en) * | 2003-03-19 | 2006-08-10 | Satoshi Takahashi | Wave detection device, method, program, and recording medium |
US7783456B2 (en) * | 2003-03-19 | 2010-08-24 | Advantest Corporation | Wave detection device, method, program, and recording medium |
US20080027721A1 (en) * | 2006-07-26 | 2008-01-31 | Preethi Konda | System and method for measurement of perceivable quantization noise in perceptual audio coders |
US7797155B2 (en) * | 2006-07-26 | 2010-09-14 | Ittiam Systems (P) Ltd. | System and method for measurement of perceivable quantization noise in perceptual audio coders |
US20090006081A1 (en) * | 2007-06-27 | 2009-01-01 | Samsung Electronics Co., Ltd. | Method, medium and apparatus for encoding and/or decoding signal |
US20110035212A1 (en) * | 2007-08-27 | 2011-02-10 | Telefonaktiebolaget L M Ericsson (Publ) | Transform coding of speech and audio signals |
US9153240B2 (en) | 2007-08-27 | 2015-10-06 | Telefonaktiebolaget L M Ericsson (Publ) | Transform coding of speech and audio signals |
US20100272285A1 (en) * | 2009-04-22 | 2010-10-28 | General Electric Company | Masking of pure tones within sound from a noise generating source |
US8223985B2 (en) | 2009-04-22 | 2012-07-17 | General Electric Company | Masking of pure tones within sound from a noise generating source |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
USRE39080E1 (en) | Rate loop processor for perceptual encoder/decoder | |
EP0559383B1 (en) | Method for coding mode selection for stereophonic audio signals utilizing peceptual models | |
EP0564089B1 (en) | A method and appartus for the perceptual coding of audio signals | |
EP0709004B1 (en) | Hybrid adaptive allocation for audio encoder and decoder | |
US5488665A (en) | Multi-channel perceptual audio compression system with encoding mode switching among matrixed channels | |
KR100209870B1 (en) | Perceptual coding of audio signals | |
US5301255A (en) | Audio signal subband encoder | |
USRE42949E1 (en) | Stereophonic audio signal decompression switching to monaural audio signal | |
CA2197128C (en) | Enhanced joint stereo coding method using temporal envelope shaping | |
EP0799531B1 (en) | Method and apparatus for applying waveform prediction to subbands of a perceptual coding system | |
US5581654A (en) | Method and apparatus for information encoding and decoding | |
Princen et al. | Audio coding with signal adaptive filterbanks | |
USRE40280E1 (en) | Rate loop processor for perceptual encoder/decoder | |
Musmann | The ISO audio coding standard | |
KR100556505B1 (en) | Reproducing and recording apparatus, decoding apparatus, recording apparatus, reproducing and recording method, decoding method and recording method | |
EP0775389B1 (en) | Encoding system and encoding method for encoding a digital signal having at least a first and a second digital signal component | |
JPH09102742A (en) | Encoding method and device, decoding method and device and recording medium | |
Pan | Overview of the mpeg/audio compression algorithm | |
Noll et al. | ISO/MPEG audio coding | |
JPH11330974A (en) | Encoding method and device, decoding method and device, digital signal recording method and device, recording medium and digital transmitting method and device | |
JP3513879B2 (en) | Information encoding method and information decoding method |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
FEPP | Fee payment procedure |
Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
FPAY | Fee payment |
Year of fee payment: 12 |
|
AS | Assignment |
Owner name: CREDIT SUISSE AG, NEW YORK Free format text: SECURITY INTEREST;ASSIGNOR:ALCATEL-LUCENT USA INC.;REEL/FRAME:030510/0627 Effective date: 20130130 |
|
AS | Assignment |
Owner name: ALCATEL-LUCENT USA INC., NEW JERSEY Free format text: RELEASE BY SECURED PARTY;ASSIGNOR:CREDIT SUISSE AG;REEL/FRAME:033950/0001 Effective date: 20140819 |