Multi-channel audio coding using complex prediction and window shape information

0001The present invention is related to audio processing and, particularly, to multi-channel audio processing of a multi-channel signal having two or more channel signals.

0002It is known in the field of multi-channel or stereo processing to apply the so-called mid/side stereo coding. In this concept, a combination of the left or first audio channel signal and the right or second audio channel signal is formed to obtain a mid or mono signal M. Additionally, a difference between the left or first channel signal and the right or second channel signal is formed to obtain the side signal S. This mid/side coding method results in a significant coding gain, when the left signal and the right signal are quite similar to each other, since the side signal will become quite small. Typically, a coding gain of a quantizer/entropy encoder stage will become higher, when the range of values to be quantized/entropy-encoded becomes smaller. Hence, for a PCM or a Huffman-based or arithmetic entropy-encoder, the coding gain increases, when the side signal becomes smaller. There exist, however, certain situations in which the mid/side coding will not result in a coding gain. The situation can occur when the signals in both channels are phase-shifted to each other, for example, by 90°. Then, the mid signal and the side signal can be in a quite similar range and, therefore, coding of the mid signal and the side signal using the entropy-encoder will not result in a coding gain and can even result in an increased bit rate. Therefore, a frequency-selective mid/side coding can be applied in order to deactivate the mid/side coding in bands, where the side signal does not become smaller to a certain degree with respect to the original left signal, for example.

0003Although the side signal will become zero, when the left and right signals are identical, resulting in a maximum coding gain due to the elimination of the side signal, the situation once again becomes different when the mid signal and the side signal are identical with respect to the shape of the waveform, but the only difference between both signals is their overall amplitudes. In this case, when it is additionally assumed that the side signal has no phase-shift to the mid signal, the side signal significantly increases, although, on the other hand, the mid signal does not decrease so much with respect to its value range. When such a situation occurs in a certain frequency band, then one would again deactivate mid/side coding due to the lack of coding gain. Mid/side coding can be applied frequency-selectively or can alternatively be applied in the time domain.

0004There exist alternative multi-channel coding techniques which do not rely on a kind of a waveform approach as mid/side coding, but which rely on the parametric processing based on certain binaural cues. Such techniques are known under the term "binaural cue coding", "parametric stereo coding" or "MPEG Surround coding". Here, certain cues are calculated for a plurality of frequency bands. These cues include inter-channel level differences, inter-channel coherence measures, inter-channel time differences and/or inter-channel phase differences. These approaches start from the assumption that a multi-channel impression felt by the listener does not necessarily rely on the detailed waveforms of the two channels, but relies on the accurate frequency-selectively provided cues or inter-channel information. This means that, in a rendering machine, care has to be taken to render multi-channel signals which accurately reflect the cues, but the waveforms are not of decisive importance.

0005This approach can be complex particularly in the case, when the decoder has to apply a decorrelation processing in order to artificially create stereo signals which are decorrelated from each other, although all these channels are derived from one and the same downmix channel. Decorrelators for this purpose are, depending on their implementation, complex and may introduce artifacts particularly in the case of transient signal portions. Additionally, in contrast to waveform coding, the parametric coding approach is a lossy coding approach which inevitably results in a loss of information not only introduced by the typical quantization but also introduced by looking on the binaural cues rather than the particular waveforms. This approach results in very low bit rates but may include quality compromises.

0006There exist recent developments for unified speech and audio coding (USAC) illustrated in <figref idref="f0011">Fig. 7a</figref>. A core decoder 700 performs a decoding operation of the encoded stereo signal at input 701, which can be mid/side encoded. The core decoder outputs a mid signal at line 702 and a side or residual signal at line 703. Both signals are transformed into a QMF domain by QMF filter banks 704 and 705. Then, an MPEG Surround decoder 706 is applied to generate a left channel signal 707 and a right channel signal 708. These low-band signals are subsequently introduced into a spectral band replication (SBR) decoder 709, which produces broad-band left and right signals on the lines 710 and 711, which are then transformed into a time domain by the QMF synthesis filter banks 712, 713 so that broad-band left and right signals L, R are obtained.

0007<figref idref="f0011">Fig. 7b</figref> illustrates the situation when the MPEG Surround decoder 706 would perform a mid/side decoding. Alternatively, the MPEG Surround decoder block 706 could perform a binaural cue based parametric decoding for generating stereo signals from a single mono core decoder signal. Naturally, the MPEG Surround decoder 706 could also generate a plurality of low band output signals to be input into the SBR decoder block 709 using parametric information such as inter-channel level differences, inter-channel coherence measures or other such inter-channel information parameters. When the MPEG Surround decoder block 706 performs the mid/side decoding illustrated in <figref idref="f0011">Fig. 7b</figref>, a real-gain factor g can be applied and DMX/RES and L/R are downmix/residual and left/right signals, respectively, represented in the complex hybrid QMF domain. Using a combination of a block 706 and a block 709 causes only a small increase in computational complexity compared to a stereo decoder used as a basis, because the complex QMF representation of the signal is already available as part of the SBR decoder. In a non-SBR configuration, however, QMF-based stereo coding, as proposed in the context of USAC, would result in a significant increase in computational complexity because of the necessary QMF banks which would require in this example 64-band analysis banks and 64-band synthesis banks. These filter banks would have to be added only for the purpose of stereo coding. In the MPEG USAC system under development, however, there also exist coding modes at high bit rates where SBR typically is not used.

0008The following documents are exemplary of multichannel audio (de)coding schemes whereby a difference signal is estimated from a downmix/sum/mono signal by means of a complex-valued prediction coefficient: <nplcit id="ncit0001" npl-type="s"><text>HEIKO PURNHAGEN ET AL: "Technical description of proposed Unified Stereo Coding in USAC",90. MPEG MEETING; 26-10-2009 - 30-10-2009; XIAN; (MOTION PICTURE EXPERT GROUP OR ISO/IEC JTC1/SC29/WG11), no. M16921, 23 October 2009 (2009-10-23</text></nplcit>).

0009<nplcit id="ncit0002" npl-type="b"><text>MAX NEUENDORF (EDITOR): "WD5 of USAC",90. MPEG MEETING; 26-10-2009 - 30-10-2009; XIAN; (MOTION PICTURE EXPERT GROUP OR ISO/IECJTC1/SC29/WG11), no. N11040, 8 December 2009 (2009-12-08), pages 1-146</text></nplcit>.

0010<patcit id="pcit0001" dnum="WO2009141775A1"><text>WO 2009/141775 A1</text></patcit> (KONINKL PHILIPS ELECTRONICS NV [NL]; SCHUIJERS ERIK G P [NL]) 26 November 2009 (2009-11-26).

0011Furthermore, reference is made to post-published <patcit id="pcit0002" dnum="WO2011124608A"><text>WO 2011/124608</text></patcit>.

0012It is an objective of the present invention to provide an improved audio processing concept which, on the one hand, yields high coding gain and, on the other hand, results in a good audio quality and/or reduced computational complexity. This objective is achieved by an audio decoder in accordance with claim 1, an audio encoder in accordance with claim 13, a method of audio decoding in accordance with claim 17, a method of audio encoding in accordance with claim 18 and a computer program in accordance with claim 19. The present invention relies on the finding that a coding gain of the high quality waveform coding approach can be significantly enhanced by a prediction of a second combination signal using a first combination signal, where both combination signals are derived from the original channel signals using a combination rule such as the mid/side combination rule. It has been found that this prediction information is calculated by a predictor in an audio encoder so that an optimization target is fulfilled, incurs only a small overhead, but results in a significant decrease of bit rate required for the side signal without losing any audio quality, since the inventive prediction is nevertheless a waveform-based coding and not a parameter-based stereo or multi-channel coding approach. In order to reduce computational complexity, it is preferred to perform frequency-domain encoding, where the prediction information is derived from frequency domain input data in a band-selective way. The conversion algorithm for converting the time domain representation into a spectral representation is preferably a critically sampled process such as a modified discrete cosine transform (MDCT) or a modified discrete sine transform (MDST), which is different from a complex transform in that only real values or only imaginary values are calculated, while, in a complex transform, real and complex values of a spectrum are calculated resulting in 2-times oversampling.

0013Preferably, a transform based on aliasing introduction and cancellation is used. The MDCT, in particular, is such a transform and allows a cross-fading between subsequent blocks without any overhead due to the well-known time domain aliasing cancellation (TDAC) property which is obtained by overlap-add-processing on the decoder side.

0014Preferably, the prediction information calculated in the encoder, transmitted to the decoder and used in the decoder comprises an imaginary part which can advantageously reflect phase differences between the two audio channels in arbitrarily selected amounts between 0° and 360°. Computational complexity is significantly reduced when only a real-valued transform or, in general, a transform is applied which either provides a real spectrum only or provides an imaginary spectrum only. In order to make use of this imaginary prediction information which indicates a phase shift between a certain band of the left signal and a corresponding band of the right signal, a real-to-imaginary converter or, depending on the implementation of the transform, an imaginary-to-real converter is provided in the decoder in order to calculate a prediction residual signal from the first combination signal, which is phase-rotated with respect to the original combination signal. This phase-rotated prediction residual signal can then be combined with the prediction residual signal transmitted in the bit stream to regenerate a side signal which, finally, can be combined with the mid signal to obtain the decoded left channel in a certain band and the decoded right channel in this band.

0015To increase audio quality, the same real-to-imaginary or imaginary-to-real converter which is applied on the decoder side is implemented on the encoder side as well, when the prediction residual signal is calculated in the encoder.

0016The present invention is advantageous in that it provides an improved audio quality and a reduced bit rate compared to systems having the same bit rate or having the same audio quality.

