EP1247275A1 - Vorrichtung und verfahren zum bestimmen eines codierungs-blockrasters eines decodierten signals - Google Patents
Vorrichtung und verfahren zum bestimmen eines codierungs-blockrasters eines decodierten signalsInfo
- Publication number
- EP1247275A1 EP1247275A1 EP01900416A EP01900416A EP1247275A1 EP 1247275 A1 EP1247275 A1 EP 1247275A1 EP 01900416 A EP01900416 A EP 01900416A EP 01900416 A EP01900416 A EP 01900416A EP 1247275 A1 EP1247275 A1 EP 1247275A1
- Authority
- EP
- European Patent Office
- Prior art keywords
- signal
- coding
- decoded signal
- coding block
- spectral representation
- 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.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G10—MUSICAL INSTRUMENTS; ACOUSTICS
- G10L—SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING
- G10L19/00—Speech or audio signals analysis-synthesis techniques for redundancy reduction, e.g. in vocoders; Coding or decoding of speech or audio signals, using source filter models or psychoacoustic analysis
- G10L19/02—Speech or audio signals analysis-synthesis techniques for redundancy reduction, e.g. in vocoders; Coding or decoding of speech or audio signals, using source filter models or psychoacoustic analysis using spectral analysis, e.g. transform vocoders or subband vocoders
Definitions
- the present invention relates generally to the analysis of signals encoded and re-decoded in some way, and more particularly to analyzing a decoded signal that has been processed using a coding algorithm that builds on a spectral representation of the original signal.
- the encoded version of the original signal basically being different from the original signal in that the amount of data of the original coded signal is less than the data amount of the original signal.
- the coding algorithm to obtain the coded signal from the original signal, and also the decoding algorithm, which is essentially an inverse of the coding algorithm, will be referred to as a data reducing coding algorithm.
- MPEG-1 For data reduction of audio signals exist various coding algorithms, which are the subject of a number of international standards, such.
- MPEG-1, MPEG-2, MPEG-4 or MPEG-2 AAC Advanced Audio Coding
- AAC Advanced Audio Coding
- Such an audio encoder typically includes an audio input 70 to which is a stream of time discrete samples which are, for example, PCM samples which are, for example, 16-bit wide.
- an analysis filter bank 71 the stream of discrete-time audio samples is divided into encoding blocks or frames of samples, windowed using a corresponding window function, and then converted to a spectral representation by, for example, a filter bank or a Fourier transformation or a Fourier derivative. Transformation, such as B. a modified discrete cosine transform (MDCT) transferred.
- MDCT modified discrete cosine transform
- one block of spectral coefficients being the spectrum of a coding block of audio samples.
- a 50% overlap of consecutive coding blocks is used so that one window of, for example, 2048 audio samples is viewed per block, and by this processing, 1024 new spectral coefficients are generated.
- the discrete-time audio signal at input 70 is further fed to a psychoacoustic model 72 to achieve data reduction, such that, as is known, the masking threshold of the audio signal is calculated in dependence on the frequency, in a block 73 labeled quantization and coding. to perform a quantization of the spectral coefficients, which depends on the masking threshold.
- the quantization of the spectral coefficients is carried out so roughly that the quantization noise introduced thereby is still below the psychoacoustic masking threshold calculated by the psychoacoustic model 72, so that the quantization noise is ideally inaudible.
- This procedure causes a certain number of spectral coefficients, which are not equal to 0 at the output of the analysis filter bank 71, to be set to 0 after the quantization, since the psychoacoustic model 72 has determined that that they are masked by adjacent spectral coefficients and are therefore inaudible.
- every quantizer also has a certain quantization step size, whereby spectral values that are smaller than the step size are set to zero by the quantization.
- spectral values that are smaller than the step size are set to zero by the quantization.
- each quantizer sets at least some values to zero, which already achieves a data reduction.
- the coded signal according to the coding algorithm shown in FIG. 7 is present in blocks.
- the coded signal at the output 75 of the coder shown in Fig. 7 is fed to a bitstream input 80 of a decoder shown in Fig. 8, which is first a bitstream in a block 81 called a bitstream demultiplexer Demultiplexing operation to separate the spectral data from the page information.
- the code words are again present, which represent the individual spectral coefficients. Using a corresponding table, the codewords are decoded to obtain quantized spectral values.
- quantized spectral values are then processed in a block 82 labeled "inverse quantization” to recalculate the quantization introduced in block 73 (FIG. 7).
- Dequantized spectral coefficients are again present at the output of the block 82, which are then converted into the time domain by means of a synthesis filter bank 83, which operates inversely to the analysis filter bank 71 (FIG. 7), in order to obtain the decoded signal at an audio output 84.
- this is a lossy encoder design because the decoded signal present at audio output 84 generally contains less information than the original signal present at audio input 70.
- the quantizer 73 controlled by the psychoacoustic model 72 information is removed from the original signal present at the audio input 70, which is no longer added back in the decoder, but is dispensed with.
- this relinquishment of information is due to the psychoacoustics see model 72, which is adapted to the human hearing characteristics, led in the ideal case to no loss of quality, but only to a targeted data compression.
- the decoded signal (exemplified by the decoded audio signal at audio output 84 in FIG. 8) is typically again a stream of discrete-time samples based on a coding block raster, but not generally visible in the decoded signal, unless special ones are involved Arrangements are made.
- the decoder which decodes a coded original signal for the first time, must introduce the signal into the decoded audio signal.
- Such a decoder thus differs from the usual standard decoders.
- an encoder that re-encodes a decoded signal must extract the destination signal to operate accordingly.
- This somewhat second coder must also be modified so that it reads and interprets the destination signal can.
- this concept is also disadvantageous only for decoded signals which have such a determination signal, but not for signals which have no such determination signal.
- Both the identification mark and the MOLE determination signal provide information about which coding block raster underlies the decoded signal associated with the identification mark or MOLE designation signal.
- these signals must be explicitly introduced, which entails the flexibility disadvantages described above.
- the object of the present invention is to provide an apparatus and a method for determining a coding block raster on which a decoded signal is based, for a decoded signal which has no explicit reference to a coding block raster.
- This object is achieved by an apparatus for determining a coding block raster according to claim 1 or by a method for determining a coding block raster according to claim 11.
- the present invention is based on the finding that the coding block raster, which is determined virtually randomly by a block-oriented coder, has a decisive influence on the spectral representation of the signal.
- Already minimal deviations or coding block raster offsets lead to the fact that the spectral representation of the decoded signal has a completely different appearance than would actually be expected from a spectral representation of the decoded signal, if it is based on the same encoding block raster as that which was decoded Signal itself is underlying.
- This characteristic of the spectrum can be used as a criterion to find out if there is a coding-block-raster offset.
- For a spectrum with grid offset is the fluctuation of z.
- a short-term spectrum of the decoded signal generated using a coding block screen division corresponding to the coding block screen division underlying the decoded signal has a certain appearance, for example with respect to the separation of the spectral lines, with respect to the number of spectral lines. which are equal to 0 or which are very small, etc.
- a section of the decoded signal is picked out for determining a coding block raster, whereupon the selected section is converted into a spectral representation thereof.
- the spectral representation of the extracted portion with respect to at least one predetermined criterion is examined to obtain an evaluation result for the portion.
- This concept is carried out for different sections, always based on a different coding block raster, so that different evaluation results result for different coding block raster divisions and thus coding block raster offsets.
- the coding block screening division which is the basis of a decoded signal, can be unambiguously reconstructed without the use of an auxiliary signal explicitly contained in the decoded signal.
- This concept basically makes it possible to determine from each decoded signal the same underlying coding block raster and thus provides considerable flexibility in that all decoded signals can be processed, not just decoded signals which already have an identification mark or a MOLE - have mood signal.
- decoded signals can be analyzed to perform a distortion-free tandem coding to obtain further information regarding the coder algorithm underlying the decoded signal, or to even prove with which coder the decoded signal was originally coded.
- the coding block grid determined according to the invention which is the basis of the decoded signal, can be entered into the decoded signal itself, thus adapting any decoded signals for existing codec stages, which are based on the identification mark or the MOLE determination signal.
- the inventive concept allows the development of almost all coding parameters, especially since starting from the knowledge of the coding block raster and using appropriate iteration algorithms, practically all coding functionalities can be back-calculated as it were.
- the prerequisite for this, however, is the determination of the coding block raster per se, since the coding block raster influences all subsequent parameters of a coding algorithm which is based on the spectral representation of a signal to be coded.
- the determination of the coding block raster is thus to a certain extent the "input gate" in order to completely analyze a decoded signal as to which coding / decoding concept it is based on.
- 1 shows a block diagram of a device according to the invention for determining a coding block raster
- 2 is a flowchart of a method according to the invention for determining a coding block raster
- FIG. 3 is a schematic diagram of a decoded signal to illustrate various encoding block raster offsets
- Fig. 4 is a spectral representation of a portion of the decoded signal with a grid offset of one sample to the left;
- Fig. 5 is a spectral representation of a portion of the decoded signal without raster offset
- Fig. 6 is a spectral representation of a portion of the decoded signal having a grid offset of one sample to the right;
- Fig. 7 is a block diagram of a known coder operating on the basis of a spectral representation of an original signal
- Fig. 8 is a block diagram of a known decoder for decoding signals encoded by the encoder shown in Fig. 7;
- FIG. 1 shows a block diagram of a device according to the invention for determining a coding block raster on which a decoded signal is based.
- the decoded signal is fed to an input 10 in the device according to the invention and enters a device 11 for extracting a portion of the decoded signal.
- the section selected by the device 11 is converted in a device 12 into a spectral representation thereof.
- the spectral representation of the extracted portion is then evaluated in means 13 for a predetermined criterion to obtain an evaluation result for the extracted portion.
- the evaluation result is then entered into a device 14 for searching and outputting a plurality of evaluation results in order to output at an output 15 of the device according to the invention the coding block raster on which the decoded signal at the input 10 of the device according to the invention is based.
- the apparatus shown in Fig. 1 operates iteratively such that the means for extracting 11 can pick out a portion of the decoded signal different from a previously picked-out portion depending on a portion control signal 16.
- the coding block raster determining apparatus according to the present invention is thus arranged to extract, transpose and determine a plurality of portions of the decoded signal starting at different output samples to obtain a plurality of evaluation results. From this plurality of evaluation results, the device 14 then determines the selected section which best corresponds to the criterion on which the evaluation is based, or which corresponds least to it depending on the criterion, in order to give an indication of the coding block grid.
- the decoded signal generally consists of a sequence 30 of discrete-time samples which, for example, the decoder shown in FIG. 8 has produced at its audio output 84.
- the sequence 30 of discrete-time samples of the decoded signal consists of samples 31a, 31b, 31c, 31d, ....
- a coding block 32 of samples is further drawn in bold, which defines the coding block rasterization corresponding to the decoded signal 30 is originally based.
- Fig. 3 illustrates the case where no overlap is used, while Fig. 9, discussed below, illustrates a window sequence using a 50% overlap.
- the coding block raster is defined in the sense of the present description in such a way that a coding block comprises the sampling values, which are picked out of the stream of time samples by an analysis windowing.
- the number of samples in a coding block thus corresponds to the number of samples used in windows, or in other words, the window length. Since there is no overlapping of the time windows in FIG. 3, a preceding coding block ends before the coding block 32 shown by way of example in FIG. 3, and a subsequent coding block begins at the end of the coding block 32.
- Fig. 9 shows a window sequence in which an overlap of 50% is used. Such a window sequence can occur with MPEG-2 AAC.
- the number of a discrete sample is plotted in a stream of samples.
- the relative size of the window is plotted, i. H. the factor used to weight a sample when it is being windowed.
- the window sequence in FIG. 9 comprises a "long" window 90, a so-called start window 92, a sequence of eight "short” windows 94, a stop window 96, and again a long window 98.
- an encoder can switch from a long window to a sequence of eight short windows to better encode high transient time signals.
- the window sequence in FIG. 9 is thus suitable for transient time signals between sample no. 2560 and sample no. 3584 to process.
- a long window comprises 2048 samples
- a short window comprises 256 samples.
- the eight short windows 94 comprise as many samples as a long window 90 or 98.
- the start window 92 and the stop window 96 are selected such that after a transition of the window with long windows to a window with short windows and after an opposite transition back to the window with long windows, the coding block raster of n • (1024 samples) is maintained.
- the coding block raster is thus defined here by a long window, ie by the number of samples comprising a long window.
- each new window will comprise 50% of the samples windowed by the previous window and 50% "new" sampled samples. If a higher overlap than 50% is used, the number of "new" sampled values in a coding block decreases, while the number of "old” samples increases. The total number of samples per encoding block, however, remains the same.
- the coding block raster determining apparatus of the present invention is required to detect only a single coding block of the decoded signal, since the coding block raster is usually fixed in a signal and, even if short windows are used, does not generally change.
- FIG. 3 also shows three possible activations of the device 11 (FIG. 1) for picking up, namely a first alternative 33 with an offset of one sample to the left, ie an offset of -1, a second alternative 34 with an offset of 0 and a third alternative 35 with an offset of one sample to the right, ie with an offset of +1.
- a first offset of the means 11 for picking is communicated, i. H. a first offset is set (step 20).
- this portion determined by the first offset which starts at an output sample of the decoded signal, is converted by the means 12 into its spectral representation, i. H. a spectral analysis of this section is performed with this offset (step 21).
- the spectral representation at the output of device 12 ( Figure 1) in device 13 ( Figure 1) is then evaluated, i. H. an evaluation of the spectrum is performed to obtain an evaluation result (step 22).
- step 23 it is determined whether all the desired offsets have already been traversed, i. H. whether the search area has been traversed. If this is not the case, d. H. If the decision in step 23 gives a "no", then in step 24 the control line 16 informs the means 11 for picking out a new offset so that the iteration loop can be run through again with this new offset. If the search area then goes through, d. H.
- step 23 If the decision in step 23 returns a "yes”, the various evaluation results are searched, and the evaluation result is determined, which is either maximal or minimal with respect to the other evaluation results, and then an identification of the coding underlying the decoded signal Block rasters on the basis of the section that had the cheapest evaluation result in a step 25 output.
- FIGS. 4 to 6 along the abscissa, the coefficient number is shown. applied.
- Figs. 4 to 6 thus show graphs of spectra when the coefficient number is multiplied by the bandwidth of a spectral coefficient.
- the absolute value of the spectral coefficients is plotted in logarithmic representation.
- FIG. 4 shows the spectral representation of an extracted portion with an offset of minus one sample, which corresponds to alternative 33 of FIG. It can be seen a clearly smeared spectrum in which no cleanly defined spectral coefficients are present, and further in which only a very small number of spectral coefficients are equal to 0 or less than a predetermined threshold.
- a spectral representation of an extracted section is shown that has no grid offset, i. H. Alternative 34 of Fig. 3. It can be seen a clearly defined spectrum in which a plurality of spectral lines due to the quantization depending on the psychoacoustic masking threshold 0 or very small, and further in which all the spectral lines have a neatly defined structure.
- FIG. 6 a spectral representation of a singled out section is shown having a grid offset of plus one sample, i. H. which corresponds to the third alternative 35 of FIG. It can be clearly seen that, in contrast to FIG. 5, the spectrum in FIG. 6 is again heavily smeared.
- the criterion used may be any property of the spectrum shown in FIG. 5, which differs from a property of the spectra shown in FIGS. 4 and 6. Most visible is that in the spectrum shown in Fig. 5, which is based on no grid offset, a large number of spectral lines smaller than z. B. 30 dB, that is about 70 dB below the significant spectral coefficients. In other words, a large number of the spectral lines are 0 and less than 30 dB, respectively. As a criterion, therefore, a simple counting of the spectral lines equal to 0 can be used here in order to use the non-zero spectral lines of an extracted section as the evaluation result.
- the portion with the least number of 0 different spectral values or the largest number of spectral lines would be 0 would then be the portion starting from the output sample of the decoded signal (here the sample 31c of FIG. 3), too the first sample of the analysis window used in encoding the original signal. Therefore, there is no raster offset here.
- a decision threshold may also be used to output as the evaluation result either the spectral values with an amount above the threshold or an amount below the threshold.
- a predetermined criterion for determining the correct coding block raster can also be based on the evaluation of the rapid or abrupt fluctuation of the z.
- a decision threshold can also be used here to output, as the evaluation result, a "fluctuation speed" of the spectrum with an amount above the threshold or an amount below the threshold. It should be noted at this point that a spectrum, as shown in FIG.
- the parameters of the analysis filter bank 71 are, for example, the type of filter bank (eg DFT, DCT, MDCT), the coding block length and the window form.
- FIGS. 1 and 2 can be readily modified such that the means 12 for converting to the spectral representation (FIG. FIG. 1) is iteratively operated in order to base the conversion in the spectral representation on different conversion parameters in order to determine in a double iteration loop in conjunction with the control of the section which is picked out, in addition to the coding block raster, also the coding algorithm used.
- the inventive concept comes to a conclusion in a limited time even if the encoder that generated the present decoded signal is still unknown.
- an M / S stereo coding JD Johnston, AJ Ferreira: “Sum Difference Stereo Transform Coding", IEEE ICASSP 1992, pp. 569-571
- the above-described iterative determination of the coding block raster is not performed on the decoded signal itself, but on the sum or difference of the spectral values. If, for example, a significant number of disappearing (sum and difference) spectral coefficients then appears, an M / S coding is concluded and any subsequent calculations are then carried out with the sum and difference spectral coefficients.
- the predetermined criterion may be modified such that individual criteria of the sum signal and the difference signal are weighted together in a suitable manner, so that the predetermined criterion is based on both the sum signal and the difference signal.
- TNS coding Temporal Noise Shaping
- TNS Temporal Noise Shaping
- the coding block raster can be determined from the "low frequency" spectral coefficients, which are usually not TNS Normally, spectral coefficients below 1 kHz are not subjected to TNS coding, but this value may of course vary from case to case.
- inventive concept for determining a coding block raster has been described on the basis of an audio coding concept, it should be noted that this concept is also applicable to video encoders.
- the inventive concept is generally applicable to all coding algorithms for all signals, if these coding algorithms have the property that they build on a spectral representation of the signal to be coded. Whenever this is the case, for different coded block framer divisions for the decoded signal, a spectral representation of the extracted portion can be generated to then evaluate the spectral representation with respect to a predetermined criterion.
- the device for determining a coding block raster according to the invention does not necessarily have to work serially in such a way that one evaluation result is produced after another, ie that the means 11 for selecting is controlled via the control lines 16 (FIG. 1), to gradually pick out, for example, a section shifted by 1, for example.
- the device according to the invention can also be implemented completely or partially in parallel, so that, for example, 1024 evaluation results are generated in one processing run.
- Mixed serial / parallel options are also possible, so that, for example, there are eight parallel branches, which then operate correspondingly often in series in order to produce an entire search sequence. to be able to cover the area.
- the coding block raster can be identified by any definition, not just the initial sample of a coding block. Of course, each sample of a coding block of samples may be used to define the coding block grid. Finally, the coding block raster can also be defined differently from the number of samples per window, such that two raster points of the coding block raster are spaced around the z. B. twice the number of samples of a window are spaced apart.
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Spectroscopy & Molecular Physics (AREA)
- Computational Linguistics (AREA)
- Signal Processing (AREA)
- Health & Medical Sciences (AREA)
- Audiology, Speech & Language Pathology (AREA)
- Human Computer Interaction (AREA)
- Acoustics & Sound (AREA)
- Multimedia (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Description
Claims
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| DE10000934A DE10000934C1 (de) | 2000-01-12 | 2000-01-12 | Vorrichtung und Verfahren zum Bestimmen eines Codierungs-Blockrasters eines decodierten Signals |
| DE10000934 | 2000-01-12 | ||
| PCT/EP2001/000241 WO2001052240A1 (de) | 2000-01-12 | 2001-01-10 | Vorrichtung und verfahren zum bestimmen eines codierungs-blockrasters eines decodierten signals |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| EP1247275A1 true EP1247275A1 (de) | 2002-10-09 |
| EP1247275B1 EP1247275B1 (de) | 2003-06-25 |
Family
ID=7627256
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| EP01900416A Expired - Lifetime EP1247275B1 (de) | 2000-01-12 | 2001-01-10 | Vorrichtung und verfahren zum bestimmen eines codierungs-blockrasters eines decodierten signals |
Country Status (4)
| Country | Link |
|---|---|
| US (1) | US6750789B2 (de) |
| EP (1) | EP1247275B1 (de) |
| AT (1) | ATE243877T1 (de) |
| DE (2) | DE10000934C1 (de) |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR100462611B1 (ko) * | 2002-06-27 | 2004-12-20 | 삼성전자주식회사 | 하모닉 성분을 이용한 오디오 코딩방법 및 장치 |
| DE102004036154B3 (de) * | 2004-07-26 | 2005-12-22 | Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. | Vorrichtung und Verfahren zur robusten Klassifizierung von Audiosignalen sowie Verfahren zu Einrichtung und Betrieb einer Audiosignal-Datenbank sowie Computer-Programm |
| FR2911228A1 (fr) * | 2007-01-05 | 2008-07-11 | France Telecom | Codage par transformee, utilisant des fenetres de ponderation et a faible retard. |
| EP2315358A1 (de) | 2009-10-09 | 2011-04-27 | Thomson Licensing | Verfahren und Vorrichtung zur arithmetischen Kodierung oder arithmetischen Dekodierung |
| EP2707873B1 (de) | 2011-05-09 | 2015-04-08 | Dolby International AB | Verfahren und codierer zur verarbeitung eines digitalen stereotonsignals |
| JP5714180B2 (ja) * | 2011-05-19 | 2015-05-07 | ドルビー ラボラトリーズ ライセンシング コーポレイション | パラメトリックオーディオコーディング方式の鑑識検出 |
| CN105074819B (zh) * | 2013-02-20 | 2019-06-04 | 弗劳恩霍夫应用研究促进协会 | 使用多重叠部分来生成经编码的信号或对经编码的音频信号进行解码的设备及方法 |
| CN111210832B (zh) * | 2018-11-22 | 2024-06-04 | 广州广晟数码技术有限公司 | 基于频谱包络模板的带宽扩展音频编解码方法及装置 |
| US11368209B2 (en) | 2019-05-30 | 2022-06-21 | Qualcomm Incorporated | Methods and apparatus for frequency translating repeaters |
Family Cites Families (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO1989011759A1 (fr) * | 1988-05-26 | 1989-11-30 | Telefunken Fernseh Und Rundfunk Gmbh | Procede de transmission d'un signal audio |
| DE3902948A1 (de) * | 1989-02-01 | 1990-08-09 | Telefunken Fernseh & Rundfunk | Verfahren zur uebertragung eines signals |
| DE4405659C1 (de) * | 1994-02-22 | 1995-04-06 | Fraunhofer Ges Forschung | Verfahren zum kaskadierten Codieren und Decodieren von Audiodaten |
| DE19647399C1 (de) * | 1996-11-15 | 1998-07-02 | Fraunhofer Ges Forschung | Gehörangepaßte Qualitätsbeurteilung von Audiotestsignalen |
| DE19730130C2 (de) * | 1997-07-14 | 2002-02-28 | Fraunhofer Ges Forschung | Verfahren zum Codieren eines Audiosignals |
| GB2327577B (en) * | 1997-07-18 | 2002-09-11 | British Broadcasting Corp | Re-encoding decoded signals |
| US6175590B1 (en) * | 1997-08-08 | 2001-01-16 | Qualcomm Inc. | Method and apparatus for determining the rate of received data in a variable rate communication system |
| US6496795B1 (en) * | 1999-05-05 | 2002-12-17 | Microsoft Corporation | Modulated complex lapped transform for integrated signal enhancement and coding |
-
2000
- 2000-01-12 DE DE10000934A patent/DE10000934C1/de not_active Expired - Lifetime
-
2001
- 2001-01-10 AT AT01900416T patent/ATE243877T1/de active
- 2001-01-10 US US10/168,456 patent/US6750789B2/en not_active Expired - Lifetime
- 2001-01-10 DE DE50100332T patent/DE50100332D1/de not_active Expired - Lifetime
- 2001-01-10 EP EP01900416A patent/EP1247275B1/de not_active Expired - Lifetime
Non-Patent Citations (1)
| Title |
|---|
| See references of WO0152240A2 * |
Also Published As
| Publication number | Publication date |
|---|---|
| EP1247275B1 (de) | 2003-06-25 |
| US20030107503A1 (en) | 2003-06-12 |
| DE10000934C1 (de) | 2001-09-27 |
| US6750789B2 (en) | 2004-06-15 |
| DE50100332D1 (de) | 2003-07-31 |
| ATE243877T1 (de) | 2003-07-15 |
| WO2001052240A2 (de) | 2001-07-19 |
| WO2001052240A8 (de) | 2001-08-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| DE19811039B4 (de) | Verfahren und Vorrichtungen zum Codieren und Decodieren von Audiosignalen | |
| DE602004005197T2 (de) | Vorrichtung und verfahren zum kodieren eines audiosignals und vorrichtung und verfahren zum dekodieren eines kodierten audiosignals | |
| DE102007017254B4 (de) | Vorrichtung zum Kodieren und Dekodieren | |
| DE60014363T2 (de) | Verringerung der von der quantisierung verursachten datenblock-diskontinuitäten in einem audio-kodierer | |
| DE60225381T2 (de) | Verfahren zur Kodierung von Sprach- und Musiksignalen | |
| DE60225276T2 (de) | Codierungsvorrichtung und -verfahren, decodierungsvorrichtung und -verfahren und programm | |
| DE102004009954B4 (de) | Vorrichtung und Verfahren zum Verarbeiten eines Multikanalsignals | |
| DE60308567T2 (de) | Dekodierungsgerät, Kodierungsgerät, Dekodierungsverfahren und Kodierungsverfahren | |
| DE69917181T2 (de) | Verfahren zur Bestimmung und zur Anpassung der Blockgrösse für Audiotransformationskodierung | |
| EP0954909A1 (de) | Verfahren zum codieren eines audiosignals | |
| WO1999004505A1 (de) | Verfahren zum signalisieren einer rauschsubstitution beim codieren eines audiosignals | |
| DE60303346T2 (de) | Encodier- und/oder Decodierverfahren für digitale Audiosignale, basierend auf Zeit-Frequenzkorrelation und Vorrichtung hierzu | |
| WO2000014886A1 (de) | Vorrichtung und verfahren zum entropie-codieren von informationswörtern und vorrichtung und verfahren zum decodieren von entropie-codierten informationswörtern | |
| EP1397799B1 (de) | Verfahren und vorrichtung zum verarbeiten von zeitdiskreten audio-abtastwerten | |
| DE60017825T2 (de) | Verfahren und Vorrichtung zur Kodierung und Dekodierung von Audiosignalen und Aufzeichnungsträger mit Programmen dafür | |
| WO2009100875A1 (de) | Vorrichtung und verfahren zum berechnen eines fingerabdrucks eines audiosignals, vorrichtung und verfahren zum synchronisieren und vorrichtung und verfahren zum charakterisieren eines testaudiosignals | |
| EP1247275B1 (de) | Vorrichtung und verfahren zum bestimmen eines codierungs-blockrasters eines decodierten signals | |
| DE102004009949B4 (de) | Vorrichtung und Verfahren zum Ermitteln eines Schätzwertes | |
| DE69629485T2 (de) | Kompressionsystem für sich wiederholende töne | |
| EP1277346B1 (de) | Vorrichtung und Verfahren zum Analysieren der spektralen Darstellung eines decodierten Zeitsignales | |
| WO2001052240A1 (de) | Vorrichtung und verfahren zum bestimmen eines codierungs-blockrasters eines decodierten signals | |
| EP0905918A2 (de) | Verfahren und Vorrichtung zum Kodieren von Audiosignalen | |
| DE4209382C1 (de) | ||
| DE10065363B4 (de) | Vorrichtung und Verfahren zum Decodieren eines codierten Datensignals |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
| 17P | Request for examination filed |
Effective date: 20020415 |
|
| AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE TR |
|
| GRAH | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOS IGRA |
|
| GRAH | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOS IGRA |
|
| GRAA | (expected) grant |
Free format text: ORIGINAL CODE: 0009210 |
|
| AK | Designated contracting states |
Designated state(s): AT CH DE GB LI |
|
| REG | Reference to a national code |
Ref country code: GB Ref legal event code: FG4D Free format text: NOT ENGLISH |
|
| REG | Reference to a national code |
Ref country code: CH Ref legal event code: EP |
|
| REG | Reference to a national code |
Ref country code: IE Ref legal event code: FG4D Free format text: GERMAN |
|
| REF | Corresponds to: |
Ref document number: 50100332 Country of ref document: DE Date of ref document: 20030731 Kind code of ref document: P |
|
| GBT | Gb: translation of ep patent filed (gb section 77(6)(a)/1977) | ||
| RAP2 | Party data changed (patent owner data changed or rights of a patent transferred) |
Owner name: FRAUNHOFER-GESELLSCHAFT ZUR FOERDERUNG DERANGEWAND |
|
| REG | Reference to a national code |
Ref country code: IE Ref legal event code: FD4D |
|
| PLBE | No opposition filed within time limit |
Free format text: ORIGINAL CODE: 0009261 |
|
| STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT |
|
| 26N | No opposition filed |
Effective date: 20040326 |
|
| PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: GB Payment date: 20200127 Year of fee payment: 20 Ref country code: DE Payment date: 20200123 Year of fee payment: 20 Ref country code: AT Payment date: 20200121 Year of fee payment: 20 |
|
| PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: CH Payment date: 20200127 Year of fee payment: 20 |
|
| REG | Reference to a national code |
Ref country code: DE Ref legal event code: R071 Ref document number: 50100332 Country of ref document: DE |
|
| REG | Reference to a national code |
Ref country code: CH Ref legal event code: PL |
|
| REG | Reference to a national code |
Ref country code: GB Ref legal event code: PE20 Expiry date: 20210109 |
|
| REG | Reference to a national code |
Ref country code: AT Ref legal event code: MK07 Ref document number: 243877 Country of ref document: AT Kind code of ref document: T Effective date: 20210110 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: GB Free format text: LAPSE BECAUSE OF EXPIRATION OF PROTECTION Effective date: 20210109 |