Hybrid perceptual audio coding.
Abstract
A hybrid coding technique for high quality coding of audio signals, using a subband filtering technique further refined to achieve a large number of subbands. Noise masking thresholds for subbands are then determined using a new tonality measure applicable to individual frequency bands or single frequencies. Based on the thresholds so determined, input signals are coded to achieve high quality at reduced bit rates.

Term
Term ended
Projected expiry passed 6 March 2011, 15.6 years ago.
- Priority
- Filed
- Published
- Projected expiry
- Today
22 claims: 4 independent, 18 dependent
- 1A method of processing an ordered time sequence of audio signals partitioned into blocks of samples, said method comprising determining a discrete short-time spectrum, S(ω i ), i=1, 2,...,N, for each of said blocks, determining the value of a tonality function as a function of frequency, and based on said tonality function, estimating the noise masking threshold for each of ω i , CHARACTERIZED IN THAT said step of determining S(ω i ) comprises determining S(ω i ) with differing time and frequency resolution as a function of ω i ,
- 11The method of any of claims 1, 8, 9 or 10, further CHARACTERIZED IN THAT said method 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 describing about how said quantized values were derived.
- 12A method for decoding an ordered sequence of coded signals comprising first code signals representing values of the frequency components corresponding to a block of values of an audio signal and second code signals representing information about how said first signals were derived to represent said audio signal with reduced perceptual error, said method comprising using said second signals to determine quantizing levels for said audio signal which reflect a reduced level of perceptual distortion, reconstructing quantized values for said frequency content of said audio signal in accordance with said quantizing levels, and transforming said reconstructed quantized spectrum to recover an estimate of the audio signal, CHARACTERIZED IN THAT said frequency components have variable rime and frequency resolution.
- 18Apparatus for processing an ordered time sequence of audio signals partitioned into blocks of samples comprising, means for determining a discrete short-time spectrum, S(ω i ), i=1, 2,...,N, for each of said blocks, means for determining the value of a tonality function as a function of frequency, and means for estimating the noise masking threshold for each of ω i , in response to said tonality function, said means for determining further comprises means for determining S(ω i ) with dithering time and frequency resolution at different values of ω i ,
Independent claims4
42 paragraphs in 2 sections, as filed
<u style="single">Field of the Invention</u>
0001The present invention relates to coding of time varying signals, such as audio signals representing voice or music information.
<u style="single">Background of the Invention</u>
0002In recent years several advanced bit rate reduction algorithms for high quality digital audio have been proposed (see e.g., Schroeder, E.F. & Voessing, W.: "High quality digital audio encoding with 3.0 bits/sample using adaptive transform coding," 80th. AES-convention Montreaux 1986, Preprint 2321 (B2); Theile, G. & Link, M. & Stoll, G.: "Low bit rate coding of high quality audio signals," 82nd AES convention, London 1987, Preprint 2432 (C-1); Brandenburg, K.: "OCF - A new coding algorithm for high quality sound signals," in Proc. of the 1987 Int. Conf. on Acoust., Speech and Signal Proc. ICASSP 1987, pp. 141-144; and Johnston, J.D.: "Transform Coding of Audio Signals Using Perceptual Noise Criteria," IEEE Journal on Selected Areas in Communications, Vol. 6 (1988), pp. 314-323). Nearly transparent quality can be achieved at bit rates down to 64 kbi/sec. using frequency domain approaches (see e.g., Brandenburg, K. & Seitzer, D.: "OCF: Coding High Quality Audio with Data Rates of 64 kbi/sec," 85th AES convention, Los Angeles 1988; Johnston, J.D.: "Perceptual Transform Coding of Wideband Stereo signals," pp. 1993- 1996, ICASSP 1989; and Theile, G. & Stoll, G. & Link, M.: "Low bit-rate coding of high quality audio signal. An introduction to the MASCAM system," EBU Review- Technical, No. 230 (August 1988), pp. 71-94).
0003FIG. 1 shows the basic block diagram common to all perceptual frequency domain coders. A filterband 101 is used to decompose the input signal into subsampled spectral components. The subsampled spectral components are then used to calculate an estimate of the actual (time dependent)) masking threshold in block 102 using rules known from psychoacoustics (see e.g., Zwicker, E.: "Psychoakustik" (in German), Berlin Heidelberg New York 1982; Hellman, R. P.: "Asymmetry of masking between noise and tone, Perception and Pyschophysics," Vol. 11, pp. 241-246, 1972; and Scharf, B: Chapter 5 of <u style="single">Foundations</u><u style="single">of</u><u style="single">Modern</u><u style="single">Auditory</u><u style="single">Theory</u>, New York, Academic Press, 1970). The spectral components are then quantized and coded in block 103 with the aim of keeping the noise, which is introduced by quantizing, below the masking threshold. Depending on the algorithm this step is done in very different ways, from simple block companding to analysis by synthesis systems using additional noiseless compression.
0004Finally, a multiplexer 104 is used to assemble the bitstream, which typically consists of the quantized and coded spectral coefficients and some side information, e. g. bit allocation information.
0005There are two filterbank designs commonly used in the above arrangement. One type is the so-called tree-structured filterbank (see e.g. QMF filterbank; descrided in Jayant, N. S. & Noll, P.: <u style="single">Digital</u><u style="single">Coding</u><u style="single">of</u><u style="single">Waveforms: Principles</u><u style="single">and</u><u style="single">Applications</u><u style="single">to</u><u style="single">Speech</u><u style="single">and</u><u style="single">Video</u>, Englewood Cliffs 1984) which are designed with the filter bandwidth of the individual bands set according to the critical bands as known from psychoacoustics. Also known are those filter banks used in transform coders (see e.g., Jayant, N. S. & Noll, P.: above, and Zelinski, R. & Noll, P., "Adaptive Transform Coding of Speech Signals," IEEE Trans. on Acoustics, Speech and Signal Processing, ASSP-25 (1977), pp. 299-309) which use a windowed transform to implement a filter bank with equal bandwidth filters with low computational complexity. Transform coders typically calculate 128 to 1024 spectral components, which also can be grouped by critical bands.
0006The basic problem of the design of an analysis/synthesis system for use in high quality digital audio coding is the trade-off between time domain and frequency domain behavior: If more spectral components are used, the masking functions can be estimated with better accuracy. In addition, a higher decorrelation of the spectral components, and therefore a higher coding gain, can be achieved. On the other hand, a higher spectral resolution necessitates less time resolution, which leads to problems with preechoes (see e.g., Vaupelt, Th.: "Ein Kompander zur Unterdrueckung von hoerbaren Stoerungen bei dynamischen Signalpassagen fuer ein Transfor- mationscodierungsverfahren fuer qualitative hochwertige Audiosignale (MSC)", (in German), ITG Fachbericht 106, pp. 209-216; and Brandenburg, K.: "High quality sound coding at 2.5 bi(sample," 84th AES Convention, Paris 1988, Preprint 2582) and longer processing delay.
<u style="single">Summary of the Invention</u>
0007The present invention provides structure and methods which seek to overcome the limitations of the prior art through a closer match to the processing of audio signals by the human ear. More specifically, the present invention models the ear as a filterbank, but with differing time and frequency resolution at different frequencies. Thus the present invention provides an analysis framework that achieves a better fit to the human ear.
0008The hybrid coder of the present invention, in typical embodiment, uses a quadrature mirror filter to perform an initial separation of input audio signals into appropriate frequency bands. This filtered output is again filtered using a windowed transform to achieve the effect of a computationally effective filter bank with many channels.
0009Masking thresholds for the filtered signals are then determined using a "superblock" technique. As in earlier work by the present inventors, a "tonality" measure is used in actually developing appropriate masking thresholds. In the present invention, however, an improved tonality measure that is local to critical bands, or even a single spectral line, is used. Advantageously, well known OCF coding and quantization techniques are then used to further process the perceptually coded signals for transmission or storage.
<u style="single">Brief Description of the Drawing</u>
0010FIG. 1 shows a general block diagram of a perceptual coder.
0011FIG. 2 shows a basic analysis system used in the hybrid coder of the present invention in the context of a system of the type of the type shown in FIG. 1.
0012FIG. 3 shows a time/frequency breakdown of the hybrid analysis structure of FIG. 2.
0013FIG. 4 shows a short time spectrum of a test signal.
0014FIG. 5 shows a block diagram of the iteration loops of a typical implementation of the present invention.
<u style="single">Detailed Description</u>
THE NEW ANALYSIS/SYNTHESIS FILTERBANK
0015The hybrid coder in accordance with an illustrative embodiment of the present invention uses a hybrid QMF/Transform filterbank. FIG. 2 shows the basic analysis/synthesis system. The time domain values are first filtered by a conventional QMF-tree filterbank 201-203. This filterbank is used to get 4 channels with 3 to 12 kHz bandwidth (frequency resolution) and, accordingly, 2 to 8 sample time resolution. The QMF filterbank was chosen only because optimized filters were readily available that satisfied our design goals. It proves convenient to use 80-tap QMF filters derived from Johnston, J. D., <i>"A Filter Family Designed for Use</i><i>in Quadrature Mirror Filter Banks,</i>" ICASSP 1980, pp. 291-294). This 80-tap filter is clearly an overdesign; lower computational complexity will clearly suffice.
0016It is well known that classical QMF-tree filterbanks do not yield "perfect reconstruction" of the input signal. However, 80 tap filter illustratively used yields near perfect reconstruction of the analysis/synthesis filter bank in the sense that the sum of the pass band ripple is below 16 bit resolution. Thus, rounding leads to perfect reconstruction.
0017The output signals of the QMF-tree are filtered again, this time using a windowed transform to get a computational effective filter bank 210-213 with many channels. The window used is a sine window, using 50 % overlap of the analysis blocks. Two different transforms have been used for this purpose. The first transform that may be used is a classical DFT, which calculates 65 or 129 (lowest frequencies) complex lines. In this approach the analysis- synthesis filterbank is not critically sampled. On the other hand, prediction of the complex frequency lines can be easily used to reduce the data rate further. Alternatively, a modified DCT (MDCT) as used in Brandenburg, K.: "Ein Beitrag zu den Verfahren und der Qualitaetsbewteilung fuer hochwertige Musikcodierung," (in German), Ph.D. thesis, Universitaet Erlangen-Nuernberg 1989 and described first in Princen, J. & Johnson, A., Bradley, A.: "Subband / Transform Coding Using Filter Bank Designs Based on Time Domain Aliasing Cancellation", in Proc. of the 1987 Int. conf. on Acoustics, Speech and Signal Processing ICASSP 87, pp. 2161-2164 may be used. This technique calculates 64 or 128 frequency values per subband and is critically sampled. Using this MDCT approach, only half the samples have to be quantized and encoded as compared to the DFT solution.
0018The combined filterbank has a frequency resolution of 23.4 Hz at low frequencies and 187.5 Hz at high frequencies, with a corresponding difference in time resolution. While the time resolution is illustratively quantized to powers of 2, advances in the analysis/synthesis method will provide more range in time/frequency resolution as well as less quantization. Depending on the frequency band, the characteristics of the filter bank are similar to an MDCT filterbank of block length 1024 at low frequencies and 128 at high frequencies. Thus, the frequency resolution at low frequencies is sufficient for the perceptual model, and the time resolution at high frequencies is short enough for pre-echo control without additional algorithmic accommodation. Table 1 shows time and frequency resolution values for the combined filter bank used in the hybrid coder. <tables id="tabl0001" num="0001"><img file="EP0446037A2_D0001.tif" /></tables>
0019Table 1: Time and frequency resolution of the analysis/synthesis filterbank
0020The masking threshold is estimated using the structure of the output signal of the filterbank. The computation is done for "superblocks" containing eight "time slices" corresponding to the number of high-frequency transforms in the low-frequency transform interval. The signal energy in the lower frequency band is distributed equally between the 8 time slices, and that of the middle frequencies distributed according to their transform rate. The "superblock" allocation is shown in FIG. 3.
0021Then the threshold is calculated for each of the 8 time slices using improved methods similar to those in Johnston, J.D.: "Transform Coding of Audio Signals Using Perceptual Noise Criteria," <u style="single">IEEE</u><u style="single">Journal</u><u style="single">on Selected</u><u style="single">Areas</u><u style="single">in</u><u style="single">Communications,</u> Vol. 6 (1988), pp. 314-323. The threshold values for transforms spread across more than 1 time slice are then added up, to give the estimate of the masking threshold with the appropriate time resolution for the critical bands contained in each transform block. Critical band boundaries are aligned with the subband boundaries, resulting in 25 critical bands.
0022The actual quantizer and coder must add no more noise than indicated by the estimated masking threshold in order to code the signal transparently, according to the threshold model.
CALCULATION OF TONALITY
0023Different values for the masking threshold for narrow band signals have been reported in literature for tone masking noise and noise as a masker. See e.g., the Hellman and Scharf references, above. In the Johnston reference, above, the spectral flatness measure was used to calculate a global "tonality" of the short time spectrum of the signal. This tonality measure was then used to interpolate between the masking threshold formulas from Hellman and Scharf. A problem has been found with the notion of a global tonality:
0024Some signals, especially speech signals or an "a capella" singer (see FIG. 4), show a spectrum with "tonal" parts (low harmonics of the pitch frequencies) and "noisy" parts of considerable energy at high frequencies. The result of the measurement of a global spectral flatness measure will not show that parts of the signal are very tonal (i.e., coherent from transform block to transform block). Further, i.e., even if the tonality is estimated correctly for the sensitive (tonal) parts of such a signal, the formula previously used will lead to a very conservative masking threshold at high frequencies, thereby requiring an excessive bit rate.
0025Experiments with changed estimated masking thresholds and results of the different approach to the estimation of the masking threshold taken in Brandenburg, K.: "Ein Beitrag zu den Verfahren und der Qualitaetsbeurteilung fuer hochwertige Musikcodierung," (in German), Ph.D. thesis, Universitaet Erlangen-Nuernberg 1989, caused a search for a new tonality measure.
0026As used in one aspect of the present invention to estimate the amount of masking by a signal tonality, is modeled not as a global value, but as a characteristic local to a critical band or even a single spectral line. In the context of the illustrative hybrid coder, this local tonality is estimated by a coherence measure:
0027For each spectral component (= subband or transform coefficient) a coherence measure is calculated. This is done using a simple prediction, calculated in polar coordinates in the complex plane. Several predictors were tested, and the one described below was selected on the basis of performance.
0028Let r(t,f) be the radius of the spectral value at time t and frequency f and φ(t,f) the phase value at t and f.
0029The predicted value of r and φ at time t are calculated as: r̂(t,f)=r(t-1,f)+(r(t-1,f)-r(t-2,f))<maths id="math0001" num=""><img file="EP0446037A2_D0002.tif" /></maths> The Euclidean distance between the actual and predicted values is used to get the new tonality metric, c(t,f). Then,<maths id="math0002" num=""><img file="EP0446037A2_D0003.tif" /></maths>
0030If the prediction turns out to be very good, c(t,f) will have values near zero. On the other hand, for very unpredictable (noisy) signals c(t,f) will have values of up to 1 with a mean of 0.5. This "inverse tonality" or "measure of chaos" is converted to a tonality metric by a simple log-linear operation. <maths id="math0003" num=""><math display="block"><mrow><mtext>t= αlnc + β</mtext></mrow></math><img file="EP0446037A2_D0004.tif" /></maths> The new tonality metric is used to estimate the masking threshold at each spectral component in the same way as described in the Johnston paper cited above for the old tonality metric. The program in Listing 1 illustrates the processing used to form c(t,f) in the context of a 512 sample input sequence. The program of Listing 1 is written in the well-known FORTRAN programming language described, e.g., in <u style="single">Fx/FORTRAN</u><u style="single">Programmer's</u><u style="single">Handbook</u>, Alliant Computer Systems Corp., 1988. The program is intended for use on general purpose computers marketed by Alliant Computer Systems Corp., but may be readily adapted for use on other general purpose or special purpose processors.
0031In a typical version of the hybrid coder in accordance with the present teachings, the quantization and coding scheme of the OCF (Optimum Coding in the Frequency domain), system described in Brandenburg, K. & Seitzer, D.: "OCF: Coding high Quality Audio with Data Rates of 64 kbit/sec," 85th AES convention, Los Angeles 1988, has been used. In that analysis-by-synthesis scheme the spectral components are first quantized using a nonuniform quantizer. In the inner iteration loop (rate loop) the count of bits needed to code the quantized values using an entropy code is compared to the number of available bits. Depending on the ratio of actual over available bits the quantization step size is adjusted, leading to a different number of bits needed to code the block of quantized values. The outer iteration loop (distortion control loop) compares actual quantization noise energy for each critical band with the estimated masking threshold. If the actual noise exceeds the masking threshold in some critical band, the scale of the spectral components in this critical band is adjusted to yield a lower quantization noise. FIG. 5 shows a block diagram of the iteration loops used for quantization and coding. The algorithm is described in more detail in the papers by Johnston and Brandenburg and Seitzer, as well as the Brandenburg thesis, all cited above. FIG. 5 shows the manner in which a coder such as the OCF system uses the psychoacoustic threshold and related information described above to produce the actual bitstream to be transmitted or stored. Thus, input information on input 500 is assumed to have been appropriately buffered, partitioned into convenient blocks and transformed in the manner described above. The appropriate variable resolution spectral information is also provided to block 504 which provides the psychoacoustic evaluation for weighting frequency signals in block 501 prior to quantization in block 502. The actual entropy coding is represented by block 503 in FIG. 5. Thus the information describing the spectral information of the input signals is provided on output 515. Side information describing the cycle acoustic evaluation and quantizing processes is then supplied on outputs 520 and 525. All outputs are conveniently multiplexed into a single bit stream for transmission or storage.
0032The Perceptual Entropy (see e.g., Johnston, James D., "Estimation of Perceptual Entropy Using Noise Masking Criteria," ICASSP '88, pp. 2524-2527) is an estimate of the information content of a piece of music relative to the capabilities of the human auditory system. It gives an estimate of the minimum bit rate necessary for total transparent coding of a piece of music using a given analysis/synthesis scheme. As introduced in this last-cited paper by Johnston, the PE is calculated from the number of quantization levels necessary to code a piece of music at the masking threshold.
0033Using the analysis/synthesis frame work of the hybrid coder, estimates of the PE have been calculated for different pieces of music. Table 2 lists some of the results and compares them to the PE measured using other analysis/synthesis systems. It can be seen that the hybrid coder performs well compared to the older results.<maths id="math0004" num=""><img file="EP0446037A2_D0005.tif" /></maths>
0034Using the quantization/coding scheme of OCF as described above, typical results for the hybrid coder have been gathered. The bit rate used was 64 kbit/sec. per channel and the basic block length was 1024 time domain samples. The MDCT was used to compute the output of the combined filter bank from the QMF tree. The sampling rate of the test pieces was 48 kHz. The signals were coded with a bandwidth of up to 20 kHz. Out of the 1362 bits available for each block at 64 kb/s, 226 bits were used to code side information.
0035A second generation perceptual coder using enhanced time/frequency resolution has been described. A tonality metric, calculated on a frequency by frequency basis, is combined with the calculation of the coder's noise threshold at each frequency in order to provide a greatly improved threshold value. The present invention thus provides performance that compares favorably with known coding of high quality digital audio at low bit rates.
0036A decoder in accordance with the above teaching can be constructed by using the approach described above. Because of the enhanced time/frequency resolution provided by the present invention, corresponding enhanced processing is accomplished at a decoder.
0037Information used at a receiver or decoder to reconstruct the original input signal at the coder is, of course, that provided as outputs from the system represented by FIG. 5. In particular, the spectral information and side information, after demultiplexing if required, is used to reconstruct the original input signal. With the information describing the cycle acoustic evaluation and quantizing process, including global gain, quantizer step size, scaling factors, bit allocations and the like, all information necessary to reconstruct the sampled time domain signal from its frequency components is present at the receiver/decoder. Information about the non-uniform frequency and time resolution (both as a function of frequency) will also be used at the decoder. Well known digital to analog conversion will also be provided when it is required to create equivalent analog signals for reproduction of the original analog signal with high fidelity, e.g., on a loudspeaker.<img file="EP0446037A2_D0006.tif" /><img file="EP0446037A2_D0007.tif" /><img file="EP0446037A2_D0008.tif" /><img file="EP0446037A2_D0009.tif" /><img file="EP0446037A2_D0010.tif" /><img file="EP0446037A2_D0011.tif" /><img file="EP0446037A2_D0012.tif" /><tables id="tabl0002" num="0002"><img file="EP0446037A2_D0013.tif" /></tables>
Contents2
16 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4 Sheet 5 Sheet 6 Sheet 7 Sheet 8 Sheet 9 Sheet 10 Sheet 11 Sheet 12 Sheet 13 Sheet 14 Sheet 15 Sheet 16
Every citation, both ways
| Document | Relation | Office | Cited during |
|---|---|---|---|
| US8073685B2 | Cited by | United States of America | Applicant |
| KR100852482B1 | Cited by | Republic of Korea | Search report |
| US5864820A | Cited by | United States of America | Search report |
| WO9625649A1 | Cited by | World Intellectual Property Organization (WIPO) | International search |
| US5864813A | Cited by | United States of America | Search report |
| US6477496B1 | Cited by | United States of America | Applicant |
| US7110941B2 | Cited by | United States of America | Search report |
| NO338917B1 | Cited by | Norway | Search report |
| US8260607B2 | Cited by | United States of America | Applicant |
| US5845251A | Cited by | United States of America | Search report |
| US5864813A | Cited by | United States of America | Search report |
| EP0740428A1 | Cited by | European Patent Office (EPO) | Search report |
| US6516299B1 | Cited by | United States of America | Applicant |
| WO9714266A3 | Cited by | World Intellectual Property Organization (WIPO) | International search |
| WO0126262A3 | Cited by | World Intellectual Property Organization (WIPO) | International search |
| WO0126262A3 | Cited by | World Intellectual Property Organization (WIPO) | International search |
| WO0126262A2 | Cited by | World Intellectual Property Organization (WIPO) | International search |
| US5502789A | Cited by | United States of America | Search report |
| CN1108023C | Cited by | China | Search report |
| US5918203A | Cited by | United States of America | Search report |
| US6104822A | Cited by | United States of America | Search report |
| WO9714266A3 | Cited by | World Intellectual Property Organization (WIPO) | International search |
| WO9625649A1 | Cited by | World Intellectual Property Organization (WIPO) | International search |
| US5699479A | Cited by | United States of America | Search report |
| US7519538B2 | Cited by | United States of America | Search report |
| US6463405B1 | Cited by | United States of America | Applicant |
| US5537510A | Cited by | United States of America | Search report |
| WO2005083680A1 | Cited by | World Intellectual Property Organization (WIPO) | International search |
| WO9714266A2 | Cited by | World Intellectual Property Organization (WIPO) | International search |
| AU2005217507B2 | Cited by | Australia | Search report |
| US6782365B1 | Cited by | United States of America | Applicant |
| EP0720316A1 | Cited by | European Patent Office (EPO) | Search report |
| US6516299B1 | Cited by | United States of America | Applicant |
| US7318028B2 | Cited by | United States of America | Applicant |
| US6782365B1 | Cited by | United States of America | Applicant |
| US6463405B1 | Cited by | United States of America | Applicant |
| US8117027B2 | Cited by | United States of America | Applicant |
| US5864820A | Cited by | United States of America | Search report |
| US6477496B1 | Cited by | United States of America | Applicant |
14 members in 6 offices; this record represents the family
Priority claims2
| Document | Office | Kind | Date |
|---|---|---|---|
| 491373 | United States of America | – | |
| 49137390 | United States of America | A |
Members14
| Document | Office | Kind | |
|---|---|---|---|
| CA2037780A1 | Canada | A1 | |
| EP0446037A2This record | European Patent Office (EPO) | A2 | |
| KR910017780A | Republic of Korea | A | |
| JPH04219799A | Japan | A | |
| EP0446037A3 | European Patent Office (EPO) | A3 | |
| CA2037780C | Canada | C | |
| EP0446037B1 | European Patent Office (EPO) | B1 | |
| DE69127842D1 | Germany | D1 | |
| DE69127842T2 | Germany | T2 | |
| JPH10133699A | Japan | A | |
| JP2774203B2 | Japan | B2 | |
| HK1002743A1 | Hong Kong, China | A1 | |
| KR0185582B1 | Republic of Korea | B1 | |
| JP3145339B2 | Japan | B2 |
31 legal events, as 4 offices reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | Office | |
|---|---|---|---|
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Patent expired after termination of 20 yearsExpiredPE20 | PE20 | GB | |
| Discontinued because of reaching the maximum lifetime of a patentV4 | V4 | NL | |
| Expiry of rightR071 | R071 | DE | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| European patent in force as of 2002-01-01IF02 | IF02 | GB | |
| No opposition filedOpposition26N | 26N | EP | |
| No opposition filed within time limitOppositionORIGINAL CODE: 0009261PLBE | PLBE | EP | |
| Information on the status of an ep patent application or granted ep patentGrantedSTATUS: NO OPPOSITION FILED WITHIN TIME LIMITSTAA | STAA | EP | |
| Corresponds to:REF | REF | EP | |
| Fr: translation filedET | ET | EP | |
| It: translation for a ep patent filedITF | ITF | EP | |
| It: translation for a ep patent filedITF | ITF | EP | |
| Designated contracting statesAK | AK | EP | |
| (expected) grantORIGINAL CODE: 0009210GRAA | GRAA | EP | |
| Despatch of communication of intention to grant a patentORIGINAL CODE: EPIDOS IGRAGRAH | GRAH | EP | |
| Despatch of communication of intention to grant a patentORIGINAL CODE: EPIDOS IGRAGRAH | GRAH | EP | |
| Despatch of communication of intention to grantORIGINAL CODE: EPIDOS AGRAGRAG | GRAG | EP | |
| First examination report despatched17Q | 17Q | EP | |
| Party data changed (applicant data changed or rights of an application transferred)RAP3 | RAP3 | EP | |
| Request for examination filed17P | 17P | EP | |
| Designated contracting statesAK | AK | EP | |
| Search report despatchedORIGINAL CODE: 0009013PUAL | PUAL | EP | |
| Designated contracting statesAK | AK | EP | |
| Public reference made under article 153(3) epc to a published international application that has entered the european phaseORIGINAL CODE: 0009012PUAI | PUAI | EP |
Numbers
- Publication
- 0446037
- Application
- 913018776
Titles3
- German
- Hybride wahrnehmungsgebundene Kodierung von Audiosignalen
- English
- Hybrid perceptual audio coding
- French
- Codage perceptuel hybride de signaux audio
Classification
- CPC, 2
- H04B1/665
- H03M1/12
- IPC, 4
- G10L19 02
- G10L19 035
- H03M7 30
- H04B1 66
Designated states5
- Contracting states, 5
- Germany
- France
- United Kingdom
- Italy
- Netherlands (Kingdom of the)