0017Additionally, advantages with respect to computational efficiency of unified stereo coding useful in the MPEG USAC system at high bit rates are obtained, where SBR is typically not used. Instead of processing the signal in the complex hybrid QMF domain, these approaches implement residual-based predictive stereo coding in the native MDCT domain of the underlying stereo transform coder. In accordance with an aspect of the present invention, the present invention comprises an apparatus or method for generating a stereo signal by complex prediction in the MDCT domain, wherein the complex prediction is done in the MDCT domain using a real-to-complex transform, where this stereo signal can either be an encoded stereo signal on the encoder-side or can alternatively be a decoded/transmitted stereo signal, when the apparatus or method for generating the stereo signal is applied on the decoder-side. Preferred embodiments of the present invention are subsequently discussed with respect to the accompanying drawings, in which: <dl id="dl0001" compact="compact"><dt>Fig. 1</dt><dd>is a diagram of an audio decoder;</dd><dt>Fig. 2</dt><dd>is a block diagram of an audio encoder;</dd><dt>Fig. 3a</dt><dd>illustrates an implementation of the encoder calculator of <figref idref="f0002">Fig. 2</figref>;</dd><dt>Fig. 3b</dt><dd>illustrates an alternative implementation of the encoder calculator of <figref idref="f0002">Fig. 2</figref>;</dd><dt>Fig. 3c</dt><dd>illustrates a mid/side combination rule to be applied on the encoder side;</dd><dt>Fig. 4a</dt><dd>illustrates an implementation of the decoder calculator of <figref idref="f0001">Fig. 1</figref>;</dd><dt>Fig. 4b</dt><dd>illustrates an alternative implementation of the decoder calculator in form of a matrix calculator;</dd><dt>Fig. 4c</dt><dd>illustrates a mid/side inverse combination rule corresponding to the combination rule illustrated in <figref idref="f0004">Fig. 3c</figref>;</dd><dt>Fig. 5a</dt><dd>illustrates an embodiment of an audio encoder operating in the frequency domain which is preferably a real-valued frequency domain;</dd><dt>Fig. 5b</dt><dd>illustrates an implementation of an audio decoder operating in the frequency domain;</dd><dt>Fig. 6a</dt><dd>illustrates an alternative implementation of an audio encoder operating in the MDCT domain and using a real-to-imaginary transform in accordance with an embodiment of the present invention;</dd><dt>Fig. 6b</dt><dd>illustrates an audio decoder operating in the MDCT domain and using a real-to-imaginary transform in accordance with an embodiment of the present invention;</dd><dt>Fig. 7a</dt><dd>illustrates an audio postprocessor using a stereo decoder and a subsequently connected SBR decoder;</dd><dt>Fig. 7b</dt><dd>illustrates a mid/side upmix matrix;</dd><dt>Fig. 8a</dt><dd>illustrates a detailed view on the MDCT block in <figref idref="f0009">Fig. 6a</figref>;</dd><dt>Fig. 8b</dt><dd>illustrates a detailed view on the MDCT^-1 block of <figref idref="f0010">Fig. 6b</figref>;</dd><dt>Fig. 9a</dt><dd>illustrates an implementation of an optimizer operating on reduced resolution with respect to the MDCT output;</dd><dt>Fig. 9b</dt><dd>illustrates a representation of an MDCT spectrum and the corresponding lower resolution bands in which the prediction information is calculated;</dd><dt>Fig. 10a</dt><dd>illustrates an implementation of the real-to-imaginary transformer in <figref idref="f0009">Fig. 6a</figref> or <figref idref="f0010">Fig. 6b</figref>; and</dd><dt>Fig. 10b</dt><dd>illustrates a possible implementation of the imaginary spectrum calculator of <figref idref="f0014">Fig. 10a</figref>.</dd></dl><figref idref="f0001">Fig. 1</figref> illustrates an audio decoder for decoding an encoded multi-channel audio signal obtained at an input line 100. The encoded multi-channel audio signal comprises an encoded first combination signal generated using a combination rule for combining a first channel signal and a second channel signal representing the multi-channel audio signal, an encoded prediction residual signal and prediction information. The encoded multi-channel signal can be a data stream such as a bitstream which has the three components in a multiplexed form. Additional side information can be included in the encoded multi-channel signal on line 100. The signal is input into an input interface 102. The input interface 102 can be implemented as a data stream demultiplexer which outputs the encoded first combination signal on line 104, the encoded residual signal on line 106 and the prediction information on line 108. Preferably, the prediction information is a factor having a real part not equal to zero and/or an imaginary part different from zero. The encoded combination signal and the encoded residual signal are input into a signal decoder 110 for decoding the first combination signal to obtain a decoded first combination signal on line 112. Additionally, the signal decoder 110 is configured for decoding the encoded residual signal to obtain a decoded residual signal on line 114. Depending on the encoding processing on an audio encoder side, the signal decoder may comprise an entropy-decoder such as a Huffman decoder, an arithmetic decoder or any other entropy-decoder and a subsequently connected dequantization stage for performing a dequantization operation matching with a quantizer operation in an associated audio encoder. The signals on line 112 and 114 are input into a decoder calculator 115, which outputs the first channel signal on line 117 and a second channel signal on line 118, where these two signals are stereo signals or two channels of a multi-channel audio signal. When, for example, the multi-channel audio signal comprises five channels, then the two signals are two channels from the multi-channel signal. In order to fully encode such a multi-channel signal having five channels, two decoders illustrated in <figref idref="f0001">Fig. 1</figref> can be applied, where the first decoder processes the left channel and the right channel, the second decoder processes the left surround channel and the right surround channel, and a third mono decoder would be used for performing a mono-encoding of the center channel. Other groupings, however, or combinations of wave form coders and parametric coders can be applied as well. An alternative way to generalize the prediction scheme to more than two channels would be to treat three (or more) signals at the same time, i.e., to predict a 3rd combination signal from a 1st and a 2nd signal using two prediction coefficients, very similarly to the "two-to-three" module in MPEG Surround.

0018The decoder calculator 116 is configured for calculating a decoded multi-channel signal having the decoded first channel signal 117 and the decoded second channel signal 118 using the decoded residual signal 114, the prediction information 108 and the decoded first combination signal 112. Particularly, the decoder calculator 116 is configured to operate in such a way that the decoded first channel signal and the decoded second channel signal are at least an approximation of a first channel signal and a second channel signal of the multi-channel signal input into a corresponding encoder, which are combined by the combination rule when generating the first combination signal and the prediction residual signal. Specifically, the prediction information on line 108 comprises a real-valued part different from zero and/or an imaginary part different from zero.

0019The decoder calculator 116 can be implemented in different manners. A first implementation is illustrated in <figref idref="f0005">Fig. 4a</figref>. This implementation comprises a predictor 1160, a combination signal calculator 1161 and a combiner 1162. The predictor receives the decoded first combination signal 112 and the prediction information 108 and outputs a prediction signal 1163. Specifically, the predictor 1160 is configured for applying the prediction information 108 to the decoded first combination signal 112 or a signal derived from the decoded first combination signal. The derivation rule for deriving the signal to which the prediction information 108 is applied may be a real-to-imaginary transform, or equally, an imaginary-to-real transform or a weighting operation, or depending on the implementation, a phase shift operation or a combined weighting/phase shift operation. The prediction signal 1163 is input together with the decoded residual signal into the combination signal calculator 1161 in order to calculate the decoded second combination signal 1165. The signals 112 and 1165 are both input into the combiner 1162, which combines the decoded first combination signal and the second combination signal to obtain the decoded multi-channel audio signal having the decoded first channel signal and the decoded second channel signal on output lines 1166 and 1167, respectively. Alternatively, the decoder calculator is implemented as a matrix calculator 1168 which receives, as input, the decoded first combination signal or signal M, the decoded residual signal or signal D and the prediction information α 108. The matrix calculator 1168 applies a transform matrix illustrated as 1169 to the signals M, D to obtain the output signals L, R, where L is the decoded first channel signal and R is the decoded second channel signal. The notation in <figref idref="f0006">Fig. 4b</figref> resembles a stereo notation with a left channel L and a right channel R. This notation has been applied in order to provide an easier understanding, but it is clear to those skilled in the art that the signals L, R can be any combination of two channel signals in a multi-channel signal having more than two channel signals. The matrix operation 1169 unifies the operations in blocks 1160, 1161 and 1162 of <figref idref="f0005">Fig. 4a</figref> into a kind of "single-shot" matrix calculation, and the inputs into the <figref idref="f0005">Fig. 4a</figref> circuit and the outputs from the <figref idref="f0005">Fig. 4a</figref> circuit are identical to the inputs into the matrix calculator 1168 or the outputs from the matrix calculator 1168.

0020<figref idref="f0006">Fig. 4c</figref> illustrates an example for an inverse combination rule applied by the combiner 1162 in <figref idref="f0005">Fig. 4a</figref>. Particularly, the combination rule is similar to the decoder-side combination rule in well-known mid/side coding, where L = M + S, and R = M - S. It is to be understood that the signal S used by the inverse combination rule in <figref idref="f0006">Fig. 4c</figref> is the signal calculated by the combination signal calculator, i.e. the combination of the prediction signal on line 1163 and the decoded residual signal on line 114. It is to be understood that in this specification, the signals on lines are sometimes named by the reference numerals for the lines or are sometimes indicated by the reference numerals themselves, which have been attributed to the lines. Therefore, the notation is such that a line having a certain signal is indicating the signal itself. A line can be a physical line in a hardwired implementation. In a computerized implementation, however, a physical line does not exist, but the signal represented by the line is transmitted from one calculation module to the other calculation module.

