Post-Quantization Gain Correction in Audio Coding

Abstract

A gain adjustment apparatus for use in decoding of audio that has been encoded with separate gain and shape representations includes an accuracy meter configured to estimate an accuracy measure of the shape representation, and to determine a gain correction based on the estimated accuracy measure. An envelope adjuster further included in the apparatus is configured to adjust the gain representation based on the determined gain correction.

Claims

1. A gain adjustment method in decoding an audio signal that has been encoded with separate gain and shape representations, said method comprising: estimating an accuracy measure of the shape representation for a frequency band of the audio signal, wherein the shape representation encodes a shape vector comprising coefficients of the audio signal for the frequency band, and wherein the shape vector has been encoded using a pulse vector coding scheme where pulses may be added on top of each other to form pulses of different height, and the accuracy measure is based on the number of pulses used for encoding the shape vector and a height of the maximum pulse in the shape representation; determining, based on the estimated accuracy measure, a gain correction; and adjusting the gain representation for the frequency band based on the determined gain correction.

2. The method of claim 1, further comprising determining the gain correction in dependence on a position of the frequency band relative to one or more defined frequency thresholds.

3. The method of claim 1, further comprising: estimating a gain attenuation that depends on an allocated bit rate used for the shape representation; determining the gain correction based on the estimated accuracy measure and the estimated gain attenuation.

4. The method of claim 3, further comprising estimating the gain attenuation from a lookup table that associates different gain attenuations with different allocated bit rates or ranges of allocated bit rates.

5. The method of claim 3, further comprising estimating the accuracy measure from a lookup table that associates different accuracy measures with different numbers of pulses and/or different heights of the maximum pulse, as used for the shape representation.

6. The method of claim 3, further comprising estimating the accuracy measure from a linear function of the maximum pulse height and the allocated bit rate.

7. The method of claim 1, further comprising adapting the gain correction to a determined audio signal class of the audio signal.

8. A gain adjustment apparatus for use in decoding an audio signal that has been encoded with separate gain and shape representations, said apparatus comprising: a first digital processing circuit that is configured to estimate an accuracy measure of the shape representation for a frequency band of the audio signal, and to determine a gain correction based on the accuracy measure, wherein the shape representation encodes a shape vector comprising coefficients of the audio signal for the frequency band, and wherein the shape vector has been encoded using a pulse vector coding scheme where pulses may be added on top of each other to form pulses of different height, and the accuracy measure is based on the number of pulses used for encoding the shape vector and a height of the maximum pulse in the shape representation; and a second digital processing circuit that is configured to adjust the gain representation for the frequency band based on the determined gain correction.

9. The apparatus of claim 8, wherein the first digital processing circuit is further configured to determine the gain correction in dependence on a position of the frequency band relative to one or more defined frequency thresholds.

10. The apparatus of claim 8, wherein the first digital processing circuit is further configured to estimate a gain attenuation that depends on an allocated bit rate used for the shape representation, and wherein the first digital processing circuit is configured to determine the gain correction based on the estimated accuracy measure and the estimated gain attenuation.

11. The apparatus of claim 10, wherein the first digital processing circuit is configured to estimate the gain attenuation using a lookup table that associates different gain attenuations with different allocated bit rates or ranges of allocated bit rates.

12. The apparatus of claim 10, wherein the first digital processing circuit is configured to estimate the accuracy measure from a lookup table that associates different accuracy measures with different numbers of pulses and/or different heights of the maximum pulse, as used for the shape representation.

13. The apparatus of claim 10, wherein the first digital processing circuit is configured to estimate the accuracy measure from a linear function of the maximum pulse height and the allocated bit rate.

14. The apparatus of claim 8, wherein the first digital processing circuit is configured to adapt the gain correction to a determined audio signal class of the audio signal.

15. A decoder comprising the gain adjustment apparatus of claim 8.

16. A network node comprising the decoder of claim 15.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

[0022] The present technology, together with further objects and advantages thereof, may best be understood by making reference to the following description taken together with the accompanying drawings, in which:

[0023] FIG. 1 illustrates an example gain-shape vector quantization scheme;

[0024] FIG. 2 illustrates an example transform domain coding and decoding scheme;

[0025] FIG. 3A-C illustrates gain-shape vector quantization in a simplified case;

[0026] FIG. 4 illustrates an example transform domain decoder using an accuracy measure to determine an envelope correction;

[0027] FIG. 5A-B illustrates an example result of scaling the synthesis with gain factors when the shape vector is a sparse pulse vector;

[0028] FIG. 6A-B illustrates how the largest pulse height can indicate the accuracy of the shape vector;

[0029] FIG. 7 illustrates an example of a rate based attenuation function for embodiment 1;

[0030] FIG. 8 illustrates an example of a rate and maximum pulse height dependent gain adjustment function for embodiment 1;

[0031] FIG. 9 illustrates another example of a rate and maximum pulse height dependent gain adjustment function for embodiment 1;

[0032] FIG. 10 illustrates an embodiment of the present technology in the context of an MDCT based audio coder and decoder system;

[0033] FIG. 11 illustrates an example of a mapping function from the stability measure to the gain adjustment limitation factor;

[0034] FIG. 12 illustrates an example of an ADPCM encoder and decoder system with an adaptive step size;

[0035] FIG. 13 illustrates an example in the context of a subband ADPCM based audio coder and decoder system;

[0036] FIG. 14 illustrates an embodiment of the present technology in the context of a subband ADPCM based audio coder and decoder system;

[0037] FIG. 15 illustrates an example transform domain encoder including a signal classifier;

