Patent Publication Number: US-11043226-B2

Title: Apparatus and method for encoding and decoding an audio signal using downsampling or interpolation of scale parameters

Description:
CROSS-REFERENCES TO RELATED APPLICATIONS 
     This application is a continuation of copending International Application No. PCT/EP2018/080137, filed Nov. 5, 2018, which is incorporated herein by reference in its entirety, and additionally claims priority from International Application No. PCT/EP2017/078921, filed Nov. 10, 2017, which is incorporated herein by reference in its entirety. 
    
    
     BACKGROUND OF THE INVENTION 
     The present invention is related to audio processing and, particularly, to audio processing operating in a spectral domain using scale parameters for spectral bands. 
     Conventional Technology 1: Advanced Audio Coding (AAC) 
     In one of the most widely used state-of-the-art perceptual audio codec, Advanced Audio Coding (AAC) [1-2], spectral noise shaping is performed with the help of so-called scale factors. 
     In this approach, the MDCT spectrum is partitioned into a number of non-uniform scale factor bands. For example at 48 kHz, the MDCT has 1024 coefficients and it is partitioned into 49 scale factor bands. In each band, a scale factor is used to scale the MDCT coefficients of that band. A scalar quantizer with constant step size is then employed to quantize the scaled MDCT coefficients. At the decoder-side, inverse scaling is performed in each band, shaping the quantization noise introduced by the scalar quantizer. 
     The 49 scale factors are encoded into the bitstream as side-information. It usually involves a significantly high amount of bits for encoding the scale factors, due to the relatively high number of scale factors and the high precision involved. This can become a problem at low bitrate and/or at low delay. 
     Conventional Technology 2: MDCT-Based TCX 
     In MDCT-based TCX, a transform-based audio codec used in the MPEG-D USAC [3] and 3GPP EVS [4] standards, spectral noise shaping is performed with the help of a LPC-based perceptual filer, the same perceptual filter as used in recent ACELP-based speech codecs (e.g. AMR-WB). 
     In this approach, a set of 16 LPCs is first estimated on a pre-emphasized input signal. The LPCs are then weighted and quantized. The frequency response of the weighted and quantized LPCs is then computed in 64 uniformly spaced bands. The MDCT coefficients are then scaled in each band using the computed frequency response. The scaled MDCT coefficients are then quantized using a scalar quantizer with a step size controlled by a global gain. At the decoder, inverse scaling is performed in every 64 bands, shaping the quantization noise introduced by the scalar quantizer. 
     This approach has a clear advantage over the AAC approach: it involves the encoding of only 16 (LPC)+1 (global-gain) parameters as side-information (as opposed to the 49 parameters in AAC). Moreover, 16 LPCs can be efficiently encoded with a small number of bits by employing a LSF representation and a vector quantizer. Consequently, the approach of conventional technology 2 involves less side-information bits as the approach of conventional technology 1, which can makes a significant difference at low bitrate and/or low delay. 
     However, this approach has also some drawbacks. The first drawback is that the frequency scale of the noise shaping is restricted to be linear (i.e. using uniformly spaced bands) because the LPCs are estimated in the time-domain. This is disadvantageous because the human ear is more sensible in low frequencies than in the high frequencies. The second drawback is the high complexity of this approach. The LPC estimation (autocorrelation, Levinson-Durbin), LPC quantization (LPC&lt;-&gt;LSF conversion, vector quantization) and LPC frequency response computation are all costly operations. The third drawback is that this approach is not very flexible because the LPC-based perceptual filter cannot be easily modified and this prevents some specific tunings that would be involved in critical audio items. 
     Conventional Technology 3: Improved MDCT-Based TCX 
     Some recent work has addressed the first drawback and partly the second drawback of conventional technology 2. It was published in U.S. Pat. No. 9,595,262 B2, EP2676266 B1. In this new approach, the autocorrelation (for estimating the LPCs) is no more performed in the time-domain but it is instead computed in the MDCT domain using an inverse transform of the MDCT coefficient energies. This allows using a non-uniform frequency scale by simply grouping the MDCT coefficients into 64 non-uniform bands and computing the energy of each band. It also reduces the complexity involved to compute the autocorrelation. 
     However, most of the second drawback and the third drawback remain, even with the new approach. 
     SUMMARY 
     According to an embodiment, an apparatus for encoding an audio signal may have: a converter for converting the audio signal into a spectral representation; a scale parameter calculator for calculating a first set of scale parameters from the spectral representation: a downsampler for downsampling the first set of scale parameters to obtain a second set of scale parameters, wherein a second number of scale parameters in the second set of scale parameters is lower than a first number of scale parameters in the first set of scale parameters; a scale parameter encoder for generating an encoded representation of the second set of scale parameters; a spectral processor for processing the spectral representation using a third set of scale parameters, the third set of scale parameters having a third number of scale parameters being greater than the second number of scale parameters, wherein the spectral processor is configured to use the first set of scale parameters or to derive the third set of scale parameters from the second set of scale parameters or from the encoded representation of the second set of scale parameters using an interpolation operation; and an output interface for generating an encoded output signal including information on the encoded representation of the spectral representation and information on the encoded representation of the second set of scale parameters. 
     According to another embodiment, a method for encoding an audio signal may have the steps of: converting the audio signal into a spectral representation; calculating a first set of scale parameters from the spectral representation: downsampling the first set of scale parameters to obtain a second set of scale parameters, wherein a second number of scale parameters in the second set of scale parameters is lower than a first number of scale parameters in the first set of scale parameters; generating an encoded representation of the second set of scale parameters; processing the spectral representation using a third set of scale parameters, the third set of scale parameters having a third number of scale parameters being greater than the second number of scale parameters, wherein the processing uses the first set of scale parameters or derives the third set of scale parameters from the second set of scale parameters or from the encoded representation of the second set of scale parameters using an interpolation operation; and generating an encoded output signal including information on the encoded representation of the spectral representation and information on the encoded representation of the second set of scale parameters. 
     According to another embodiment, an apparatus for decoding an encoded audio signal including information on an encoded spectral representation and information on an encoded representation of a second set of scale parameters may have: an input interface for receiving the encoded signal and extracting the encoded spectral representation and the encoded representation of the second set of scale parameters; a spectrum decoder for decoding the encoded spectral representation to obtain a decoded spectral representation; a scale parameter decoder for decoding the encoded second set of scale parameters to obtain a first set of scale parameters, wherein the number of scale parameters of the second set is smaller than a number of scale parameters of the first set; a spectral processor for processing the decoded spectral representation using the first set of scale parameters to obtain a scaled spectral representation; and a converter for converting the scaled spectral representation to obtain a decoded audio signal. 
     According to another embodiment, a method for decoding an encoded audio signal including information on an encoded spectral representation and information on an encoded representation of a second set of scale parameters may have the steps of: receiving the encoded signal and extracting the encoded spectral representation and the encoded representation of the second set of scale parameters; decoding the encoded spectral representation to obtain a decoded spectral representation; decoding the encoded second set of scale parameters to obtain a first set of scale parameters, wherein the number of scale parameters of the second set is smaller than a number of scale parameters of the first set; processing the decoded spectral representation using the first set of scale parameters to obtain a scaled spectral representation; and converting the scaled spectral representation to obtain a decoded audio signal. 
     According to another embodiment, a non-transitory digital storage medium including a computer program stored thereon to perform the method for encoding an audio signal, including: converting the audio signal into a spectral representation; calculating a first set of scale parameters from the spectral representation: downsampling the first set of scale parameters to obtain a second set of scale parameters, wherein a second number of scale parameters in the second set of scale parameters is lower than a first number of scale parameters in the first set of scale parameters; generating an encoded representation of the second set of scale parameters; processing the spectral representation using a third set of scale parameters, the third set of scale parameters including a third number of scale parameters being greater than the second number of scale parameters, wherein the processing uses the first set of scale parameters or derives the third set of scale parameters from the second set of scale parameters or from the encoded representation of the second set of scale parameters using an interpolation operation; and generating an encoded output signal including information on the encoded representation of the spectral representation and information on the encoded representation of the second set of scale parameters, when said computer program is run by a computer. 
     According to another embodiment, a non-transitory digital storage medium including a computer program stored thereon to perform the method for decoding an encoded audio signal including information on an encoded spectral representation and information on an encoded representation of a second set of scale parameters, including: receiving the encoded signal and extracting the encoded spectral representation and the encoded representation of the second set of scale parameters; decoding the encoded spectral representation to obtain a decoded spectral representation; decoding the encoded second set of scale parameters to obtain a first set of scale parameters, wherein the number of scale parameters of the second set is smaller than a number of scale parameters of the first set; processing the decoded spectral representation using the first set of scale parameters to obtain a scaled spectral representation; and converting the scaled spectral representation to obtain a decoded audio signal, when said computer program is run by a computer. 
     An apparatus for encoding an audio signal comprises a converter for converting the audio signal into a spectral representation. Furthermore, a scale parameter calculator for calculating a first set of scale parameters from the spectral representation is provided. Additionally, in order to keep the bitrate as low as possible, the first set of scale parameters is downsampled to obtain a second set of scale parameters, wherein a second number of scale parameters in the second set of scale parameters is lower than a first number of scale parameters in the first set of scale parameters. Furthermore, a scale parameter encoder for generating an encoded representation of the second set of scale parameters is provided in addition to a spectral processor for processing the spectral representation using a third set of scale parameters, the third set of scale parameters having a third number of scale parameters being greater than the second number of scale parameters. Particularly, the spectral processor is configured to use the first set of scale parameters or to derive the third set of scale parameters from the second set of scale parameters or from the encoded representation of the second set of scale parameters using an interpolation operation to obtain an encoded representation of the spectral representation. Furthermore, an output interface is provided for generating an encoded output signal comprising information on the encoded representation of the spectral representation and also comprising information on the encoded representation of the second set of scale parameters. 
     The present invention is based on the finding that a low bitrate without substantial loss of quality can be obtained by scaling, on the encoder-side, with a higher number of scale factors and by downsampling the scale parameters on the encoder-side into a second set of scale parameters or scale factors, where the scale parameters in the second set that is then encoded and transmitted or stored via an output interface is lower than the first number of scale parameters. Thus, a fine scaling on the one hand and a low bitrate on the other hand is obtained on the encoder-side. 
     On the decoder-side, the transmitted small number of scale factors is decoded by a scale factor decoder to obtain a first set of scale factors where the number of scale factors or scale parameters in the first set is greater than the number of scale factors or scale parameters of the second set and, then, once again, a fine scaling using the higher number of scale parameters is performed on the decoder-side within a spectral processor to obtain a fine-scaled spectral representation. 
     Thus, a low bitrate on the one hand and, nevertheless, a high quality spectral processing of the audio signal spectrum on the other hand are obtained. 
     Spectral noise shaping as done in advantageous embodiments is implemented using only a very low bitrate. Thus, this spectral noise shaping can be an essential tool even in a low bitrate transform-based audio codec. The spectral noise shaping shapes the quantization noise in the frequency domain such that the quantization noise is minimally perceived by the human ear and, therefore, the perceptual quality of the decoded output signal can be maximized. 
     Advantageous embodiments rely on spectral parameters calculated from amplitude-related measures, such as energies of a spectral representation. Particularly, band-wise energies or, generally, band-wise amplitude-related measures are calculated as the basis for the scale parameters, where the bandwidths used in calculating the band-wise amplitude-related measures increase from lower to higher bands in order to approach the characteristic of the human hearing as far as possible. Advantageously, the division of the spectral representation into bands is done in accordance with the well-known Bark scale. 
     In further embodiments, linear-domain scale parameters are calculated and are particularly calculated for the first set of scale parameters with the high number of scale parameters, and this high number of scale parameters is converted into a log-like domain. A log-like domain is generally a domain, in which small values are expanded and high values are compressed. Then, the downsampling or decimation operation of the scale parameters is done in the log-like domain that can be a logarithmic domain with the base 10, or a logarithmic domain with the base 2, where the latter may be advantageous for implementation purposes. The second set of scale factors is then calculated in the log-like domain and, advantageously, a vector quantization of the second set of scale factors is performed, wherein the scale factors are in the log-like domain. Thus, the result of the vector quantization indicates log-like domain scale parameters. The second set of scale factors or scale parameters has, for example, a number of scale factors half of the number of scale factors of the first set, or even one third or yet even more advantageously, one fourth Then, the quantized small number of scale parameters in the second set of scale parameters is brought into the bitstream and is then transmitted from the encoder-side to the decoder-side or stored as an encoded audio signal together with a quantized spectrum that has also been processed using these parameters, where this processing additionally involves quantization using a global gain. Advantageously, however, the encoder derives from these quantized log-like domain second scale factors once again a set of linear domain scale factors, which is the third set of scale factors, and the number of scale factors in the third set of scale factors is greater than the second number and is advantageously even equal to the first number of scale factors in the first set of first scale factors. Then, on the encoder-side, these interpolated scale factors are used for processing the spectral representation, where the processed spectral representation is finally quantized and, in any way entropy-encoded, such as by Huffman-encoding, arithmetic encoding or vector-quantization-based encoding, etc. 
     In the decoder that receives an encoded signal having a low number of spectral parameters together with the encoded representation of the spectral representation, the low number of scale parameters is interpolated to a high number of scale parameters, i.e., to obtain a first set of scale parameters where a number of scale parameters of the scale factors of the second set of scale factors or scale parameters is smaller than the number of scale parameters of the first set, i.e., the set as calculated by the scale factor/parameter decoder. Then, a spectral processor located within the apparatus for decoding an encoded audio signal processes the decoded spectral representation using this first set of scale parameters to obtain a scaled spectral representation. A converter for converting the scaled spectral representation then operates to finally obtain a decoded audio signal that is advantageously in the time domain. 
     Further embodiments result in additional advantages set forth below. In advantageous embodiments, spectral noise shaping is performed with the help of 16 scaling parameters similar to the scale factors used in conventional technology 1. These parameters are obtained in the encoder by first computing the energy of the MDCT spectrum in 64 non-uniform bands (similar to the 64 non-uniform bands of conventional technology 3), then by applying some processing to the 64 energies (smoothing, pre-emphasis, noise-floor, log-conversion), then by downsampling the 64 processed energies by a factor of 4 to obtain 16 parameters which are finally normalized and scaled. These 16 parameters are then quantized using vector quantization (using similar vector quantization as used in conventional technology 2/3). The quantized parameters are then interpolated to obtain 64 interpolated scaling parameters. These 64 scaling parameters are then used to directly shape the MDCT spectrum in the 64 non-uniform bands. Similar to conventional technology 2 and 3, the scaled MDCT coefficients are then quantized using a scalar quantizer with a step size controlled by a global gain. At the decoder, inverse scaling is performed in every 64 bands, shaping the quantization noise introduced by the scalar quantizer. 
     As in conventional technology 2/3, the advantageous embodiment uses only 16+1 parameters as side-information and the parameters can be efficiently encoded with a low number of bits using vector quantization. Consequently, the advantageous embodiment has the same advantage as prior 2/3: it involves less side-information bits as the approach of conventional technology 1, which can makes a significant difference at low bitrate and/or low delay. 
     As in conventional technology 3, the advantageous embodiment uses a non-linear frequency scaling and thus does not have the first drawback of conventional technology 2. 
     Contrary to conventional technology 2/3, the advantageous embodiment does not use any of the LPC-related functions which have high complexity. The processing functions involved (smoothing, pre-emphasis, noise-floor, log-conversion, normalization, scaling, interpolation) need very small complexity in comparison. Only the vector quantization still has relatively high complexity. But some low complexity vector quantization techniques can be used with small loss in performance (multi-split/multi-stage approaches). The advantageous embodiment thus does not have the second drawback of conventional technology 2/3 regarding complexity. 
     Contrary to conventional technology 2/3, the advantageous embodiment is not relying on a LPC-based perceptual filter. It uses 16 scaling parameters which can be computed with a lot of freedom. The advantageous embodiment is more flexible than the conventional technology 2/3 and thus does not have the third drawback of conventional technology 2/3. 
     In conclusion, the advantageous embodiment has all advantages of conventional technology 2/3 with none of the drawbacks. 
    
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
       Embodiments of the present invention will be detailed subsequently referring to the appended drawings, in which: 
         FIG. 1  is a block diagram of an apparatus for encoding an audio signal; 
         FIG. 2  is a schematic representation of an advantageous implementation of the scale factor calculator of  FIG. 1 ; 
         FIG. 3  is a schematic representation of an advantageous implementation of the downsampler of  FIG. 1 ; 
         FIG. 4  is a schematic representation of the scale factor encoder of  FIG. 4 ; 
         FIG. 5  is a schematic illustration of the spectral processor of  FIG. 1 ; 
         FIG. 6  illustrates a general representation of an encoder on the one hand and a decoder on the other hand implementing spectral noise shaping (SNS); 
         FIG. 7  illustrates a more detailed representation of the encoder-side on the one hand and the decoder-side on the other hand where temporal noise shaping (TNS) is implemented together with spectral noise shaping (SNS); 
         FIG. 8  illustrates a block diagram of an apparatus for decoding an encoded audio signal; 
         FIG. 9  illustrates a schematic illustration illustrating details of the scale factor decoder, the spectral processor and the spectrum decoder of  FIG. 8 ; 
         FIG. 10  illustrates a subdivision of the spectrum into 64 bands; 
         FIG. 11  illustrates a schematic illustration of the downsampling operation on the one hand and the interpolation operation on the other hand; 
         FIG. 12 a    illustrates a time-domain audio signal with overlapping frames; 
         FIG. 12 b    illustrates an implementation of the converter of  FIG. 1 ; and 
         FIG. 12 c    illustrates a schematic illustration of the converter of  FIG. 8 . 
     
    
    
     DETAILED DESCRIPTION OF THE INVENTION 
       FIG. 1  illustrates an apparatus for encoding an audio signal  160 . The audio signal  160  advantageously is available in the time-domain, although other representations of the audio signal such as a prediction-domain or any other domain would principally also be useful. The apparatus comprises a converter  100 , a scale factor calculator  110 , a spectral processor  120 , a downsampler  130 , a scale factor encoder  140  and an output interface  150 . The converter  100  is configured for converting the audio signal  160  into a spectral representation. The scale factor calculator  110  is configured for calculating a first set of scale parameters or scale factors from the spectral representation. 
     Throughout the specification, the term “scale factor” or “scale parameter” is used in order to refer to the same parameter or value, i.e., a value or parameter that is, subsequent to some processing, used for weighting some kind of spectral values. This weighting, when performed in the linear domain is actually a multiplying operation with a scaling factor. However, when the weighting is performed in a logarithmic domain, then the weighting operation with a scale factor is done by an actual addition or subtraction operation. Thus, in the terms of the present application, scaling does not only mean multiplying or dividing but also means, depending on the certain domain, addition or subtraction or, generally means each operation, by which the spectral value, for example, is weighted or modified using the scale factor or scale parameter. 
     The downsampler  130  is configured for downsampling the first set of scale parameters to obtain a second set of scale parameters, wherein a second number of the scale parameters in the second set of scale parameters is lower than a first number of scale parameters in the first set of scale parameters. This is also outlined in the box in  FIG. 1  stating that the second number is lower than the first number. As illustrated in  FIG. 1 , the scale factor encoder is configured for generating an encoded representation of the second set of scale factors, and this encoded representation is forwarded to the output interface  150 . Due to the fact that the second set of scale factors has a lower number of scale factors than the first set of scale factors, the bitrate for transmitting or storing the encoded representation of the second set of scale factors is lower compared to a situation, in which the downsampling of the scale factors performed in the downsampler  130  would not have been performed. 
     Furthermore, the spectral processor  120  is configured for processing the spectral representation output by the converter  100  in  FIG. 1  using a third set of scale parameters, the third set of scale parameters or scale factors having a third number of scale factors being greater than the second number of scale factors, wherein the spectral processor  120  is configured to use, for the purpose of spectral processing the first set of scale factors as already available from block  110  via line  171 . Alternatively, the spectral processor  120  is configured to use the second set of scale factors as output by the downsampler  130  for the calculation of the third set of scale factors as illustrated by line  172 . In a further implementation, the spectral processor  120  uses the encoded representation output by the scale factor/parameter encoder  140  for the purpose of calculating the third set of scale factors as illustrated by line  173  in  FIG. 1 . Advantageously, the spectral processor  120  does not use the first set of scale factors, but uses either the second set of scale factors as calculated by the downsampler or even more advantageously uses the encoded representation or, generally, the quantized second set of scale factors and, then, performs an interpolation operation to interpolate the quantized second set of spectral parameters to obtain the third set of scale parameters that has a higher number of scale parameters due to the interpolation operation. 
     Thus, the encoded representation of the second set of scale factors that is output by block  140  either comprises a codebook index for a advantageously used scale parameter codebook or a set of corresponding codebook indices. In other embodiments, the encoded representation comprises the quantized scale parameters of quantized scale factors that are obtained, when the codebook index or the set of codebook indices or, generally, the encoded representation is input into a decoder-side vector decoder or any other decoder. 
     Advantageously, the spectral processor  120  uses the same set of scale factors that is also available at the decoder-side, i.e., uses the quantized second set of scale parameters together with an interpolation operation to finally obtain the third set of scale factors. 
     In a advantageous embodiment, the third number of scale factors in the third set of scale factors is equal to the first number of scale factors. However, a smaller number of scale factors is also useful. Exemplarily, for example, one could derive 64 scale factors in block  110 , and one could then downsample the 64 scale factors to 16 scale factors for transmission. Then, one could perform an interpolation not necessarily to 64 scale factors, but to 32 scale factors in the spectral processor  120 . Alternatively, one could perform an interpolation to an even higher number such as more than 64 scale factors as the case may be, as long as the number of scale factors transmitted in the encoded output signal  170  is smaller than the number of scale factors calculated in block  110  or calculated and used in block  120  of  FIG. 1 . 
     Advantageously, the scale factor calculator  110  is configured to perform several operations illustrated in  FIG. 2 . These operations refer to a calculation  111  of an amplitude-related measure per band. An advantageous amplitude-related measure per band is the energy per band, but other amplitude-related measures can be used as well, for example, the summation of the magnitudes of the amplitudes per band or the summation of squared amplitudes which corresponds to the energy. However, apart from the power of 2 used for calculating the energy per band, other powers such as a power of 3 that would reflect the loudness of the signal could also be used and, even powers different from integer numbers such as powers of 1.5 or 2.5 can be used as well in order to calculate amplitude-related measures per band. Even powers less than 1.0 can be used as long as it is made sure that values processed by such powers are positive-valued. 
     A further operation performed by the scale factor calculator can be an inter-band smoothing  112 . This inter-band smoothing is advantageously used to smooth out the possible instabilities that can appear in the vector of amplitude-related measures as obtained by step  111 . If one would not perform this smoothing, these instabilities would be amplified when converted to a log-domain later as illustrated at  115 , especially in spectral values where the energy is close to 0. However, in other embodiments, inter-band smoothing is not performed. 
     A further advantageous operation performed by the scale factor calculator  110  is the pre-emphasis operation  113 . This pre-emphasis operation has a similar purpose as a pre-emphasis operation used in an LPC-based perceptual filter of the MDCT-based TCX processing as discussed before with respect to the conventional technology. This procedure increases the amplitude of the shaped spectrum in the low-frequencies that results in a reduced quantization noise in the low-frequencies. 
     However, depending on the implementation, the pre-emphasis operation—as the other specific operations—does not necessarily have to be performed. 
     A further optional processing operation is the noise-floor addition processing  114 . This procedure improves the quality of signals containing very high spectral dynamics such as, for example, Glockenspiel, by limiting the amplitude amplification of the shaped spectrum in the valleys, which has the indirect effect of reducing the quantization noise in the peaks, at the cost of an increase of quantization noise in the valleys, where the quantization noise is anyway not perceptible due to masking properties of the human ear such as the absolute listening threshold, the pre-masking, the post-masking or the general masking threshold indicating that, typically, a quite low volume tone relatively close in frequency to a high volume tone is not perceptible at all, i.e., is fully masked or is only roughly perceived by the human hearing mechanism, so that this spectral contribution can be quantized quite coarsely. 
     The noise-floor addition operation  114 , however, does not necessarily have to be performed. 
     Furthermore, block  115  indicates a log-like domain conversion. Advantageously, a transformation of an output of one of blocks  111 ,  112 ,  113 ,  114  in  FIG. 2  is performed in a log-like domain. A log-like domain is a domain, in which values close to 0 are expanded and high values are compressed. Advantageously, the log domain is a domain with basis of 2, but other log domains can be used as well. However, a log domain with the basis of 2 is better for an implementation on a fixed-point signal processor. 
     The output of the scale factor calculator  110  is a first set of scale factors. 
     As illustrated in  FIG. 2 , each of the blocks  112  to  115  can be bridged, i.e., the output of block  111 , for example, could already be the first set of scale factors. However, all the processing operations and, particularly, the log-like domain conversion may be advantageous. Thus, one could even implement the scale factor calculator by only performing steps  111  and  115  without the procedures in steps  112  to  114 , for example. 
     Thus, the scale factor calculator is configured for performing one or two or more of the procedures illustrated in  FIG. 2  as indicated by the input/output lines connecting several blocks. 
       FIG. 3  illustrates an advantageous implementation of the downsampler  130  of  FIG. 1 . Advantageously, a low-pass filtering or, generally, a filtering with a certain window w(k) is performed in step  131 , and, then, a downsampling/decimation operation of the result of the filtering is performed. Due to the fact that low-pass filtering  131  and in advantageous embodiments the downsampling/decimation operation  132  are both arithmetic operations, the filtering  131  and the downsampling  132  can be performed within a single operation as will be outlined later on. Advantageously, the downsampling/decimation operation is performed in such a way that an overlap among the individual groups of scale parameters of the first set of scale parameters is performed. Advantageously, an overlap of one scale factor in the filtering operation between two decimated calculated parameters is performed. Thus, step  131  performs a low-pass filter on the vector of scale parameters before decimation. This low-pass filter has a similar effect as the spreading function used in psychoacoustic models. It reduces the quantization noise at the peaks, at the cost of an increase of quantization noise around the peaks where it is anyway perceptually masked at least to a higher degree with respect to quantization noise at the peaks. 
     Furthermore, the downsampler additionally performs a mean value removal  133  and an additional scaling step  134 . However, the low-pass filtering operation  131 , the mean value removal step  133  and the scaling step  134  are only optional steps. Thus, the downsampler illustrated in  FIG. 3  or illustrated in  FIG. 1  can be implemented to only perform step  132  or to perform two steps illustrated in  FIG. 3  such as step  132  and one of the steps  131 ,  133  and  134 . Alternatively, the downsampler can perform all four steps or only three steps out of the four steps illustrated in  FIG. 3  as long as the downsampling/decimation operation  132  is performed. 
     As outlined in  FIG. 3 , audio operations in  FIG. 3  performed by the downsampler are performed in the log-like domain in order to obtain better results. 
       FIG. 4  illustrates an advantageous implementation of the scale factor encoder  140 . The scale factor encoder  140  receives the advantageously log-like domain second set of scale factors and performs a vector quantization as illustrated in block  141  to finally output one or more indices per frame. These one or more indices per frame can be forwarded to the output interface and written into the bitstream, i.e., introduced into the output encoded audio signal  170  by means of any available output interface procedures. Advantageously, the vector quantizer  141  additionally outputs the quantized log-like domain second set of scale factors. Thus, this data can be directly output by block  141  as indicated by arrow  144 . However, alternatively, a decoder codebook  142  is also available separately in the encoder. This decoder codebook receives the one or more indices per frame and derives, from these one or more indices per frame the quantized advantageously log-like domain second set of scale factors as indicated by line  145 . In typical implementations, the decoder codebook  142  will be integrated within the vector quantizer  141 . Advantageously, the vector quantizer  141  is a multi-stage or split-level or a combined multi-stage/split-level vector quantizer as is, for example, used in any of the indicated conventional technology procedures. 
     Thus, it is made sure that the second set of scale factors are the same quantized second set of scale factors that are also available on the decoder-side, i.e., in the decoder that only receives the encoded audio signal that has the one or more indices per frame as output by block  141  via line  146 . 
       FIG. 5  illustrates an advantageous implementation of the spectral processor. The spectral processor  120  included within the encoder of  FIG. 1  comprises an interpolator  121  that receives the quantized second set of scale parameters and that outputs the third set of scale parameters where the third number is greater than the second number and advantageously equal to the first number. Furthermore, the spectral processor comprises a linear domain converter  120 . Then, a spectral shaping is performed in block  123  using the linear scale parameters on the one hand and the spectral representation on the other hand that is obtained by the converter  100 . Advantageously, a subsequent temporal noise shaping operation, i.e., a prediction over frequency is performed in order to obtain spectral residual values at the output of block  124 , while the TNS side information is forwarded to the output interface as indicated by arrow  129 . 
     Finally, the spectral processor  125  has a scalar quantizer/encoder that is configured for receiving a single global gain for the whole spectral representation, i.e., for a whole frame. Advantageously, the global gain is derived depending on certain bitrate considerations. Thus, the global gain is set so that the encoded representation of the spectral representation generated by block  125  fulfils certain requirements such as a bitrate requirement, a quality requirement or both. The global gain can be iteratively calculated or can be calculated in a feed forward measure as the case may be. Generally, the global gain is used together with a quantizer and a high global gain typically results in a coarser quantization where a low global gain results in a finer quantization. Thus, in other words, a high global gain results in a higher quantization step size while a low global gain results in a smaller quantization step size when a fixed quantizer is obtained. However, other quantizers can be used as well together with the global gain functionality such as a quantizer that has some kind of compression functionality for high values, i.e., some kind of non-linear compression functionality so that, for example, the higher values are more compressed than lower values. The above dependency between the global gain and the quantization coarseness is valid, when the global gain is multiplied to the values before the quantization in the linear domain corresponding to an addition in the log domain. If, however, the global gain is applied by a division in the linear domain, or by a subtraction in the log domain, the dependency is the other way round. The same is true, when the “global gain” represents an inverse value. 
     Subsequently, advantageous implementations of the individual procedures described with respect to  FIG. 1  to  FIG. 5  are given. 
     Detailed Step-by-Step Description of Advantageous Embodiments 
     Encoder: 
     Step 1: Energy Per Band ( 111 ) 
     The energies per band E B (n) are computed as follows: 
                 E   B     ⁡     (   b   )       =         ∑     k   =     Ind   ⁡     (   b   )             Ind   ⁡     (     b   +   1     )       -   1       ⁢           X   ⁡     (   k   )       2         Ind   ⁡     (     b   +   1     )       -     Ind   ⁡     (   b   )           ⁢           ⁢   for   ⁢           ⁢   b       =       0   ⁢           ⁢   …   ⁢           ⁢     N   B       -   1             