0021<figref idref="f0002">Fig. 2</figref> illustrates an audio encoder for encoding a multi-channel audio signal 200 having two or more channel signals, where a first channel signal is illustrated at 201 and a second channel is illustrated at 202. Both signals are input into an encoder calculator 203 for calculating a first combination signal 204 and a prediction residual signal 205 using the first channel signal 201 and the second channel signal 202 and the prediction information 206, so that the prediction residual signal 205, when combined with a prediction signal derived from the first combination signal 204 and the prediction information 206 results in a second combination signal, where the first combination signal and the second combination signal are derivable from the first channel signal 201 and the second channel signal 202 using a combination rule.

0022The prediction information is generated by an optimizer 207 for calculating the prediction information 206 so that the prediction residual signal fulfills an optimization target 208. The first combination signal 204 and the residual signal 205 are input into a signal encoder 209 for encoding the first combination signal 204 to obtain an encoded first combination signal 210 and for encoding the residual signal 205 to obtain an encoded residual signal 211. Both encoded signals 210, 211 are input into an output interface 212 for combining the encoded first combination signal 210 with the encoded prediction residual signal 211 and the prediction information 206 to obtain an encoded multi-channel signal 213, which is similar to the encoded multi-channel signal 100 input into the input interface 102 of the audio decoder illustrated in <figref idref="f0001">Fig. 1</figref>.

0023Depending on the implementation, the optimizer 207 receives either the first channel signal 201 and the second channel signal 202, or as illustrated by lines 214 and 215, the first combination signal 214 and the second combination signal 215 derived from a combiner 2031 of <figref idref="f0003">Fig. 3a</figref>, which will be discussed later.

0024A preferred optimization target is illustrated in <figref idref="f0002">Fig. 2</figref>, in which the coding gain is maximized, i.e. the bit rate is reduced as much as possible. In this optimization target, the residual signal D is minimized with respect to α. This means, in other words, that the prediction information α is chosen so that ∥S - αM∥² is minimized. This results in a solution for α illustrated in <figref idref="f0002">Fig. 2</figref>. The signals S, M are given in a block-wise manner and are preferably spectral domain signals, where the notation ∥...∥ means the 2-norm of the argument, and where <...> illustrates the dot product as usual. When the first channel signal 201 and the second channel signal 202 are input into the optimizer 207, then the optimizer would have to apply the combination rule, where an exemplary combination rule is illustrated in <figref idref="f0004">Fig. 3c</figref>. When, however, the first combination signal 214 and the second combination signal 215 are input into the optimizer 207, then the optimizer 207 does not need to implement the combination rule by itself. Other optimization targets may relate to the perceptual quality. An optimization target can be that a maximum perceptual quality is obtained. Then, the optimizer would require additional information from a perceptual model. Other implementations of the optimization target may relate to obtaining a minimum or a fixed bit rate. Then, the optimizer 207 would be implemented to perform a quantization/entropy-encoding operation in order to determine the required bit rate for certain α values so that the α can be set to fulfill the requirements such as a minimum bit rate, or alternatively, a fixed bit rate. Other implementations of the optimization target can relate to a minimum usage of encoder or decoder resources. In case of an implementation of such an optimization target, information on the required resources for a certain optimization would be available in the optimizer 207. Additionally, a combination of these optimization targets or other optimization targets can be applied for controlling the optimizer 207 which calculates the prediction information 206. The encoder calculator 203 in <figref idref="f0002">Fig. 2</figref> can be implemented in different ways, where an exemplary first implementation is illustrated in <figref idref="f0003">Fig. 3a</figref>, in which an explicit combination rule is performed in the combiner 2031. An alternative exemplary implementation is illustrated in <figref idref="f0004">Fig. 3b</figref>, where a matrix calculator 2039 is used. The combiner 2031 in <figref idref="f0003">Fig. 3a</figref> may be implemented to perform the combination rule illustrated in <figref idref="f0004">Fig. 3c</figref>, which is exemplarily the well-known mid/side encoding rule, where a weighting factor of 0.5 is applied to all branches. However, other weighting factors or no weighting factors at all can be implemented depending on the implementation. Additionally, it is to be noted that other combination rules such as other linear combination rules or non-linear combination rules can be applied, as long as there exists a corresponding inverse combination rule which can be applied in the decoder combiner 1162 illustrated in <figref idref="f0005">Fig. 4a</figref>, which applies a combination rule that is inverse to the combination rule applied by the encoder. Any invertible prediction rule can be used, since the influence on the waveform is "balanced" by the prediction, i.e. any error is included in the transmitted residual signal, since the prediction operation performed by the optimizer 207 in combination with the encoder calculator 203 is a waveform-conserving process. The combiner 2031 outputs the first combination signal 204 and a second combination signal 2032. The first combination signal is input into a predictor 2033, and the second combination signal 2032 is input into the residual calculator 2034. The predictor 2033 calculates a prediction signal 2035, which is combined with the second combination signal 2032 to finally obtain the residual signal 205. Particularly, the combiner 2031 is configured for combining the two channel signals 201 and 202 of the multi-channel audio signal in two different ways to obtain the first combination signal 204 and the second combination signal 2032, where the two different ways are illustrated in an example in <figref idref="f0004">Fig. 3c</figref>. The predictor 2033 is configured for applying the prediction information to the first combination signal 204 or a signal derived from the first combination signal to obtain the prediction signal 2035. The signal derived from the combination signal can be derived by any non-linear or linear operation, where a real-to-imaginary transform/ imaginary-to-real transform is preferred, which can be implemented using a linear filter such as an FIR filter performing weighted additions of certain values. The residual calculator 2034 in <figref idref="f0003">Fig. 3a</figref> may perform a subtraction operation so that the prediction signal is subtracted from the second combination signal. However, other operations in the residual calculator are possible. Correspondingly, the combination signal calculator 1161 in <figref idref="f0005">Fig. 4a</figref> may perform an addition operation where the decoded residual signal 114 and the prediction signal 1163 are added together to obtain the second combination signal 1165.

0025<figref idref="f0007">Fig. 5a</figref> illustrates an audio encoder. Compared to the audio encoder illustrated in <figref idref="f0003">Fig. 3a</figref>, the first channel signal 201 is a spectral representation of a time domain first channel signal 55a. Correspondingly, the second channel signal 202 is a spectral representation of a time domain channel signal 55b. The conversion from the time domain into the spectral representation is performed by a time/frequency converter 50 for the first channel signal and a time/frequency converter 51 for the second channel signal. Preferably, but not necessarily, the spectral converters 50, 51 are implemented as real-valued converters. The conversion algorithm can be a discrete cosine transform, an FFT transform, where only the real-part is used, an MDCT or any other transform providing real-valued spectral values. Alternatively, both transforms can be implemented as an imaginary transform, such as a DST, an MDST or an FFT where only the imaginary part is used and the real part is discarded. Any other transform only providing imaginary values can be used as well. One purpose of using a pure real-valued transform or a pure imaginary transform is computational complexity, since, for each spectral value, only a single value such as magnitude or the real part has to be processed, or, alternatively, the phase or the imaginary part. In contrast to a fully complex transform such as an FFT, two values, i.e., the real part and the imaginary part for each spectral line would have to be processed which is an increase of computational complexity by a factor of at least 2. Another reason for using a real-valued transform here is that such a transform is usually critically sampled, and hence provides a suitable (and commonly used) domain for signal quantization and entropy coding (the standard "perceptual audio coding" paradigm implemented in "MP3", AAC, or similar audio coding systems).

