USRE36714E - Perceptual coding of audio signals - Google Patents

Perceptual coding of audio signals Download PDF

Info

Publication number
USRE36714E
USRE36714E US08/622,313 US62231394A USRE36714E US RE36714 E USRE36714 E US RE36714E US 62231394 A US62231394 A US 62231394A US RE36714 E USRE36714 E US RE36714E
Authority
US
United States
Prior art keywords
frequency
iaddend
iadd
signals
function
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
Application number
US08/622,313
Inventor
Karlheinz Brandenburg
James David Johnston
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nokia of America Corp
Original Assignee
Lucent Technologies Inc
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Lucent Technologies Inc filed Critical Lucent Technologies Inc
Priority to US08/622,313 priority Critical patent/USRE36714E/en
Application granted granted Critical
Publication of USRE36714E publication Critical patent/USRE36714E/en
Assigned to THE CHASE MANHATTAN BANK, AS COLLATERAL AGENT reassignment THE CHASE MANHATTAN BANK, AS COLLATERAL AGENT CONDITIONAL ASSIGNMENT OF AND SECURITY INTEREST IN PATENT RIGHTS Assignors: LUCENT TECHNOLOGIES INC. (DE CORPORATION)
Assigned to LUCENT TECHNOLOGIES INC. reassignment LUCENT TECHNOLOGIES INC. TERMINATION AND RELEASE OF SECURITY INTEREST IN PATENT RIGHTS Assignors: JPMORGAN CHASE BANK, N.A. (FORMERLY KNOWN AS THE CHASE MANHATTAN BANK), AS ADMINISTRATIVE AGENT
Anticipated expiration legal-status Critical
Assigned to CREDIT SUISSE AG reassignment CREDIT SUISSE AG SECURITY INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: ALCATEL-LUCENT USA INC.
Assigned to ALCATEL-LUCENT USA INC. reassignment ALCATEL-LUCENT USA INC. RELEASE BY SECURED PARTY (SEE DOCUMENT FOR DETAILS). Assignors: CREDIT SUISSE AG
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B1/00Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
    • H04B1/66Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission for reducing bandwidth of signals; for improving efficiency of transmission
    • H04B1/665Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission for reducing bandwidth of signals; for improving efficiency of transmission using psychoacoustic properties of the ear, e.g. masking effect
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits

Definitions

  • the present invention relates to coding of time varying signals, such as audio signals representing voice or music information.
  • CD compact disc
  • DAT digital audio tape
  • Perceptual coding as described in the Johnston, et al paper relates to a technique for lowering required bitrates (or reapportioning available bits) in representing audio signals.
  • the masking threshold for unwanted signals is identified as a function of frequency of the desired signal. Then 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 masking effect of noise is dependent on the "tonelike or noiselike" nature of the signal.
  • an offset for the masking threshold for each critical band is developed which depends on whether a "coefficient of tonality" for the signal in each critical band indicates that the signal is relatively more tonelike or noiselike. This coefficient of tonality is, in turn, conveniently derived from a measure of flatness of the spectrum of the signal over that critical band.
  • the present invention improves on the tonality based perceptual coding techniques described in the cited copending application Ser. No. 292,598. Because the frequency analysis typically involves determining spectral information at discrete frequencies ("frequency lines") within the audio spectrum, and because a number of these discrete frequencies will, in general, fall within each critical band, the processing described in the prior application Ser. No. 292,598 and the cited Johnston paper, illustratively grouped spectral values for frequencies within each critical band. That is, the spectral processing used to determine the tonality and masking threshold was typically accomplished on a critical-band-by-critical-band basis.
  • the improvements made in accordance with aspects of the present invention permit grouping of values at discrete frequencies, but also include the use of a frequency-line-by-frequency-line analysis, rather than analysis on a spectrum-wide basis, in calculating the tonality metric values.
  • This line-by-line calculation is advantageously based on a history of consecutive frames of the input power spectrum, rather than on the current frame alone.
  • the present invention then advantageously determines improved estimates of perceptual thresholds on a line-by-line basis, rather than on a critical-band-by-critical-band basis. In appropriate cases, the critical band masking threshold can be used.
  • the tonality estimate of the present invention advantageously uses a statistic of a plurality, typically two, of the previous time frames to predict the value of a given power spectrum frequency line in the current time frame.
  • This process features the use of a Euclidian distance between the predicted line and the actual line in a present frame to estimate the tonality (or noisiness) of each spectral line. It proves convenient in these calculations to perform a normalization of the estimates using the predicted and actual values.
  • These tonality estimates can then be combined, e.g., on a critical-band basis, to obtain an estimate of the actual tonality. This is done for each frequency to determine the noise-masking thresholds to be used in quantizing the frequency information to be finally coded for recording, transmission or other use.
  • a spreading operation known in the art e.g., that is described generally in the Schroeder, et al paper, supra, is employed in an alternative implementation of certain aspects of the improved masking threshold determination process of the present invention.
  • Spreading generally relates to the masking effect on a signal at a given frequency by signals separated in frequency from the given signal frequency.
  • matrix processing is disclosed which involves signal spreading effects from signals many bark frequencies away. A bark is the term used to indicated a frequency difference of one critical band.
  • FIG. 1 is a block diagram of an overall system based on the present invention
  • FIG. 2 is a flow chart illustrating the masking threshold processing employed in an illustrative embodiment of the coder in accordance with the present invention.
  • FIG. 3 shows a detailed block diagram of a decoder that may be used in the system of FIG. 1.
  • the application WO 88/01811 describes the so-called OCF coder that may be used as one alternative to the transform coder described in the Jayant, et al reference or the application Ser. No. 292,598.
  • FIG. 1 of the present application discloses the overall organization of a system incorporating the present invention.
  • an analog signal on input 100 is applied to preprocessor 105 where it is sampled (typically at 32 kHz) and each sample is converted to a digital sequence (typically 16 bits) in standard fashion.
  • Preprocessor 105 then groups these digital values in frames (or blocks or sets) of, e.g., 512 digital values, corresponding to, e.g., 16 msec of audio input.
  • frames or blocks or sets
  • 512 digital values corresponding to, e.g., 16 msec of audio input.
  • Other typical values for these and other system or process parameters are discussed in the ISO Document.
  • each frame contains 512 ordered digital values, 256 of these values are repeated from the preceding 512-value frame.
  • each input digital value appears in two successive frames, first as part of the second half of the frame and then as part of the first half of the frame.
  • pre-echo and dynamic windowing techniques described, for example, in the above-referenced ISO Document.
  • Other pre-processing techniques that can be included in the functionality represented by preprocessor block 105 in FIG. 1 include those described in the ISO Document.
  • Perceptual coder block 110 shown in FIG. 1 includes the perceptual masking estimation improvements of the present invention and will be described in detail below.
  • Quantizer/Coder block 115 in FIG. 1 represents the above-mentioned transform or OCF coder and related coder functionality described in the incorporated application Ser. No. 292,598 and the ISO Document.
  • Block 120 in FIG. 1 represents the recording or transmission medium to which the coded output of quantizer/coder 115 are applied. Suitable formatting and modulation of the output signals from quantizer/coder 115 is included in the medium block 120. Such techniques are well known to the art and will be dictated by the particular medium, transmission or recording rates and other system parameters.
  • the medium 120 includes noise or other corrupting influences, it may be necessary to include additional error-control devices or processes, as is well known in the art.
  • the medium is an optical recording medium similar to the standard CD devices, then redundancy coding of the type common in that medium can be used with the present invention.
  • the medium is one used for transmission, e.g., a broadcast, telephone, or satellite medium
  • error control mechanisms Any modulation, redundancy or other coding to accommodate (or combat the effects of) the medium will, of course, be reversed upon the delivery from the channel or other medium to the decoder.
  • the originally coded information provided by quantizer/coder 115 will therefore be applied at a reproduction device.
  • these coded signals will be applied to decoder 130 shown in FIG. 1, and to perceptual decoder 140.
  • some of the information derived by perceptual coder 110 and delivered via quantizer/coder 115 and medium 120 to the perceptual decoder 140 is in the nature of "side information.” Such side information is described more completely below and in the ISO Document.
  • Other information provided by quantizer/coder 115 via medium 120 relating to the spectral coefficients of the input information is illustratively provided directly to decoder 130.
  • perceptual decoder 140 After processing the side information, perceptual decoder 140 provides decoder 130 with the additional information to allow it to recreate, with little or no perceptual distortion, the original spectral signals developed in pre-processor 105. These recreated signals are then applied to post-processor 150, where the inverse MDCT or equivalent operations and D/A functions are accomplished (generally as described in application Ser. No. 292,598) to recreate the original analog signal on output 160.
  • the output on 160 is in such form as to be perceived by a listener as substantially identical to that supplied on input 100.
  • FIG. 2 is a flow chart representation of the processing accomplished in perceptual coder 110.
  • Listing 1 attached, forms part of this application.
  • This listing is an illustrative annotated FORTRAN program listing reflecting processing in accordance with aspects of the present invention relating to developing a noise masking threshold.
  • a useful reference for understanding the FORTRAN processing as described herein is FX/FORTRAN Programmer's Handbook, Alliant Computer Systems Corp., July 1988.
  • general purpose computers like those from Alliant Computer Systems Corp. can be used to execute the program of Listing 1.
  • Table 1 is a list of constants used in connection with the illustrative program of Listing 1.
  • FIG. 2 and Listing 1 will now be discussed in detail to give a fuller understanding of the illustrative embodiment of the present invention.
  • Function 200 in FIG. 2 indicates the start of the processing performed in determining the improved estimates of the masking thresholds in accordance with the present invention.
  • Block 210 represents the initializing functions, using the absolute threshold values from Table 1, represented by block 220 in FIG. 2.
  • i is used, e.g., as the index for the critical bands, of the type described in the application Ser. No. 292,598, and has values from 0 to 25.
  • the index i may be used with different ranges for other processing in other occurrences appearing in Listing 1.
  • abslow is a constant assigned the indicated value to set the absolute threshold of hearing.
  • rzotz is the desired sampling rate.
  • rnorm is a normalization variable used in connection with the spreading function. openas is simply an operator used for opening an ascii file.
  • db is a dummy variable used to calculate table entries.
  • the actual threshold calculation begins with the sub-routine thrgen. Its variables r and phi are, of course, the spectral coefficients provided by preprocessor 105 in FIG. 1. They are vectors having 257 values (zero frequency, the Nyquist frequency and all intermediate components).
  • Block 210 represents the initialization, using the absolute threshold information in Table 1 (shown in block 220 in FIG. 2).
  • the next step in calculation of the perceptual threshold is the calculation of the tonality t(j) of the signal energy within each critical band j. This operation is indicated by block 230 in FIG. 2.
  • the tonality metric is determined in accordance with the program of Listing 1 by forming
  • dr and d ⁇ are the differences between the radius (r( ⁇ )) and phase ( ⁇ ( ⁇ )) of the previous calculation block and the one two previous.
  • the calculation is done on a frequency line by frequency line ( ⁇ ) basis. Note that if the blocks are shortened by the dynamic windowing technique referred to in the ISO Document, the frequency lines are duplicated accordingly, so that the number of frequency lines remains the same. Additionally, the difference is multiplied accordingly in such a dynamic windowing context, so that it represents the (estimated) difference over one differently sized block.
  • c values are used later to calculate the appropriate threshold in each critical band, through the calculation of t(j).
  • the unspread threshold uthr(j) is calculated.
  • the proper value for the masking SNR (snr db (j)), corresponding to frequency and tonality, is calculated in decibels:
  • fmin is tabulated in the ISO Document and in Table 2 as an energy ratio, rather than in db.
  • Table 2 also indicates critical band boundaries, expressed in terms of frequency lines for the indicated sampling rate. Then the ratio of masked noise energy to signal energy is calculated: ##EQU4## and the unspread threshold value is calculated:
  • the spread threshold (sthr) is calculated from the unspread threshold, the snr(j), and the critical band energies, (P(j), according to
  • mask(i-j) is tabulated at the end of the ISO Document, and represents an example modified spreading function.
  • the spreading may be accomplished using the function sprdgf(j, i) given in Listing 1.
  • the spread threshold is compared to the absolute threshold, and the maximum substituted in the limited threshold, lthr(j).
  • lthr(j) the maximum substituted in the limited threshold
  • the threshold lthr(j) is transferred to a variable named 1xmin(j) for use in the outer iteration loop described in the ISO Document.
  • a final step in the threshold calculation procedure calculates an entropy measure that is used to estimate the number of bits needed for the current signal block. This estimate is derived for use by the quantizer/coder 115 using ##EQU5##
  • An output of the processing described above and in Listing 1 is a set of threshold values that the quantizer/coder 115 FIG. 1 employs to efficiently encode the input signal information for transmission or storage as described above.
  • the inputs to quantizer/coder 115 in FIG. 1 include spectral information derived by MDCT and other processing in accordance with functions represented by block 105 in FIG. 1, and outputs of perceptual coder 110, including the noise threshold information and perceptual energy information. Quantizer/coder 115 then processes this information and in doing so provides a bitstream to the channel or recording medium 120 in FIG. 1, which bitstream includes information divided into three main parts:
  • a second part containing the scaling factors for the 23 critical 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;
  • the following bits are dependent on the side information of part 1 (e.g. subblock information is only needed if coding in subblocks is actually selected)
  • a part of the Huffman code is ordered in a two-dimenional array with the number of columns depending on the longest codeword of the Huffman codetable (5, 16, 18, 22 or 19 bits for ESC-tables).
  • the number of rows is the size of part 3 divided by the number of columns.
  • the codewords of the higher frequencies that can not be ordered into this rectangular array are fit into the remaining gaps.
  • FIG. 3 shows a detailed block diagram of a decoder in accordance with aspects of the present invention.
  • FIG. 3 shows a synchronization buffer 310 which acts to appropriately buffer input bitstreams arriving on input lead 305. Error correction is then effected in the part of the system represented by block 315. This block also provides for extraction of low frequency spectral coefficients.
  • Side information extracted in block 320 is demultiplexed from the other arriving information and is sentto either the Huffman coder 330 or the speech reconstruction functional elements 335.
  • the actual coded spectral coefficient information is sent to the Huffman decoder itself.
  • the decoder 330 is provided with a stored Huffman codebook equivalent to that maintained at the coder of FIG. 1.
  • the MDCT synthesis or other frequency synthesis operation
  • Standard aliasing techniques are then applied to provide samples to be converted by digital-to-analog conversion and reproduction to acoustic or other analog signals.

Abstract

A method is disclosed for determining estimates of the perceived noise masking level of audio signals as a function of frequency. By developing a randomness metric related to the euclidian distance between (i) actual frequency components amplitude and phase for each block of sampled values of the signal and (ii) predicted values for these components based on values in prior blocks, it is possible to form a tonality index which provides more detailed information useful in forming the noise masking function. Application of these techniques is illustrated in a coding and decoding context for audio recording or transmission. The noise spectrum is shaped based on a noise threshold and a tonality measure for each critical frequency-band (bark).

Description

.Iadd.This application is a continuation of application Ser. No. 08/106,499, filed on Aug. 13, 1993, abandoned..Iaddend.
FIELD OF THE INVENTION
The present invention relates to coding of time varying signals, such as audio signals representing voice or music information.
BACKGROUND OF THE INVENTION
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) digital recordings for music have largely replaced the long-popular phonograph records. More recently, digital audio tape (DAT) devices promise further enhancements and convenience in high quality audio applications. See, for example, Tan and Vermeulen, "Digital audio tape for data storage," IEEE Spectrum, October 1989, pp. 34-38. Recent interest in high-definition television (HDTV) has also spurred consideration of how high quality audio for such systems can be efficiently provided.
While commercially available CD and DAT systems employ elaborate parity and error correction codes, no standard presently exists for efficiently coding source information for high quality audio signals with these devices. Tan and Vermeulen, supra, note that (unspecified) data compression, among other techniques, can be used to increase capacity and transfer rate for DAT devices by a factor of ten over time.
It has long been known that the human auditory response can be masked by audio-frequency noise or by other-than-desired audio frequency sound signals. See, B. Scharf, "Critical Bands," Chap. 5 in J. V. Tobias, Foundations of Modern Auditory Theory, Academic Press, New York, 1970. While "critical bands," as noted by Scharf, relate to many analytical and empirical phenonomena and techniques, a central features of critical band analysis relates to the characteristic of certain human auditory responses to be relatively constant over a range of frequencies. Thus, for example, the loudness of a band of noise at a constant sound pressure remains constant as the bandwidth increases up to the critical band; then loudness begins to increase. In the cited Tobias reference, at page 162, there is presented one possible table of 24 critical bands, each having an identified upper and lower cutoff frequency. The totality of the band covers the audio frequency spectrum up to 15.5 kHz. These effects have been used to advantage in designing coders for audio signals. See, for example, M. R. Schroeder et al, "Optimizing Digital Speech Coders By Exploiting Masking Properties of the Human Ear," Journal of the Acoustical Society of America, Vol. 66, pp. 1647-1652, December, 1979.
E. F. Schroeder and H. J. Platte, "MSC': Stereo Audio Coding with CD-Quality and 256 IT/SEC," IEEE Trans. on Consumer Electronics, Vol. CE-33, No. 4, November 1987, describes a perceptual encoding procedure with possible application to CDs.
In J. D. Johnston, "Transform Coding of Audio Signals Using Perceptual Noise Criteria," IEEE Trans. on Selected Areas in Communications, February 1988, pp. 314-434 and .[.copending application Ser. No. 292,598, filed Dec. 30, 1988;.]. .Iadd.U.S. Pat. No. 5,535,300, issued Jul. 9, 1996 on application Ser. No. 284,324, filed Aug. 2, 1994, which is a continuation of Ser. No. 109,867, Aug. 20, 1993, U.S. Pat. No. 5,341,457, which is a continuation of Ser. No. 962,151, Oct. 16, 1992, abandoned, which is a continuation of Ser. No. 844,967, Feb. 28, 1992, abandoned, which is a continuation of Ser. No. 292,598, Dec. 30, 1998, abandoned, .Iaddend.by J. L. Hall II and J. D. Johnston, assigned to the assignee of the present invention, there are disclosed enhanced perceptual coding techniques for audio signals. Perceptual coding, as described in the Johnston, et al paper relates to a technique for lowering required bitrates (or reapportioning available bits) in representing audio signals. In this form of coding, the masking threshold for unwanted signals is identified as a function of frequency of the desired signal. Then 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. 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. In particular, the systems described in this paper and copending application use a human auditory model to derive a short-term spectral masking function that is implemented in a transform coder. Bitrates are reduced by extracting redundancy based on signal frequency analysis and the masking function. The techniques use a so-called "tonality" measure indicative of the shape of the spectrum over the critical bands of the signal to be coded to better control the effects of quantizing noise. As noted in the Johnston paper, supra, and the cited patent application Ser. No. 292,598, the masking effect of noise is dependent on the "tonelike or noiselike" nature of the signal. In particular, an offset for the masking threshold for each critical band is developed which depends on whether a "coefficient of tonality" for the signal in each critical band indicates that the signal is relatively more tonelike or noiselike. This coefficient of tonality is, in turn, conveniently derived from a measure of flatness of the spectrum of the signal over that critical band.
SUMMARY OF THE INVENTION
The present invention improves on the tonality based perceptual coding techniques described in the cited copending application Ser. No. 292,598. Because the frequency analysis typically involves determining spectral information at discrete frequencies ("frequency lines") within the audio spectrum, and because a number of these discrete frequencies will, in general, fall within each critical band, the processing described in the prior application Ser. No. 292,598 and the cited Johnston paper, illustratively grouped spectral values for frequencies within each critical band. That is, the spectral processing used to determine the tonality and masking threshold was typically accomplished on a critical-band-by-critical-band basis. The improvements made in accordance with aspects of the present invention permit grouping of values at discrete frequencies, but also include the use of a frequency-line-by-frequency-line analysis, rather than analysis on a spectrum-wide basis, in calculating the tonality metric values. This line-by-line calculation is advantageously based on a history of consecutive frames of the input power spectrum, rather than on the current frame alone. The present invention then advantageously determines improved estimates of perceptual thresholds on a line-by-line basis, rather than on a critical-band-by-critical-band basis. In appropriate cases, the critical band masking threshold can be used.
More particularly, the tonality estimate of the present invention advantageously uses a statistic of a plurality, typically two, of the previous time frames to predict the value of a given power spectrum frequency line in the current time frame. This process features the use of a Euclidian distance between the predicted line and the actual line in a present frame to estimate the tonality (or noisiness) of each spectral line. It proves convenient in these calculations to perform a normalization of the estimates using the predicted and actual values. These tonality estimates can then be combined, e.g., on a critical-band basis, to obtain an estimate of the actual tonality. This is done for each frequency to determine the noise-masking thresholds to be used in quantizing the frequency information to be finally coded for recording, transmission or other use.
A spreading operation known in the art, e.g., that is described generally in the Schroeder, et al paper, supra, is employed in an alternative implementation of certain aspects of the improved masking threshold determination process of the present invention. Spreading generally relates to the masking effect on a signal at a given frequency by signals separated in frequency from the given signal frequency. In the above cited prior application Ser. No. 292,598, and the Johnston paper, matrix processing is disclosed which involves signal spreading effects from signals many bark frequencies away. A bark is the term used to indicated a frequency difference of one critical band.
Other features and improvements of the present invention will appear from the following detailed description of an illustrative embodiment.
BRIEF DESCRIPTION OF THE DRAWING
FIG. 1 is a block diagram of an overall system based on the present invention;
FIG. 2 is a flow chart illustrating the masking threshold processing employed in an illustrative embodiment of the coder in accordance with the present invention; and
FIG. 3 shows a detailed block diagram of a decoder that may be used in the system of FIG. 1.
DETAILED DESCRIPTION
To simplify the present disclosure, copending application, Ser. No. 292,598, filed Dec. 30, 1988, by J. L. Hall II and J. D. Johnston, assigned to the assignee of the present invention; 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; and International Patent Application (PCT) WO 88/01811, filed Mar. 10, 1988 by K. Brandenburg are hereby incorporated by reference as if set forth in their entirety herein.
Also incorporated by reference as set forth in its entirety herein is a proposal submitted by the assignee of the present application, inter alia, to the International Standards Organization (ISO) on Oct. 18, 1989 for consideration by the members of that body as the basis for a standard relating to digital coding. This document, entitled "ASPEC" will hereinafter be referred to as "the ISO Document".
Application Ser. No. 292,598 describes a perceptual noise threshold estimation technique in the context of the well-known transform coder. See also, for example, N. S. Jayant and P. Noll, Digital Coding of Waveforms--Principles and Applications to Speech and Video, especially, Chapter 12, "Transform Coding."
The application WO 88/01811 describes the so-called OCF coder that may be used as one alternative to the transform coder described in the Jayant, et al reference or the application Ser. No. 292,598.
FIG. 1 of the present application discloses the overall organization of a system incorporating the present invention.
In that figure, an analog signal on input 100 is applied to preprocessor 105 where it is sampled (typically at 32 kHz) and each sample is converted to a digital sequence (typically 16 bits) in standard fashion. Preprocessor 105 then groups these digital values in frames (or blocks or sets) of, e.g., 512 digital values, corresponding to, e.g., 16 msec of audio input. Other typical values for these and other system or process parameters are discussed in the ISO Document.
It also proves advantageous to overlap contiguous frames, typically to the extent of 50 percent. That is, though each frame contains 512 ordered digital values, 256 of these values are repeated from the preceding 512-value frame. Thus each input digital value appears in two successive frames, first as part of the second half of the frame and then as part of the first half of the frame.
These frames are then transformed in standard fashion using. e.g., the modified discrete cosine transform (MDCT) described in Princen, J., et al, "Sub-band Transform Coding Using Filter Bank Designs Based on Time Domain Aliasing Cancellation," IEEE ICASSP, 1987, pp. 2161-2164. The well-known short-term Fast Fourier Transform (FFT) in one of its several standard forms can be adapted for such use as will be clear to those skilled in the art. The set of 257 complex coefficients (zero-frequency, Nyquist frequency, and all intermediate frequencies) resulting from the MDCT represents the short-term frequency spectrum of the input signal.
The complex coefficients are conveniently represented in polar coordinate or amplitude and phase components, indicated as "r" and "phi," respectively, in the sequel.
While not shown explicitly in FIG. 1, the present invention advantageously utilizes known "pre-echo" and dynamic windowing techniques described, for example, in the above-referenced ISO Document. Other pre-processing techniques that can be included in the functionality represented by preprocessor block 105 in FIG. 1 include those described in the ISO Document.
Perceptual coder block 110 shown in FIG. 1 includes the perceptual masking estimation improvements of the present invention and will be described in detail below. Quantizer/Coder block 115 in FIG. 1 represents the above-mentioned transform or OCF coder and related coder functionality described in the incorporated application Ser. No. 292,598 and the ISO Document.
Block 120 in FIG. 1 represents the recording or transmission medium to which the coded output of quantizer/coder 115 are applied. Suitable formatting and modulation of the output signals from quantizer/coder 115 is included in the medium block 120. Such techniques are well known to the art and will be dictated by the particular medium, transmission or recording rates and other system parameters.
Further, if the medium 120 includes noise or other corrupting influences, it may be necessary to include additional error-control devices or processes, as is well known in the art. Thus, for example, if the medium is an optical recording medium similar to the standard CD devices, then redundancy coding of the type common in that medium can be used with the present invention.
If the medium is one used for transmission, e.g., a broadcast, telephone, or satellite medium, then other appropriate error control mechanisms will advantageously be applied. Any modulation, redundancy or other coding to accommodate (or combat the effects of) the medium will, of course, be reversed upon the delivery from the channel or other medium to the decoder. The originally coded information provided by quantizer/coder 115 will therefore be applied at a reproduction device.
More particularly, these coded signals will be applied to decoder 130 shown in FIG. 1, and to perceptual decoder 140. As in the case of the system described in application Ser. No. 292,598, some of the information derived by perceptual coder 110 and delivered via quantizer/coder 115 and medium 120 to the perceptual decoder 140 is in the nature of "side information." Such side information is described more completely below and in the ISO Document. Other information provided by quantizer/coder 115 via medium 120 relating to the spectral coefficients of the input information is illustratively provided directly to decoder 130.
After processing the side information, perceptual decoder 140 provides decoder 130 with the additional information to allow it to recreate, with little or no perceptual distortion, the original spectral signals developed in pre-processor 105. These recreated signals are then applied to post-processor 150, where the inverse MDCT or equivalent operations and D/A functions are accomplished (generally as described in application Ser. No. 292,598) to recreate the original analog signal on output 160. The output on 160 is in such form as to be perceived by a listener as substantially identical to that supplied on input 100.
PERCEPTUAL THRESHOLD VALUES
With the overall system organization described above as background, and with the details of the incorporated application Ser. No. 292,598 as a baseline or reference, the improved process of calculating the threshold value estimates in accordance with the present invention will be described. The ISO Document should also be referred to for more detailed descriptions of elements of the present invention and for alternative implementations.
FIG. 2 is a flow chart representation of the processing accomplished in perceptual coder 110. Listing 1, attached, forms part of this application. This listing is an illustrative annotated FORTRAN program listing reflecting processing in accordance with aspects of the present invention relating to developing a noise masking threshold. A useful reference for understanding the FORTRAN processing as described herein is FX/FORTRAN Programmer's Handbook, Alliant Computer Systems Corp., July 1988. Likewise, general purpose computers like those from Alliant Computer Systems Corp. can be used to execute the program of Listing 1. Table 1 is a list of constants used in connection with the illustrative program of Listing 1.
While a particular programming language, well known to the art, is used in Listing 1, those skilled in the art will recognize that other languages will be appropriate to particular applications of the present invention. Similarly, constants, sampling rates and other particular values will be understood to be for illustrative purposes only, and in no sense should be interpreted as a limitation of the scope of the present invention.
FIG. 2 and Listing 1 will now be discussed in detail to give a fuller understanding of the illustrative embodiment of the present invention.
Function 200 in FIG. 2 indicates the start of the processing performed in determining the improved estimates of the masking thresholds in accordance with the present invention. Block 210 represents the initializing functions, using the absolute threshold values from Table 1, represented by block 220 in FIG. 2.
These initializing or startup operations are depicted explicitly in Listing 1 by the subroutine strt(). In this illustrative subroutine, threshold generation tables ithr and bval are set up first.
It should be noted that i is used, e.g., as the index for the critical bands, of the type described in the application Ser. No. 292,598, and has values from 0 to 25. The index i may be used with different ranges for other processing in other occurrences appearing in Listing 1.
In strt(), abslow is a constant assigned the indicated value to set the absolute threshold of hearing. rzotz is the desired sampling rate. rnorm is a normalization variable used in connection with the spreading function. openas is simply an operator used for opening an ascii file. db is a dummy variable used to calculate table entries.
The actual threshold calculation begins with the sub-routine thrgen. Its variables r and phi are, of course, the spectral coefficients provided by preprocessor 105 in FIG. 1. They are vectors having 257 values (zero frequency, the Nyquist frequency and all intermediate components).
Block 210 represents the initialization, using the absolute threshold information in Table 1 (shown in block 220 in FIG. 2).
The next step in calculation of the perceptual threshold is the calculation of the tonality t(j) of the signal energy within each critical band j. This operation is indicated by block 230 in FIG. 2. The tonality metric is determined in accordance with the program of Listing 1 by forming
dr(ω)=r.sub.t-1 (ω)-r.sub.t-2 (ω)
and
dφ(ω)=φ.sub.t-1 (ω)-φ.sub.t-2 (ω).
dr and dφ are the differences between the radius (r(ω)) and phase (φ(ω)) of the previous calculation block and the one two previous. The calculation is done on a frequency line by frequency line (ω) basis. Note that if the blocks are shortened by the dynamic windowing technique referred to in the ISO Document, the frequency lines are duplicated accordingly, so that the number of frequency lines remains the same. Additionally, the difference is multiplied accordingly in such a dynamic windowing context, so that it represents the (estimated) difference over one differently sized block.
From the dr and dφ values and the previous r and φ, the "expected" radius and phase for the current block are calculated:
r(ω)=r.sub.t-1 (ω)+dr(ω)
and
φ(ω)=φ.sub.t-1 (ω)+dφ(ω),
where the ω and difference signals are again adjusted appropriately for the dynamic windowing, if present.
From these values and the actual values for the current spectrum, a randomness metric (c(ω))) is calculated: ##EQU1##
c values are used later to calculate the appropriate threshold in each critical band, through the calculation of t(j).
Next, the critical band energy calculation is made, as indicated by block 240 in FIG. 2.
The energy in each critical band is ##EQU2## and the summed randomness metric, C(j) is ##EQU3##
The C(j) are then converted to the tonality index, t(j) in two steps
tmp(j)=max(0.05, min(0.5. C(j))),
then
t(j)=0.43*1n tmp(j)-0.299
It is now possible to derive the unspread threshold values.
From the power and the tonality values, the unspread threshold uthr(j) is calculated. First, the proper value for the masking SNR (snrdb (j)), corresponding to frequency and tonality, is calculated in decibels:
snr.sub.db (j)=max(max(24.5, 15.5+j)+5.5*(1.-t(j)), fmin(j))
where fmin is tabulated in the ISO Document and in Table 2 as an energy ratio, rather than in db. Table 2 also indicates critical band boundaries, expressed in terms of frequency lines for the indicated sampling rate. Then the ratio of masked noise energy to signal energy is calculated: ##EQU4## and the unspread threshold value is calculated:
uthr(j)=P(j)*snr(j).
The spread threshold (sthr) is calculated from the unspread threshold, the snr(j), and the critical band energies, (P(j), according to
sthr(j)=max(uthr(j), snr(j)*P(i)*mask(i-j)[i>j])
where mask(i-j) is tabulated at the end of the ISO Document, and represents an example modified spreading function. Alternatively, the spreading may be accomplished using the function sprdgf(j, i) given in Listing 1.
After spreading, the spread threshold is compared to the absolute threshold, and the maximum substituted in the limited threshold, lthr(j). As noted in the Johnston paper cited above, this adjustment is made because it is not practical to specify a noise threshold that is lower than the level at which a person could hear noise. Any such threshold below the absolute level at which it could be heard could result in waste of resources. Thus the absolute threshold is taken into account by lthr(j)=max(thr(j), absthr(j)), where absthr(j) is tabulated at the end of the ISO document. Note that the absolute threshold is adjusted for actual block length.
Finally, the threshold is examined, after adjustment for block length factors, for narrow-band pre-echo problems. The final threshold, thr(j) is then calculated:
thr(j)=min(lthr(j), 2*othr(j))
and othr is then updated:
othr(j)=lthr(j).
The threshold lthr(j) is transferred to a variable named 1xmin(j) for use in the outer iteration loop described in the ISO Document.
A final step in the threshold calculation procedure calculates an entropy measure that is used to estimate the number of bits needed for the current signal block. This estimate is derived for use by the quantizer/coder 115 using ##EQU5##
This completes the perceptual threshold processes.
An output of the processing described above and in Listing 1 is a set of threshold values that the quantizer/coder 115 FIG. 1 employs to efficiently encode the input signal information for transmission or storage as described above.
While the preceding description of an illustrative embodiment of the present invention has referred to a particular programming language and type of processors, it will be recognized by those skilled in the art that other implementations will be desirable in particular cases. For example, in consumer products size requirements may dictate that high performance general purpose or special purpose microprocessors like those from AT&T, Intel Corp. or Motorola be used. For example, various of the AT&T DSP-32 digital signal processing chips have proved useful for performing processing of the type described above. In other particular cases, special purpose designs based on well-known chip design techniques will be preferably employed to perform the above described processing.
The tonality metric determined in the illustrative embodiment above using differences between the values of r(ω) and φ(ω) from the present block and the corresponding values from the two previous blocks. In appropriate cases, it may prove advantageous to form such a difference using only one prior value in evaluating these variables, or using a plurality greater than two of such prior values, as the basis for forming the expected current values.
Likewise, though values for certain of the variables described above are calculated for each spectral frequency line, it may prove to be an economical use of processing resources to calculate such values for less than all of such lines.
Aspects of the processing accomplished by quantizer/coder 115 and decoder 130 in FIG. 1 will now be described, based on materials included in the ISO Document.
The inputs to quantizer/coder 115 in FIG. 1 include spectral information derived by MDCT and other processing in accordance with functions represented by block 105 in FIG. 1, and outputs of perceptual coder 110, including the noise threshold information and perceptual energy information. Quantizer/coder 115 then processes this information and in doing so provides a bitstream to the channel or recording medium 120 in FIG. 1, which bitstream includes information divided into three main parts:
a first part containing the standardized side information, typically in a fixed length record;
a second part containing the scaling factors for the 23 critical 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
a third part containing the entropy coded spectral values, typically in the form of the well-known two-dimensional Huffman code.
Typical apportionment for information provided by quantizer/coder 115 is summarized in Table 3.
__________________________________________________________________________
PART I                                                                    
__________________________________________________________________________
sync work (0110111)                                                       
                   signals the start of the block                         
                                       7 bit                              
position of parts 2 & 3 (bitsav)                                          
                   difference between the last bit of part 2 &            
                                       12 bit                             
                   and the first bit of part 1                            
word length selector for part 2 (cbtable)                                 
                   selects by a table a word length for                   
                                       4 bit                              
                   scaling factors for the 12 lower critical              
                   bands between 0..4 and for the higher                  
                   critical bands between 0..3. Four                      
                   combinations with a small expectation are              
                   unused                                                 
number of big spectral values (bigvalues)                                 
                   number of pairs of spectral values that                
                                       8 bit                              
                   coded with a two dimensional Huffman                   
                   code, able to code values larger than 1 × 1 the  
                   so called small spectral values                        
quantizer and global gain information (Gain)                              
                   level differences between original and                 
                                       7 bit                              
                   quantized values in steps of 2.sup.1                   
Huffman codetable (iqfeld)                                                
                   values 0..3 select a 4 × 4, 8 × 8, 16      
                   × 16 or       4 bit                              
                   32 × 32 codetable                                
                   values > 3 select a 32 × 32 ESC-table when 31    
                   is an ESC-character followed by (Huffman               
                   codetable-3) bits of linear transmitted part of        
                   the spectral value, that has to be added to the        
                   31                                                     
pre-emphasis (preflag)                                                    
                   flag, that the higher part of the spectrum             
                                       1 bit                              
                   quantized with a smaller quantizer step size           
critical band scaling stepsize (ps-scale)                                 
                   flag, whether the critical band scaling                
                                       1 bitr                             
                   has a stepsize of 2 or 2.sup.1                         
block split (split-flag)                                                  
                   flag, whether the block is split into                  
                                       1 bit                              
                   subblocks (dynamic windowing)                          
0/1 codetable (count 1 table)                                             
                   selection of one of two possible codebooks             
                                       1 bit                              
                   for the coding of small values (-1,0,1)                
DC-part of the signal (dc-value)       9 bit                              
                                       55 bit                             
__________________________________________________________________________
PART II
The following bits are dependent on the side information of part 1 (e.g. subblock information is only needed if coding in subblocks is actually selected)
______________________________________                                    
global gain for subblock 2                                                
                        3 bit                                             
DC-value of subblock 2  9 bit                                             
global gain for subblock 3                                                
                        3 bit                                             
DC-value of subblock 3  9 bit                                             
global gain for subblock 4                                                
                        3 bit                                             
DC-value of subblock 4  9 bit                                             
scaling factors for the lower 12 *(0 . . . 4)                             
                        48 bit                                            
12 critical bands                                                         
scaling factors for the higher *(0 . . . 3)                               
                        33 bit                                            
11 critical bands                                                         
                       117 bit                                            
______________________________________                                    
PART III
Huffman coded spectral values about 0 . . . 4000 bit
A part of the Huffman code is ordered in a two-dimenional array with the number of columns depending on the longest codeword of the Huffman codetable (5, 16, 18, 22 or 19 bits for ESC-tables). The number of rows is the size of part 3 divided by the number of columns. The codewords of the higher frequencies that can not be ordered into this rectangular array are fit into the remaining gaps.
Signs of values not equal to 0 follow the codeword directly.
When using the ESC-table, up to 4 msb+sign of the linear transmitted part follow the codeword directly the lsb+sign are filled in the gaps. ********+xxxxxxxxxxx**********+mmmmxxx***-xxxxxxxxxxxxxxxxxx** . . .
1. start of row 2. start of row 3. start of row 4. . . .
* bits of Huffman codeword ordered in the array
+ sign of the first spectral values
- sign of the second spectral values
m msb's of the linear part of an ESC-value
x gaps, filled by the rest of the Huffman code and the lsb's
The advantage of the array, which is sent in row by row order as the bitstream, is the restriction of error propagation to higher frequencies.
FIG. 3 shows a detailed block diagram of a decoder in accordance with aspects of the present invention. FIG. 3 shows a synchronization buffer 310 which acts to appropriately buffer input bitstreams arriving on input lead 305. Error correction is then effected in the part of the system represented by block 315. This block also provides for extraction of low frequency spectral coefficients.
Side information extracted in block 320 is demultiplexed from the other arriving information and is sentto either the Huffman coder 330 or the speech reconstruction functional elements 335. The actual coded spectral coefficient information is sent to the Huffman decoder itself. The decoder 330 is provided with a stored Huffman codebook equivalent to that maintained at the coder of FIG. 1. After the spectrum information is reconstructed, the MDCT synthesis (or other frequency synthesis operation) is applied to reverse the original frequency analysis performed preparatory to coding. Standard aliasing techniques are then applied to provide samples to be converted by digital-to-analog conversion and reproduction to acoustic or other analog signals.
______________________________________                                    
LISTING 1                                                                 
______________________________________                                    
c      First startup routine                                              
       subroutine strt( )                                                 
c      sets up threshold generation tables, ithr and bval                 
       real freq(0:25)/0.,100.,200.,300.,400.,500.,630.,770.,             
       1 920.,1080.,1270.,1480.,1720.,2000.,2320.,2700.,                  
       1 315O.,3700.,4400.,5300.,6400.,7700.,9500.,12000.,15500.,         
       1 25000./                                                          
       common/thresh/ithr(26),bval(257,rnorm(257)                         
       common/absthr/abslow(257)                                          
       common/sigs/ifirst                                                 
c      ithr(i) is bottom of crital band i. bval is bark index             
c      of each line                                                       
       write(*,*) `what spl will + - 32000 be →`                   
       read(*.*) abslev                                                   
       abslev = abslev - 96.                                              
       abstow = 5224245.*5224245./exp(9.6*alog(10.))                      
       ifirst = 0                                                         
       write(*.*) `what is the sampling rate`                             
       read(*.*) rzotz                                                    
       fnyq = rzotz/2.                                                    
c      nyquest frequency of interest.                                     
       ithr(1) = 2.                                                       
       i = 2                                                              
10     ithr(i) = freq(i - 1)/fnyq*256. + 2.                               
       i = i + 1                                                          
       if (freq(i - 1) .It. fnyq) goto 10                                 
c      sets ithr to bottom of cb                                          
       ithr(i:26) = 257                                                   
c      now, set up the critical band indexing array                       
       bval(1) = 0                                                        
c      first, figure out frequency, then . . .                            
       do i = 2,257,1                                                     
       fre = (i - 1)/256.*fnyq                                            
c      write(*,*) i,fre                                                   
c      fre is now the frequency of the line. convert                      
c      it to critical band number . . .                                   
       do j = 0,25,1                                                      
       if (fre .gt. freq(j)) k = j                                        
       end do                                                             
c      so now, k = last CB lower than fre                                 
       rpart = fre - freq(k)                                              
       range = freq(k + 1) - freq(k)                                      
       bval(i) = k + rpart/range                                          
       end do                                                             
       rnorm = 1                                                          
       do i = 2,257,1                                                     
       imp = 0                                                            
       do j = 2.257,1                                                     
       imp = imp + sprdngf(bval(j),bval(i))                               
       end do                                                             
       rnorm(i) = tmp                                                     
       end do                                                             
       rnorm = 1./rnorm                                                   
c      do i = 1.257.1                                                     
c      write(*.*)i.bval(i), 10.*alog10(rnorm(i))                          
c      end do                                                             
       call openas(0.`/usr/jj/nsrc/thrtry/freqlist`.0)                    
       do i = 2.257,1                                                     
       read(0,*) ii.db                                                    
       if (ii .ne. i) then                                                
       write(*,*) `freqlist is bad.`                                      
       stop                                                               
       end if                                                             
       db = exp((db-abslev)/10.*alog(10.))                                
c      write(*,*) i,db                                                    
       abslow(i) = abslow(i)*db                                           
       end do                                                             
       abslow(1) = 1.                                                     
       write(*,*) `lowest level is `, sqrt(abslow(45))                    
       return                                                             
       end                                                                
c      Threshold calculation program                                      
       subroutine thrgen(rt,phi,thr)                                      
       real r(257),phi(257)                                               
       real rt(257)                                                       
       real thr(257)                                                      
       common/blnk/ or(257),ophi(257),dr(257),dphi(257)                   
       common/blk1/othr(257)                                              
       real alpha(257),tr(257),tphi(257)                                  
       real beta(257),bcalc(257)                                          
       common/absthr/abslow(257)                                          
       common/thresh/ithr(26),bval(257),rnorm(257)                        
       common/sigs/ifirst                                                 
       r = max(rt,.0005)                                                  
       bcalc = 1.                                                         
       if(ifirst .eq. 0) then                                             
       or = 0).                                                           
       othr = le20                                                        
       ophi = 0                                                           
       dr = 0                                                             
       dphi = 0                                                           
       ifirst = 1                                                         
       end if                                                             
c      this subroutine figures out the new threshold values               
c      using line-by-line measurement.                                    
       tr. = or -dr                                                       
       tphi = ophi ÷ dphi                                             
       dr = r -or                                                         
       dphi = phi - ophi                                                  
       or = r                                                             
       ophi = phi                                                         
       alpha = sqrt((r*cos(phi) - tr*cos(tphi))                           
       1 *(r*cos(phi) - tr*cos(tphi))                                     
       2 + (r*sin(phi) - tr*sin(tphi))                                    
       3 *(r*sin(phi) - tr*sin(tphi)))                                    
       4/(r + abs(tr) + 1.)                                               
       beta  alpha                                                        
c      now, beta is the unweighted tonality factor                        
       alpha = r*r                                                        
c      now, the energy is in each                                         
c      line. Must spread. (ecch)                                          
c      write(*,*) `before spreading`                                      
       thr = 0                                                            
       bcalc = 0                                                          
cvdS1  cncall                                                             
       do i = 2.2257,1                                                    
cvdS1  cncall                                                             
       do j = 2.257,1                                                     
       glorch = sprdngf(bval(j),bval(i))                                  
       thr(i) = alpha(j)*glorch + thr(i)                                  
       bcalc(i) = alpha(j)*glorch*beta(j) + bcalc(i)                      
c      thr is the spread energy. bcalc is the weighted chaos              
       end do                                                             
c      if (thr(i) .eq. 0) then                                            
c      write(*,*) `zero threshold, you blew it`                           
c      stop                                                               
c      end if                                                             
       bcalc(i) = bcalc(i)/thr(i)                                         
       if (bcalc(i) .gt. .5)bcalc(i) = 1. - bcalc(i)                      
c      that normalizes bcalc to 0-.5                                      
       end do                                                             
c      write(*.*) `after spreading`                                       
       bcalc = max(bcalc,.05)                                             
       bcalc = min(bcalc,.5)                                              
c      bcalc is now the chaos metric, convert to the                      
c      tonality metric                                                    
       bcalc = -.45*alog(bcalc) ` .299                                    
c      now calculate DB                                                   
       bcalc = max(24 5.(15.5 + bval))*bcalc + 5.5*(1. - bcalc)           
       bcalc = exp((-bcalc/10.) * alog (10.))                             
c      now, bcalc it actual tonality factor, for power                    
c      space.                                                             
       thr = thr*rnorm*bcalc                                              
c      threshold is tonality factor times energy (with                    
       normalization)                                                     
       thr = max(thr,abslow)                                              
       alpha = thr                                                        
       thr = min(thr,othr*2.)                                             
       othr = alpha                                                       
c      write(*,*) `leaving thrgen`                                        
       return                                                             
       end                                                                
c      And, the spreading function                                        
       function sprdngf(j,i)                                              
       real i,j                                                           
       real sprdngf                                                       
c      this calculates the value of the spreading function for            
c      the i'th bark, with the center being the j'th                      
c      bark                                                               
       temp1 = i - j                                                      
       temp2 = 15.8811389 + 7.5*(templ + .474)                            
       temp2 = temp2 - 17.5*sqrt(1. + (templ + .474)*                     
       (temp1 + .474))                                                    
       if( temp2 .1e. - 100.) then                                        
       temp3 = 0.                                                         
       else                                                               
       temp2 = temp2/10.*alog(10.)                                        
       temp3 = exp(temp2)                                                 
       end if                                                             
       sprdngf = temp3                                                    
       return                                                             
       end                                                                
______________________________________                                    
              TABLE I                                                     
______________________________________                                    
Absolute Threshold File -                                                 
("freqlist" for start-up routine)                                         
______________________________________                                    
 1          56      3.  111  16.  166  16.  221   50.                     
 2   27.    57      4.  112  17.  167  16.  222   50.                     
 3   18.    58      4.  113  17.  168  16.  223   50.                     
 4   16.    59      5.  114  17.  169  16.  224   50.                     
 5   10.    60      5.  115  17.  170  16.  225   50.                     
 6   9.     61      5.  116  18.  171  17.  226   50.                     
 7   8.     62      6.  117  18.  172  17.  227   50.                     
 8   8.     63      6.  118  18.  173  17.  228   50.                     
 9   8.     64      6.  119  18.  174  17.  229   50.                     
10   8.     65      6.  120  18.  175  17.  230   50.                     
11   8.     66      7.  121  18.  176  17.  231   50.                     
12   7.     67      7.  122  18.  177  18.  232   50.                     
13   7.     68      7.  123  18.  178  18.  233   50.                     
14   7.     69      8.  124  17.  179  18.  234   60.                     
15   7.     70      9.  125  17.  180  18.  235   60.                     
16   7.     71     10.  126  16.  181  18.  236   60.                     
17   7.     72     10.  127  16.  182  19.  237   60.                     
18   7.     73     10.  128  16.  183  19.  238   60.                     
19   7.     74     10.  129  16.  184  19.  239   60.                     
20   7.     75     10.  130  15.  185  19.  240   60.                     
21   7.     76     10.  131  15.  186  19.  241   60.                     
22   7.     77     10.  132  15.  187  20.  242   60.                     
23   7.     78     10.  133  15.  188  21.  243   60.                     
24   7.     79     10.  134  14.  189  22.  244   60.                     
25   6.     80     10.  135  14.  190  23.  245   60.                     
26   5.     81     11.  136  13.  191  24.  246   60.                     
27   5.     82     11.  137  12.  192  25.  247   60.                     
28   5.     83     11.  138  12.  193  26.  248   60.                     
29   5.     84     11.  139  12.  194  27.  249   60.                     
30   5.     85     11.  140  12.  195  28.  250   60.                     
31   4.     86     12.  141  12.  196  29.  251   60.                     
32   4.     87     12.  142  12.  197  30.  252   60.                     
33   4.     88     12.  143  12.  198  31.  253   60.                     
34   4.     89     12.  144  13.  199  32.  254   60.                     
35   4.     90     12.  145  13.  200  33.  255   60.                     
36   3.     91     12.  146  14.  201  34.  256   60.                     
37   3.     92     13.  147  14.  202  35.  257   60.                     
38   3.     93     13.  148  14.  203  36.                                
39   3.     94     13.  149  14.  204  37.                                
40   2.     95     13.  150  14.  205  38.                                
41   2.     96     13.  151  14.  206  39.                                
42   1.     97     13.  152  14.  207  40.                                
43   1.     98     14.  153  14.  208  41.                                
44   1.     99     14.  154  14.  209  42.                                
45   1.     100    14.  155  14.  210  43.                                
46   0.     101    14.  156  15.  211  44.                                
47   0.     102    15.  157  15.  212  45.                                
48   0.     103    15.  158  15.  213  46.                                
49   0.     104    15.  159  15.  214  47.                                
50   0.     105    15.  160  15.  215  48.                                
51   0.     106    15.  161  15.  216  49.                                
52   2.     107    16.  162  15.  217  50.                                
53   2.     108    16.  163  15.  218  50.                                
54   2.     109    16.  164  15.  219  50.                                
55   3.     110    16.  165  15.  220  50.                                
______________________________________                                    
              TABLE 2                                                     
______________________________________                                    
table of critical bands and fmin                                          
(used at 48 kHz sampling frequency)                                       
The upper band edge is set to 20 kHz (line 214 at block                   
length 256, line 428 at block length 512)                                 
The following table is used at block length 512. The table                
for block length 256 can easily be calculated                             
from the table for 512 block length. The tables for other                 
sampling rates can also be calculated from this                           
list.                                                                     
cb     start          width  fmin                                         
______________________________________                                    
 1      0             4      .007                                         
 2      4             4      .007                                         
 3      8             4      .007                                         
 4     12             4      .007                                         
 5     16             4      .007                                         
 6     20             4      .007                                         
 7     24             4      .007                                         
 8     28             4      .01                                          
 9     32             4      .01                                          
10     36             4      .01                                          
11     40             6      .01                                          
12     46             6       .0144                                       
13     52             8       .0225                                       
14     60             8      .04                                          
15     68             12      .0625                                       
16     80             12     .09                                          
17     92             16     .09                                          
18     108            20     .09                                          
19     128            26      .1225                                       
20     154            30      .1225                                       
21     184            38     .16                                          
22     222            50      .2025                                       
23     272            70     .25                                          
24     342            86                                                  
______________________________________                                    
______________________________________                                    
17 17                                                                     
     16 16   16 16   16 16 16 16 16 16 16 16 16 16                        
16 16                                                                     
     16 16   16 16   16 16 17 17 17 17 17 17 17 14                        
17 17                                                                     
     17 17   16 16   16 16 16 16 16 16 16 16 16 16                        
16 16                                                                     
     16 16   16 16   16 16 17 16 17 17 17 17 17 14                        
18 17                                                                     
     17 17   17 16   16 16 16 16 16 16 16 16 16 16                        
16 16                                                                     
     16 16   16 16   16 16 17 17 17 17 17 17 17 14                        
18 17                                                                     
     17 17   17 17   17 16 17 16 16 16 16 16 16 16                        
16 16                                                                     
     16 16   16 16   16 16 16 17 17 17 17 17 17 13                        
18 18                                                                     
     17 17   17 17   17 17 17 17 16 17 17 16 17 16                        
17 17                                                                     
     17 16   16 16   17 17 17 17 17 17 17 17 17 14                        
18 18                                                                     
     17 17   17 17   17 17 17 17 17 17 17 17 17 17                        
17 17                                                                     
     17 17   17 17   17 17 17 17 17 17 17 17 18 14                        
18 18                                                                     
     17 17   17 17   17 17 17 17 17 17 17 17 17 17                        
17 17                                                                     
     17 17   17 17   17 17 17 17 17 17 17 17 17 14                        
18 18                                                                     
     18 18   18 17   17 17 17 17 17 17 17 17 17 17                        
17 17                                                                     
     17 17   17 17   17 17 17 17 17 17 17 17 17 14                        
19 18                                                                     
     18 18   18 18   18 17 17 18 17 17 17 17 17 17                        
17 17                                                                     
     17 17   17 17   17 17 17 17 17 17 17 17 18 13                        
19 19                                                                     
     18 18   18 18   18 18 18 17 17 18 17 17 17 17                        
17 17                                                                     
     17 17   17 17   17 17 17 17 17 17 17 17 18 14                        
15 15                                                                     
     15 14   14 14   14 14 14 14 14 14 14 14 14 14                        
14 14                                                                     
     14 14   14 14   14 14 14 14 14 13 14 14 14 8                         
______________________________________                                    

Claims (20)

We claim:
1. A method of processing an ordered time sequence of audio signals partitioned into contiguous blocks of samples, each such block having a discrete short-time spectrum, S(ωi), i=1,2, . . . , N, for each of said blocks, comprising
predicting, for each block .Iadd.of audio signals.Iaddend., an estimate of the values for each S(ωi) based on the values for S(ωi) for one or more prior blocks,
determining for each frequency, ωi, a randomness metric based on the predicted value for each S(ωi) and the actual value for S(ωi) for each block,
based on said randomness metrics, and the distribution of power with frequency in the block, determining the value of a tonality function as a function of frequency, and
based on said tonality function, estimating the noise masking threshold at each ωi for the block.
2. The method of claim 1 further comprising quantizing said S(ωi) based on said noise masking threshold at each respective ωi.
3. The method of claim 1 wherein said step of predicting comprises,
for each ωi, forming the difference between the value of S(ωi) for the corresponding ωi from the two preceding blocks, and
adding said difference to the value for S(ωi) from the immediately preceding block.
4. The method of claim 3, wherein said S(ωi) is represented in terms of .[.its.]. magnitude and phase, and wherein said difference and adding are effected separately for the magnitude and phase of S(ωi).
5. The method of claim 1, wherein said determining of said randomness metric is accomplished by calculating the euclidian distance between said estimate of S(ωi) and said actual value for S(ωi).
6. The method of claim 5, wherein said determining of said randomness metric further comprises normalizing said euclidian distance with respect to the sum of the magnitude of said actual magnitude for S(ωi) and the absolute value of said estimate of S(ωi).
7. The method of claim 1, wherein said estimating of the noise masking threshold at each ωi comprises
calculating an unspread threshold function, and
modifying said unspread threshold function in accordance with a spreading function to generate a spread threshold function.
8. The method of claim 7, wherein said estimating of the noise masking threshold function further comprises modifying said spread threshold function in response to an absolute noise masking threshold for each ωi to form a limited spread threshold function.
9. The method of claim 8, further comprising modifying said limited threshold function to eliminate any existing pre-echoes, thereby generating an output threshold function value for each ωi.
10. The method of any of claims 1, 7, 8 or 9, further comprising the steps of
generating an estimate of the number of bits necessary to encode S(ωi)
quantizing said S(ωi) to form quantized representations of said S(ωi) using said estimate of the number of bits, and
providing to a medium a coded representation of said quantized values and information about how said quantized values were derived.
11. A method for processing an ordered sequence of coded signals comprising
first code signals representing values of the frequency components of a block of values of an audio signal and
second code signals representing information about how said first .Iadd.code .Iaddend.signals were derived
to reproduce said audio signal with reduced perceptual error, said method comprising
using said second .Iadd.code .Iaddend.signals to determine quantizing levels for said audio signal which reflect a reduced level of perceptual distortion,
reconstructing quantized values for said frequency .[.content.]. .Iadd.components .Iaddend.of said audio signal in accordance with said quantizing levels, and
transforming said reconstructed quantized .[.spectrum.]. .Iadd.values .Iaddend.to recover an estimate of the audio signal.
12. The method of claim 11 wherein said reconstructing comprises using said second .Iadd.code .Iaddend.signals to effect scaling of said quantized values.
13. The method of claim 11 wherein said reconstructing comprises applying a global gain factor based on said second .Iadd.code .Iaddend.signals.
14. The method of claim 11 wherein said reconstructing comprises determining quantizer step size as a function of frequency component.
15. The method of claim 11 wherein said second .Iadd.code .Iaddend.signals include information about the degree of coarseness of quantization as a function of frequency component.
16. The method of claim 11 wherein said second .Iadd.code .Iaddend.signals include information about the number of values of said audio signal that occur in each block. .Iadd.
17. A method of processing an ordered time sequence of audio signals partitioned into a set of ordered blocks, each said block having a discrete frequency spectrum comprising a first set of frequency coefficients, the method comprising, for each said block, the steps of:
(a) grouping said first set of frequency coefficients into a plurality of frequency groups, each of said frequency groups comprising at least one frequency coefficient;
(b) determining for frequency coefficients in each of said frequency groups a randomness metric, said randomness metrics reflecting the predictability of said frequency coefficients;
(c) based on said randomness metrics, determining the value of a tonality function signal as a function of frequency; and
(d) based on said tonality function signal, estimating a noise masking threshold for frequency coefficients in each frequency group..Iaddend..Iadd.18. The method of claim 17 further comprising at least one quantizing frequency coefficient in said first set of frequency coefficients based on said noise masking threshold for each frequency coefficient being quantized..Iaddend..Iadd.19. The method of claim 18 wherein said step of quantizing comprises assigning quantizing levels for each of said frequency coefficients in each of said frequency groups such that noise contributed by said quantizing falls below said noise masking threshold for the respective frequency group..Iaddend..Iadd.20. A method of processing an ordered time sequence of audio signals partitioned into a set of ordered blocks, each said block having a discrete frequency spectrum comprising a first set of frequency coefficients, the method comprising, for each said block, the steps of
(a) grouping said first set of frequency coefficients into a plurality of frequency groups, each of said frequency groups comprising at least one frequency coefficient; and
(b) generating a set of tonality index signals, said set of tonality index signals comprising a tonality index signal for each of said frequency groups, said set of tonality index signals being based on at least one of said first set of frequency coefficients corresponding to at least one
previous block..Iaddend..Iadd.21. The method of claim 20 further comprising generating, based on the set of tonality index signals, a set of respective noise masking thresholds..Iaddend..Iadd.22. The method of claim 21 further comprising quantizing at least one frequency coefficient in said first set of frequency coefficients based on said noise masking threshold for the band comprising the frequency coefficient being quantized..Iaddend..Iadd.23. The method of claim 22 wherein said step of quantizing comprises assigning quantizing levels for each of said frequency coefficients in each of said frequency groups such that noise contributed by said quantizing falls below said noise masking threshold for each respective frequency coefficient..Iaddend..Iadd.24. A storage medium adapted for use with a decoder, the storage medium manufactured in accordance with a process comprising the steps of
(a) processing an ordered time sequence of audio signals partitioned into a set of ordered blocks, each said block having a discrete frequency spectrum comprising a first set of frequency coefficients; and
(b) for each block:
(1) grouping said first set of frequency coefficients into a plurality of frequency groups, each of said frequency groups comprising at least one frequency coefficient;
(2) determining for each of said frequency coefficients in said frequency groups a randomness metric, said randomness metrics reflecting the predictability of said frequency coefficients;
(3) based on said randomness metrics, determining the value of a tonality function as a function of frequency;
(4) based on said tonality function, estimating a noise masking threshold for each frequency group;
(5) quantizing each of said frequency coefficients such that noise contributed by said quantizing falls below said noise masking threshold for the frequency group comprising the frequency coefficient being quantized;
(6) applying a recording signal to said storage medium, thereby causing said storage medium to store said recording signal, said recording signal comprising signals representing
(i) said quantized frequency coefficients; and
(ii) side information for controlling said decoder in reconstructing said audio signal from said recording signal upon retrieval of said recording signal from said storage medium, said side information comprising quantizing information relating to said quantizing of frequency
coefficients..Iaddend..Iadd.25. The method of claim 24 wherein said storage medium is a compact disc..Iaddend..Iadd.26. The method of claim 24 wherein said storage medium is a magnetic storage means..Iaddend..Iadd.27. A method of transmitting audio signals, the method comprising:
(a) processing an ordered time sequence of audio signals partitioned into a set of ordered blocks, each said block having a discrete frequency spectrum comprising a first set of frequency coefficients; and
(b) for each block:
(1) grouping said first set of frequency coefficients into a plurality of frequency groups, each of said frequency groups comprising at least one frequency coefficient;
(2) determining for each of said frequency coefficients in said frequency groups a randomness metric, said randomness metrics reflecting the predictability of said frequency coefficients;
(3) based on said randomness metrics, determining the value of a tonality function as a unction of frequency;
(4) based on said tonality function, estimating a noise masking threshold for each frequency group;
(5) quantizing each of said frequency coefficients such that noise contributed by said quantizing falls below said noise masking threshold for the frequency group comprising the frequency coefficient being quantized;
(6) applying a transmission signal to a transmission medium, said transmission signal comprising signals representing said quantized
frequency coefficients..Iaddend..Iadd.28. The method of claim 27 wherein said transmission medium is a broadcast transmission medium..Iaddend..Iadd.29. The method of claim 27 wherein said transmission medium is an electrical conducting medium..Iaddend..Iadd.30. The method of claim 27 wherein said transmission medium is an optical transmission medium..Iaddend..Iadd.31. The method of any of claims 17, 20, or 27 wherein said processing further comprises generating discrete frequency spectrum signals..Iaddend..Iadd.32. The method of claim 31 wherein said generating of discrete frequency spectrum signals comprises generating discrete Fourier coefficient signals..Iaddend.
US08/622,313 1989-10-18 1994-11-10 Perceptual coding of audio signals Expired - Lifetime USRE36714E (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US08/622,313 USRE36714E (en) 1989-10-18 1994-11-10 Perceptual coding of audio signals

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
US07/423,088 US5040217A (en) 1989-10-18 1989-10-18 Perceptual coding of audio signals
US10649993A 1993-08-13 1993-08-13
US08/622,313 USRE36714E (en) 1989-10-18 1994-11-10 Perceptual coding of audio signals

Related Parent Applications (2)

Application Number Title Priority Date Filing Date
US07/423,088 Reissue US5040217A (en) 1989-10-18 1989-10-18 Perceptual coding of audio signals
US10649993A Continuation 1989-10-18 1993-08-13

Publications (1)

Publication Number Publication Date
USRE36714E true USRE36714E (en) 2000-05-23

Family

ID=23677639

Family Applications (2)

Application Number Title Priority Date Filing Date
US07/423,088 Ceased US5040217A (en) 1989-10-18 1989-10-18 Perceptual coding of audio signals
US08/622,313 Expired - Lifetime USRE36714E (en) 1989-10-18 1994-11-10 Perceptual coding of audio signals

Family Applications Before (1)

Application Number Title Priority Date Filing Date
US07/423,088 Ceased US5040217A (en) 1989-10-18 1989-10-18 Perceptual coding of audio signals

Country Status (7)

Country Link
US (2) US5040217A (en)
EP (1) EP0424016B1 (en)
JP (1) JP2756515B2 (en)
KR (1) KR100209870B1 (en)
CA (1) CA2027136C (en)
DE (1) DE69028675T2 (en)
HK (1) HK220296A (en)

Cited By (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6424939B1 (en) * 1997-07-14 2002-07-23 Fraunhofer-Gesellschaft Zur Forderung Der Angewandten Forschung E.V. Method for coding an audio signal
US6654716B2 (en) * 2000-10-20 2003-11-25 Telefonaktiebolaget Lm Ericsson Perceptually improved enhancement of encoded acoustic signals
US6766293B1 (en) * 1997-07-14 2004-07-20 Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V. Method for signalling a noise substitution during audio signal coding
US20040267522A1 (en) * 2001-07-16 2004-12-30 Eric Allamanche Method and device for characterising a signal and for producing an indexed signal
US6915264B2 (en) 2001-02-22 2005-07-05 Lucent Technologies Inc. Cochlear filter bank structure for determining masked thresholds for use in perceptual audio coding
US20050289066A1 (en) * 2000-08-11 2005-12-29 Microsoft Corporation Audio fingerprinting
USRE39080E1 (en) 1988-12-30 2006-04-25 Lucent Technologies Inc. Rate loop processor for perceptual encoder/decoder
US20070140499A1 (en) * 2004-03-01 2007-06-21 Dolby Laboratories Licensing Corporation Multichannel audio coding
US7333930B2 (en) 2003-03-14 2008-02-19 Agere Systems Inc. Tonal analysis for perceptual audio coding using a compressed spectral representation
USRE40280E1 (en) 1988-12-30 2008-04-29 Lucent Technologies Inc. Rate loop processor for perceptual encoder/decoder
US20080195654A1 (en) * 2001-08-20 2008-08-14 Microsoft Corporation System and methods for providing adaptive media property classification
US20090264960A1 (en) * 2007-07-13 2009-10-22 Advanced Bionics, Llc Tonality-Based Optimization of Sound Sensation for a Cochlear Implant Patient
US20100042406A1 (en) * 2002-03-04 2010-02-18 James David Johnston Audio signal processing using improved perceptual model
US20100272285A1 (en) * 2009-04-22 2010-10-28 General Electric Company Masking of pure tones within sound from a noise generating source

Families Citing this family (135)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5341457A (en) * 1988-12-30 1994-08-23 At&T Bell Laboratories Perceptual coding of audio signals
US5434948A (en) * 1989-06-15 1995-07-18 British Telecommunications Public Limited Company Polyphonic coding
US5115240A (en) * 1989-09-26 1992-05-19 Sony Corporation Method and apparatus for encoding voice signals divided into a plurality of frequency bands
JP2969862B2 (en) * 1989-10-04 1999-11-02 松下電器産業株式会社 Voice recognition device
JPH03139700A (en) * 1989-10-25 1991-06-13 Sony Corp Audio signal reproducing device
US6695477B1 (en) * 1989-10-25 2004-02-24 Sony Corporation Audio signal reproducing apparatus
US5388181A (en) * 1990-05-29 1995-02-07 Anderson; David J. Digital audio compression system
DE4020656A1 (en) * 1990-06-29 1992-01-02 Thomson Brandt Gmbh METHOD FOR TRANSMITTING A SIGNAL
US5317672A (en) * 1991-03-05 1994-05-31 Picturetel Corporation Variable bit rate speech encoder
CA2105387A1 (en) * 1991-03-05 1992-09-06 Antony H. Crossman Variable bit rate speech encoder
KR100268623B1 (en) * 1991-06-28 2000-10-16 이데이 노부유끼 Compressed data recording and/or reproducing apparatus and signal processing method
US5388209A (en) * 1991-08-02 1995-02-07 Sony Corporation Apparatus for high-speed recording compressed digital data with increased compression
DE4212339A1 (en) * 1991-08-12 1993-02-18 Standard Elektrik Lorenz Ag CODING PROCESS FOR AUDIO SIGNALS WITH 32 KBIT / S
EP0786874B1 (en) * 1991-09-30 2000-08-16 Sony Corporation Method and apparatus for audio data compression
JP3310682B2 (en) * 1992-01-21 2002-08-05 日本ビクター株式会社 Audio signal encoding method and reproduction method
US5285498A (en) * 1992-03-02 1994-02-08 At&T Bell Laboratories Method and apparatus for coding audio signals based on perceptual model
JP3446216B2 (en) * 1992-03-06 2003-09-16 ソニー株式会社 Audio signal processing method
US5495552A (en) * 1992-04-20 1996-02-27 Mitsubishi Denki Kabushiki Kaisha Methods of efficiently recording an audio signal in semiconductor memory
JP3278900B2 (en) * 1992-05-07 2002-04-30 ソニー株式会社 Data encoding apparatus and method
JP3153933B2 (en) * 1992-06-16 2001-04-09 ソニー株式会社 Data encoding device and method and data decoding device and method
JP3508146B2 (en) * 1992-09-11 2004-03-22 ソニー株式会社 Digital signal encoding / decoding device, digital signal encoding device, and digital signal decoding device
JP3185413B2 (en) * 1992-11-25 2001-07-09 ソニー株式会社 Orthogonal transform operation and inverse orthogonal transform operation method and apparatus, digital signal encoding and / or decoding apparatus
JP3123286B2 (en) * 1993-02-18 2001-01-09 ソニー株式会社 Digital signal processing device or method, and recording medium
JP3186292B2 (en) * 1993-02-02 2001-07-11 ソニー株式会社 High efficiency coding method and apparatus
US5579404A (en) * 1993-02-16 1996-11-26 Dolby Laboratories Licensing Corporation Digital audio limiter
JP3186307B2 (en) * 1993-03-09 2001-07-11 ソニー株式会社 Compressed data recording apparatus and method
JP3123290B2 (en) * 1993-03-09 2001-01-09 ソニー株式会社 Compressed data recording device and method, compressed data reproducing method, recording medium
JP3173218B2 (en) * 1993-05-10 2001-06-04 ソニー株式会社 Compressed data recording method and apparatus, compressed data reproducing method, and recording medium
US5581654A (en) * 1993-05-25 1996-12-03 Sony Corporation Method and apparatus for information encoding and decoding
KR100458969B1 (en) * 1993-05-31 2005-04-06 소니 가부시끼 가이샤 Signal encoding or decoding apparatus, and signal encoding or decoding method
EP0663739B1 (en) * 1993-06-30 2001-08-22 Sony Corporation Digital signal encoding device, its decoding device, and its recording medium
US5664057A (en) * 1993-07-07 1997-09-02 Picturetel Corporation Fixed bit rate speech encoder/decoder
TW272341B (en) * 1993-07-16 1996-03-11 Sony Co Ltd
TW327223B (en) * 1993-09-28 1998-02-21 Sony Co Ltd Methods and apparatus for encoding an input signal broken into frequency components, methods and apparatus for decoding such encoded signal
DE69428435T2 (en) * 1993-11-04 2002-07-11 Sony Corp SIGNAL ENCODERS, SIGNAL DECODERS, RECORD CARRIERS AND SIGNAL ENCODER METHODS
WO1995013660A1 (en) * 1993-11-09 1995-05-18 Sony Corporation Quantization apparatus, quantization method, high efficiency encoder, high efficiency encoding method, decoder, high efficiency encoder and recording media
US5488665A (en) * 1993-11-23 1996-01-30 At&T Corp. Multi-channel perceptual audio compression system with encoding mode switching among matrixed channels
US5608713A (en) * 1994-02-09 1997-03-04 Sony Corporation Bit allocation of digital audio signal blocks by non-linear processing
JPH07261797A (en) * 1994-03-18 1995-10-13 Mitsubishi Electric Corp Signal encoding device and signal decoding device
JP3186412B2 (en) * 1994-04-01 2001-07-11 ソニー株式会社 Information encoding method, information decoding method, and information transmission method
CN1103141C (en) * 1994-04-01 2003-03-12 索尼公司 Method and device for encoding information, method and device for decoding information, information transmitting method, and information recording medium
JP3277677B2 (en) * 1994-04-01 2002-04-22 ソニー株式会社 Signal encoding method and apparatus, signal recording medium, signal transmission method, and signal decoding method and apparatus
JPH07322252A (en) * 1994-05-23 1995-12-08 Canon Inc Image coder
JP3250376B2 (en) * 1994-06-13 2002-01-28 ソニー株式会社 Information encoding method and apparatus, and information decoding method and apparatus
JP3277699B2 (en) * 1994-06-13 2002-04-22 ソニー株式会社 Signal encoding method and apparatus, and signal decoding method and apparatus
JP3277705B2 (en) 1994-07-27 2002-04-22 ソニー株式会社 Information encoding apparatus and method, and information decoding apparatus and method
JP3341474B2 (en) * 1994-07-28 2002-11-05 ソニー株式会社 Information encoding method and decoding method, information encoding device and decoding device, and information recording medium
US5625743A (en) * 1994-10-07 1997-04-29 Motorola, Inc. Determining a masking level for a subband in a subband audio encoder
ATE211869T1 (en) * 1994-10-28 2002-01-15 Rai Radiotelevisione Italiana SUB-BAND CODING WITH TONE-BASED PREDICTION CODING IN EACH SINGLE SUB-BAND
US5654952A (en) * 1994-10-28 1997-08-05 Sony Corporation Digital signal encoding method and apparatus and recording medium
KR970011727B1 (en) * 1994-11-09 1997-07-14 Daewoo Electronics Co Ltd Apparatus for encoding of the audio signal
JP3557674B2 (en) * 1994-12-15 2004-08-25 ソニー株式会社 High efficiency coding method and apparatus
JP3371590B2 (en) * 1994-12-28 2003-01-27 ソニー株式会社 High efficiency coding method and high efficiency decoding method
US5646961A (en) * 1994-12-30 1997-07-08 Lucent Technologies Inc. Method for noise weighting filtering
EP0720316B1 (en) * 1994-12-30 1999-12-08 Daewoo Electronics Co., Ltd Adaptive digital audio encoding apparatus and a bit allocation method thereof
KR970003559Y1 (en) * 1994-12-30 1997-04-18 기아자동차 주식회사 Instrument core being capable of resisting heat deformations
US5682463A (en) * 1995-02-06 1997-10-28 Lucent Technologies Inc. Perceptual audio compression based on loudness uncertainty
US5699479A (en) * 1995-02-06 1997-12-16 Lucent Technologies Inc. Tonality for perceptual audio compression based on loudness uncertainty
FR2730594B1 (en) * 1995-02-09 1997-03-21 France Telecom VECTOR QUANTIFICATION METHOD ON A CONSTRAINED FLOW NETWORK
KR100346734B1 (en) * 1995-09-22 2002-11-23 삼성전자 주식회사 Audio coder and decoder having high speed analyzing filter and composite filter
JPH1084284A (en) * 1996-09-06 1998-03-31 Sony Corp Signal reproducing method and device
JP3496411B2 (en) * 1996-10-30 2004-02-09 ソニー株式会社 Information encoding method and decoding device
US6147010A (en) * 1996-11-14 2000-11-14 Micron Technology, Inc. Solvent prewet and method to dispense the solvent prewet
US6782365B1 (en) 1996-12-20 2004-08-24 Qwest Communications International Inc. Graphic interface system and product for editing encoded audio data
US5845251A (en) * 1996-12-20 1998-12-01 U S West, Inc. Method, system and product for modifying the bandwidth of subband encoded audio data
US6516299B1 (en) 1996-12-20 2003-02-04 Qwest Communication International, Inc. Method, system and product for modifying the dynamic range of encoded audio signals
US5864820A (en) * 1996-12-20 1999-01-26 U S West, Inc. Method, system and product for mixing of encoded audio signals
US5864813A (en) * 1996-12-20 1999-01-26 U S West, Inc. Method, system and product for harmonic enhancement of encoded audio signals
US6463405B1 (en) 1996-12-20 2002-10-08 Eliot M. Case Audiophile encoding of digital audio data using 2-bit polarity/magnitude indicator and 8-bit scale factor for each subband
US6477496B1 (en) 1996-12-20 2002-11-05 Eliot M. Case Signal synthesis by decoding subband scale factors from one audio signal and subband samples from different one
SE512719C2 (en) * 1997-06-10 2000-05-02 Lars Gustaf Liljeryd A method and apparatus for reducing data flow based on harmonic bandwidth expansion
US6266419B1 (en) * 1997-07-03 2001-07-24 At&T Corp. Custom character-coding compression for encoding and watermarking media content
US6111844A (en) * 1997-07-03 2000-08-29 At&T Corp. Quality degradation through compression/decompression
DE19840853B4 (en) * 1997-10-24 2004-12-09 Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. Methods and devices for encoding an audio signal
US6091773A (en) * 1997-11-12 2000-07-18 Sydorenko; Mark R. Data compression method and apparatus
US6243424B1 (en) 1998-03-27 2001-06-05 Ibiguity Digital Corporation Method and apparatus for AM digital broadcasting
US20060265091A1 (en) * 1998-08-14 2006-11-23 Bruce Mihura Audio entertainment system for storing and playing audio information
US6704705B1 (en) 1998-09-04 2004-03-09 Nortel Networks Limited Perceptual audio coding
US6122610A (en) * 1998-09-23 2000-09-19 Verance Corporation Noise suppression for low bitrate speech coder
JP2000165251A (en) * 1998-11-27 2000-06-16 Matsushita Electric Ind Co Ltd Audio signal coding device and microphone realizing the same
US6418404B1 (en) 1998-12-28 2002-07-09 Sony Corporation System and method for effectively implementing fixed masking thresholds in an audio encoder device
SE9903553D0 (en) 1999-01-27 1999-10-01 Lars Liljeryd Enhancing conceptual performance of SBR and related coding methods by adaptive noise addition (ANA) and noise substitution limiting (NSL)
US6480820B1 (en) 1999-09-20 2002-11-12 Advanced Cochlear Systems, Inc. Method of processing auditory data
DE19947877C2 (en) * 1999-10-05 2001-09-13 Fraunhofer Ges Forschung Method and device for introducing information into a data stream and method and device for encoding an audio signal
US7215776B1 (en) 1999-11-09 2007-05-08 University Of New Hampshire Method and apparatus for the compression and decompression of audio files using a chaotic system
US7286670B2 (en) * 1999-11-09 2007-10-23 Chaoticom, Inc. Method and apparatus for chaotic opportunistic lossless compression of data
US7215772B2 (en) * 1999-11-09 2007-05-08 Chaoticom, Inc. Method and apparatus for remote digital key generation
US6549544B1 (en) * 1999-11-10 2003-04-15 Ibiquity Digital Corporation Method and apparatus for transmission and reception of FM in-band on-channel digital audio broadcasting
US6523147B1 (en) 1999-11-11 2003-02-18 Ibiquity Digital Corporation Method and apparatus for forward error correction coding for an AM in-band on-channel digital audio broadcasting system
US6499010B1 (en) 2000-01-04 2002-12-24 Agere Systems Inc. Perceptual audio coder bit allocation scheme providing improved perceptual quality consistency
SE0001926D0 (en) 2000-05-23 2000-05-23 Lars Liljeryd Improved spectral translation / folding in the subband domain
US7110547B2 (en) * 2000-06-20 2006-09-19 University Of New Hampshire Method and apparatus for the compression and decompression of image files using a chaotic system
CA2414093A1 (en) * 2000-06-20 2001-12-27 University Of New Hampshire Method and apparatus for the compression and decompression of audio files using a chaotic system
US6732180B1 (en) 2000-08-08 2004-05-04 The University Of Tulsa Method to inhibit the identification and retrieval of proprietary media via automated search engines utilized in association with computer compatible communications network
US7447639B2 (en) 2001-01-24 2008-11-04 Nokia Corporation System and method for error concealment in digital audio transmission
US7069208B2 (en) * 2001-01-24 2006-06-27 Nokia, Corp. System and method for concealment of data loss in digital audio transmission
WO2003036621A1 (en) * 2001-10-22 2003-05-01 Motorola, Inc., A Corporation Of The State Of Delaware Method and apparatus for enhancing loudness of an audio signal
US7240001B2 (en) 2001-12-14 2007-07-03 Microsoft Corporation Quality improvement techniques in an audio encoder
GB2388502A (en) * 2002-05-10 2003-11-12 Chris Dunn Compression of frequency domain audio signals
US20040165734A1 (en) * 2003-03-20 2004-08-26 Bing Li Audio system for a vehicle
US6813661B2 (en) 2003-03-20 2004-11-02 Bing Li Portable audio system
US7724827B2 (en) * 2003-09-07 2010-05-25 Microsoft Corporation Multi-layer run level encoding and decoding
US7447317B2 (en) 2003-10-02 2008-11-04 Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V Compatible multi-channel coding/decoding by weighting the downmix channel
US7460990B2 (en) 2004-01-23 2008-12-02 Microsoft Corporation Efficient coding of digital media spectral data using wide-sense perceptual similarity
US20050172154A1 (en) * 2004-01-29 2005-08-04 Chaoticom, Inc. Systems and methods for providing digital content and caller alerts to wireless network-enabled devices
US7539870B2 (en) * 2004-02-10 2009-05-26 Microsoft Corporation Media watermarking by biasing randomized statistics
US7505902B2 (en) * 2004-07-28 2009-03-17 University Of Maryland Discrimination of components of audio signals based on multiscale spectro-temporal modulations
US7676362B2 (en) * 2004-12-31 2010-03-09 Motorola, Inc. Method and apparatus for enhancing loudness of a speech signal
US8280730B2 (en) 2005-05-25 2012-10-02 Motorola Mobility Llc Method and apparatus of increasing speech intelligibility in noisy environments
JP4639966B2 (en) * 2005-05-31 2011-02-23 ヤマハ株式会社 Audio data compression method, audio data compression circuit, and audio data expansion circuit
KR100718132B1 (en) * 2005-06-24 2007-05-14 삼성전자주식회사 Method and apparatus for generating bitstream of audio signal, audio encoding/decoding method and apparatus thereof
US7630882B2 (en) * 2005-07-15 2009-12-08 Microsoft Corporation Frequency segmentation to obtain bands for efficient coding of digital media
US7562021B2 (en) * 2005-07-15 2009-07-14 Microsoft Corporation Modification of codewords in dictionary used for efficient coding of digital media spectral data
US8599925B2 (en) * 2005-08-12 2013-12-03 Microsoft Corporation Efficient coding and decoding of transform blocks
EP1943642A4 (en) * 2005-09-27 2009-07-01 Lg Electronics Inc Method and apparatus for encoding/decoding multi-channel audio signal
CN101427307B (en) * 2005-09-27 2012-03-07 Lg电子株式会社 Method and apparatus for encoding/decoding multi-channel audio signal
ES2296489B1 (en) * 2005-12-02 2009-04-01 Cesar Alonso Abad SCALABLE METHOD OF AUDIO AND IMAGE COMPRESSION.
KR101355376B1 (en) * 2007-04-30 2014-01-23 삼성전자주식회사 Method and apparatus for encoding and decoding high frequency band
KR101411900B1 (en) * 2007-05-08 2014-06-26 삼성전자주식회사 Method and apparatus for encoding and decoding audio signal
US7774205B2 (en) * 2007-06-15 2010-08-10 Microsoft Corporation Coding of sparse digital media spectral data
US7761290B2 (en) 2007-06-15 2010-07-20 Microsoft Corporation Flexible frequency and time partitioning in perceptual transform coding of audio
EP2162880B1 (en) * 2007-06-22 2014-12-24 VoiceAge Corporation Method and device for estimating the tonality of a sound signal
US8046214B2 (en) * 2007-06-22 2011-10-25 Microsoft Corporation Low complexity decoder for complex transform coding of multi-channel sound
US7885819B2 (en) 2007-06-29 2011-02-08 Microsoft Corporation Bitstream syntax for multi-process audio decoding
US8249883B2 (en) 2007-10-26 2012-08-21 Microsoft Corporation Channel extension coding for multi-channel source
KR101454867B1 (en) 2008-03-24 2014-10-28 삼성전자주식회사 Method and apparatus for audio signal compression
KR101619972B1 (en) 2008-10-02 2016-05-11 한국전자통신연구원 Apparatus and method for coding/decoding image selectivly using descrete cosine/sine transtorm
US20100324915A1 (en) * 2009-06-23 2010-12-23 Electronic And Telecommunications Research Institute Encoding and decoding apparatuses for high quality multi-channel audio codec
US20110257978A1 (en) * 2009-10-23 2011-10-20 Brainlike, Inc. Time Series Filtering, Data Reduction and Voice Recognition in Communication Device
US8925024B2 (en) 2009-12-31 2014-12-30 The Nielsen Company (Us), Llc Methods and apparatus to detect commercial advertisements associated with media presentations
JP5732994B2 (en) * 2011-04-19 2015-06-10 ソニー株式会社 Music searching apparatus and method, program, and recording medium
EP2717263B1 (en) * 2012-10-05 2016-11-02 Nokia Technologies Oy Method, apparatus, and computer program product for categorical spatial analysis-synthesis on the spectrum of a multichannel audio signal
ES2834929T3 (en) * 2013-01-29 2021-06-21 Fraunhofer Ges Forschung Filled with noise in perceptual transform audio coding
US9848222B2 (en) 2015-07-15 2017-12-19 The Nielsen Company (Us), Llc Methods and apparatus to detect spillover
US10043527B1 (en) 2015-07-17 2018-08-07 Digimarc Corporation Human auditory system modeling with masking energy adaptation

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US28276A (en) * 1860-05-15 Bedstead-fastening
US28488A (en) * 1860-05-29 Eataet-machiite
US3420742A (en) * 1964-10-16 1969-01-07 Dairy Technics Inc Milk fermenting product and method of making same
USRE28276E (en) 1963-06-06 1974-12-17 Milk fermenting product and method of making same
USRE28488E (en) 1973-11-19 1975-07-22 Milk fermenting product
US4972484A (en) * 1986-11-21 1990-11-20 Bayerische Rundfunkwerbung Gmbh Method of transmitting or storing masked sub-band coded audio signals
US5285498A (en) * 1992-03-02 1994-02-08 At&T Bell Laboratories Method and apparatus for coding audio signals based on perceptual model
US5535300A (en) * 1988-12-30 1996-07-09 At&T Corp. Perceptual coding of audio signals using entropy coding and/or multiple power spectra

Family Cites Families (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS59129900A (en) * 1983-01-18 1984-07-26 日本電信電話株式会社 Band division coding system
JPS6027459A (en) * 1983-07-22 1985-02-12 Sumitomo Metal Ind Ltd Device for preventing corrosion of current-conducting roll and billet
JPS60159800A (en) * 1984-01-30 1985-08-21 日本電気株式会社 Adaptive forecast transform encoding system
CA1229681A (en) * 1984-03-06 1987-11-24 Kazunori Ozawa Method and apparatus for speech-band signal coding
JPH0833746B2 (en) * 1987-02-17 1996-03-29 シャープ株式会社 Band division coding device for voice and musical sound
JPH032559Y2 (en) * 1987-03-11 1991-01-23
JPS63237100A (en) * 1987-03-26 1988-10-03 沖電気工業株式会社 Voice detector
JPS63281200A (en) * 1987-05-14 1988-11-17 沖電気工業株式会社 Voice section detecting system
JP2586043B2 (en) * 1987-05-14 1997-02-26 日本電気株式会社 Multi-pulse encoder
JPS6446880A (en) * 1987-08-17 1989-02-21 Fuji Xerox Co Ltd Image processor

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US28276A (en) * 1860-05-15 Bedstead-fastening
US28488A (en) * 1860-05-29 Eataet-machiite
USRE28276E (en) 1963-06-06 1974-12-17 Milk fermenting product and method of making same
US3420742A (en) * 1964-10-16 1969-01-07 Dairy Technics Inc Milk fermenting product and method of making same
USRE28488E (en) 1973-11-19 1975-07-22 Milk fermenting product
US4972484A (en) * 1986-11-21 1990-11-20 Bayerische Rundfunkwerbung Gmbh Method of transmitting or storing masked sub-band coded 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
US5285498A (en) * 1992-03-02 1994-02-08 At&T Bell Laboratories Method and apparatus for coding audio signals based on perceptual model

Non-Patent Citations (16)

* Cited by examiner, † Cited by third party
Title
"Critical Bands", Foundations of Modern Auditory Theory, J. V. Tobias, Chapter 5, B. Scharf, Academic Press, New York, 1970.
"Digital audio tape for data storage", IEEE Spectrum, Oct. 1989, pp. 34-38, E. Tan and B. Vermeulen.
"MSC: Stereo Audio Coding With CD-Quality and 256 kBIT/SEC", IEEE Transactions on Consumer Electronics, vol. CE-33, No. 4, Nov. 1987, pp. 512-519, E. F. Schroeder and H. J. Platte.
"Optimizing digital speech coders by exploiting masking properties of the human ear", Journal of Acoustical Society of America, vol. 66 (6), Dec., 1979, pp. 1647-1652, M.R. Schroeder et al.
"Sub-band Transform Coding Using Filter Bank Designs Based on Time Domain Aliasing Cancellation," IEEE ICASSP, 1987, J. Princen et al., pp. 2161-2164.
"Transform Coding of Audio Signals Using Perceptual Noise Criteria", IEEE Journal On Selected Areas In Communications, vol. 6, No. 2, Feb. 1988, pp. 314-323, J. D. Johnston.
Critical Bands , Foundations of Modern Auditory Theory , J. V. Tobias, Chapter 5, B. Scharf, Academic Press, New York, 1970. *
Digital audio tape for data storage , IEEE Spectrum , Oct. 1989, pp. 34 38, E. Tan and B. Vermeulen. *
FX/FORTRAN Programmer s Handbook , Alliant Computer Systems Corp., Jul. 1988. *
FX/FORTRAN Programmer's Handbook, Alliant Computer Systems Corp., Jul. 1988.
MSC: Stereo Audio Coding With CD Quality and 256 kBIT/SEC , IEEE Transactions on Consumer Electronics , vol. CE 33, No. 4, Nov. 1987, pp. 512 519, E. F. Schroeder and H. J. Platte. *
N. S. Jayant and P. Noll, Digital Coding of Waveforms Principles and Applications to Speech and Video, Chapter 12, Transform Coding , 1987. *
N. S. Jayant and P. Noll, Digital Coding of Waveforms--Principles and Applications to Speech and Video, Chapter 12, "Transform Coding", 1987.
Optimizing digital speech coders by exploiting masking properties of the human ear , Journal of Acoustical Society of America, vol. 66 (6), Dec., 1979, pp. 1647 1652, M.R. Schroeder et al. *
Sub band Transform Coding Using Filter Bank Designs Based on Time Domain Aliasing Cancellation, IEEE ICASSP , 1987, J. Princen et al., pp. 2161 2164. *
Transform Coding of Audio Signals Using Perceptual Noise Criteria , IEEE Journal On Selected Areas In Communications , vol. 6, No. 2, Feb. 1988, pp. 314 323, J. D. Johnston. *

Cited By (44)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
USRE40280E1 (en) 1988-12-30 2008-04-29 Lucent Technologies Inc. Rate loop processor for perceptual encoder/decoder
USRE39080E1 (en) 1988-12-30 2006-04-25 Lucent Technologies Inc. Rate loop processor for perceptual encoder/decoder
US6766293B1 (en) * 1997-07-14 2004-07-20 Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V. Method for signalling a noise substitution during audio signal coding
US6424939B1 (en) * 1997-07-14 2002-07-23 Fraunhofer-Gesellschaft Zur Forderung Der Angewandten Forschung E.V. Method for coding an audio signal
US7240207B2 (en) * 2000-08-11 2007-07-03 Microsoft Corporation Fingerprinting media entities employing fingerprint algorithms and bit-to-bit comparisons
US20050289066A1 (en) * 2000-08-11 2005-12-29 Microsoft Corporation Audio fingerprinting
US20050289065A1 (en) * 2000-08-11 2005-12-29 Microsoft Corporation Audio fingerprinting
US7080253B2 (en) * 2000-08-11 2006-07-18 Microsoft Corporation Audio fingerprinting
US6654716B2 (en) * 2000-10-20 2003-11-25 Telefonaktiebolaget Lm Ericsson Perceptually improved enhancement of encoded acoustic signals
US6915264B2 (en) 2001-02-22 2005-07-05 Lucent Technologies Inc. Cochlear filter bank structure for determining masked thresholds for use in perceptual audio coding
US7478045B2 (en) * 2001-07-16 2009-01-13 M2Any Gmbh Method and device for characterizing a signal and method and device for producing an indexed signal
US20040267522A1 (en) * 2001-07-16 2004-12-30 Eric Allamanche Method and device for characterising a signal and for producing an indexed signal
US8082279B2 (en) 2001-08-20 2011-12-20 Microsoft Corporation System and methods for providing adaptive media property classification
US20080195654A1 (en) * 2001-08-20 2008-08-14 Microsoft Corporation System and methods for providing adaptive media property classification
US20100042406A1 (en) * 2002-03-04 2010-02-18 James David Johnston Audio signal processing using improved perceptual model
US7333930B2 (en) 2003-03-14 2008-02-19 Agere Systems Inc. Tonal analysis for perceptual audio coding using a compressed spectral representation
US20080031463A1 (en) * 2004-03-01 2008-02-07 Davis Mark F Multichannel audio coding
US9454969B2 (en) 2004-03-01 2016-09-27 Dolby Laboratories Licensing Corporation Multichannel audio coding
US11308969B2 (en) 2004-03-01 2022-04-19 Dolby Laboratories Licensing Corporation Methods and apparatus for reconstructing audio signals with decorrelation and differentially coded parameters
EP1914722A1 (en) 2004-03-01 2008-04-23 Dolby Laboratories Licensing Corporation Multichannel audio decoding
EP2224430A2 (en) 2004-03-01 2010-09-01 Dolby Laboratories Licensing Corporation Multichannel audio decoding
US10796706B2 (en) 2004-03-01 2020-10-06 Dolby Laboratories Licensing Corporation Methods and apparatus for reconstructing audio signals with decorrelation and differentially coded parameters
US20070140499A1 (en) * 2004-03-01 2007-06-21 Dolby Laboratories Licensing Corporation Multichannel audio coding
US8170882B2 (en) 2004-03-01 2012-05-01 Dolby Laboratories Licensing Corporation Multichannel audio coding
US10460740B2 (en) 2004-03-01 2019-10-29 Dolby Laboratories Licensing Corporation Methods and apparatus for adjusting a level of an audio signal
US10403297B2 (en) 2004-03-01 2019-09-03 Dolby Laboratories Licensing Corporation Methods and apparatus for adjusting a level of an audio signal
US10269364B2 (en) 2004-03-01 2019-04-23 Dolby Laboratories Licensing Corporation Reconstructing audio signals with multiple decorrelation techniques
US8983834B2 (en) 2004-03-01 2015-03-17 Dolby Laboratories Licensing Corporation Multichannel audio coding
US9311922B2 (en) 2004-03-01 2016-04-12 Dolby Laboratories Licensing Corporation Method, apparatus, and storage medium for decoding encoded audio channels
EP2065885A1 (en) 2004-03-01 2009-06-03 Dolby Laboratories Licensing Corporation Multichannel audio decoding
US9520135B2 (en) 2004-03-01 2016-12-13 Dolby Laboratories Licensing Corporation Reconstructing audio signals with multiple decorrelation techniques
US9640188B2 (en) 2004-03-01 2017-05-02 Dolby Laboratories Licensing Corporation Reconstructing audio signals with multiple decorrelation techniques
US9672839B1 (en) 2004-03-01 2017-06-06 Dolby Laboratories Licensing Corporation Reconstructing audio signals with multiple decorrelation techniques and differentially coded parameters
US9691405B1 (en) 2004-03-01 2017-06-27 Dolby Laboratories Licensing Corporation Reconstructing audio signals with multiple decorrelation techniques and differentially coded parameters
US9691404B2 (en) 2004-03-01 2017-06-27 Dolby Laboratories Licensing Corporation Reconstructing audio signals with multiple decorrelation techniques
US9697842B1 (en) 2004-03-01 2017-07-04 Dolby Laboratories Licensing Corporation Reconstructing audio signals with multiple decorrelation techniques and differentially coded parameters
US9704499B1 (en) 2004-03-01 2017-07-11 Dolby Laboratories Licensing Corporation Reconstructing audio signals with multiple decorrelation techniques and differentially coded parameters
US9715882B2 (en) 2004-03-01 2017-07-25 Dolby Laboratories Licensing Corporation Reconstructing audio signals with multiple decorrelation techniques
US9779745B2 (en) 2004-03-01 2017-10-03 Dolby Laboratories Licensing Corporation Reconstructing audio signals with multiple decorrelation techniques and differentially coded parameters
US8914124B2 (en) 2007-07-13 2014-12-16 Advanced Bionics Ag Tonality-based optimization of sound sensation for a cochlear implant patient
US8412340B2 (en) * 2007-07-13 2013-04-02 Advanced Bionics, Llc Tonality-based optimization of sound sensation for a cochlear implant patient
US20090264960A1 (en) * 2007-07-13 2009-10-22 Advanced Bionics, Llc Tonality-Based Optimization of Sound Sensation for a Cochlear Implant Patient
US8223985B2 (en) 2009-04-22 2012-07-17 General Electric Company Masking of pure tones within sound from a noise generating source
US20100272285A1 (en) * 2009-04-22 2010-10-28 General Electric Company Masking of pure tones within sound from a noise generating source

Also Published As

Publication number Publication date
JP2756515B2 (en) 1998-05-25
DE69028675D1 (en) 1996-10-31
CA2027136A1 (en) 1991-04-19
US5040217A (en) 1991-08-13
JPH03144700A (en) 1991-06-20
KR910008975A (en) 1991-05-31
DE69028675T2 (en) 1997-02-13
HK220296A (en) 1997-01-03
KR100209870B1 (en) 1999-07-15
EP0424016A3 (en) 1992-09-02
CA2027136C (en) 2001-01-16
EP0424016B1 (en) 1996-09-25
EP0424016A2 (en) 1991-04-24

Similar Documents

Publication Publication Date Title
USRE36714E (en) Perceptual coding of audio signals
US5341457A (en) Perceptual coding of audio signals
USRE36683E (en) Apparatus and method for audio data compression and expansion with reduced block floating overhead
US5664056A (en) Digital encoder with dynamic quantization bit allocation
CA2140779C (en) Method, apparatus and recording medium for coding of separated tone and noise characteristics spectral components of an acoustic signal
US5357594A (en) Encoding and decoding using specially designed pairs of analysis and synthesis windows
KR100310214B1 (en) Signal encoding or decoding device and recording medium
JP3277692B2 (en) Information encoding method, information decoding method, and information recording medium
US5625746A (en) Method and apparatus for encoding, decoding and compression of audio-type data
US5774844A (en) Methods and apparatus for quantizing, encoding and decoding and recording media therefor
EP0545017A2 (en) Data compression method and apparatus in which quantizing bits are allocated to a block in a present frame in response to the block in a past frame
EP0717392B1 (en) Encoding method, decoding method, encoding-decoding method, encoder, decoder, and encoder-decoder
JPH08190764A (en) Method and device for processing digital signal and recording medium
JPH0830295A (en) Method and device for digital/audio signal recording and reproducing
JPS61112433A (en) Frequency region voice encoding method and device
PL207862B1 (en) Low bit-rate audio coding
US5754127A (en) Information encoding method and apparatus, and information decoding method and apparatus
EP0376553B1 (en) Perceptual coding of audio signals
JPH09134200A (en) Method and apparatus for digital audio coding
KR100556505B1 (en) Reproducing and recording apparatus, decoding apparatus, recording apparatus, reproducing and recording method, decoding method and recording method
JP3277699B2 (en) Signal encoding method and apparatus, and signal decoding method and apparatus
JP3353868B2 (en) Audio signal conversion encoding method and decoding method
US6647063B1 (en) Information encoding method and apparatus, information decoding method and apparatus and recording medium
JPH11330974A (en) Encoding method and device, decoding method and device, digital signal recording method and device, recording medium and digital transmitting method and device
JP3465698B2 (en) Signal decoding method and apparatus

Legal Events

Date Code Title Description
STCF Information on status: patent grant

Free format text: PATENTED CASE

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

FPAY Fee payment

Year of fee payment: 4

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

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: 8

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:033949/0531

Effective date: 20140819