with X(k) are the MDCT coefficients, N B =64 is the number of bands and Ind(n) are the band indices. The bands are non-uniform and follow the perceptually-relevant bark scale (smaller in low-frequencies, larger in high-frequencies).
 
     Step 2: Smoothing ( 112 ) 
     The energy per band E B (b) is smoothed using 
     
       
         
           
             
               
                 E 
                 S 
               
               ⁡ 
               
                 ( 
                 b 
                 ) 
               
             
             = 
             
               { 
               
                 
                   
                     
                       
                         
                           0.75 
                           · 
                           
                             
                               E 
                               B 
                             
                             ⁡ 
                             
                               ( 
                               0 
                               ) 
                             
                           
                         
                         + 
                         
                           0 
                           ⁢ 
                           
                             .25 
                             · 
                             
                               
                                 E 
                                 B 
                               
                               ⁡ 
                               
                                 ( 
                                 1 
                                 ) 
                               
                             
                           
                         
                       
                       , 
                     
                   
                   
                     
                       
                           
                       
                       ⁢ 
                       
                         
                           if 
                           ⁢ 
                           
                               
                           
                           ⁢ 
                           b 
                         
                         = 
                         0 
                       
                     
                   
                 
                 
                   
                     
                       
                         
                           0.25 
                           · 
                           
                             
                               E 
                               B 
                             
                             ⁡ 
                             
                               ( 
                               
                                 6 
                                 ⁢ 
                                 2 
                               
                               ) 
                             
                           
                         
                         + 
                         
                           0 
                           ⁢ 
                           
                             .75 
                             · 
                             
                               
                                 E 
                                 B 
                               
                               ⁡ 
                               
                                 ( 
                                 63 
                                 ) 
                               
                             
                           
                         
                       
                       , 
                     
                   
                   
                     
                       
                           
                       
                       ⁢ 
                       
                         
                           if 
                           ⁢ 
                           
                               
                           
                           ⁢ 
                           b 
                         
                         = 
                         63 
                       
                     
                   
                 
                 
                   
                     
                       
                         
                           0.25 
                           · 
                           
                             
                               E 
                               B 
                             
                             ⁡ 
                             
                               ( 
                               
                                 b 
                                 + 
                                 1 
                               
                               ) 
                             
                           
                         
                         + 
                         
                           0.5 
                           · 
                           
                             
                               E 
                               B 
                             
                             ⁡ 
                             
                               ( 
                               b 
                               ) 
                             
                           
                         
                         + 
                         
                           0.25 
                           · 
                           
                             
                               E 
                               B 
                             
                             ⁡ 
                             
                               ( 
                               
                                 b 
                                 + 
                                 1 
                               
                               ) 
                             
                           
                         
                       
                       , 
                     
                   
                   
                     otherwise 
                   
                 
               
             
           
         
       
     
     Remark: this step is mainly used to smooth the possible instabilities that can appear in the vector E B (b). If not smoothed, these instabilities are amplified when converted to log-domain (see step 5), especially in the valleys where the energy is close to 0. 
     Step 3: Pre-Emphasis ( 113 ) 
     The smoothed energy per band E S (b) is then pre-emphasized using 
                 E   P     ⁡     (   b   )       =             E   S     ⁡     (   b   )       ·     10       b   ·     g   tilt         10   ·   63           ⁢           ⁢   for   ⁢           ⁢   b     =     0   ⁢           ⁢   …   ⁢           ⁢   63             
with g tilt  controls the pre-emphasis tilt and depends on the sampling frequency. It is for example 18 at 16 kHz and 30 at 48 kHz. The pre-emphasis used in this step has the same purpose as the pre-emphasis used in the LPC-based perceptual filter of conventional technology 2, it increases the amplitude of the shaped Spectrum in the low-frequencies, resulting in reduced quantization noise in the low-frequencies.
 
     Step 4: Noise Floor ( 114 ) 
     A noise floor at −40 dB is added to E P (b) using
 
 E   P ( b )=max( E   P ( b ),noiseFloor) for  b= 0 . . . 63
 
with the noise floor being calculated by
 
     
       
         
           
             noiseFloor 
             ⁢ 
             
               = 
               
                 max 
                 ⁡ 
                 
                   ( 
                   
                     
                       
                         
                           
                             ∑ 
                             
                               b 
                               = 
                               0 
                             
                             
                               6 
                               ⁢ 
                               3 
                             
                           
                           ⁢ 
                           
                             
                               E 
                               P 
                             
                             ⁡ 
                             
                               ( 
                               b 
                               ) 
                             
                           
                         
                         
                           6 
                           ⁢ 
                           4 
                         
                       
                       · 
                       
                         10 
                         
                           - 
                           
                             
                               4 
                               ⁢ 
                               0 
                             
                             
                               1 
                               ⁢ 
                               0 
                             
                           
                         
                       
                     
                     , 
                     
                       2 
                       
                         
                           - 
                           3 
                         
                         ⁢ 
                         2 
                       
                     
                   
                   ) 
                 
               
             
           
         
       
     
     This step improves quality of signals containing very high spectral dynamics such as e.g. glockenspiel, by limiting the amplitude amplification of the shaped spectrum in the valleys, which has the indirect effect of reducing the quantization noise in the peaks, at the cost of an increase of quantization noise in the valleys where it is anyway not perceptible. 
     Step 5: Logarithm ( 115 ) 
     A transformation into the logarithm domain is then performed using 
     
       
         
           
             
               
                 E 
                 L 
               
               ⁡ 
               
                 ( 
                 b 
                 ) 
               
             
             = 
             
               
                 
                   
                     
                       log 
                       2 
                     
                     ⁡ 
                     
                       ( 
                       
                         
                           E 
                           P 
                         
                         ⁡ 
                         
                           ( 
                           b 
                           ) 
                         
                       
                       ) 
                     
                   
                   2 
                 
                 ⁢ 
                 
                     
                 
                 ⁢ 
                 for 
                 ⁢ 
                 
                     
                 
                 ⁢ 
                 b 
               
               = 
               
                 0 
                 ⁢ 
                 
                     
                 
                 ⁢ 
                 … 
                 ⁢ 
                 
                     
                 
                 ⁢ 
                 63 
               
             
           
         
       
     
     Step 6: Downsampling ( 131 ,  132 ) 
     The vector E L  (b) is then downsampled by a factor of 4 using 
     
       
         
           
             
               
                 E 
                 4 
               
               ⁡ 
               
                 ( 
                 b 
                 ) 
               
             
             = 
             
               { 
               
                 
                   
                     
                       
                         
                           
                             
                               
                                 w 
                                 ⁡ 
                                 
                                   ( 
                                   0 
                                   ) 
                                 
                               
                               ⁢ 
                               
                                 
                                   E 
                                   L 
                                 
                                 ⁡ 
                                 
                                   ( 
                                   0 
                                   ) 
                                 
                               
                             
                             + 
                             
                               
                                 ∑ 
                                 
                                   k 
                                   = 
                                   1 
                                 
                                 5 
                               
                               ⁢ 
                               
                                 
                                   w 
                                   ⁡ 
                                   
                                     ( 
                                     k 
                                     ) 
                                   
                                 
                                 ⁢ 
                                 
                                   
                                     E 
                                     L 
                                   
                                   ⁡ 
                                   
                                     ( 
                                     
                                       
                                         4 
                                         ⁢ 
                                         b 
                                       
                                       + 
                                       k 
                                       - 
                                       1 
                                     
                                     ) 
                                   
                                 
                               
                             
                           
                           , 
                         
                       
                       
                         
                           
                             if 
                             ⁢ 
                             
                                 
                             
                             ⁢ 
                             b 
                           
                           = 
                           0 
                         
                       
                     
                     
                       
                         
                           
                             
                               
                                 ∑ 
                                 
                                   k 
                                   = 
                                   0 
                                 
                                 4 
                               
                               ⁢ 
                               
                                 
                                   w 
                                   ⁡ 
                                   
                                     ( 
                                     k 
                                     ) 
                                   
                                 
                                 ⁢ 
                                 
                                   
                                     E 
                                     L 
                                   
                                   ⁡ 
                                   
                                     ( 
                                     
                                       
                                         4 
                                         ⁢ 
                                         b 
                                       
                                       + 
                                       k 
                                       - 
                                       1 
                                     
                                     ) 
                                   
                                 
                               
                             
                             + 
                             
                               
                                 w 
                                 ⁡ 
                                 
                                   ( 
                                   5 
                                   ) 
                                 
                               
                               ⁢ 
                               
                                 
                                   E 
                                   L 
                                 
                                 ⁡ 
                                 
                                   ( 
                                   63 
                                   ) 
                                 
                               
                             
                           
                           , 
                         
                       
                       
                         
                           
                             if 
                             ⁢ 
                             
                                 
                             
                             ⁢ 
                             b 
                           
                           = 
                           15 
                         
                       
                     
                     
                       
                         
                           
                             
                               ∑ 
                               
                                 k 
                                 = 
                                 0 
                               
                               5 
                             
                             ⁢ 
                             
                               
                                 w 
                                 ⁡ 
                                 
                                   ( 
                                   k 
                                   ) 
                                 
                               
                               ⁢ 
                               
                                 
                                   E 
                                   L 
                                 
                                 ⁡ 
                                 
                                   ( 
                                   
                                     
                                       4 
                                       ⁢ 
                                       b 
                                     
                                     + 
                                     k 
                                     - 
                                     1 
                                   
                                   ) 
                                 
                               
                             
                           
                           , 
                         
                       
                       
                         otherwise 
                       
                     
                   
                   ⁢ 
                   
                     
 
                   
                   ⁢ 
                   With 
                   ⁢ 
                   
                     
 
                   
                   ⁢ 
                   
                     w 
                     ⁡ 
                     
                       ( 
                       k 
                       ) 
                     
                   
                 
                 = 
                 
                   { 
                   
                     
                       1 
                       
                         1 
                         ⁢ 
                         2 
                       
                     
                     , 
                     
                       2 
                       
                         1 
                         ⁢ 
                         2 
                       
                     
                     , 
                     
                       3 
                       
                         1 
                         ⁢ 
                         2 
                       
                     
                     , 
                     
                       3 
                       
                         1 
                         ⁢ 
                         2 
                       
                     
                     , 
                     
                       2 
                       
                         1 
                         ⁢ 
                         2 
                       
                     
                     , 
                     
                       1 
                       
                         1 
                         ⁢ 
                         2 
                       
                     
                   
                   } 
                 
               
             
           
         
       
     
     This step applies a low-pass filter (w(k)) on the vector E L (b) before decimation. This low-pass filter has a similar effect as the spreading function used in psychoacoustic models: it reduces the quantization noise at the peaks, at the cost of an increase of quantization noise around the peaks where it is anyway perceptually masked. 
     Step 7: Mean Removal and Scaling ( 133 ,  134 ) 
     The final scale factors are obtained after mean removal and scaling by a factor of 0.85 
     
       
         
           
             
               scf 
               ⁡ 
               
                 ( 
                 n 
                 ) 
               
             
             = 
             
               
                 
                   0 
                   . 
                   8 
                 
                 ⁢ 
                 5 
                 ⁢ 
                 
                   ( 
                   
                     
                       
                         E 
                         4 
                       
                       ⁡ 
                       
                         ( 
                         n 
                         ) 
                       
                     
                     - 
                     
                       
                         
                           ∑ 
                           
                             b 
                             = 
                             0 
                           
                           
                             1 
                             ⁢ 
                             5 
                           
                         
                         ⁢ 
                         
                           
                             E 
                             4 
                           
                           ⁡ 
                           
                             ( 
                             b 
                             ) 
                           
                         
                       
                       
                         1 
                         ⁢ 
                         6 
                       
                     
                   
                   ) 
                 
                 ⁢ 
                 
                     
                 
                 ⁢ 
                 for 
                 ⁢ 
                 
                     
                 
                 ⁢ 
                 n 
               
               = 
               
                 0 
                 ⁢ 
                 
                     
                 
                 ⁢ 
                 … 
                 ⁢ 
                 
                     
                 
                 ⁢ 
                 15 
               
             
           
         
       
     
     Since the codec has an additional global-gain, the mean can be removed without any loss of information. Removing the mean also allows more efficient vector quantization. The scaling of 0.85 slightly compress the amplitude of the noise shaping curve. It has a similar perceptual effect as the spreading function mentioned in Step 6: reduced quantization noise at the peaks and increased quantization noise in the valleys. 
     Step 8: Quantization ( 141 ,  142 ) 
     The scale factors are quantized using vector quantization, producing indices which are then packed into the bitstream and sent to the decoder, and quantized scale factors scfQ(n). 
     Step 9: Interpolation ( 121 ,  122 ) 
     The quantized scale factors scfQ(n) are interpolated using 
               scfQint   ⁡     (   0   )       =     scfQ   ⁡     (   0   )                     scfQint   ⁡     (   1   )       =     scfQ   ⁡     (   0   )                     scfQint   ⁡     (       4   ⁢   n     +   2     )       =         scfQ   ⁡     (   n   )       +       1   8     ⁢     (       scfQ   ⁡     (     n   +   1     )       -     scfQ   ⁡     (   n   )         )     ⁢           ⁢   for   ⁢           ⁢   n       =     0   ⁢           ⁢   …   ⁢           ⁢   14                     scfQint   ⁡     (       4   ⁢   n     +   3     )       =         scfQ   ⁡     (   n   )       +       3   8     ⁢     (       scfQ   ⁡     (     n   +   1     )       -     scfQ   ⁡     (   n   )         )     ⁢           ⁢   for   ⁢           ⁢   n       =     0   ⁢           ⁢   …   ⁢           ⁢   14                     scfQint   ⁡     (       4   ⁢   n     +   4     )       =         scfQ   ⁡     (   n   )       +       5   8     ⁢     (       scfQ   ⁡     (     n   +   1     )       -     scfQ   ⁡     (   n   )         )     ⁢           ⁢   for   ⁢           ⁢   n       =     0   ⁢           ⁢   …   ⁢           ⁢   14                     scfQint   ⁡     (       4   ⁢   n     +   5     )       =         scfQ   ⁡     (   n   )       +       7   8     ⁢     (       scfQ   ⁡     (     n   +   1     )       -     scfQ   ⁡     (   n   )         )     ⁢           ⁢   for   ⁢           ⁢   n       =     0   ⁢           ⁢   …   ⁢           ⁢   14                     scfQint   ⁡     (   62   )       =       scfQ   ⁡     (   15   )       +       1   8     ⁢     (       scfQ   ⁡     (   15   )       -     scfQ   ⁡     (   14   )         )                       scfQint   ⁡     (   63   )       =       scfQ   ⁡     (   15   )       +       3   8     ⁢     (       scfQ   ⁡     (   15   )       -     scfQ   ⁡     (   14   )         )               
and transformed back into linear domain using
 
 g   SNS ( b )=2 scfQint(b)  for  b= 0 . . . 63
 
     Interpolation is used to get a smooth noise shaping curve and thus to avoid any big amplitude jumps between adjacent bands. 
     Step 10: Spectral Shaping ( 123 ) 
     The SNS scale factors g SNS (b) are applied on the MDCT frequency lines for each band separately in order to generate the shaped spectrum X s (k) 
     
       
         
           
             
               
                 
                   X 
                   s 
                 
                 ⁡ 
                 
                   ( 
                   k 
                   ) 
                 
               
               = 
               
                 
                   
                     
                       X 
                       ⁡ 
                       
                         ( 
                         k 
                         ) 
                       
                     
                     
                       
                         g 
                         SNS 
                       
                       ⁡ 
                       
                         ( 
                         b 
                         ) 
                       
                     
                   
                   ⁢ 
                   
                       
                   
                   ⁢ 
                   for 
                   ⁢ 
                   
                       
                   
                   ⁢ 
                   k 
                 
                 = 
                 
                   
                     
                       Ind 
                       ⁡ 
                       
                         ( 
                         b 
                         ) 
                       
                     
                     ⁢ 
                     
                         
                     
                     ⁢ 
                     … 
                     ⁢ 
                     
                         
                     
                     ⁢ 
                     
                       Ind 
                       ⁡ 
                       
                         ( 
                         
                           b 
                           + 
                           1 
                         
                         ) 
                       
                     
                   
                   - 
                   1 
                 
               
             
             , 
             
               
                 for 
                 ⁢ 
                 
                     
                 
                 ⁢ 
                 b 
               
               = 
               
                 0 
                 ⁢ 
                 
                     
                 
                 ⁢ 
                 … 
                 ⁢ 
                 
                     
                 
                 ⁢ 
                 63 
               
             
           
         
       
     
       FIG. 8  illustrates an advantageous implementation of an apparatus for decoding an encoded audio signal  250  comprising information on an encoded spectral representation and information on an encoded representation of a second set of scale parameters. The decoder comprises an input interface  200 , a spectrum decoder  210 , a scale factor/parameter decoder  220 , a spectral processor  230  and a converter  240 . The input interface  200  is configured for receiving the encoded audio signal  250  and for extracting the encoded spectral representation that is forwarded to the spectrum decoder  210  and for extracting the encoded representation of the second set of scale factors that is forwarded to the scale factor decoder  220 . Furthermore, the spectrum decoder  210  is configured for decoding the encoded spectral representation to obtain a decoded spectral representation that is forwarded to the spectral processor  230 . The scale factor decoder  220  is configured for decoding the encoded second set of scale parameters to obtain a first set of scale parameters forwarded to the spectral processor  230 . The first set of scale factors has a number of scale factors or scale parameters that is greater than the number of scale factors or scale parameters in the second set. The spectral processor  230  is configured for processing the decoded spectral representation using the first set of scale parameters to obtain a scaled spectral representation. The scaled spectral representation is then converted by the converter  240  to finally obtain the decoded audio signal  260 . 
     Advantageously, the scale factor decoder  220  is configured to operate in substantially the same manner as has been discussed with respect to the spectral processor  120  of  FIG. 1  relating to the calculation of the third set of scale factors or scale parameters as discussed in connection with blocks  141  or  142  and, particularly, with respect to blocks  121 ,  122  of  FIG. 5 . Particularly, the scale factor decoder is configured to perform the substantially same procedure for the interpolation and the transformation back into the linear domain as has been discussed before with respect to step 9. Thus, as illustrated in  FIG. 9 , the scale factor decoder  220  is configured for applying a decoder codebook  221  to the one or more indices per frame representing the encoded scale parameter representation. Then, an interpolation is performed in block  222  that is substantially the same interpolation as has been discussed with respect to block  121  in  FIG. 5 . Then, a linear domain converter  223  is used that is substantially the same linear domain converter  122  as has been discussed with respect to  FIG. 5 . However, in other implementations, blocks  221 ,  222 ,  223  can operate different from what has been discussed with respect to the corresponding blocks on the encoder-side. 
     Furthermore, the spectrum decoder  210  illustrated in  FIG. 8  comprises a dequantizer/decoder block that receives, as an input, the encoded spectrum and that outputs a dequantized spectrum that is advantageously dequantized using the global gain that is additionally transmitted from the encoder side to the decoder side within the encoded audio signal in an encoded form. The dequantizer/decoder  210  can, for example, comprise an arithmetic or Huffman decoder functionality that receives, as an input, some kind of codes and that outputs quantization indices representing spectral values. Then, these quantization indices are input into a dequantizer together with the global gain and the output are dequantized spectral values that can then be subjected to a TNS processing such as an inverse prediction over frequency in a TNS decoder processing block  211  that, however, is optional. Particularly, the TNS decoder processing block additionally receives the TNS side information that has been generated by block  124  of  FIG. 5  as indicated by line  129 . The output of the TNS decoder processing step  211  is input into a spectral shaping block  212 , where the first set of scale factors as calculated by the scale factor decoder are applied to the decoded spectral representation that can or cannot be TNS processed as the case may be, and the output is the scaled spectral representation that is then input into the converter  240  of  FIG. 8 . 
     Further procedures of advantageous embodiments of the decoder are discussed subsequently. 
     Decoder: 
     Step 1: Quantization ( 221 ) 
     The vector quantizer indices produced in encoder step 8 are read from the bitstream and used to decode the quantized scale factors scfQ(n). 
     Step 2: Interpolation ( 222 ,  223 ) 
     Same as Encoder Step 9. 
     Step 3: Spectral Shaping ( 212 ) 
     The SNS scale factors g SNS (b) are applied on the quantized MDCT frequency lines for each band separately in order to generate the decoded spectrum {circumflex over (X)}(k) as outlined by the following code.
 
 {circumflex over (X)} ( k )= {circumflex over (X)}   S ( sk )· g   SNS ( b ) for  k=Ind ( b ) . . .  Ind ( b+ 1)−1, for  b= 0 . . . 63
 
       FIG. 6  and  FIG. 7  illustrate a general encoder/decoder setup where  FIG. 6  represents an implementation without TNS processing, while  FIG. 7  illustrates an implementation that comprises TNS processing. Similar functionalities illustrated in  FIG. 6  and  FIG. 7  correspond to similar functionalities in the other figures when identical reference numerals are indicated. Particularly, as illustrated in  FIG. 6 , the input signal  160  is input into a transform stage  110  and, subsequently, the spectral processing  120  is performed. Particularly, the spectral processing is reflected by an SNS encoder indicated by reference numerals  123 ,  110 ,  130 ,  140  indicating that the block SNS encoder implements the functionalities indicated by these reference numerals. Subsequently to the SNS encoder block, a quantization encoding operation  125  is performed, and the encoded signal is input into the bitstream as indicated at  180  in  FIG. 6 . The bitstream  180  then occurs at the decoder-side and subsequent to an inverse quantization and decoding illustrated by reference numeral  210 , the SNS decoder operation illustrated by blocks  210 ,  220 ,  230  of  FIG. 8  are performed so that, in the end, subsequent to an inverse transform  240 , the decoded output signal  260  is obtained. 
       FIG. 7  illustrates a similar representation as in  FIG. 6 , but it is indicated that, advantageously, the TNS processing is performed subsequent to SNS processing on the encoder-side and, correspondingly, the TNS processing  211  is performed before the SNS processing  212  with respect to the processing sequence on the decoder-side. 
     Advantageously the additional tool TNS between Spectral Noise Shaping (SNS) and quantization/coding (see block diagram below) is used. TNS (Temporal Noise Shaping) also shapes the quantization noise but does a time-domain shaping (as opposed to the frequency-domain shaping of SNS) as well. TNS is useful for signals containing sharp attacks and for speech signals. 
     TNS is usually applied (in AAC for example) between the transform and SNS. Advantageously, however, it may be advantageous to apply TNS on the shaped spectrum. This avoids some artifacts that were produced by the TNS decoder when operating the codec at low bitrates. 
       FIG. 10  illustrates an advantageous subdivision of the spectral coefficients or spectral lines as obtained by block  100  on the encoder-side into bands. Particularly, it is indicated that lower bands have a smaller number of spectral lines than higher bands. 
     Particularly, the x-axis in  FIG. 10  corresponds to the index of bands and illustrates the advantageous embodiment of 64 bands and the y-axis corresponds to the index of the spectral lines illustrating 320 spectral coefficients in one frame. Particularly,  FIG. 10  illustrates exemplarily the situation of the super wide band (SWB) case where there is a sampling frequency of 32 kHz. 
     For the wide band case, the situation with respect to the individual bands is so that one frame results in 160 spectral lines and the sampling frequency is 16 kHz so that, for both cases, one frame has a length in time of 10 milliseconds. 
       FIG. 11  illustrates more details on the advantageous downsampling performed in the downsampler  130  of  FIG. 1  or the corresponding upsampling or interpolation as performed in the scale factor decoder  220  of  FIG. 8  or as illustrated in block  222  of  FIG. 9 . 
     Along the x-axis, the index for the bands 0 to 63 is given. Particularly, there are 64 bands going from 0 to 63. 
     The 16 downsample points corresponding to scfQ(i) are illustrated as vertical lines  1100 . Particularly,  FIG. 11  illustrates how a certain grouping of scale parameters is performed to finally obtain the downsampled point  1100 . Exemplarily, the first block of four bands consists of (0, 1, 2, 3) and the middle point of this first block is at 1.5 indicated by item  1100  at the index 1.5 along the x-axis. 
     Correspondingly, the second block of four bands is (4, 5, 6, 7), and the middle point of the second block is 5.5. 
     The windows  1110  correspond to the windows w(k) discussed with respect to the step 6 downsampling described before. It can be seen that these windows are centered at the downsampled points and there is the overlap of one block to each side as discussed before. 
     The interpolation step  222  of  FIG. 9  recovers the 64 bands from the 16 downsampled points. This is seen in  FIG. 11  by computing the position of any of the lines  1120  as a function of the two downsampled points indicated at  1100  around a certain line  1120 . The following example exemplifies that. 
     The position of the second band is calculated as a function of the two vertical lines around it (1.5 and 5.5): 2=1.5+1/8×(5.5−1.5). 
     Correspondingly, the position of the third band as a function of the two vertical lines  1100  around it (1.5 and 5.5): 3=1.5+3/8×(5.5−1.5). 
     A specific procedure is performed for the first two bands and the last two bands. For these bands, an interpolation cannot be performed, because there would not exist vertical lines or values corresponding to vertical lines  1100  outside the range going from 0 to 63. Thus, in order to address this issue, an extrapolation is performed as described with respect to step 9: interpolation as outlined before for the two bands 0, 1 on the one hand and 62 and 63 on the other hand. 
     Subsequently, an advantageous implementation of the converter  100  of  FIG. 1  on the one hand and the converter  240  of  FIG. 8  on the other hand are discussed. 
     Particularly,  FIG. 12 a    illustrates a schedule for indicating the framing performed on the encoder-side within converter  100 .  FIG. 12 b    illustrates an advantageous implementation of the converter  100  of  FIG. 1  on the encoder-side and  FIG. 12 c    illustrates an advantageous implementation of the converter  240  on the decoder-side. 
     The converter  100  on the encoder-side is advantageously implemented to perform a framing with overlapping frames such as a 50% overlap so that frame 2 overlaps with frame 1 and frame 3 overlaps with frame 2 and frame 4. However, other overlaps or a non-overlapping processing can be performed as well, but it may be advantageous to perform a 50% overlap together with an MDCT algorithm. To this end, the converter  100  comprises an analysis window  101  and a subsequently-connected spectral converter  102  for performing an FFT processing, an MDCT processing or any other kind of time-to-spectrum conversion processing to obtain a sequence of frames corresponding to a sequence of spectral representations as input in  FIG. 1  to the blocks subsequent to the converter  100 . 
     Correspondingly, the scaled spectral representation(s) are input into the converter  240  of  FIG. 8 . Particularly, the converter comprises a time-converter  241  implementing an inverse FFT operation, an inverse MDCT operation or a corresponding spectrum-to-time conversion operation. The output is inserted into a synthesis window  242  and the output of the synthesis window  242  is input into an overlap-add processor  243  to perform an overlap-add operation in order to finally obtain the decoded audio signal. Particularly, the overlap-add processing in block  243 , for example, performs a sample-by-sample addition between corresponding samples of the second half of, for example, frame 3 and the first half of frame 4 so that the audio sampling values for the overlap between frame 3 and frame 4 as indicated by item  1200  in  FIG. 12 a    is obtained. Similar overlap-add operations in a sample-by-sample manner are performed to obtain the remaining audio sampling values of the decoded audio output signal. 
     An inventively encoded audio signal can be stored on a digital storage medium or a non-transitory 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. 
     Although 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. 
     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. 
     Some embodiments according to the invention comprise a 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. 
     Generally, 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. 
     Other embodiments comprise the computer program for performing one of the methods described herein, stored on a machine readable carrier or a non-transitory storage medium. 
     In 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. 
     A 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. 
     A 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. 
     A 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. 
     A further embodiment comprises a computer having installed thereon the computer program for performing one of the methods described herein. 
     In 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 advantageously performed by any hardware apparatus. 
     While this invention has been described in terms of several embodiments, there are alterations, permutations, and equivalents which fall within the scope of this invention. It should also be noted that there are many alternative ways of implementing the methods and compositions of the present invention. It is therefore intended that the following appended claims be interpreted as including all such alterations, permutations and equivalents as fall within the true spirit and scope of the present invention. 
     BIBLIOGRAPHY 
     
         
         [1] ISO/IEC 14496-3:2001; Information technology—Coding of audio-visual objects—Part 3: Audio. 
         [2] 3GPP TS 26.403; General audio codec audio processing functions; Enhanced aacPlus general audio codec; Encoder specification; Advanced Audio Coding (AAC) part. 
         [3] ISO/IEC 23003-3; Information technology—MPEG audio technologies—Part 3: Unified speech and audio coding. 
         [4] 3GPP TS 26.445; Codec for Enhanced Voice Services (EVS); Detailed algorithmic description.