0026<figref idref="f0007">Fig. 5a</figref> additionally illustrates the residual calculator 2034 as an adder which receives the side signal at its "plus" input and which receives the prediction signal output by the predictor 2033 at its "minus" input. Additionally, <figref idref="f0007">Fig. 5a</figref> illustrates the situation that the predictor control information is forwarded from the optimizer to the multiplexer 212 which outputs a multiplexed bit stream representing the encoded multi-channel audio signal. Particularly, the prediction operation is performed in such a way that the side signal is predicted from the mid signal as illustrated by the Equations to the right of <figref idref="f0007">Fig. 5a</figref>. Preferably, the predictor control information 206 is a factor as illustrated to the right in <figref idref="f0004">Fig. 3b</figref>. In an example in which the prediction control information only comprises a real portion such as the real part of a complex-valued α or a magnitude of the complex-valued α, where this portion corresponds to a factor different from zero, a significant coding gain can be obtained when the mid signal and the side signal are similar to each other due to their waveform structure, but have different amplitudes. When, however, the prediction control information only comprises a second portion which can be the imaginary part of a complex-valued factor or the phase information of the complex-valued factor, where the imaginary part or the phase information is different from zero, the present invention achieves a significant coding gain for signals which are phase shifted to each other by a value different from 0° or 180°, and which have, apart from the phase shift, similar waveform characteristics and similar amplitude relations. Preferably, a prediction control information is complex-valued. Then, a significant coding gain can be obtained for signals being different in amplitude and being phase shifted. In a situation in which the time/frequency transforms provide complex spectra, the operation 2034 would be a complex operation in which the real part of the predictor control information is applied to the real part of the complex spectrum M and the imaginary part of the complex prediction information is applied to the imaginary part of the complex spectrum. Then, in adder 2034, the result of this prediction operation is a predicted real spectrum and a predicted imaginary spectrum, and the predicted real spectrum would be subtracted from the real spectrum of the side signal S (band-wise), and the predicted imaginary spectrum would be subtracted from the imaginary part of the spectrum of S to obtain a complex residual spectrum D. The time-domain signals L and R are real-valued signals, but the frequency-domain signals can be real- or complex-valued. When the frequency-domain signals are real-valued, then the transform is a real-valued transform. When the frequency domain signals are complex, then the transform is a complex-valued transform. This means that the input to the time-to-frequency and the output of the frequency-to-time transforms are real-valued, while the frequency domain signals could e.g. be complex-valued QMF-domain signals. <figref idref="f0008">Fig. 5b</figref> illustrates an audio decoder corresponding to the audio encoder illustrated in <figref idref="f0007">Fig. 5a</figref>. Similar elements with respect to the <figref idref="f0001">Fig. 1</figref> audio decoder have similar reference numerals. The bitstream output by bitstream multiplexer 212 in <figref idref="f0007">Fig. 5a</figref> is input into a bitstream demultiplexer 102 in <figref idref="f0008">Fig. 5b</figref>. The bitstream demultiplexer 102 demultiplexes the bitstream into the downmix signal M and the residual signal D. The downmix signal M is input into a dequantizer 110a. The residual signal D is input into a dequantizer 110b. Additionally, the bitstream demultiplexer 102 demultiplexes a predictor control information 108 from the bitstream and inputs same into the predictor 1160. The predictor 1160 outputs a predicted side signal α · M and the combiner 1161 combines the residual signal output by the dequantizer 110b with the predicted side signal in order to finally obtain the reconstructed side signal S. The signal is then input into the combiner 1162 which performs, for example, a sum/difference processing, as illustrated in <figref idref="f0006">Fig. 4c</figref> with respect to the mid/side encoding. Particularly, block 1162 performs an (inverse) mid/side decoding to obtain a frequency-domain representation of the left channel and a frequency-domain representation of the right channel. The frequency-domain representation is then converted into a time domain representation by corresponding frequency/time converters 52 and 53. Depending on the implementation of the system, the frequency/time converters 52, 53 are real-valued frequency/time converters when the frequency-domain representation is a real-valued representation, or complex-valued frequency/time converters when the frequency-domain representation is a complex-valued representation. For increasing efficiency, however, performing a real-valued transform is preferred as illustrated in another implementation in <figref idref="f0009">Fig. 6a</figref> for the encoder in accordance with an embodiment of the present invention and <figref idref="f0010">Fig. 6b</figref> for the decoder in accordance with an embodiment of the present invention. The real-valued transforms 50 and 51 are implemented by an MDCT. Additionally, the prediction information is calculated as a complex value having a real part and an imaginary part. Since both spectra M, S are real-valued spectra, and since, therefore, no imaginary part of the spectrum exists, a real-to-imaginary converter 2070 is provided which calculates an estimated imaginary spectrum 600 from the real-valued spectrum of signal M. This real-to-imaginary transformer 2070 is a part of the optimizer 207, and the imaginary spectrum 600 estimated by block 2070 is input into the α optimizer stage 2071 together with the real spectrum M in order to calculate the prediction information 206, which now has a real-valued factor indicated at 2073 and an imaginary factor indicated at 2074. Now, in accordance with this embodiment, the real-valued spectrum of the first combination signal M is multiplied by the real part α_R 2073 to obtain the prediction signal which is then subtracted from the real-valued side spectrum. Additionally, the imaginary spectrum 600 is multiplied by the imaginary part α_I illustrated at 2074 to obtain the further prediction signal, where this prediction signal is then subtracted from the real-valued side spectrum as indicated at 2034b. Then, the prediction residual signal D is quantized in quantizer 209b, while the real-valued spectrum of M is quantized/encoded in block 209a. Additionally, it is preferred to quantize and encode the prediction information α in the quantizer/entropy encoder 2072 to obtain the encoded complex α value which is forwarded to the bit stream multiplexer 212 of <figref idref="f0007">Fig. 5a</figref>, for example, and which is finally input into a bit stream as the prediction information.

0027Concerning the position of the quantization/coding (Q/C) module 2072 for α, it is noted that the multipliers 2073 and 2074 preferably use exactly the same (quantized) α that will be used in the decoder as well. Hence, one could move 2072 directly to the output of 2071, or one could consider that the quantization of α is already taken into account in the optimization process in 2071.

0028Although one could calculate a complex spectrum on the encoder-side, since all information is available, it is preferred to perform the real-to-complex transform in block 2070 in the encoder so that similar conditions with respect to a decoder illustrated in <figref idref="f0010">Fig. 6b</figref> are produced. The decoder receives a real-valued encoded spectrum of the first combination signal and a real-valued spectral representation of the encoded residual signal. Additionally, an encoded complex prediction information is obtained at 108, and an entropy-decoding and a dequantization is performed in block 65 to obtain the real part α_R illustrated at 1160b and the imaginary part α_I illustrated at 1160c. The mid signals output by weighting elements 1160b and 1160c are added to the decoded and dequantized prediction residual signal. Particularly, the spectral values input into weighter 1160c, where the imaginary part of the complex prediction factor is used as the weighting factor, are derived from the real-valued spectrum M by the real-to-imaginary converter 1160a, which is preferably implemented in the same way as block 2070 from <figref idref="f0009">Fig. 6a</figref> relating to the encoder side. On the decoder-side, a complex-valued representation of the mid signal or the side signal is not available, which is in contrast to the encoder-side. The reason is that only encoded real-valued spectra have been transmitted from the encoder to the decoder due to bit rates and complexity reasons.

0029The real-to-imaginary transformer 1160a or the corresponding block 2070 of <figref idref="f0009">Fig. 6a</figref> can be implemented as published in <patcit id="pcit0003" dnum="WO2004013839A1"><text>WO 2004/013839 A1</text></patcit> or <patcit id="pcit0004" dnum="WO2008014853A1"><text>WO 2008/014853 A1</text></patcit> or <patcit id="pcit0005" dnum="US6980933B"><text>U.S. Patent No. 6,980,933</text></patcit>. Alternatively, any other implementation known in the art can be applied, and a preferred implementation is discussed in the context of <figref idref="f0014">Figs. 10a</figref>, <figref idref="f0015">10b</figref>.

0030Specifically, as illustrated in <figref idref="f0014">Fig. 10a</figref>, the real-to-imaginary converter 1160a comprises a spectral frame selector 1000 connected to an imaginary spectrum calculator 1001. The spectral frame selector 1000 receives an indication of a current frame i at input 1002 and, depending on the implementation, control information at a control input 1003. When, for example, the indication on line 1002 indicates that an imaginary spectrum for a current frame i is to be calculated, and when the control information 1003 indicates that only the current frame is to be used for that calculation, then the spectral frame selector 1000 only selects the current frame i and forwards this information to the imaginary spectrum calculator. Then, the imaginary spectrum calculator only uses the spectral lines of the current frame i to perform a weighted combination of lines positioned in the current frame (block 1008), with respect to frequency, close to or around the current spectral line k, for which an imaginary line is to be calculated as illustrated at 1004 in <figref idref="f0015">Fig. 10b</figref>. When, however, the spectral frame selector 1000 receives a control information 1003 indicating that the preceding frame i-1 and the following frame i+1 are to be used for the calculation of the imaginary spectrum as well, then the imaginary spectrum calculator additionally receives the values from frames i-1 and i+1 and performs a weighted combination of the lines in the corresponding frames as illustrated at 1005 for frame i-1 and at 1006 for frame i+1. The results of the weighting operations are combined by a weighted combination in block 1007 to finally obtain an imaginary line k for the frame f_i which is then multiplied by the imaginary part of the prediction information in element 1160c to obtain the prediction signal for this line which is then added to the corresponding line of the mid signal in adder 1161b for the decoder. In the encoder, the same operation is performed, but a subtraction in element 2034b is done.

0031It has to be noted that the control information 1003 can additionally indicate to use more frames than the two surrounding frames or to, for example, only use the current frame and exactly one or more preceding frames but not using "future" frames in order to reduce the systematic delay.

0032Additionally, it is to be noted that the stage-wise weighted combination illustrated in <figref idref="f0015">Fig. 10b</figref>, in which, in a first operation, the lines from one frame are combined and, subsequently, the results from these frame-wise combination operations are combined by themselves can also be performed in the other order. The other order means that, in a first step, the lines for the current frequency k from a number of adjacent frames indicated by control information 103 are combined by a weighted combination. This weighted combination is done for the lines k, k-1, k-2, k+1, k+2 etc. depending on the number of adjacent lines to be used for estimating the imaginary line. Then, the results from these "time-wise" combinations are subjected to a weighted combination in the "frequency direction" to finally obtain the imaginary line k for the frame f_i. The weights are set to be valued between -1 and 1, preferably, and the weights can be implemented in a straight-forward FIR or IIR filter combination which performs a linear combination of spectral lines or spectral signals from different frequencies and different frames.

0033As indicated in <figref idref="f0009">Figs. 6a</figref> and <figref idref="f0010">6b</figref>, the preferred transform algorithm is the MDCT transform algorithm which is applied in the forward direction in elements 50 and 51 in <figref idref="f0009">Fig. 6a</figref> and which is applied in the backward direction in elements 52, 53, subsequent to a combination operation in the combiner 1162 operating in the spectral domain.

0034<figref idref="f0012">Fig. 8a</figref> illustrates a more detailed implementation of block 50 or 51. Particularly, a sequence of time domain audio samples is input into an analysis windower 500 which performs a windowing operation using an analysis window and, particularly, performs this operation in a frame by frame manner, but using a stride or overlap of 50 %. The result of the analysis windower, i.e., a sequence of frames of windowed samples is input into an MDCT transform block 501, which outputs the sequence of real-valued MDCT frames, where these frames are aliasing-affected. Exemplarily, the analysis windower applies analysis windows having a length of 2048 samples. Then, the MDCT transform block 501 outputs MDCT spectra having 1024 real spectral lines or MDCT values. Preferably, the analysis windower 500 and/or the MDCT transformer 501 are controllable by a window length or transform length control 502 so that, for example, for transient portions in the signal, the window length/transform length is reduced in order to obtain better coding results.

