Audio decoding
Abstract
Coding of an audio signal represented by a respective set of sampled signal values for each of a plurality of sequential segments is disclosed. The sampled signal values are analyzed (40) to determine one or more sinusoidal components for each of the plurality of sequential segments. The sinusoidal components are linked (42) across a plurality of sequential segments to provide sinusoidal tracks. For each sinusoidal track, a phase comprising a generally monotonically changing value is determined and an encoded audio stream including sinusoidal codes (r) representing said phase is generated (46).

Term
Term ended
Expired 6 November 2023, 2.9 years ago.
- Priority
- Filed
- Granted
- Expired
- Today
3 claims: 2 independent, 1 dependent
- 1Method of decoding an audio stream, the method comprising the steps of:reading an encoded audio stream (AS') including sinusoidal codes (r) representing a phase (ψ) for each track of linked sinusoidal components, for each track, generating (56) a generally monotonically changing value (ψ̂) from said codes (r) representing said phase;filtering (58) said generated value to provide an estimate of frequency (ω̂) for a track;and employing (32) said generated values and said frequency estimates to synthesize said sinusoidal components of said audio signal.
- 2Audio player (3) comprising:means for reading an encoded audio stream (AS') including sinusoidal codes (r) representing a phase (ψ) for each track of linked sinusoidal components, a phase unwrapper (56) for generating, for each track, a generally monotonically changing value (ψ̂) from said codes (r) representing said phase;a filter (58) for filtering said generated value to provide an estimate of frequency (ω̂) for a track;and a synthesizer (32) arranged to employ said generated values and said frequency estimates to synthesize said sinusoidal components of said audio signal.
Independent claims2
42 paragraphs in 5 sections, as filed
FIELD OF THE INVENTION
The present invention relates to coding and decoding audio signals.
BACKGROUND OF THE INVENTION
Referring now to Figure 1, a parametric coding scheme in particular a sinusoidal coder is described in <patcit id="pcit0001" dnum="WO0169593A"><text>PCT Patent Application No. WO01/69593</text></patcit>. In this coder, an input audio signal x(t) is split into several (overlapping) segments or frames, typically of length 20ms. Each segment is decomposed into transient, sinusoidal and noise components. (It is also possible to derive other components of the input audio signal such as harmonic complexes although these are not relevant for the purposes of the present invention.)
In the sinusoidal analyser 130, the signal x2 for each segment is modelled using a number of sinusoids represented by amplitude, frequency and phase parameters. This information is usually extracted for an analysis interval by performing a Fourier Transform (FT) which provides a spectral representation of the interval including: frequencies; amplitudes for each frequency; and phases for each frequency where each phase is in the range {-π,π}. Once the sinusoidal information for a segment is estimated, a tracking algorithm is initiated. This algorithm uses a cost function to link sinusoids with each other on a segment-to-segment basis to obtain so-called tracks. The tracking algorithm thus results in sinusoidal codes C<sub>S</sub> comprising sinusoidal tracks that start at a specific time instance, evolve for a certain amount of time over a plurality of time segments and then stop.
In such sinusoidal coding, frequency information is usually transmitted for the tracks formed in the encoder. This can be done cheaply, since tracks are defined as having a slowly varying frequency and, therefore, frequency can be transmitted efficiently by time-differential encoding. (In general, amplitude can also be encoded differentially over time.)
In contrast to frequency, phase transmission is viewed as expensive. In principle, if the frequency is (nearly) constant, phase as a function of the track segment index should adhere to a (nearly) linear behaviour. However, when it is transmitted, phase is limited to the range {-π,π} as provided by the Fourier Transform. Because of this modulo 2π representation of phase, the structural inter-frame relation of the phase is lost and, at first sight appears to be a white stochastic variable.
However, since the phase is the integral of the frequency, the phase need, in principle, not be transmitted. This is called phase continuation and reduces the bit rate significantly.
In phase continuation, only the frequency is transmitted and the phase is recovered at the decoder from the frequency data by exploiting the integral relation between phase and frequency. It is known, however, that the phase can only be approximately recovered using phase continuation. If frequency errors occur, due to measurement errors in the frequency or due to quantisation noise, the phase, being reconstructed using the integral relation, will typically show an error having the character of a drift. This is because frequency errors have an approximately white noise character. Integration amplifies low-frequency errors and, consequently, the recovered phase will tend to drift away from the actually measured phase. This leads to audible artifacts.
This is illustrated in Figure 2(a) where ψ and Ω are the real frequency and phase for a track. In both the encoder and decoder frequency and phase have an integral relationship represented by I. The quantisation process in the encoder is modelled as an additive white noise <i>n</i>. In the decoder, the recovered phase ψ̂ thus includes two components: the real phase ψ and a noise component ε<sub>2</sub>, where both the spectrum of the recovered phase and the power spectral density function of the noise ε<sub>2</sub> have a pronounced low-frequency character.
Thus, it can be seen that in phase continuation, since the recovered phase is the integral of a low-frequency signal, the recovered phase is a low-frequency signal itself. However, the noise introduced in the reconstruction process is also dominant in this low-frequency range. It is therefore difficult to separate these sources with a view to filtering the noise <i>n</i> introduced during encoding.
DISCLOSURE OF THE INVENTION
According to the present invention there are provided a method according to claim 1, and an audio player according to claim 2.
According to the invention, in the decoder, the frequency can be approximately recovered from the quantised phase information using finite differences as an approximation for differentiation. The noise component of the recovered frequency has a pronounced high-frequency behaviour under the assumption that the noise introduced by the phase quantisation is nearly spectrally flat. This is illustrated in Figure 2(b), where within the encoder and the decoder, frequency is represented as the differential (D) of phase. Again, noise <i>n</i> is introduced in the encoder and so in the decoder, the recovered frequency Ω̂ includes two components: the real frequency Ω and a noise component ε<sub>4</sub>, where the frequency is nearly a DC signal and the noise is mainly in high-frequency range. However, since the underlying frequency has a low-frequency behaviour and the added noise a high-frequency behaviour, the noise component ε<sub>4</sub> of the recovered frequency can be reduced by low-pass filtering.
BRIEF DESCRIPTION OF THE DRAWINGS
<ul id="ul0001" list-style="none" compact="compact"><li>Figure 1 shows an audio coder;</li><li>Figures 2(a) and 2(b) illustrate the relationship between phase and frequency in prior art systems and in audio systems according to the present invention respectively;</li><li>Figures 3(a) and 3(b) show a sinusoidal coder component of the audio coder of Figure 1;</li><li>Figure 4 shows an audio player in which an embodiment of the invention is implemented; and</li><li>Figures 5(a) and 5(b) show a preferred embodiment of a sinusoidal synthesizer component of the audio player of Figure 4; and</li><li>Figure 6 shows a system comprising an audio coder and an audio player according to the invention.</li></ul>
DESCRIPTION OF THE PREFERRED EMBODIMENT
Preferred embodiments of the invention will now be described with reference to the accompanying drawings wherein like components have been accorded like reference numerals and, unless otherwise stated perform a like function. The encoder 1 is a sinusoidal coder of the type described in <patcit id="pcit0002" dnum="WO0169593A"><text>PCT Patent Application No. WO 01/69593</text></patcit>, Figure 1. The operation of this prior art coder and its corresponding decoder has been well described and description is only provided here where relevant to the present invention.
The audio coder 1 samples an input audio signal at a certain sampling frequency resulting in a digital representation x(t) of the audio signal. The coder 1 then separates the sampled input signal into three components: transient signal components, sustained deterministic components, and sustained stochastic components. The audio coder 1 comprises a transient coder 11, a sinusoidal coder 13 and a noise coder 14.
The transient coder 11 comprises a transient detector (TD) 110, a transient analyzer (TA) 111 and a transient synthesizer (TS) 112. First, the signal x(t) enters the transient detector 110. This detector 110 estimates if there is a transient signal component and its position. This information is fed to the transient analyzer 111. If the position of a transient signal component is determined, the transient analyzer 111 tries to extract (the main part of) the transient signal component. It matches a shape function to a signal segment preferably starting at an estimated start position, and determines content underneath the shape function, by employing for example a (small) number of sinusoidal components. This information is contained in the transient code C<sub>T</sub> and more detailed information on generating the transient code C<sub>T</sub> is provided in <patcit id="pcit0003" dnum="WO0169593A"><text>PCT Patent Application No. WO 01/69593</text></patcit>.
The transient code C<sub>T</sub> is furnished to the transient synthesizer 112. The synthesized transient signal component is subtracted from the input signal x(t) in subtractor 16, resulting in a signal x1. A gain control mechanism GC (12) is used to produce x2 from x1.
The signal x2 is furnished to the sinusoidal coder 13 where it is analyzed in a sinusoidal analyzer (SA) 130, which determines the (deterministic) sinusoidal components. It will therefore be seen that while the presence of the transient analyser is desirable, it is not necessary and the invention can be implemented without such an analyser. Alternatively, as mentioned above, the invention can also be implemented with for example an harmonic complex analyser.
In brief, the sinusoidal coder encodes the input signal x2 as tracks of sinusoidal components linked from one frame segment to the next. Referring now to Figure 3(a), in the same manner as in the prior art, each segment of the input signal x2 is transformed into the frequency domain in a Fourier Transform (FT) unit 40. For each segment, the FT unit provides measured amplitudes A, phases φ and frequencies ω. As mentioned previously, the range of phases provided by the Fourier Transform is restricted to -π ≤ φ < π. A tracking algorithm (TA) unit 42 takes the information for each segment and by employing a suitable cost function, links sinusoids from one segment to the next, so producing a sequence of measured phases φ(k) and frequencies ω(k) for each track.
In contrast to the prior art, according to the present invention the sinusoidal codes C<sub>S</sub> ultimately produced by the analyzer 130 include phase information, and frequency is reconstructed from this information in the decoder.
As mentioned above, however, the measured phase is restricted to a modulo 2π representation. Therefore, in the encoder 1, the analyzer comprises a phase unwrapper (PU) 44 where the modulo 2π phase representation is unwrapped to expose the structural inter-frame phase behaviour for a track ψ. As the frequency in sinusoidal tracks is nearly constant, it will be seen that the unwrapped phase ψ will typically be a linearly increasing (or decreasing) function and this makes cheap transmission of phase possible. The unwrapped phase ψ is provided as input to a phase encoder (PE) 46 which provides as output representation levels r suitable for being transmitted.
Referring now to the operation of the phase unwrapper 44, as mentioned above, actual phase ψ and actual frequency Ω for a track are related by: <maths id="math0001" num="Equation 1"><math display="block"><mi mathvariant="italic">ψ</mi><mfenced><mi>t</mi></mfenced><mo>=</mo><mstyle displaystyle="true"><msubsup><mo>∫</mo><msub><mi>T</mi><mn>0</mn></msub><mi>t</mi></msubsup></mstyle><mi mathvariant="normal">Ω</mi><mfenced><mi mathvariant="italic">τ</mi></mfenced><mo>ⅆ</mo><mi mathvariant="italic">τ</mi><mo>+</mo><mi mathvariant="italic">ψ</mi><mfenced><msub><mi>T</mi><mn>0</mn></msub></mfenced></math><img file="EP1568012B1_D0001.tif" /></maths> with To a reference time instant.
A sinusoidal track in frames k = K, K+1... K+L-1 has measured frequencies ω(k) (expressed in radians per second) and measured phases φ(k) (expressed in radians). The distance between the centre of the frames is given by U (update rate expressed in seconds). The measured frequencies are supposed to be samples of the assumed underlying continuous-time frequency track Ω with ω(k) = Ω (kU) and, similarly, the measured phases are samples of the associated continuous-time phase track ψ with φ(k)=ψ(kU) mod (2π). For sinusoidal coding it is assumed that Ω is a nearly constant function.
Assuming that the frequencies are nearly constant within a segment Equation 1 can be approximated as follows: <maths id="math0002" num="Equation 2"><math display="block"><mtable columnalign="left"><mtr><mtd><mi mathvariant="italic">ψ</mi><mfenced><mi mathvariant="italic">kU</mi></mfenced></mtd><mtd><mo>=</mo><mstyle displaystyle="true"><msubsup><mo>∫</mo><mrow><mfenced separators=""><mi>k</mi><mo>-</mo><mn>1</mn></mfenced><mo></mo><mi>U</mi></mrow><mi mathvariant="italic">kU</mi></msubsup></mstyle><mi mathvariant="normal">Ω</mi><mfenced><mi mathvariant="italic">τ</mi></mfenced><mo>ⅆ</mo><mi mathvariant="italic">τ</mi><mo>+</mo><mi mathvariant="italic">ψ</mi><mo></mo><mfenced separators=""><mfenced separators=""><mi>k</mi><mo>-</mo><mn>1</mn></mfenced><mo></mo><mi>U</mi></mfenced></mtd></mtr><mtr><mtd><mspace width="1em" /></mtd><mtd><mo>≈</mo><mfenced open="{" close="}" separators=""><mi mathvariant="italic">ω</mi><mfenced><mi>k</mi></mfenced><mo>+</mo><mi mathvariant="italic">ω</mi><mo></mo><mfenced separators=""><mi>k</mi><mo>+</mo><mn>1</mn></mfenced></mfenced><mo></mo><mi>U</mi><mo>/</mo><mn>2</mn><mo>+</mo><mi mathvariant="italic">ψ</mi><mo></mo><mfenced separators=""><mfenced separators=""><mi>k</mi><mo>-</mo><mn>1</mn></mfenced><mo></mo><mi>U</mi></mfenced><mn>.</mn></mtd></mtr></mtable></math><img file="EP1568012B1_D0002.tif" /></maths>
It will therefore be seen that knowing the phase and frequency for a given segment and the frequency of the next segment, it is possible to estimate an unwrapped phase value for the next segment, and so on for each segment in a track.
In the preferred embodiment, the phase unwrapper determines an unwrap factor <i>m(k)</i> at instant k: <maths id="math0003" num="Equation 3"><math display="block"><mi mathvariant="italic">ψ</mi><mfenced><mi mathvariant="italic">kU</mi></mfenced><mo>=</mo><mi>φ</mi><mfenced><mi>k</mi></mfenced><mo>+</mo><mi>m</mi><mfenced><mi>k</mi></mfenced><mo></mo><mn>2</mn><mo></mo><mi mathvariant="italic">π</mi></math><img file="EP1568012B1_D0003.tif" /></maths>
The unwrap factor <i>m(k)</i> tells the phase unwrapper 44 the number of cycles which has to be added to obtain the unwrapped phase.
Combining equations 2 and 3, the phase unwrapper determines an incremental unwrap factor e as follows: <maths id="math0004" num=""><math display="block"><mn>2</mn><mo></mo><mi mathvariant="italic">πe</mi><mfenced><mi>k</mi></mfenced><mo>=</mo><mn>2</mn><mo></mo><mi mathvariant="italic">π</mi><mfenced open="{" close="}" separators=""><mi>m</mi><mfenced><mi>k</mi></mfenced><mo>-</mo><mi>m</mi><mo></mo><mfenced separators=""><mi>k</mi><mo>-</mo><mn>1</mn></mfenced></mfenced><mo>=</mo><mfenced open="{" close="}" separators=""><mi mathvariant="italic">ω</mi><mfenced><mi>k</mi></mfenced><mo>+</mo><mi mathvariant="italic">ω</mi><mo></mo><mfenced separators=""><mi>k</mi><mo>-</mo><mn>1</mn></mfenced></mfenced><mo></mo><mi>U</mi><mo>/</mo><mn>2</mn><mo>-</mo><mfenced open="{" close="}" separators=""><mi>φ</mi><mfenced><mi>k</mi></mfenced><mo>-</mo><mi>φ</mi><mo></mo><mfenced separators=""><mi>k</mi><mo>-</mo><mn>1</mn></mfenced></mfenced></math><img file="EP1568012B1_D0004.tif" /></maths> where e should be an integer. However, due to measurement and model errors, the incremental unwrap factor will not be an integer exactly, so: <maths id="math0005" num=""><math display="block"><mi>e</mi><mfenced><mi>k</mi></mfenced><mo>=</mo><mi>round</mi><mo></mo><mfenced separators=""><mfenced open="[" close="]" separators=""><mfenced open="{" close="}" separators=""><mi mathvariant="italic">ω</mi><mfenced><mi>k</mi></mfenced><mo>+</mo><mi mathvariant="italic">ω</mi><mo></mo><mfenced separators=""><mi>k</mi><mo>-</mo><mn>1</mn></mfenced></mfenced><mo></mo><mi>U</mi><mo>/</mo><mn>2</mn><mo>-</mo><mfenced open="{" close="}" separators=""><mi>φ</mi><mfenced><mi>k</mi></mfenced><mo>-</mo><mi>φ</mi><mo></mo><mfenced separators=""><mi>k</mi><mo>-</mo><mn>1</mn></mfenced></mfenced></mfenced><mo>/</mo><mfenced separators=""><mn>2</mn><mo></mo><mi mathvariant="italic">π</mi></mfenced></mfenced></math><img file="EP1568012B1_D0005.tif" /></maths> assuming that the model and measurement errors are small.
Having the incremental unwrap factor e, the <i>m(k)</i> from equation (3) is calculated as the cumulative sum where, without loss of generality, the phase unwrapper starts in the first frame K with m(K)=0, and from m(k) and φ(k), the (unwrapped) phase ψ<i>(</i>kU) is determined.
In practice, the sampled data ψ(kU) and Ω (kU) are distorted by measurement errors: <maths id="math0006" num=""><math display="block"><mi>φ</mi><mfenced><mi>k</mi></mfenced><mo>=</mo><mi mathvariant="italic">ψ</mi><mfenced><mi mathvariant="italic">kU</mi></mfenced><mo>+</mo><msub><mi mathvariant="italic">ε</mi><mn>1</mn></msub><mfenced><mi>k</mi></mfenced><mo>,</mo></math><img file="EP1568012B1_D0006.tif" /></maths><maths id="math0007" num=""><math display="block"><mi mathvariant="italic">ω</mi><mfenced><mi>k</mi></mfenced><mo>=</mo><mi mathvariant="normal">Ω</mi><mfenced><mi mathvariant="italic">kU</mi></mfenced><mo>+</mo><msub><mi mathvariant="italic">ε</mi><mn>2</mn></msub><mfenced><mi>k</mi></mfenced><mo>,</mo></math><img file="EP1568012B1_D0007.tif" /></maths> where ε<sub>1</sub> and ε<sub>2</sub> are the phase and frequency errors, respectively. In order to prevent the determination of the unwrap factor becoming ambiguous, the measurement data needs to be determined with sufficient accuracy. Thus, in the encoder 1, tracking is restricted so that: <maths id="math0008" num=""><math display="block"><mi mathvariant="italic">δ</mi><mfenced><mi>k</mi></mfenced><mo>=</mo><mi>e</mi><mfenced><mi>k</mi></mfenced><mo>-</mo><mfenced open="[" close="]" separators=""><mfenced open="{" close="}" separators=""><mi mathvariant="italic">ω</mi><mfenced><mi>k</mi></mfenced><mo>+</mo><mi mathvariant="italic">ω</mi><mo></mo><mfenced separators=""><mi>k</mi><mo>-</mo><mn>1</mn></mfenced></mfenced><mo></mo><mi>U</mi><mo>/</mo><mn>2</mn><mo>-</mo><mfenced open="{" close="}" separators=""><mi>φ</mi><mfenced><mi>k</mi></mfenced><mo>-</mo><mi>φ</mi><mo></mo><mfenced separators=""><mi>k</mi><mo>-</mo><mn>1</mn></mfenced></mfenced></mfenced><mo>/</mo><mfenced separators=""><mn>2</mn><mo></mo><mi mathvariant="italic">π</mi></mfenced><mo><</mo><msub><mi mathvariant="italic">δ</mi><mn>0</mn></msub></math><img file="EP1568012B1_D0008.tif" /></maths> where δ is the error in the rounding operation. The error δ is mainly determined by the errors in ω due to the multiplication with U. Assume that ω is determined from the maxima of the absolute value of the Fourier Transform from a sampled version of the input signal with sampling frequency <i>F<sub>s</sub></i> and that the resolution of the Fourier Transform is 2π/<i>L<sub>a</sub></i> with <i>L<sub>a</sub></i> the analysis size. In order to be within the considered bound, we have: <maths id="math0009" num=""><math display="block"><mfrac><msub><mi>L</mi><mi>a</mi></msub><mi>U</mi></mfrac><mo>=</mo><msub><mi>δ</mi><mn>0</mn></msub></math><img file="EP1568012B1_D0009.tif" /></maths>
That means that the analysis size should be few times larger than the update size in order for unwrapping to be accurate, e.g., setting δ<sub>0</sub>=1/4, the analysis size should be four times the update size (neglecting the errors ε<sub>1</sub> in the phase measurement).
The second precaution which can be taken to avoid decision errors in the round operation is to defining tracks appropriately. In the tracking unit 42, sinusoidal tracks are typically defined by considering amplitude and frequency differences. Additionally, it is also possible to account for phase information in the linking criterion. For instance, we can define the phase prediction error ε as the difference between the measured value and the predicted value φ̃ according to <maths id="math0010" num=""><math display="block"><mi mathvariant="italic">ε</mi><mo>=</mo><mfenced open="{" close="}" separators=""><mi>φ</mi><mfenced><mi>k</mi></mfenced><mo>-</mo><mover><mi>φ</mi><mo>˜</mo></mover><mfenced><mi>k</mi></mfenced></mfenced><mo></mo><mi>mod</mi><mo></mo><mn>2</mn><mo></mo><mi mathvariant="italic">π</mi></math><img file="EP1568012B1_D0010.tif" /></maths> where the predicted value can be taken as <maths id="math0011" num=""><math display="block"><mover><mi>φ</mi><mo>˜</mo></mover><mfenced><mi>k</mi></mfenced><mo>=</mo><mi>φ</mi><mo></mo><mfenced separators=""><mi>k</mi><mo>-</mo><mn>1</mn></mfenced><mo>+</mo><mfenced open="{" close="}" separators=""><mi mathvariant="italic">ω</mi><mfenced><mi>k</mi></mfenced><mo>-</mo><mi mathvariant="italic">ω</mi><mo></mo><mfenced separators=""><mi>k</mi><mo>-</mo><mn>1</mn></mfenced></mfenced><mo></mo><mi>U</mi><mo>/</mo><mn>2</mn></math><img file="EP1568012B1_D0011.tif" /></maths> Thus, preferably the tracking unit 42 forbids tracks where ε is larger than a certain value (e.g. ε > π/2), resulting in an unambiguous definition of <i>e(k).</i>
Additionally, the encoder may calculate the phases and frequencies such as will be available in the decoder. If the phases or frequencies which will become available in the decoder differ too much from the phases and/or frequencies such as are present in the encoder, it may be decided to interrupt a track, i.e. to signal the end of a track and start a new one using the current frequency and phase and their linked sinusoidal data.
The sampled unwrapped phase ψ (kU) produced by the phase unwrapper (PU) 44 is provided as input to phase encoder (PE) 46 to produce the set of representation levels r. Techniques for efficient transmission of a generally monotonically changing characteristic such as the unwrapped phase are known. In Figure 3(b), Adaptive Differential Pulse Code Modulation (ADPCM) is employed. Here, a predictor (PF) 48 is used to estimate the phase of the next track segment and encode the difference only in a quantizer (Q) 50. Since ψ is expected to be a nearly linear function and for reasons of simplicity, the predictor 48 is chosen as a second-order filter of the form: <maths id="math0012" num=""><math display="block"><mi>y</mi><mo></mo><mfenced separators=""><mi>k</mi><mo>+</mo><mn>1</mn></mfenced><mo>=</mo><mn>2</mn><mo></mo><mi>x</mi><mfenced><mi>k</mi></mfenced><mo>-</mo><mi>x</mi><mo></mo><mfenced separators=""><mi>k</mi><mo>-</mo><mn>1</mn></mfenced></math><img file="EP1568012B1_D0012.tif" /></maths> where x is the input and <i>y</i> is the output. It will be seen, however, that it is also possible to take other functional relations (including higher-order relations) and to include adaptive (backward or forward) adaptation of the filter coefficients. In the phase encoder 46, a backward adaptive control mechanism (QC) 52 is used for simplicity to control the quantiser 50. Forward adaptive control is also possible as well but would require extra bit rate overhead.
As will be seen, initialization of the encoder (and decoder) for a track starts with knowledge of the start phase φ(0) and frequency ω(0). These are quantized and transmitted by a separate mechanism. Additionally, the initial quantization step used in the quantization controller 52 of the encoder and the corresponding controller 62 in the decoder, Figure 5(b), is either transmitted or set to a certain value in both encoder and decoder. Finally, the end of a track can either be signalled in a separate side stream or as a unique symbol in the bit stream of the phases.
From the sinusoidal code C<sub>S</sub> generated with the sinusoidal coder, the sinusoidal signal component is reconstructed by a sinusoidal synthesizer (SS) 131 in the same manner as will be described for the sinusoidal synthesizer (SS) 32 of the decoder. This signal is subtracted in subtractor 17 from the input x2 to the sinusoidal coder 13, resulting in a remaining signal x3. The residual signal x3 produced by the sinusoidal coder 13 is passed to the noise analyzer 14 of the encoder 1 which produces a noise code C<sub>N</sub> representative of this noise, as described in, for example, <patcit id="pcit0004" dnum="EP0004599W"><text>PCT patent application No. PCT/EP00/04599</text></patcit>.
Finally, in a multiplexer 15, an audio stream AS is constituted which includes the codes C<sub>T</sub>, C<sub>S</sub> and C<sub>N</sub>. The audio stream AS is furnished to e.g. a data bus, an antenna system, a storage medium etc.
Fig. 4 shows an audio player 3 suitable for decoding an audio stream AS', e.g. generated by an encoder 1 of Fig. 1, obtained from a data bus, antenna system, storage medium etc. The audio stream AS' is de-multiplexed in a de-multiplexer 30 to obtain the codes C<sub>T</sub>, C<sub>S</sub> and C<sub>N</sub>. These codes are furnished to a transient synthesizer 31, a sinusoidal synthesizer 32 and a noise synthesizer 33 respectively. From the transient code C<sub>T</sub>, the transient signal components are calculated in the transient synthesizer 31. In case the transient code indicates a shape function, the shape is calculated based on the received parameters. Further, the shape content is calculated based on the frequencies and amplitudes of the sinusoidal components. If the transient code C<sub>T</sub> indicates a step, then no transient is calculated. The total transient signal y<sub>T</sub> is a sum of all transients.
The sinusoidal code C<sub>S</sub> including the information encoded by the analyser 130 is used by the sinusoidal synthesizer 32 to generate signal y<sub>s</sub>. Referring now to Figures 5(a) and (b), the sinusoidal synthesizer 32 comprises a phase decoder (PD) 56 compatible with the phase encoder 46. Here, a dequantiser (DQ) 60 in conjunction with a second-order prediction filter (PF) 64 produces (an estimate of) the unwrapped phase ψ̂ from: the representation levels r; initial information φ̂(0), ω̂(0) provided to the prediction filter (PF) 64 and the initial quantization step for the quantization controller (QC) 62.
As illustrated in Figure 2(b), the frequency can be recovered from the unwrapped phase ψ̂ by differentiation. Assuming that the phase error at the decoder is approximately white and since differentiation amplifies the high frequencies, the differentiation can be combined with a low-pass filter to reduce the noise and, thus, to obtain an accurate estimate of the frequency at the decoder.
In the preferred embodiment, a filtering unit (FR) 58 approximates the differentiation which is necessary to obtain the frequency ω̂ from the unwrapped phase by procedures as forward, backward or central differences. This enables the decoder to produce as output the phases ψ̂ and frequencies ω̂ usable in a conventional manner to synthesize the sinusoidal component of the encoded signal.
At the same time, as the sinusoidal components of the signal are being synthesized, the noise code C<sub>N</sub> is fed to a noise synthesizer NS 33, which is mainly a filter, having a frequency response approximating the spectrum of the noise. The NS 33 generates reconstructed noise y<sub>N</sub> by filtering a white noise signal with the noise code C<sub>N</sub>. The total signal y(t) comprises the sum of the transient signal y<sub>T</sub> and the product of any amplitude decompression (g) and the sum of the sinusoidal signal y<sub>S</sub> and the noise signal y<sub>N</sub>. The audio player comprises two adders 36 and 37 to sum respective signals. The total signal is furnished to an output unit 35, which is e.g. a speaker.
Fig. 6 shows an audio system according to the invention comprising an audio coder 1 as shown in Fig. 1 and an audio player 3 as shown in Fig. 4. Such a system offers playing and recording features. The audio stream AS is furnished from the audio coder to the audio player over a communication channel 2, which may be a wireless connection, a data 20 bus or a storage medium. In case the communication channel 2 is a storage medium, the storage medium may be fixed in the system or may also be a removable disc, memory stick etc. The communication channel 2 may be part of the audio system, but will however often be outside the audio system.
Contents5
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 waysCites: the store holds 2 of 3
| Document | Relation | Office |
|---|---|---|
| EP0337636A | Cites | European Patent Office (EPO) |
| WO02056298A | Cites | World Intellectual Property Organization (WIPO) |
| AHMADI S ET AL: "Minimum-variance phase prediction and frame interpolation algorithms for low bit rate sinusoidal speech coding" ISCAS 2000 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, vol. 3, 28 May 2000 (2000-05-28), pages 730-733, XP010502635 | Non-patent | – |
| PURNHAGEN H: "Advances in parametric audio coding" APPLICATIONS OF SIGNAL PROCESSING TO AUDIO AND ACOUSTICS, 1999 IEEE WORKSHOP ON NEW PALTZ, NY, USA 17-20 OCT. 1999, PISCATAWAY, NJ, USA,IEEE, US, 17 October 1999 (1999-10-17), pages 31-34, XP010365061 ISBN: 0-7803-5612-8 | Non-patent | – |
| DEN BRINKER A C, GERRITS A J, SLUIJTER R J: "Phase transmission in a sinusoidal audio and speech coder" 115TH AES CONVENTION, AUDIO ENGINEERING SOCIETY , 10 - 13 October 2003, XP009028272 New York | Non-patent | – |
| MCAULAY R J ET AL: "SPEECH ANALYSIS/SYNTHESIS BASED ON A SINUSOIDAL REPRESENTATION" IEEE TRANSACTIONS ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING, IEEE INC. NEW YORK, US, vol. ASSP-34, no. 4, August 1986 (1986-08), pages 744-754, XP001002928 ISSN: 0096-3518 | Non-patent | – |
| EDLER B ET AL: "ASAC - ANALYSIS/SYNTHESIS AUDIO CODEC FOR VERY LOW BIT RATES" PREPRINTS OF PAPERS PRESENTED AT THE AES CONVENTION, XX, XX, 11 May 1996 (1996-05-11), pages 1-15, XP001062332 | Non-patent | – |
23 members in 14 offices
Priority claims11
| Document | Office | Kind | Date |
|---|---|---|---|
| 02080002 | European Patent Office (EPO) | A | |
| 02080002 | European Patent Office (EPO) | A | |
| 02080002 | European Patent Office (EPO) | – | |
| 0305019 | International Bureau of the World Intellectual Property Organization (WIPO) | W | |
| 0305019 | International Bureau of the World Intellectual Property Organization (WIPO) | W | |
| 03758591 | European Patent Office (EPO) | A | |
| 02080002 | – | – | – |
| EP20020080002 | – | – | – |
| EP20030758591 | – | – | – |
| IB2003005019 | – | – | – |
| WO2003IB05019 | – | – | – |
Members23
| Document | Office | Kind | |
|---|---|---|---|
| WO2004051627A1 | World Intellectual Property Organization (WIPO) | A1 | |
| AU2003274617A1 | Australia | A1 | |
| AU2003274617A8 | Australia | A8 | |
| MXPA05005601A | Mexico | A | |
| KR20050086871A | Republic of Korea | A | |
| EP1568012A1 | European Patent Office (EPO) | A1 | |
| BR0316663A | Brazil | A | |
| CN1717719A | China | A | |
| PL376861A1 | Poland | A1 | |
| RU2005120380A | Russian Federation | A | |
| US2006036431A1 | United States of America | A1 | |
| JP2006508394A | Japan | A | |
| EP1568012B1This record | European Patent Office (EPO) | B1 | |
| AT381092T | Austria | T | |
| ATE381092T1 | Austria | T1 | |
| DE60318102D1 | Germany | D1 | |
| ES2298568T3 | Spain | T3 | |
| DE60318102T2 | Germany | T2 | |
| RU2353980C2 | Russian Federation | C2 | |
| CN100559467C | China | C | |
| US7664633B2 | United States of America | B2 | |
| JP4606171B2 | Japan | B2 | |
| KR101016995B1 | Republic of Korea | B1 |
67 legal events, as 7 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 | |
| Gb: european patent ceased through non-payment of renewal feeCeasedGBPC | GBPC | EP | |
| Application deemed withdrawn, or ip right lapsed, due to non-payment of renewal feeWithdrawnR119 | R119 | 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 | |
| Fee paymentPLFP | PLFP | FR | |
| Change of representativeR082 | R082 | DE | |
| Fee paymentPLFP | PLFP | FR | |
| Fee paymentPLFP | PLFP | FR | |
| Change of addressCA | CA | FR | |
| Change of name or company nameCD | CD | FR | |
| 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 | |
| Change of applicant/patenteeR081 | R081 | DE | |
| Change of representativeR082 | R082 | DE | |
| Change of representativeR082 | R082 | DE | |
| Change of representativeR082 | R082 | DE | |
| Announcement of lapse in spainLapsedFD2A | FD2A | ES | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | 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 | |
| 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 | |
| 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 | |
| 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 | |
| No opposition filedOpposition26N | 26N | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | 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 | |
| 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 | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Fr: translation filedET | ET | 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 ceasedCeasedPL | PL | CH | |
| Nl: lapsed or annulled due to failure to fulfill the requirements of art. 29p and 29m of the patents actLapsedNLV1 | NLV1 | 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 | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Definitive protectionFG2A | FG2A | ES | |
| 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 | |
| Corresponds to:REF | REF | EP | |
| European patents granted designating irelandGrantedFG4D | FG4D | IE | |
| European patent takes effect as a national patent in ch/liEP | EP | CH | |
| Designated contracting statesAK | AK | EP | |
| European patent grantedGrantedFG4D | FG4D | GB | |
| (expected) grantORIGINAL CODE: 0009210GRAA | GRAA | EP | |
| Grant fee paidORIGINAL CODE: EPIDOSNIGR3GRAS | GRAS | EP | |
| Title (correction)AUDIO DECODINGRTI1 | RTI1 | EP | |
| Despatch of communication of intention to grant a patentORIGINAL CODE: EPIDOSNIGR1GRAP | GRAP | EP | |
| Request for extension of the european patent (deleted)DAX | DAX | EP | |
| Request for examination filed17P | 17P | EP | |
| Designated contracting statesAK | AK | EP | |
| Request for extension of the european patentAX | AX | 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
- 1568012
- Publication, DOCDB
- 1568012
- Publication, EPODOC
- EP1568012
- Application
- 3758591
- Application, DOCDB
- 03758591
- Application, EPODOC
- EP20030758591
Titles3
- German
- AUDIODEKODIERUNG
- English
- AUDIO DECODING
- French
- DECODAGE AUDIO
Classification
- CPC, 2
- G10L19/093
- G10L19/02
- IPC, 3
- G10L19 08
- G10L19 093
- G10L25 90
Designated states1
- Contracting states, 1
- Türkiye