[0038] FIG. 16 illustrates another example transform domain decoder using an accuracy measure to determine an envelope correction;

[0039] FIG. 17 illustrates an embodiment of a gain adjustment apparatus in accordance with the present technology;

[0040] FIG. 18 illustrates an embodiment of gain adjustment in accordance with the present technology in more detail;

[0041] FIG. 19 is a flow chart illustrating the method in accordance with the present technology;

[0042] FIG. 20 is a flow chart illustrating an embodiment of the method in accordance with the present technology; and

[0043] FIG. 21 illustrates an embodiment of a network in accordance with the present technology.

DETAILED DESCRIPTION

[0044] In the following description the same reference designations will be used for elements performing the same or similar function.

[0045] Before the present technology is described in detail, gain-shape coding will be illustrated with reference to FIG. 1-3.

[0046] FIG. 1 illustrates an example gain-shape vector quantization scheme. The upper part of the figure illustrates the encoder side. An input vector x is forwarded to a norm calculator 10, which determines the vector norm (gain) g, typically the Euclidian norm. This exact norm is quantized in a norm quantizer 12, and the inverse 1/ĝ of the quantized norm ĝ is forwarded to a multiplier 14 for scaling the input vector x into a shape. The shape is quantized in a shape quantizer 16. Representations of the quantized gain and shape are forwarded to a bitstream multiplexer (mux) 18. These representations are illustrated by dashed lines to indicate that they may, for example, constitute indices into tables (code books) rather than the actual quantized values.

[0047] The lower part of FIG. 1 illustrates the decoder side. A bitstream demultiplexer (demux) 20 receives the gain and shape representations. The shape representation is forwarded to a shape dequantizer 22, and the gain representation is forwarded to a gain dequantizer 24. The obtained gain ĝ is forwarded to a multiplier 26, where it scales the obtained shape, which gives the reconstructed vector {circumflex over (x)}.

[0048] FIG. 2 illustrates an example transform domain coding and decoding scheme. The upper part of the figure illustrates the encoder side. An input signal is forwarded to a frequency transformer 30, for example, based on the Modified Discrete Cosine Transform (MDCT), to produce the frequency transform X. The frequency transform X is forwarded to an envelope calculator 32, which determines the energy E(b) of each frequency band b. These energies are quantized into energies Ê(b) in an envelope quantizer 34. The quantized energies Ê(b) are forwarded to an envelope normalizer 36, which scales the coefficients of frequency band b of the transform X with the inverse of the corresponding quantized energy Ê(b) of the envelope. The resulting scaled shapes are forwarded to a fine structure quantizer 38. The quantized energies Ê(b) are also forwarded to a bit allocator 40, which allocates bits for fine structure quantization to each frequency band b. As noted above, the bit allocation R(b) may be based on a model of the human auditory system. Representations of the quantized gains Ê(b) and corresponding quantized shapes are forwarded to bitstream multiplexer 18.

[0049] The lower part of FIG. 2 illustrates the decoder side. The bitstream demultiplexer 20 receives the gain and shape representations. The gain representations are forwarded to an envelope dequantizer 42. The generated envelope energies Ê(b) are forwarded to a bit allocator 44, which determines the bit allocation R(b) of the received shapes. The shape representations are forwarded to a fine structure dequantizer 46, which is controlled by the bit allocation R(b). The decoded shapes are forwarded to an envelope shaper 48, which scales them with the corresponding envelope energies Ê(b) to form a reconstructed frequency transform. This transform is forwarded to an inverse frequency transformer 50, for example, based on the Inverse Modified Discrete Cosine Transform (IMDCT), which produces an output signal representing synthesized audio.

[0050] FIG. 3A-C illustrates gain-shape vector quantization described above in a simplified case where the frequency band b is represented by the 2-dimensional vector X(b) in FIG. 3A. This case is simple enough to be illustrated in a drawing, but also general enough to illustrate the problem with gain-shape quantization (in practice the vectors typically have 8 or more dimensions). The right hand side of FIG. 3A illustrates an exact gain-shape representation of the vector X(b) with a gain E(b) and a shape (unit length vector) N′(b).

[0051] However, as illustrated in FIG. 3B, the exact gain E(b) is encoded into a quantized gain Ê(b) on the encoder side. Since the inverse of the quantized gain Ê(b) is used for scaling of the vector X(b), the resulting scaled vector N(b) will point in the correct direction, but will not necessarily be of unit length. During shape quantization, the scaled vector N(b) is quantized into the quantized shape {circumflex over (N)}(b). In this case, the quantization is based on a pulse coding scheme [3], which constructs the shape (or direction) from a sum of signed integer pulses. The pulses may be added on top of each other for each dimension. This means that the allowed shape quantization positions are represented by the large dots in the rectangular grids illustrated in FIG. 3B-C. The result is that the quantized shape {circumflex over (N)}(b) will in general not coincide with the shape (direction) of N(b) (and N′(b)).

[0052] FIG. 3C illustrates that the accuracy of the shape quantization depends on the allocated bits R(b), or equivalently the total number of pulses available for shape quantization. In the left part of FIG. 3C the shape quantization is based on 8 pulses, whereas the shape quantization in the right part uses only 3 pulses (the example in FIG. 3B uses 4 pulses).

[0053] Thus, it is appreciated that depending on the accuracy of the shape quantizer, the gain value Ê(b) used to reconstruct the vector X(b) on the decoder side may be more or less appropriate. In accordance with the present technology, a gain correction can be based on an accuracy measure of the quantized shape.