0035<figref idref="f0012">Fig. 8b</figref> illustrates the inverse MDCT operation performed in blocks 52 and 53. Exemplarily, block 52 comprises a block 520 for performing a frame-by-frame inverse MDCT transform. When, for example, a frame of MDCT values has 1024 values, then the output of this MDCT inverse transform has 2048 aliasing-affected time samples. Such a frame is supplied to a synthesis windower 521, which applies a synthesis window to this frame of 2048 samples. The windowed frame is then forwarded to an overlap/add processor 522 which, exemplarily, applies a 50 % overlap between two subsequent frames and, then, performs a sample by sample addition so that a 2048 samples block finally results in 1024 new samples of the aliasing free output signal. Again, it is preferred to apply a window/transform length control using information which is, for example, transmitted in the side information of the encoded multi-channel signal as indicated at 523.

0036The α prediction values could be calculated for each individual spectral line of an MDCT spectrum. However, it has been found that this is not necessary and a significant amount of side information can be saved by performing a band-wise calculation of the prediction information. Stated differently, a spectral converter 50 illustrated in <figref idref="f0013">Fig. 9</figref> which is, for example, an MDCT processor as discussed in the context of <figref idref="f0012">Fig. 8a</figref> provides a high-frequency resolution spectrum having certain spectral lines illustrated in <figref idref="f0013">Fig. 9b</figref>. This high frequency resolution spectrum is used by a spectral line selector 90 that provides a low frequency resolution spectrum which comprises certain bands B1, B2, B3, ... , BN. This low frequency resolution spectrum is forwarded to the optimizer 207 for calculating the prediction information so that a prediction information is not calculated for each spectral line, but only for each band. To this end, the optimizer 207 receives the spectral lines per band and calculates the optimization operation starting from the assumption that the same α value is used for all spectral lines in the band.

0037Preferably, the bands are shaped in a psychoacoustic way so that the bandwidth of the bands increases from lower frequencies to higher frequencies as illustrated in <figref idref="f0013">Fig. 9b</figref>. Alternatively, although not as preferred as the increasing bandwidth implementation, equally-sized frequency bands could be used as well, where each frequency band has at least two or typically many more, such as at least 30 frequency lines. Typically, for a 1024 spectral lines spectrum, less than 30 complex α values, and preferably, more than 5 α values are calculated. For spectra with less than 1024 spectral lines (e.g. 128 lines), preferably, less frequency bands (e.g. 6) are used for α.

0038For calculating the α values the high resolution MDCT spectrum is not necessarily required. Alternatively, a filter bank having a frequency resolution similar to the resolution required for calculating the α values can be used as well. When bands increasing in frequency are to be implemented, then this filterbank should have varying bandwidth. When, however, a constant bandwidth from low to high frequencies is sufficient, then a traditional filter bank with equi-width sub-bands can be used.

0039Depending on the implementation, the sign of the α value indicated in <figref idref="f0004">Fig. 3b</figref> or <figref idref="f0006">4b</figref> can be reversed. To remain consistent, however, it is necessary that this reversion of the sign is used on the encoder side as well as on the decoder side. Compared to <figref idref="f0009">Fig. 6a</figref>, <figref idref="f0007">Fig. 5a</figref> illustrates a generalized view of the encoder, where item 2033 is a predictor that is controlled by the predictor control information 206, which is determined in item 207 and which is embedded as side information in the bitstream. Instead of the MDCT used in <figref idref="f0009">Fig. 6a</figref> in blocks 50, 51, a generalized time/frequency transform is used in <figref idref="f0007">Fig. 5a</figref> as discussed. As outlined earlier, <figref idref="f0009">Fig. 6a</figref> is the encoder process which corresponds to the decoder process in <figref idref="f0010">Fig. 6b</figref>, where L stands for the left channel signal, R stands for the right channel signal, M stands for the mid signal or downmix signal, S stands for the side signal and D stands for the residual signal. Alternatively, L is also called the first channel signal 201, R is also called the second channel signal 202, M is also called the first combination signal 204 and S is also called the second combination signal 2032.

0040Preferably, the modules 2070 in the encoder and 1160a in the decoder should exactly match in order to ensure correct waveform coding. This applies preferably to the case, in which these modules use some form of approximation such as truncated filters or when it is only made use of one or two instead of the three MDCT frames, i.e. the current MDCT frame on line 60, the preceding MDCT frame on line 61 and the next MDCT frame on line 62.

0041Additionally, it is preferred that the module 2070 in the encoder in <figref idref="f0009">Fig. 6a</figref> uses the non-quantized MDCT spectrum M as input, although the real-to-imaginary (R2I) module 1160a in the decoder has only the quantized MDCT spectrum available as input. Alternatively, one can also use an implementation in which the encoder uses the quantized MDCT coefficients as an input into the module 2070. However, using the non-quantized MDCT spectrum as input to the module 2070 is the preferred approach from a perceptual point of view.

0042Subsequently, several aspects of embodiments of the present invention are discussed in more detail.

0043Standard parametric stereo coding relies on the capability of the oversampled complex (hybrid) QMF domain to allow for time- and frequency-varying perceptually motivated signal processing without introducing aliasing artifacts. However, in case of downmix/residual coding (as used for the high bit rates considered here), the resulting unified stereo coder acts as a waveform coder. This allows operation in a critically sampled domain, like the MDCT domain, since the waveform coding paradigm ensures that the aliasing cancellation property of the MDCT-IMDCT processing chain is sufficiently well preserved.

0044However, to be able to exploit the improved coding efficiency that can be achieved in case of stereo signals with inter-channel time- or phase-differences by means of a complex-valued prediction coefficient <i>α,</i> a complex-valued frequency-domain representation of the downmix signal DMX is required as input to the complex-valued upmix matrix. This can be obtained by using an MDST transform in addition to the MDCT transform for the DMX signal. The MDST spectrum can be computed (exactly or as an approximation) from the MDCT spectrum.

0045Furthermore, the parameterization of the upmix matrix can be simplified by transmitting the complex prediction coefficient <i>α</i> instead of MPS parameters. Hence, only two parameters (real and imaginary part of <i>α</i>) are transmitted instead of three (ICC, CLD, and IPD). This is possible because of redundancy in the MPS parameterization in case of downmix/residual coding. The MPS parameterization includes information about the relative amount of decorrelation to be added in the decoder (i.e., the energy ratio between the RES and the DMX signals), and this information is redundant when the actual DMX and RES signals are transmitted.

0046Because of the same reason, the gain factor <i>g,</i> shown in the upmix matrix above, is obsolete in case of downmix/residual coding. Hence, the upmix matrix for downmix/residual coding with complex prediction is now: <maths id="math0001" num=""><math display="block"><mfenced open="[" close="]"><mtable><mtr><mtd><mi>L</mi></mtd></mtr><mtr><mtd><mi>R</mi></mtd></mtr></mtable></mfenced><mo>=</mo><mfenced open="[" close="]"><mtable><mtr><mtd><mrow><mn>1</mn><mo>−</mo><mi>α</mi></mrow></mtd><mtd><mn>1</mn></mtd></mtr><mtr><mtd><mrow><mn>1</mn><mo>+</mo><mi>α</mi></mrow></mtd><mtd><mrow><mo>−</mo><mn>1</mn></mrow></mtd></mtr></mtable></mfenced><mfenced open="[" close="]"><mtable><mtr><mtd><mi mathvariant="italic">DMX</mi></mtd></mtr><mtr><mtd><mi mathvariant="italic">RES</mi></mtd></mtr></mtable></mfenced><mo>.</mo></math><img file="EP2947653B1_D0001.tif" /></maths>

0047Compared to Equation 1169 in <figref idref="f0006">Fig. 4b</figref>, the sign of alpha is inverted in this equation, and DMX=M and RES=D. This is, therefore, an alternative implementation/notation with respect to <figref idref="f0006">Fig. 4b</figref>.

0048Two options are available for calculating the prediction residual signal in the encoder. One option is to use the quantized MDCT spectral values of the downmix. This would result in the same quantization error distribution as in M/S coding since encoder and decoder use the same values to generate the prediction. The other option is to use the non-quantized MDCT spectral values. This implies that encoder and decoder will not use the same data for generating the prediction, which allows for spatial redistribution of the coding error according to the instantaneous masking properties of the signal at the cost of a somewhat reduced coding gain.

0049It is preferable to compute the MDST spectrum directly in the frequency domain by means of two-dimensional FIR filtering of three adjacent MDCT frames as discussed. The latter can be considered as a "real-to-imaginary" (R2I) transform. The complexity of the frequency-domain computation of the MDST can be reduced in different ways, which means that only an approximation of the MDST spectrum is calculated: <ul id="ul0001" list-style="bullet"><li>Limiting the number of FIR filter taps.</li><li>Estimating the MDST from the current MDCT frame only.</li><li>Estimating the MDST from the current and previous MDCT frame.</li></ul>

0050As long as the same approximation is used in the encoder and decoder, the waveform coding properties are not affected. Such approximations of the MDST spectrum, however, can lead to a reduction in the coding gain achieved by complex prediction.

0051If the underlying MDCT coder supports window-shape switching, the coefficients of the two-dimensional FIR filter used to compute the MDST spectrum have to be adapted to the actual window shapes. The filter coefficients applied to the current frame's MDCT spectrum depend on the complete window, i.e. a set of coefficients is required for every window type and for every window transition. The filter coefficients applied to the previous/next frame's MDCT spectrum depend only on the window half overlapping with the current frame, i.e. for these a set of coefficients is required only for each window type (no additional coefficients for transitions).

0052If the underlying MDCT coder uses transform-length switching, including the previous and/or next MDCT frame in the approximation becomes more complicated around transitions between the different transforms lengths. Due to the different number of MDCT coefficients in the current and previous/next frame, the two-dimensional filtering is more complicated in this case. To avoid increasing computational and structural complexity, the previous/next frame can be excluded from the filtering at transform-length transitions, at the price of reduced accuracy of the approximation for the respective frames.

0053Furthermore, special care needs to be taken for the lowest and highest parts of the MDST spectrum (close to DC and fs/2), where less surrounding MDCT coefficients are available for FIR filtering than required. Here the filtering process needs to be adapted to compute the MDST spectrum correctly. This can either be done by using a symmetric extension of the MDCT spectrum for the missing coefficients (according to the periodicity of spectra of time discrete signals), or by adapting filter coefficients accordingly. The handling of these special cases can of course be simplified at the price of a reduced accuracy in vicinity of the borders of the MDST spectrum.

0054Computing the exact MDST spectrum from the transmitted MDCT spectra in the decoder increases the decoder delay by one frame (here assumed to be 1024 samples).

0055The additional delay can be avoided by using an approximation of the MDST spectrum that does not require the MDCT spectrum of the next frame as an input.

0056The following bullet list summarizes the advantages of the MDCT-based unified stereo coding over QMF-based unified stereo coding: <ul id="ul0002" list-style="bullet"><li>Only small increase in computational complexity (when SBR is not used).</li><li>Scales up to perfect reconstruction if MDCT spectra are not quantized. Note that this is not the case for QMF-based unified stereo coding.</li><li>Natural extension of M/S coding and intensity stereo coding.</li><li>Cleaner architecture that simplifies encoder tuning, since stereo signal processing and quantization/coding can be tightly coupled. Note that in QMF-based unified stereo coding, MPEG Surround frames and MDCT frames are not aligned and that scalefactor bands don't match parameter bands.</li><li>Efficient coding of stereo parameters, since only two parameters (complex <i>α</i>) instead of three parameters as in MPEG Surround (ICC, CLD, IPD) have to be transmitted.</li><li>No additional decoder delay if the MDST spectrum is computed as an approximation (without using the next frame).</li></ul>

0057Important properties of an implementation can be summarized as follows: <ol id="ol0001" ol-style=""><li>a) MDST spectra are computed by means of two-dimensional FIR filtering from current, previous, and next MDCT spectra. Different complexity/quality trade-offs for the MDST computation (approximation) are possible by reducing the number of FIR filter taps and/or the number of MDCT frames used. In particular, if an adjacent frame is not available because of frame loss during transmission or transform-length switching, that particular frame is excluded from the MDST estimation. For the case of transform-length switching the exclusion is signaled in the bitstream.</li><li>b) Only two parameters, the real and imaginary part of the complex prediction coefficient <i>α,</i> are transmitted instead of ICC, CLD, and IPD. The real and imaginary parts of <i>α</i> are handled independently, limited to the range [-3.0, 3.0] and quantized with a step size of 0.1. If a certain parameter (real or imaginary part of α) is not being used in a given frame, this is signaled in the bitstream, and the irrelevant parameter is not transmitted. The parameters are time-differentially or frequency-differentially coded and finally Huffman coding is applied using the scalefactor codebook. The prediction coefficients are updated every second scalefactor band, which results in a frequency resolution similar to that of MPEG Surround. This quantization and coding scheme results in an average bit rate of approximately 2 kb/s for the stereo side information within a typical configuration having a target bit rate of 96 kb/s.</li></ol>

0058Preferred additional or alternative implementation details comprise: <ul id="ul0003" list-style="none"><li>c) For each of the two parameters of <i>α</i>, one may choose non-differential (PCM) or differential (DPCM) coding on a per-frame or per-stream basis, signaled by a corresponding bit in the bit stream. For DPCM coding, either time- or frequency-differential coding is possible. Again, this may be signaled using a one-bit flag.</li><li>d) Instead of re-using a pre-defined code book such as the AAC scale factor book, one may also utilize a dedicated invariant or signal-adaptive code book to code the <i>α</i> parameter values, or one may revert to fixed-length (e.g. 4-bit) unsigned or two's-complement code words.</li><li>e) The range of <i>α</i> parameter values as well as the parameter quantization step size may be chosen arbitrarily and optimized to the signal characteristics at hand.</li><li>f) The number and spectral and/or temporal width of active <i>α</i> parameter bands may be chosen arbitrarily and optimized to the given signal characteristics. In particular, the band configuration may be signaled on a per-frame or per-stream basis.</li><li>g) In addition to or instead of the mechanisms outlined in a), above, it may be signaled explicitly by means of a bit per frame in the bitstream that only the MDCT spectrum of the current frame is used to compute the MDST spectrum approximation, i.e., that the adjacent MDCT frames are not taken into account.</li></ul>

0059Embodiments relate to an inventive system for unified stereo coding in the MDCT-domain. It enables to utilize the advantages of unified stereo coding in the MPEG USAC system even at higher bit rates (where SBR is not used) without the significant increase in computational complexity that would come with a QMF-based approach.

0060The following two lists summarize preferred configuration aspects described before, which can be used alternatively to each other or in addition to other aspects: <ul id="ul0004" list-style="none"><li>1a) general concept: complex prediction of side MDCT from mid MDCT and MDST;</li><li>1b) calculate/approximate MDST from MDCT ("R2I") in frequency domain using 1 or more frames (3-frames introduces delay);</li><li>1c) truncation of filter (even down to 1-frame 2-tap, i.e., [-1 0 1]) to reduce computational complexity;</li><li>1d) proper handling of DC and fs/2;</li><li>1e) proper handling of window shape switching;</li><li>1f) do not use previous/next frame if it has a different transform size;</li><li>1g) prediction based on non-quantized or quantized MDCT coefficients in the encoder;</li><li>2a) quantize and code real and imaginary part of complex prediction coefficient directly (i.e., no MPEG Surround parameterization);</li><li>2b) use uniform quantizer for this (step size e.g. 0.1);</li><li>2c) use appropriate frequency resolution for prediction coefficients (e.g. 1 coefficient per 2 Scale Factor Bands);</li><li>2d) cheap signaling in case all prediction coefficients are real;</li><li>2e) explicit bit per frame to force 1-frame R2I operation.</li></ul>

0061In an embodiment, the encoder additionally comprises: a spectral converter (50, 51) for converting a time-domain representation of the two channel signals to a spectral representation of the two channel signals having subband signals for the two channel signals, wherein the combiner (2031), the predictor (2033) and the residual signal calculator (2034) are configured to process each subband signal separately so that the first combined signal and the residual signal are obtained for a plurality of subbands, wherein the output interface (212) is configured for combining the encoded first combined signal and the encoded residual signal for the plurality of subbands.

0062Although some aspects have been described in the context of an apparatus, it is clear that these aspects also represent a description of the corresponding method, where a block or device corresponds to a method step or a feature of a method step. Analogously, aspects described in the context of a method step also represent a description of a corresponding block or item or feature of a corresponding apparatus.

0063In an embodiment of the present invention, a proper handling of window shape switching is applied. When <figref idref="f0014">Fig. 10a</figref> is considered, a window shape information 109 can be input into the imaginary spectrum calculator 1001. Specifically, the imaginary spectrum calculator which performs the real-to-imaginary conversion of the real-valued spectrum such as the MDCT spectrum (such as element 2070 in <figref idref="f0009">Fig. 6a</figref> or element 1160a in <figref idref="f0010">Fig. 6b</figref>) can be implemented as a FIR or IIR filter. The FIR or IIR coefficients in this real-to-imaginary module 1001 depend on the window shape of the left half and of the right half of the current frame. This window shape can be different for a sine window or a KBD (Kaiser Bessel Derived) window and, subject to the given window sequence configuration, can be a long window, a start window, a stop window, and stop-start window, or a short window. The real-to-imaginary module may comprise a two-dimensional FIR filter, where one dimension is the time dimension where two subsequent MDCT frames are input into the FIR filter, and the second dimension is the frequency dimension, where the frequency coefficients of a frame are input.