[0054] The accuracy measure used to correct the gain may be derived from parameters already available in the decoder, but it may also depend on additional parameters designated for the accuracy measure. Typically, the parameters would include the number of allocated bits for the shape vector and the shape vector itself, but it may also include the gain value associated with the shape vector and pre-stored statistics about the signals that are typical for the encoding and decoding system. An overview of a system incorporating an accuracy measure and gain correction or adjustment is shown in FIG. 4.

[0055] FIG. 4 illustrates an example transform domain decoder 300 using an accuracy measure to determine an envelope correction. In order to avoid cluttering of the drawing, only the decoder side is illustrated. The encoder side may be implemented as in FIG. 2. The new feature is a gain adjustment apparatus 60. The gain adjustment apparatus 60 includes an accuracy meter 62 configured to estimate an accuracy measure A(b) of the shape representation {circumflex over (N)}(b), and to determine a gain correction g.sub.c(b) based on the estimated accuracy measure A(b). It also includes an envelope adjuster 64 configured to adjust the gain representation Ê(b) based on the determined gain correction.

[0056] As indicated above, the gain correction may in some embodiments be performed without spending additional bits. This is done by estimating the gain correction from parameters already available in the decoder. This process can be described as an estimation of the accuracy of the encoded shape. Typically, this estimation includes deriving the accuracy measure A(b) from shape quantization characteristics indicating the resolution of the shape quantization.

Embodiment 1

[0057] In one embodiment, the present technology is used in an audio encoder/decoder system. The system is transform based and the transform used is the Modified Discrete Cosine Transform (MDCT) using sinusoidal windows with 50% overlap. However, it is understood that any transform suitable for transform coding may be used together with appropriate segmentation and windowing.

Encoder of Embodiment 1

[0058] The input audio is extracted into frames using 50% overlap and windowed with a symmetric sinusoidal window. Each windowed frame is then transformed to an MDCT spectrum X. The spectrum is partitioned into subbands for processing, where the subband widths are non-uniform. The spectral coefficients of frame m belonging to band b are denoted X(b,m) and have the bandwidth BW(b). Since most encoder and decoder steps can be described within one frame, we omit the frame index and just use the notation X(b). The bandwidths should preferably increase with increasing frequency to comply with the frequency resolution of the human auditory system. The root-mean-square (RMS) value of each band is used as a normalization factor and is denoted E(b):

[00001]$\begin{array}{cc}E\left(b\right)=\sqrt{\frac{{X\left(b\right)}^T.Math.X\left(b\right)}{\mathrm{BW}\left(b\right)}}& \left(1\right)\end{array}$

where X(b).sup.T denotes the transpose of X(b).

[0059] The RMS value can be seen as the energy value per coefficient. The sequence of normalization factors E(b) for b=1, 2, . . . , N.sub.bands forms the envelope of the MDCT spectrum, where N.sub.bands denotes the number of bands. Next, the sequence is quantized in order to be transmitted to the decoder. To ensure that the normalization can be reversed in the decoder, the quantized envelope E(b) is obtained. In this example embodiment the envelope coefficients are scalar quantized in log domain using a step size of 3 dB and the quantizer indices are differentially encoded using Huffman coding. The quantized envelope is used for normalization of the spectral bands, i.e.:

[00002]$\begin{array}{cc}N\left(b\right)=\frac{1}{\hat{E}\left(b\right)}.Math.X\left(b\right)& \left(2\right)\end{array}$

Note that if the non-quantized envelope E(b) is used for normalization, the shape would have RMS=1, i.e.:

[00003]$\begin{array}{cc}{N}^{\prime }\left(b\right)=\frac{1}{E\left(b\right)}.Math.X\left(b\right).Math.\sqrt{\frac{{N^{\prime }\left(b\right)}^T.Math.N^{\prime }\left(b\right)}{\mathrm{BW}\left(b\right)}}=1& \left(3\right)\end{array}$

By using the quantized envelope Ê(b), the shape vector will have an RMS value close to 1. This feature will be used in the decoder to create an approximation of the gain value.

[0060] The union of the normalized shape vectors N(b) forms the fine structure of the MDCT spectrum. The quantized envelope is used to produce a bit allocation R(b) for encoding of the normalized shape vectors N(b). The bit allocation algorithm preferably uses an auditory model to distribute the bits to the perceptually most relevant parts. Any quantizer scheme may be used for encoding the shape vector. Common for all is that they may be designed under the assumption that the input is normalized, which simplifies quantizer design. In this embodiment the shape quantization is done using a pulse coding scheme which constructs the synthesis shape from a sum of signed integer pulses [3]. The pulses may be added on top of each other to form pulses of different height. In this embodiment the bit allocation R(b) denotes the number of pulses assigned to band b.

[0061] The quantizer indices from the envelope quantization and shape quantization are multiplexed into a bitstream to be stored or transmitted to a decoder.

Decoder of Embodiment 1

[0062] The decoder demultiplexes the indices from the bitstream and forwards the relevant indices to each decoding module. First, the quantized envelope Ê(b) is obtained. Next, the fine structure bit allocation is derived from the quantized envelope using a bit allocation identical the one used in the encoder. The shape vectors {circumflex over (N)}(b) of the fine structure are decoded using the indices and the obtained bit allocation R(b).

[0063] Now, before scaling the decoded fine structure with the envelope, additional gain correction factors are determined. First, the RMS matching gain is obtained as:

[00004]$\begin{array}{cc}{g}_{\mathrm{RMS}}\left(b\right)=\sqrt{\frac{\mathrm{BW}\left(b\right)}{{\hat{N}\left(b\right)}^T.Math.\hat{N}\left(b\right)}}& \left(4\right)\end{array}$

The g.sub.RMS(b) factor is a scaling factor that normalizes the RMS value to 1, i.e.:

[00005]$\begin{array}{cc}\sqrt{\frac{{\left(g_{\mathrm{RMS}}\left(b\right).Math.\hat{N}\left(b\right)\right)}^T.Math.\left(g_{\mathrm{RMS}}\left(b\right).Math.\hat{N}\left(b\right)\right)}{\mathrm{BW}\left(b\right)}}=1& \left(5\right)\end{array}$

In this embodiment we seek to minimize the mean squared error (MSE) of the synthesis:

[00006]$\begin{array}{cc}{g}_{\mathrm{MSE}}\left(b\right)=\underset{g}{\arg .Math..Math.\min .Math.}.Math..Math.N\left(b\right)-g.Math.\hat{N}\left(b\right).Math.& \left(6\right)\end{array}$

with the solution

[00007]$\begin{array}{cc}{g}_{\mathrm{MSE}}\left(b\right)=\frac{{\hat{N}\left(b\right)}^T.Math.N\left(b\right)}{{N\left(b\right)}^T.Math.N\left(b\right)}& \left(7\right)\end{array}$

[0064] Since g.sub.MSE(b) depends on the input shape N(b), it is not known in the decoder. In this embodiment the impact is estimated by using an accuracy measure. The ratio of these gains is defined as a gain correction factor g.sub.c(b):

[00008]$\begin{array}{cc}{g}_c\left(b\right)=\frac{g_{\mathrm{MSE}}\left(b\right)}{g_{\mathrm{RMS}}\left(b\right)}& \left(8\right)\end{array}$

When the accuracy of the shape quantization is good, the correction factor is close to 1, i.e.:

{circumflex over (N)}(b).fwdarw.N(b)g.sub.c(b).fwdarw.1  (9)

[0065] However, when the accuracy of {circumflex over (N)}(b) is low, g.sub.MSE(b) and g.sub.RMS(b) will diverge. In this embodiment, where the shape is encoded using a pulse coding scheme, a low rate will make the shape vector sparse and g.sub.RMS(b) will give an overestimate of the appropriate gain in terms of MSE. For this case g.sub.c(b) should be lower than 1 to compensate for the overshoot. See FIG. 5A-B for an example illustration of the low rate pulse shape case. FIG. 5A-B illustrates an example of scaling the synthesis with g.sub.MSE (FIG. 5B) and g.sub.RMS (FIG. 5A) gain factors when the shape vector is a sparse pulse vector. The g.sub.RMS scaling gives pulses that are too high in an MSE sense.

[0066] On the other hand, a peaky or sparse target signal can be well represented with a pulse shape. While the sparseness of the input signal may not be known in the synthesis stage, the sparseness of the synthesis shape may serve as an indicator of the accuracy of the synthesized shape vector. One way to measure the sparseness of the synthesis shape is the height of the maximum peak in the shape. The reasoning behind this is that a sparse input signal is more likely to generate high peaks in the synthesis shape. See FIG. 7A-B for an illustration of how the peak height can indicate the accuracy of two equal rate pulse vectors.

[0067] In FIG. 7A there are 5 pulses available (R(b)=5) to represent the dashed shape. Since the shape is rather constant, the coding generated 5 distributed pulses of equal height 1, i.e. P.sub.max=1. In FIG. 7B there are also 5 pulses available to represent the dashed shape. However, in this case the shape is peaky or sparse, and the largest peak is represented by 3 pulses on top of each other, i.e. P.sub.max=3. This indicates that the gain correction g.sub.c(b) depends on an estimated sparseness P.sub.max of the quantized shape.

[0068] As noted above, the input shape N(b) is not known by the decoder. Since g.sub.MSE(b) depends on the input shape N(b), this means that the gain correction or compensation g.sub.c(b) can in practice not be based on the ideal equation (8). In this embodiment the gain correction g.sub.c(b) is instead decided based on the bit-rate in terms of the number of pulses R(b), the height of the largest pulse in the shape vector p.sub.max(b) and the frequency band b, i.e.:

g.sub.c(b)=f(R(b),p.sub.max(b),b)  (10)

[0069] It has been observed that the lower rates generally require an attenuation of the gain to minimize the MSE. The rate dependency may be implemented as a lookup table t(R(b)) which is trained on relevant audio signal data. An example lookup table can be seen in FIG. 7. Since the shape vectors in this embodiment have different widths, the rate may preferably be expressed as number of pulses per sample. In this way the same rate dependent attenuation can be used for all bandwidths. An alternative solution, which is used in this embodiment, is to use a step size T in the table depending on the width of the band. Here, we use 4 different bandwidths in 4 different groups and hence require 4 step sizes. An example of step sizes is found in Table 1. Using the step size, the lookup value is obtained by using a rounding operation t(└R(b).Math.T┘), where └ ┘ represents rounding to the closest integer.

TABLE-US-00001 TABLE 1 Band group Bandwidth Step size T 1 8 4 2 16 4/3 3 24 2 4 34 1
Another example lookup table is given in Table 2.

TABLE-US-00002 TABLE 2 Band group Bandwidth Step size T 1 8 4 2 16 4/3 3 24 2 4 32 1

[0070] The estimated sparseness can be implemented as another lookup table u(R(b), p.sub.max(b)) based on both the number of pulses R(b) and the height of the maximum pulse p.sub.max(b). An example lookup table is shown in FIG. 8. The lookup table u serves as an accuracy measure A(b) for band b, i.e.:

A(b)=u(R(b),p.sub.max(b))  (11)

[0071] It was noted that the approximation of g.sub.MSE was more suitable for the lower frequency range from a perceptual perspective. For the higher frequencies the fine structure becomes less perceptually important and the matching of the energy or RMS value becomes vital. For this reason, the gain attenuation may be applied only below a certain band number b.sub.THR. In this case the gain correction g.sub.c(b) will have an explicit dependence on the frequency band b. The resulting gain correction function can in this case be defined as:

[00009]$\begin{array}{cc}{g}_c\left(b\right)=\{\begin{array}{cc}t\left(R\left(b\right)\right).Math.A\left(b\right),& b<b_{\mathrm{THR}}\\ 1,& \mathrm{otherwise}\end{array}& \left(12\right)\end{array}$

[0072] The description up to this point may also be used to describe the essential features of the example embodiment of FIG. 4. Thus, in the embodiment of FIG. 4, the final synthesis {circumflex over (X)}(b) is calculated as:

[00010]$\begin{array}{cc}\hat{X}\left(b\right)=\underset{\underset{\tilde{E}\left(n\right)}{}}{g_c\left(b\right).Math.g_{\mathrm{RMS}}\left(b\right).Math.\hat{E}.Math.\left(n\right)}.Math.\hat{N}\left(b\right)& \left(13\right)\end{array}$

[0073] As an alternative the function u(R(b), p.sub.max(b)) may be implemented as a linear function of the maximum pulse height p.sub.max and the allocated bit rate R(b), for example as:

u(R(b),p.sub.max(b))=k.Math.(p.sub.max(b)−R(b))+1  (14)

where the inclination k is determined by:

[00011]$\begin{array}{cc}k=\frac{1-\left(a_{\min }+R\left(b\right).Math.\Delta .Math..Math.a\right)}{R\left(b\right)-1}.Math..Math.\Delta .Math..Math.a=\left(a_{\max }-a_{\min }\right)/R\left(b\right).Math..Math.a_{\max }=1-\frac{1-a_{\min }}{R\left(b\right)-1}& \left(15\right)\end{array}$

[0074] The function depends on the tuning parameter a.sub.min which gives the initial attenuation factor for R(b)=1 and p.sub.max(b)=1. The function is illustrated in FIG. 9, with the tuning parameter a.sub.min=0.41. Typically u.sub.maxε[0.7, 1.4] and u.sub.minε[0, u.sub.max]. In equation (14) u is linear in the difference between p.sub.max(b) and R(b). Another possibility is to have different inclination factors for p.sub.max(b) and R(b).

[0075] The bitrate for a given band may change drastically for a given band between adjacent frames. This may lead to fast variations of the gain correction. Such variations are especially critical when the envelope is fairly stable, i.e. the total changes between frames are quite small. This often happens for music signals which typically have more stable energy envelopes. To avoid that the gain attenuation introduces instability, an additional adaptation may be added. An overview of such an embodiment is given in FIG. 10, in which a stability meter 66 has been added to the gain adjustment apparatus 60 in the decoder 300.

[0076] The adaptation can, for example, be based on a stability measure of the envelope Ê(b). An example of such a measure is to compute the squared Euclidian distance between adjacent log.sub.2 envelope vectors:

[00012]$\begin{array}{cc}\Delta .Math..Math.E\left(m\right)=\frac{1}{N_{\mathrm{bands}}}.Math.\underset{b=0}{\overset{N_{\mathrm{bands}}-1}{.Math.}}.Math..Math.{\left({\log }_2.Math.\hat{E}\left(b,m\right)-{\log }_2.Math.\hat{E}\left(b,m-1\right)\right)}^2& \left(16\right)\end{array}$

[0077] Here, ΔE(m) denotes the squared Euclidian distance between the envelope vectors for frame m and frame m−1. The stability measure may also be lowpass filtered to have a smoother adaptation:

Δ{tilde over (E)}(m)=αΔE(m)+(1−α)ΔE(m−1)  (17)

[0078] A suitable value for the forgetting factor α may be 0.1. The smoothened stability measure may then be used to create a limitation of the attenuation using, for example, a sigmoid function such as:

[00013]$\begin{array}{cc}{g}_{\min }=\frac{1}{1+e^{C_1\left(\Delta .Math..Math.\tilde{E}\left(m\right)-C_2\right)-C_3}},& \left(18\right)\end{array}$

where the parameters may be set to C.sub.1=6, C.sub.2=2 and C.sub.3=1.9. It should be noted that these parameters are to be seen as examples, while the actual values may be chosen with more freedom. For instance:

C.sub.1ε[1,10]

C.sub.2ε[1,4]

C.sub.3ε[−5,10]

[0079] FIG. 11 illustrates an example of a mapping function from the stability measure Δ{tilde over (E)}(m) to the gain adjustment limitation factor g.sub.min. The above expression for g.sub.min is preferably implemented as a lookup table or with a simple step function, such as:

[00014]$\begin{array}{cc}{g}_{\min }=\{\begin{array}{cc}1,& \Delta .Math..Math.\tilde{E}\left(m\right)<C_3/C_1+C_2\\ 0,& \Delta .Math..Math.\tilde{E}\left(m\right)\ge C_3/C_1+C_2\end{array}& \left(19\right)\end{array}$

[0080] The attenuation limitation variable g.sub.minε[0,1] may be used to create a stability adapted gain modification {tilde over (g)}.sub.c(b) as:

{tilde over (g)}.sub.c(b)=max(g.sub.c(b),g.sub.min)  (20)

[0081] After the estimation of the gain, the final synthesis {circumflex over (X)}(b) is calculated as:

[00015]$\begin{array}{cc}\hat{X}\left(b\right)=\underset{\underset{\tilde{E}\left(n\right)}{}}{{\tilde{g}}_c\left(b\right).Math.g_{\mathrm{RMS}}\left(b\right).Math.\hat{E}\left(n\right)}.Math.\hat{N}\left(b\right)& \left(21\right)\end{array}$

[0082] In the described variations of embodiment 1 the union of the synthesized vectors {circumflex over (X)}(b) forms the synthesized spectrum {circumflex over (X)}, which is further processed using the inverse MDCT transform, windowed with the symmetric sine window and added to the output synthesis using the overlap-and-add strategy.

Embodiment 2

[0083] In another example embodiment, the shape is quantized using a QMF (Quadrature Mirror Filter) filter bank and an ADPCM (Adaptive Differential Pulse-Code Modulation) scheme for shape quantization. An example of a subband ADPCM scheme is the ITU-T G.722 [4]. The input audio signal is preferably processed in segments. An example ADPCM scheme is shown in FIG. 12, with an adaptive step size S. Here, the adaptive step size of the shape quantizer serves as an accuracy measure that is already present in the decoder and does not require additional signaling. However, the quantization step size needs to be extracted from the parameters used by the decoding process and not from the synthesized shape itself. An overview of this embodiment is shown in FIG. 14. However, before this embodiment is described in detail, an example ADPCM scheme based on a QMF filter bank will be described with reference to FIGS. 12 and 13.

[0084] FIG. 12 illustrates an example of an ADPCM encoder and decoder system with an adaptive quantization step size. An ADPCM quantizer 70 includes an adder 72, which receives an input signal and subtracts an estimate of the previous input signal to form an error signal e. The error signal is quantized in a quantizer 74, the output of which is forwarded to the bitstream multiplexer 18, and also to a step size calculator 76 and a dequantizer 78. The step size calculator 76 adapts the quantization step size S to obtain an acceptable error. The quantization step size S is forwarded to the bitstream multiplexer 18, and also controls the quantizer 74 and the dequantizer 78. The dequantizer 78 outputs an error estimate ê to an adder 80. The other input of the adder 80 receives an estimate of the input signal which has been delayed by a delay element 82. This forms a current estimate of the input signal, which is forwarded to the delay element 82. The delayed signal is also forwarded to the step size calculator 76 and to (with a sign change) the adder 72 to form the error signal e.

[0085] An ADPCM dequantizer 90 includes a step size decoder 92, which decodes the received quantization step size S and forwards it to a dequantizer 94. The dequantizer 94 decodes the error estimate e, which is forwarded to an adder 98, the other input of which receives the output signal from the adder delayed by a delay element 96.

[0086] FIG. 13 illustrates an example in the context of a subband ADPCM based audio encoder and decoder system. The encoder side is similar to the encoder side of the embodiment of FIG. 2. The essential differences are that the frequency transformer 30 has been replaced by a QMF (Quadrature Mirror Filter) analysis filter bank 100, and that fine structure quantizer 38 has been replaced by an ADPCM quantizer, such as the quantizer 70 in FIG. 12. The decoder side is similar to the decoder side of the embodiment of FIG. 2. The essential differences are that the inverse frequency transformer 50 has been replaced by a QMF synthesis filter bank 102, and that fine structure dequantizer 46 has been replaced by an ADPCM dequantizer, such as the dequantizer 90 in FIG. 12.

[0087] FIG. 14 illustrates an embodiment of the present technology in the context of a subband ADPCM based audio coder and decoder system. In order to avoid cluttering of the drawing, only the decoder side 300 is illustrated. The encoder side may be implemented as in FIG. 13.

Encoder of Embodiment 2

[0088] The encoder applies the QMF filter bank to obtain the subband signals. The RMS values of each subband signal are calculated and the subband signals are normalized. The envelope E(b), subband bit allocation R(b) and normalized shape vectors N(b) are obtained as in embodiment 1. Each normalized subband is fed to the ADPCM quantizer. In this embodiment the ADPCM operates in a forward adaptive fashion, and determines a scaling step S(b) to be used for subband b. The scaling step is chosen to minimize the MSE across the subband frame. In this embodiment the step is chosen by trying all possible steps and selecting the one which gives the minimum MSE:

[00016]$\begin{array}{cc}S\left(b\right)=\underset{s}{\min }.Math.\frac{1}{\mathrm{BW}\left(b\right)}.Math.{\left(N\left(b\right)-Q\left(N\left(b\right),s\right)\right)}^T.Math.\left(N\left(b\right)-Q\left(N\left(b\right),s\right)\right)& \left(22\right)\end{array}$

where Q(x,s) is the ADPCM quantizing function of the variable x using a step size of s. The selected step size may be used to generate the quantized shape:

{circumflex over (N)}(b)=Q(N(b),S(b))  (23)

[0089] The quantizer indices from the envelope quantization and shape quantization are multiplexed into a bitstream to be stored or transmitted to a decoder.

Decoder of Embodiment 2

[0090] The decoder demultiplexes the indices from the bitstream and forwards the relevant indices to each decoding module. The quantized envelope Ê(b) and the bit allocation R(b) are obtained as in embodiment 1. The synthesized shape vectors {circumflex over (N)}(b) are obtained from the ADPCM decoder or dequantizer together with the adaptive step sizes S(b). The step sizes indicate an accuracy of the quantized shape vector, where a smaller step size corresponds to a higher accuracy and vice versa. One possible implementation is to make the accuracy A(b) inversely proportional to the step size using a proportionality factor γ:

[00017]$\begin{array}{cc}A\left(b\right)=\gamma .Math.\frac{1}{S\left(b\right)}& \left(24\right)\end{array}$

where γ should be set to achieve the desired relation. One possible choice is γ=S.sub.min where S.sub.min is the minimum step size, which gives accuracy 1 for S(b)=S.sub.min.

[0091] The gain correction factor g.sub.c may be obtained using a mapping function:

g.sub.c(b)=h(R(b),b).Math.A(b)  (25)

[0092] The mapping function h may be implemented as a lookup table based on the rate R(b) and frequency band b. This table may be defined by clustering the optimal gain correction values g.sub.MSE/g.sub.RMS by these parameters and computing the table entry by averaging the optimal gain correction values for each cluster.

[0093] After the estimation of the gain correction, the subband synthesis {circumflex over (X)}(b) is calculated as:

[00018]$\begin{array}{cc}\hat{X}\left(b\right)=\underset{\underset{\tilde{E}\left(n\right)}{}}{g_c\left(b\right).Math.g_{\mathrm{RMS}}\left(b\right).Math.\hat{E}\left(n\right)}.Math.\hat{N}\left(b\right)& \left(26\right)\end{array}$

[0094] The output audio frame is obtained by applying the synthesis QMF filter bank to the subbands.

[0095] In the example embodiment illustrated in FIG. 14 the accuracy meter 62 in the gain adjustment apparatus 60 receives the not yet decoded quantization step size S (b) directly from the received bitstream. An alternative, as noted above, is to decode it in the ADPCM dequantizer 90 and forward it in decoded form to the accuracy meter 62.

Further Alternatives

[0096] The accuracy measure could be complemented with a signal class parameter derived in the encoder. This may for instance be a speech/music discriminator or a background noise level estimator. An overview of a system incorporating a signal classifier is shown in FIG. 15-16. The encoder side in FIG. 15 is similar to the encoder side in FIG. 2, but has been provided with a signal classifier 104. The decoder side 300 in FIG. 16 is similar to the decoder side in FIG. 4, but has been provided with a further signal class input to the accuracy meter 62.

[0097] The signal class could be incorporated in the gain correction for instance by having a class dependent adaptation. If we assume the signal classes are speech or music corresponding to the values C=1 and C=0 respectively, we can constrain the gain adjustment to be effective only during speech. i.e.:

[00019]$\begin{array}{cc}{g}_c\left(b\right)=\{\begin{array}{cc}t\left(R\left(b\right)\right).Math.A\left(b\right),& b<b_{\mathrm{THR}}.Math.C=1\\ 1,& \mathrm{otherwise}\end{array}& \left(27\right)\end{array}$

[0098] In another alternative embodiment the system can act as a predictor together with a partially coded gain correction or compensation. In this embodiment the accuracy measure is used to improve the prediction of the gain correction or compensation such that the remaining gain error may be coded with fewer bits.

[0099] When creating the gain correction or compensation factor g.sub.c one might want to do a trade-off between matching the RMS value or energy and minimizing the MSE. In some cases matching the energy becomes more important than an accurate waveform. This is for instance true for higher frequencies. To accommodate this, the final gain correction may, in a further embodiment, be formed by using a weighted sum of the different gain values:

[00020]$\begin{array}{cc}{g}_c^{\prime }=\frac{\beta .Math..Math.g_{\mathrm{RMS}}+\left(1-\beta \right).Math.g_{\mathrm{MSE}}}{g_{\mathrm{RMS}}}=\beta +\left(1-\beta \right).Math.\frac{g_{\mathrm{MSE}}}{g_{\mathrm{RMS}}}=\beta +\left(1-\beta \right).Math.g_c& \left(28\right)\end{array}$

where g.sub.c is the gain correction obtained in accordance with one of the approaches described above. The weighting factor β can be made adaptive to e.g. the frequency, bitrate or signal type.

[0100] The steps, functions, procedures and/or blocks described herein may be implemented in hardware using any conventional technology, such as discrete circuit or integrated circuit technology, including both general-purpose electronic circuitry and application-specific circuitry.

[0101] Alternatively, at least some of the steps, functions, procedures and/or blocks described herein may be implemented in software for execution by a suitable processing device, such as a micro processor, Digital Signal Processor (DSP) and/or any suitable programmable logic device, such as a Field Programmable Gate Array (FPGA) device.

[0102] It should also be understood that it may be possible to reuse the general processing capabilities of the decoder. This may, for example, be done by reprogramming of the existing software or by adding new software components.

[0103] FIG. 17 illustrates an embodiment of a gain adjustment apparatus 60 in accordance with the present technology. This embodiment is based on a processor 110, for example a micro processor, which executes a software component 120 for estimating the accuracy measure, a software component 130 for determining gain the correction, and a soft-ware component 140 for adjusting the gain representation. These software components are stored in memory 150. The processor 110 communicates with the memory over a system bus. The parameters {circumflex over (N)}(b), R(b), Ê(b) are received by an input/output (I/O) controller 160 controlling an I/O bus, to which the processor 110 and the memory 150 are connected. In this embodiment the parameters received by the I/O controller 160 are stored in the memory 150, where they are processed by the software components. Software components 120, 130 may implement the functionality of block 62 in the embodiments described above. Software component 140 may implement the functionality of block 64 in the embodiments described above. The adjusted gain representation {tilde over (E)}(b) obtained from software component 140 is outputted from the memory 150 by the I/O controller 160 over the I/O bus.

[0104] FIG. 18 illustrates an embodiment of gain adjustment in accordance with the present technology in more detail. An attenuation estimator 200 is configured to use the received bit allocation R(b) to determine a gain attenuation t(R(b)). The attenuation estimator 200 may, for example, be implemented as a lookup table or in software based on a linear equation such as equation (14) above. The bit allocation R(b) is also forwarded to a shape accuracy estimator 202, which also receives an estimated sparseness p.sub.max(b) of the quantized shape, for example represented by the height of the highest pulse in the shape representation {circumflex over (N)}(b). The shape accuracy estimator 202 may, for example, be implemented as a lookup table. The estimated attenuation t(R(b)) and the estimated shape accuracy A(b) are multiplied in a multiplier 204. In one embodiment this product t(R(b)).Math.A(b) directly forms the gain correction g.sub.c(b). In another embodiment the gain correction g.sub.c(b) is formed in accordance with equation (12) above. This requires a switch 206 controlled by a comparator 208, which determines whether the frequency band b is less than a frequency limit b.sub.THR. If this is the case, then g.sub.c(b) is equal to t(R(b)).Math.A(b). Otherwise g.sub.c(b) is set to 1. The gain correction g.sub.c(b) is forwarded to another multiplier 210, the other input of which receives the RMS matching gain g.sub.RMA(b). The RMS matching gain g.sub.RMA(b) is determined by an RMS matching gain calculator 212 based on the received shape representation {circumflex over (N)}(b) and corresponding bandwidth BW(b), see equation (4) above. The resulting product is forwarded to another multiplier 214, which also receives the shape representation {circumflex over (N)}(b) and the gain representation Ê(b), and forms the synthesis {circumflex over (X)}(b).

[0105] The stability detection described with reference to FIG. 10 may be incorporated into embodiment 2 as well as the other embodiments described above.

[0106] FIG. 19 is a flow chart illustrating the method in accordance with the present technology. Step S1 estimates an accuracy measure A(b) of the shape representation {circumflex over (N)}(b). The accuracy measure may, for example, be derived from shape quantization characteristics, such as R(b), S(b), indicating the resolution of the shape quantization. Step S2 determines a gain correction, such as g.sub.c(b), {tilde over (g)}.sub.c(b), g.sub.c′(b), based on the estimated accuracy measure. Step S3 adjusts the gain representation Ê(b) based on the determined gain correction.

[0107] FIG. 20 is a flow chart illustrating an embodiment of the method in accordance with the present technology, in which the shape has been encoded using a pulse coding scheme and the gain correction depends on an estimated sparseness p.sub.max(b) of the quantized shape. It is assumed that an accuracy measure has already been determined a step S1 (FIG. 19). Step S4 estimates a gain attenuation that depends on allocated bit rate. Step S5 determines a gain correction based on the estimated accuracy measure and the estimated gain attenuation. Thereafter the procedure proceeds to step S3 (FIG. 19) to adjust the gain representation.

[0108] FIG. 21 illustrates an embodiment of a network in accordance with the present technology. It includes a decoder 300 provided with a gain adjustment apparatus in accordance with the present technology. This embodiment illustrates a radio terminal, but other network nodes are also feasible. For example, if voice over IP (Internet Protocol) is used in the network, the nodes may comprise computers.

[0109] In the network node in FIG. 21 an antenna 302 receives a coded audio signal. A radio unit 304 transforms this signal into audio parameters, which are forwarded to the decoder 300 for generating a digital audio signal, as described with reference to the various embodiments above. The digital audio signal is then D/A converted and amplified in a unit 306 and finally forwarded to a loudspeaker 308.

[0110] Although the description above focuses on transform based audio coding, the same principles may also be applied to time domain audio coding with separate gain and shape representations, for example CELP coding.

[0111] It will be understood by those skilled in the art that various modifications and changes may be made to the present technology without departure from the scope thereof, which is defined by the appended claims.

Abbreviations

[0112] ADPCM Adaptive Differential Pulse-Code Modulation

[0113] AMR Adaptive MultiRate

[0114] AMR-WB Adaptive MultiRate WideBand

[0115] CELP Code Excited Linear Prediction

[0116] GSM-EFR Global System for Mobile communications—Enhanced FullRate

[0117] DSP Digital Signal Processor

[0118] FPGA Field Programmable Gate Array

[0119] IP Internet Protocol

[0120] MDCT Modified Discrete Cosine Transform

[0121] MSE Mean Squared Error

[0122] QMF Quadrature Mirror Filter

[0123] RMS Root-Mean-Square

[0124] VQ Vector Quantization

REFERENCES

[0125] [1] “ITU-T G.722.1 ANNEX C: A NEW LOW-COMPLEXITY 14 KHZ AUDIO CODING STANDARD”, ICASSP 2006. [0126] [2] “ITU-T G.719: A NEW LOW-COMPLEXITY FULL-BAND (20 KHZ) AUDIO CODING STANDARD FOR HIGH-QUALITY CONVERSATIONAL APPLICATIONS”, WASPA 2009. [0127] [3] U. Mittal, J. Ashley, E. Cruz-Zeno, “Low Complexity Factorial Pulse Coding of MDCT Coefficients using Approximation of Combinatorial Functions,” ICASSP 2007. [0128] [4] “7 kHz Audio Coding Within 64 kbit/s”, [G.722], IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1988.