0064The subsequent table gives different MDST filter coefficients for a current window sequence for different window shapes and different implementations of the left half and the right half of the window. <tables id="tabl0001" num="0001"><table frame="all"><title><b>Table A</b> - <b>MDST Filter Parameters for Current Window</b></title><tgroup cols="3"><colspec colnum="1" colname="col1" colwidth="51mm" /><colspec colnum="2" colname="col2" colwidth="58mm" /><colspec colnum="3" colname="col3" colwidth="58mm" /><thead><row><entry align="center" valign="middle"><b>Current Window Sequence</b></entry><entry align="center" valign="middle"><b>Left Half: Sine Shape Right Half: Sine Shape</b></entry><entry align="center" valign="middle"><b>Left Half: KBD Shape Right Half: KBD Shape</b></entry></row></thead><tbody><row><entry align="center" valign="middle">ONLY_LONG_SEQUENCE, EIGHT_SHORT_SEQUENCE</entry><entry align="center" valign="middle">[0.000000, 0.000000, 0.500000, 0.000000, -0.500000, 0.000000, 0.000000]</entry><entry align="center" valign="middle">[0.091497, 0.581427, 0.000000, 0.000000 -0.581427, 0.000000 -0.091497]</entry></row><row><entry align="center" valign="middle">LONG_START_SEQUENCE</entry><entry align="center" valign="middle">[0.102658, 0.103791, 0.567149, 0.000000, -0.567149, -0.103791, -0.102658]</entry><entry align="center" valign="middle">[0.150512, 0.047969, 0.608574, 0.000000 -0.608574, -0.047969, -0.150512]</entry></row><row><entry align="center" valign="middle">LONG_STOP_SEQUENCE</entry><entry align="center" valign="middle">[0.102658, -0.103791, 0.567149, 0.000000, -0.567149, 0.103791, -0.102658]</entry><entry align="center" valign="middle">[0.150512, -0.047969, 0.608574, 0.000000 -0.608574, 0.047969, -0.150512]</entry></row><row><entry align="center" valign="middle">STOP_START_SEQUENCE</entry><entry align="center" valign="middle">[0.205316, 0.000000, 0.634298, 0.000000, -0.634298, 0.000000, -0.205316]</entry><entry align="center" valign="middle">[0.209526, 0.000000, 0.635722, 0.000000 -0.635722, 0.000000, -0.209526]</entry></row></tbody></tgroup><tgroup cols="3"><colspec colnum="1" colname="col1" colwidth="51mm" /><colspec colnum="2" colname="col2" colwidth="58mm" /><colspec colnum="3" colname="col3" colwidth="58mm" /><thead><row><entry align="center" valign="middle"><b>Current Window Sequence</b></entry><entry align="center" valign="middle"><b>Left Half: Sine Shape Right Half: KBD Shape</b></entry><entry align="center" valign="middle"><b>Left Half: KBD Shape Right Half: Sine Shape</b></entry></row></thead><tbody><row><entry align="center" valign="middle">ONLY_LONG_SEQUENCE, EIGHT_SHORT_SEQUENCE</entry><entry align="center" valign="middle">[0.045748, 0.057238, 0.540714, 0.000000, -0.540714, -0.057238, -0.045748]</entry><entry align="center" valign="middle">[0.045748, -0.057238, 0.540714, 0.000000 -0.540714, 0.057238, -0.045748]</entry></row><row><entry align="center" valign="middle">LONG_START_SEQUENCE</entry><entry align="center" valign="middle">[0.104763, 0.105207, 0.567861, 0.000000, -0.567861, -0.105207, -0.104763]</entry><entry align="center" valign="middle">[0.148406, 0.046553, 0.607863, 0.000000 -0.607863, -0.046553, -0.148406]</entry></row><row><entry align="center" valign="middle">LONG_STOP_SEQUENCE</entry><entry align="center" valign="middle">[0.148406, -0.046553, 0.607863, 0.000000, -0.607863, 0.046553, -0.148406]</entry><entry align="center" valign="middle">[0.104763, -0.105207, 0.567861, 0.000000, -0.567861, 0.105207, -0.104763]</entry></row><row><entry align="center" valign="middle">STOP_START_SEQUENCE</entry><entry align="center" valign="middle">[0.207421, 0.001416, 0.635010, 0.000000, -0.635010, -0.001416, -0.207421]</entry><entry align="center" valign="middle">[0.207421, -0.001416, 0.635010, 0.000000, -0.635010, 0.001416, -0.207421]</entry></row></tbody></tgroup></table></tables>

0065Additionally, the window shape information 109 provides window shape information for the previous window, when the previous window is used for calculating the MDST spectrum from the MDCT spectrum. Corresponding MDST filter coefficients for the previous window are given in the subsequent table. <tables id="tabl0002" num="0002"><table frame="all"><title><b>Table B - MDST Filter Parameters for Previous Window</b></title><tgroup cols="3"><colspec colnum="1" colname="col1" colwidth="63mm" /><colspec colnum="2" colname="col2" colwidth="52mm" /><colspec colnum="3" colname="col3" colwidth="52mm" /><thead><row><entry align="center" valign="middle"><b>Current Window Sequence</b></entry><entry align="center" valign="middle"><b>Left Half of Current Window: Sine Shape</b></entry><entry align="center" valign="middle"><b>Left Half of Current Window: KBD Shape</b></entry></row></thead><tbody><row><entry align="center" valign="middle">ONLY_LONG_SEQUENCE, LONG_START_SEQUENCE, EIGHT_SHORT_SEQUENCE</entry><entry align="center" valign="middle">[ 0.000000, 0.106103, 0.250000, 0.318310, 0.250000, 0.106103, 0.000000]</entry><entry align="center" valign="middle">[ 0.059509, 0.123714, 0.186579, 0.213077, 0.186579, 0.123714, 0.059509]</entry></row><row><entry align="center" valign="middle">LONG_STOP_SEQUENCE STOP_START_SEQUENCE</entry><entry align="center" valign="middle">[0.038498, 0.039212, 0.039645, 0.039790, 0.039645, 0.039212, 0.038498]</entry><entry align="center" valign="middle">[0.026142, 0.026413, 0.026577, 0.026631, 0.026577, 0.026413, 0.026142]</entry></row></tbody></tgroup></table></tables>

0066Hence, depending on the window shape information 109, the imaginary spectrum calculator 1001 in <figref idref="f0014">Fig. 10a</figref> is adapted by applying different sets of filter coefficients.

0067The window shape information which is used on the decoder side is calculated on the encoder side and transmitted as side information together with the encoder output signal. On the decoder side, the window shape information 109 is extracted from the bitstream by the bitstream demultiplexer (for example 102 in <figref idref="f0008">Fig. 5b</figref>) and provided to the imaginary spectrum calculator 1001 as illustrated in <figref idref="f0014">Fig. 10a</figref>.

0068When the window shape information 109 signals that the previous frame had a different transform size, then it is preferred that the previous frame is not used for calculating the imaginary spectrum from the real-valued spectrum. The same is true when it is found by interpreting the window shape information 109 that the next frame has a different transform size. Then, the next frame is not used for calculating the imaginary spectrum from the real-valued spectrum. In such a case when, for example, the previous frame had a different transform size from the current frame and when the next frame again has a different transform size compared to the current frame, then only the current frame, i.e. the spectral values of the current window, are used for estimating the imaginary spectrum.

0069The prediction in the encoder is based on non-quantized or quantized frequency coefficients such as MDCT coefficients. When the prediction illustrated by element 2033 in <figref idref="f0003">Fig. 3a</figref>, for example, is based on non-quantized data, then the residual calculator 2034 preferably also operates on non-quantized data and the residual calculator output signal, i.e. the residual signal 205 is quantized before being entropy-encoded and transmitted to a decoder. In an alternative embodiment, however, it is preferred that the prediction is based on quantized MDCT coefficients. Then, the quantization can take place before the combiner 2031 in <figref idref="f0003">Fig. 3a</figref> so that a first quantized channel and a second quantized channel are the basis for calculating the residual signal. Alternatively, the quantization can also take place subsequent to the combiner 2031 so that the first combination signal and the second combination signal are calculated in a non-quantized form and are quantized before the residual signal is calculated. Again, alternatively, the predictor 2033 may operate in the non-quantized domain and the prediction signal 2035 is quantized before being input into the residual calculator. Then, it is useful that the second combination signal 2032, which is also input into the residual calculator 2034, is also quantized before the residual calculator calculates the residual signal070 in <figref idref="f0009">Fig. 6a</figref>, which may be implemented within the predictor 2033 in <figref idref="f0003">Fig. 3a</figref>, operates on the same quantized data as are available on the decoder side. Then, it can be guaranteed that the MDST spectrum estimated in the encoder for the purpose of performing the calculation of the residual signal is exactly the same as the MDST spectrum on the decoder side used for performing the inverse prediction, i.e. for calculating the side signal form the residual signal. To this end, the first combination signal such as signal M on line 204 in <figref idref="f0009">Fig. 6a</figref> is quantized before being input into block 2070. Then, the MDST spectrum calculated using the quantized MDCT spectrum of the current frame, and depending on the control information, the quantized MDCT spectrum of the previous or next frame is input into the multiplier 2074, and the output of multiplier 2074 of <figref idref="f0009">Fig. 6a</figref> will again be a non-quantized spectrum. This non-quantized spectrum will be subtracted from the spectrum input into adder 2034b and will finally be quantized in quantizer 209b.

0070In an embodiment, the real part and the imaginary part of the complex prediction coefficient per prediction band are quantized and encoded directly, i.e. without for example MPEG Surround parameterization. The quantization can be performed using a uniform quantizer with a step size, for example, of 0.1. This means that any logarithmic quantization step sizes or the like are not applied, but any linear step sizes are applied. In an implementation, the value range for the real part and the imaginary part of the complex prediction coefficient ranges from -3 to 3, which means that 60 or, depending on implementational details, 61 quantization steps are used for the real part and the imaginary part of the complex prediction coefficient.

0071Preferably, the real part applied in multiplier 2073 in <figref idref="f0009">Fig. 6a</figref> and the imaginary part 2074 applied in <figref idref="f0009">Fig. 6a</figref> are quantized before being applied so that, again, the same value for the prediction is used on the encoder side as is available on the decoder side. This guarantees that the prediction residual signal covers - apart from the introduced quantization error - any errors which might occur when a non-quantized prediction coefficient is applied on the encoder side while a quantized prediction coefficient is applied on the decoder side. Preferably, the quantization is applied in such a way that - as far as possible - the same situation and the same signals are available on the encoder side and on the decoder side. Hence, it is preferred to quantize the input into the real-to-imaginary calculator 2070 using the same quantization as is applied in quantizer 209a. Additionally, it is preferred to quantize the real part and the imaginary part of the prediction coefficient α for performing the multiplications in item 2073 and item 2074. The quantization is the same as is applied in quantizer 2072. Additionally, the side signal output by block 2031 in <figref idref="f0009">Fig. 6a</figref> can also be quantized before the adders 2034a and 2034b. However, performing the quantization by quantizer 209b subsequent to the addition where the addition by these adders is applied with a non-quantized side signal is not problematic.

0072In a further example a cheap signaling in case all prediction coefficients are real is applied. It can be the situation that all prediction coefficients for a certain frame, i.e. for the same time portion of the audio signal are calculated to be real. Such a situation may occur when the full mid signal and the full side signal are not or only little phase-shifted to each other. In order to save bits, this is indicated by a single real indicator. Then, the imaginary part of the prediction coefficient does not need to be signaled in the bitstream with a codeword representing a zero value. On the decoder side, the bitstream decoder interface, such as a bitstream demultiplexer, will interpret this real indicator and will then not search for codewords for an imaginary part but will assume all bits being in the corresponding section of the bitstream as bits for real-valued prediction coefficients. Furthermore, the predictor 2033, when receiving an indication that all imaginary parts of the prediction coefficients in the frame are zero, will not need to calculate an MDST spectrum, or generally an imaginary spectrum from the real-valued MDCT spectrum. Hence, element 1160a in the <figref idref="f0010">Fig. 6b</figref> decoder will be deactivated and the inverse prediction will only take place using the real-valued prediction coefficient applied in multiplier 1160b in <figref idref="f0010">Fig. 6b</figref>. The same is true for the encoder side where element 2070 will be deactivated and prediction will only take place using the multiplier 2073. This side information is preferably used as an additional bit per frame, and the decoder will read this bit frame by frame in order to decide whether the real-to-imaginary converter 1160a will be active for a frame or not. Hence, providing this information results in a reduced size of the bitstream due to the more efficient signaling of all imaginary parts of the prediction coefficient being zero for a frame, and additionally, provides less complexity for the decoder for such a frame which immediately results in a reduced battery consumption of such a processor implemented, for example, in a mobile battery-powered device.

0073The complex stereo prediction in accordance with preferred embodiments of the present invention is a tool for efficient coding of channel pairs with level and/or phase differences between the channels. Using a complex-valued parameter α, the left and right channels are reconstructed via the following matrix. dmx_Im denotes the MDST corresponding to the MDCT of the downmix channels dmx_Re. <maths id="math0002" num=""><math display="block"><mfenced open="[" close="]"><mtable><mtr><mtd><mi>r</mi></mtd></mtr><mtr><mtd><mi>l</mi></mtd></mtr></mtable></mfenced><mo>=</mo><mfenced open="[" close="]"><mtable><mtr><mtd><mrow><mn>1</mn><mo>−</mo><msub><mi>α</mi><mi>Re</mi></msub></mrow></mtd><mtd><mrow><mo>−</mo><msub><mi>α</mi><mi>Im</mi></msub></mrow></mtd><mtd><mn>1</mn></mtd></mtr><mtr><mtd><mrow><mn>1</mn><mo>+</mo><msub><mi>α</mi><mi>Re</mi></msub></mrow></mtd><mtd><msub><mi>α</mi><mi>Im</mi></msub></mtd><mtd><mrow><mo>−</mo><mn>1</mn></mrow></mtd></mtr></mtable></mfenced><mfenced open="[" close="]"><mtable><mtr><mtd><mrow><mi mathvariant="italic">dm</mi><msub><mi>x</mi><mi>Re</mi></msub></mrow></mtd></mtr><mtr><mtd><mrow><mi mathvariant="italic">dm</mi><msub><mi>x</mi><mi>Im</mi></msub></mrow></mtd></mtr><mtr><mtd><mi mathvariant="italic">res</mi></mtd></mtr></mtable></mfenced></math><img file="EP2947653B1_D0002.tif" /></maths>

0074The above equation is another representation, which is split with respect to the real part and the imaginary part of α and represents the equation for a combined prediction/combination operation, in which the predicted signal S is not necessarily calculated.

0075The following data elements are preferably used for this tool: <tables id="tabl0003" num="0003"><table frame="none"><tgroup cols="2" colsep="0" rowsep="0"><colspec colnum="1" colname="col1" colwidth="45mm" /><colspec colnum="2" colname="col2" colwidth="121mm" /><tbody><row><entry><b>cplx_pred_all</b></entry><entry>0: Some bands use L/R coding, as signaled by cplx_pred_used[]</entry></row><row><entry /><entry>1: All bands use complex stereo prediction</entry></row><row><entry><b>cplx_pred_used[g][sfb]</b></entry><entry>One-bit flag per window group g and scalefactor band sfb (after mapping from prediction bands) indicating that</entry></row><row><entry /><entry>0: complex prediction is not being used, L/R coding is used</entry></row><row><entry /><entry>1: complex prediction is being used</entry></row><row><entry><b>complex_coef</b></entry><entry>0: α_Im = 0 for all prediction bands</entry></row><row><entry /><entry>1: α_Im is transmitted for all prediction bands</entry></row><row><entry><b>use_prev_frame</b></entry><entry>0: Use only the current frame for MDST estimation</entry></row><row><entry /><entry>1: Use current and previous frame for MDST estimation</entry></row><row><entry><b>delta_code_time</b></entry><entry>0: Frequency differential coding of prediction coefficients</entry></row><row><entry /><entry>1: Time differential coding of prediction coefficients</entry></row><row><entry><b>hcod_alpha_q_re</b></entry><entry>Huffman code of α_Re</entry></row><row><entry><b>hcod_alpha_q_im</b></entry><entry>Huffman code of α_Im</entry></row></tbody></tgroup></table></tables>

0076These data elements are calculated in an encoder and are put into the side information of a stereo or multi-channel audio signal. The elements are extracted from the side information on the decoder side by a side information extractor and are used for controlling the decoder calculator to perform a corresponding action.

0077Complex stereo prediction requires the downmix MDCT spectrum of the current channel pair and, in case of complex_coef == 1, an estimate of the downmix MDST spectrum of the current channel pair, i.e. the imaginary counterpart of the MDCT spectrum. The downmix MDST estimate is computed from the current frame's MDCT downmix and, in case of use_prev_frame == 1, the previous frame's MDCT downmix. The previous frame's MDCT downmix of window group g and group window b is obtained from that frame's reconstructed left and right spectra.

0078In the computation of the downmix MDST estimate, the even-valued MDCT transform length is used, which depends on window_sequence, as well as filter_coefs and filter_coefs_prev, which are arrays containing the filter kernels and which are derived according to the previous tables.

0079For all prediction coefficients the difference to a preceding (in time or frequency) value is coded using a Huffman code book. Prediction coefficients are not transmitted for prediction bands for which cplx_pred_used = 0.

0080The inverse quantized prediction coefficients alpha_re and alpha_im are given by <maths id="math0003" num=""><math display="block"><mi>alpha</mi><mo>_</mo><mi>re</mi><mo>=</mo><mi>alpha</mi><mo>_</mo><mi mathvariant="normal">q</mi><mo>_</mo><mi>re</mi><mo>*</mo><mn>0.1</mn></math><img file="EP2947653B1_D0003.tif" /></maths><maths id="math0004" num=""><math display="block"><mi>alpha</mi><mo>_</mo><mi>im</mi><mo>=</mo><mi>alpha</mi><mo>_</mo><mi mathvariant="normal">q</mi><mo>_</mo><mi>im</mi><mo>*</mo><mn>0.1</mn></math><img file="EP2947653B1_D0004.tif" /></maths>

0081It is to be emphasized that the invention is not only applicable to stereo signals, i.e. multi-channel signals having only two channels, but is also applicable to two channels of a multi-channel signal having three or more channels such as a 5.1 or 7.1 signal.

0082The inventive encoded audio signal can be stored on a digital storage medium or can be transmitted on a transmission medium such as a wireless transmission medium or a wired transmission medium such as the Internet. Depending on certain implementation requirements, embodiments of the invention can be implemented in hardware or in software. The implementation can be performed using a digital storage medium, for example a floppy disk, a DVD, a CD, a ROM, a PROM, an EPROM, an EEPROM or a FLASH memory, having electronically readable control signals stored thereon, which cooperate (or are capable of cooperating) with a programmable computer system such that the respective method is performed.

0083Some embodiments according to the invention comprise a non-transitory or tangible data carrier having electronically readable control signals, which are capable of cooperating with a programmable computer system, such that one of the methods described herein is performed.

0084Generally, embodiments of the present invention can be implemented as a computer program product with a program code, the program code being operative for performing one of the methods when the computer program product runs on a computer. The program code may for example be stored on a machine readable carrier.

0085Other embodiments comprise the computer program for performing one of the methods described herein, stored on a machine readable carrier.

0086In other words, an embodiment of the inventive method is, therefore, a computer program having a program code for performing one of the methods described herein, when the computer program runs on a computer.

0087A further embodiment of the inventive methods is, therefore, a data carrier (or a digital storage medium, or a computer-readable medium) comprising, recorded thereon, the computer program for performing one of the methods described herein.

0088A further embodiment of the inventive method is, therefore, a data stream or a sequence of signals representing the computer program for performing one of the methods described herein. The data stream or the sequence of signals may for example be configured to be transferred via a data communication connection, for example via the Internet.

0089A further embodiment comprises a processing means, for example a computer, or a programmable logic device, configured to or adapted to perform one of the methods described herein.

0090A further embodiment comprises a computer having installed thereon the computer program for performing one of the methods described herein.

0091In some embodiments, a programmable logic device (for example a field programmable gate array) may be used to perform some or all of the functionalities of the methods described herein. In some embodiments, a field programmable gate array may cooperate with a microprocessor in order to perform one of the methods described herein. Generally, the methods are preferably performed by any hardware apparatus.

0092The above described embodiments are merely illustrative for the principles of the present invention. It is understood that modifications and variations of the arrangements and the details described herein will be apparent to others skilled in the art. It is the intent, therefore, to be limited only by the scope of the impending patent claims and not by the specific details presented by way of description and explanation of the embodiments herein.