Temporal noise shaping

Information

  • Patent Grant
  • 11056124
  • Patent Number
    11,056,124
  • Date Filed
    Thursday, May 7, 2020
    4 years ago
  • Date Issued
    Tuesday, July 6, 2021
    3 years ago
Abstract
In methods and apparatus for performing temporal noise shaping, an apparatus may have a temporal noise shaping, TNS, tool for performing linear prediction, LP, filtering on an information signal including a plurality of frames; and a controller configured to control the TNS tool so that the TNS tool performs LP filtering with: a first filter whose impulse response has a higher energy; and a second filter whose impulse response has a lower energy than the first filter, wherein the second filter is not an identity filter, wherein the controller is configured to choose between filtering with the first filter, and filtering with the second filter on the basis of a frame metrics.
Description
TECHNICAL FIELD

Examples herein relate to encoding and decoding apparatus, in particular for performing temporal noise shaping (TNS).


KNOWN TECHNOLOGY

The following documents are in the known technology:

  • [1] Herre, Jurgen, and James D. Johnston. “Enhancing the performance of perceptual audio coders by using temporal noise shaping (TNS).” Audio Engineering Society Convention 101. Audio Engineering Society, 1996.
  • [2] Herre, Jurgen, and James D. Johnston. “Continuously signal-adaptive filterbank for high-quality perceptual audio coding.” Applications of Signal Processing to Audio and Acoustics, 1997. 1997 IEEE ASSP Workshop on. IEEE, 1997.
  • [3] Herre, Jurgen. “Temporal noise shaping, quantization and coding methods in perceptual audio coding: A tutorial introduction.” Audio Engineering Society Conference: 17th International Conference: High-Quality Audio Coding. Audio Engineering Society, 1999.
  • [4] Herre, Juergen Heinrich. “Perceptual noise shaping in the time domain via LPC prediction in the frequency domain.” U.S. Pat. No. 5,781,888. 14 Jul. 1998.
  • [5] Herre, Juergen Heinrich. “Enhanced joint stereo coding method using temporal envelope shaping.” U.S. Pat. No. 5,812,971. 22 Sep. 1998.
  • [6] 3GPP TS 26.403; General audio codec audio processing functions; Enhanced aacPlus general audio codec; Encoder specification; Advanced Audio Coding (AAC) part.
  • [7] ISO/IEC 14496-3:2001; Information technology—Coding of audio-visual objects—Part 3: Audio.
  • [8] 3GPP TS 26.445; Codec for Enhanced Voice Services (EVS); Detailed algorithmic description.


Temporal Noise Shaping (TNS) is a tool for transform-based audio coders that was developed in the 90s (conference papers [1-3] and patents [4-5]). Since then, it has been integrated in major audio coding standards such as MPEG-2 AAC, MPEG-4 AAC, 3GPP E-AAC-Plus, MPEG-D USAC, 3GPP EVS, MPEG-H 3D Audio.


TNS can be briefly described as follows. At the encoder-side and before quantization, a signal is filtered in the frequency domain (FD) using linear prediction, LP, in order to flatten the signal in the time-domain. At the decoder-side and after inverse quantization, the signal is filtered back in the frequency-domain using the inverse prediction filter, in order to shape the quantization noise in the time-domain such that it is masked by the signal.


TNS is effective at reducing the so-called pre-echo artefact on signals containing sharp attacks such as e.g. castanets. It is also helpful for signals containing pseudo stationary series of impulse-like signals such as e.g. speech.


TNS is generally used in an audio coder operating at relatively high bitrate. When used in an audio coder operating at low bitrate, TNS can sometimes introduce artefacts, degrading the quality of the audio coder. These artefacts are click-like or noise-like and appear in most of the cases with speech signals or tonal music signals.


Examples in the present document permit to suppress or reduce the impairments of TNS maintaining its advantages.


Several examples below permit to obtain an improved TNS for low-bitrate audio coding.


SUMMARY

According to an embodiment, an encoder apparatus may have: a temporal noise shaping, TNS, tool for performing linear prediction, LP, filtering on an information signal including a plurality of frames; and a controller configured to control the TNS tool so that the TNS tool performs LP filtering with: a first filter whose impulse response has a higher energy; and a second filter whose impulse response has a lower energy, wherein the second filter is not an identity filter, wherein the controller is configured to choose between filtering with the first filter and filtering with the second filter on the basis of a frame metrics, wherein the controller is further configured to: modify the first filter so as to acquire the second filter in which the filter's impulse response energy is reduced.


According to another embodiment, a method for performing temporal noise shaping, TNS, filtering on an information signal including a plurality of frames may have the steps of: for each frame, choosing between filtering with a first filter and filtering with a second filter, whose impulse response has a lower energy, on the basis of a frame metrics, wherein the second filter is not an identity filter; filtering the frame using the filtering with the filtering chosen between filtering with the first filter and filtering with the second filter; and modify the first filter so as to acquire the second filter in which the filter's impulse response energy is reduced.


Another embodiment may have a non-transitory digital storage medium having a computer program stored thereon to perform the method for performing temporal noise shaping, TNS, filtering on an information signal including a plurality of frames, the method having the steps of: for each frame, choosing between filtering with a first filter and filtering with a second filter, whose impulse response has a lower energy, on the basis of a frame metrics, wherein the second filter is not an identity filter; filtering the frame using the filtering with the filtering chosen between filtering with the first filter and filtering with the second filter; and modify the first filter so as to acquire the second filter in which the filter's impulse response energy is reduced, when said computer program is run by a computer.


In accordance with examples, there is provided an encoder apparatus comprising:

    • a temporal noise shaping, TNS, tool for performing linear prediction, LP, filtering on an information signal including a plurality of frames; and
    • a controller configured to control the TNS tool so that the TNS tool performs LP filtering with:
      • a first filter whose impulse response has a higher energy; and
      • a second filter whose impulse response has a lower energy than the impulse response of the first filter, wherein the second filter is not an identity filter,
    • wherein the controller is configured to choose between filtering with the first filter and filtering with the second filter on the basis of a frame metrics.


It has been noted that it is possible to remove artefacts on problematic frames while minimally affecting the other frames.


Instead of simply turning on/off the TNS operations, it is possible to maintain the advantages of the TNS tool while reducing its impairments. Therefore, an intelligent real-time feedback-based control is therefore obtained by simply reducing filtering where needed instead of avoiding it.


In accordance with examples, the controller is further configured to:

    • modify the first filter so as to obtain the second filter in which the filter's impulse response energy is reduced.


Accordingly, the second filter with reduced impulse response energy may be crated when needed.


In accordance with examples, the controller is further configured to:

    • apply at least one adjustment factor to the first filter to obtain the second filter.


By intelligently modifying the first filter, a filtering status may be created which is not be achievable by simply performing operations of turning on/off the TNS. At least one intermediate status between full filtering and no filtering is obtained. This intermediate status, if invoked when needed, permits to reduce the disadvantages of the TNS maintaining its positive characteristics.


In accordance with examples, the controller is further configured to:

    • define the at least one adjustment factor on the basis of at least the frame metrics.


In accordance with examples, the controller is further configured to:

    • define the at least one adjustment factor on the basis of a TNS filtering determination threshold which is used for selecting between performing TNS filtering and non-performing TNS filtering.


In accordance with examples, the controller is further configured to:

    • define the at least one adjustment factor using a linear function of the frame metrics, the linear function being such that an increase in the frame metrics corresponds to an increase of the adjustment factor and/or of the filter's impulse response energy.


Therefore, it is possible to define, for different metrics, different adjustment factors to obtain the filter parameters which are the most appropriated for each frame.


In accordance with examples, the controller is further configured to define the adjustment factor as






γ
=

{





1
-


(

1
-

γ
min


)





thresh





2

-
frameMetrics



thresh





2

-
thresh




,





if





frameMetrics

<

thresh





2












1
,



otherwise














wherein thresh is the TNS filtering determination threshold, thresh2 is the filtering type determination threshold, frameMetrics is a frame metrics, and γmin is a fixed value.


Artefacts caused by the TNS occur in frames in which the prediction gain is in a particular interval, which is here defined as the set of values higher than the TNS filtering determination threshold thresh but lower than the filtering determination threshold thresh2. In some cases in which the metrics is the prediction gain, thresh=1.5 and thresh2=2, artefacts caused by the TNS tend to occur between 1.5 and 2. Therefore, several examples permit to overcome these impairments by reducing the filtering for 1.5<predGain<2.


In accordance with examples, the controller is further configured to modify the parameters of the first filter to obtain the parameters of the second filter by applying:

αw(k)=γkα(k),k=0, . . . ,K

where α(k) are parameters of the first filter, γ is the adjustment factor such that 0<γ<1, αw(k) are the parameters of the second filter and K is the order of the first filter.


This is an easy but valid technique for obtaining the parameters of the second filter so that the impulse response energy is reduced in respect to the impulse response energy of the first filter.


In accordance with examples, the controller is further configured to obtain the frame metrics from at least one of a prediction gain, an energy of the information signal and/or a prediction error.


That these metrics permit to easily and reliably discriminate the frames which need to be filtered by the second filter from the frames which need to be filtered by the first filter.


In accordance with examples, the frame metrics comprises a prediction gain calculated as






predGain
=

energy
predError






where energy is a term associated to an energy of the information signal, and predError is a term associated to a prediction error.


In accordance with examples, the controller is configured so that:

    • at least for a reduction of a prediction gain and/or a reduction of an energy of the information signal, the second filter's impulse response energy is reduced, and/or at least for an increase of the prediction error, the second filter's impulse response energy is reduced.


In accordance with examples, the controller is configured to:

    • compare the frame metrics with a filtering type determination threshold (e.g., thresh2), so as to perform a filtering with the first filter when the frame metrics is lower than the filtering type determination threshold.


Accordingly, it is easy to automatically establish whether the signal is to be filtered using the first filter or using the second filter.


In accordance with examples, the controller is configured to:

    • choose between performing a filtering and non-performing filtering on the basis of the frame metrics.


Accordingly, it is also possible to completely avoid TNS filtering at all when not appropriated.


In examples, the same metrics may be used twice (by performing comparisons with two different thresholds): both for deciding between the first filter and second filter, and for deciding whether to filter or not to filter.


In accordance with examples, the controller is configured to:

    • compare the frame metrics with a TNS filtering determination threshold, so as to choose to avoid TNS filtering when the frame metrics is lower than the TNS filtering determination threshold.


In accordance with examples, the apparatus may further comprise:

    • a bitstream writer to prepare a bitstream with reflection coefficients, or a quantized version thereof, obtained by the TNS.


These data may be stored and/or transmitted, for example, to a decoder.


In accordance with examples, there is provided a system comprising an encoder side and a decoder side, wherein the encoder side comprises an encoder apparatus as above and/or below.


In accordance with examples, there is provided a method for performing temporal noise shaping, TNS, filtering on an information signal including a plurality of frames, the method comprising:

    • for each frame, choosing, on the basis of a frame metrics, between filtering with a first filter whose impulse response has a higher energy and filtering with a second filter whose impulse response has an energy lower than the energy of the impulse response of the first filter (14a), wherein the second filter is not an identity filter;
    • filtering the frame using the filtering with the chosen between the first filter and the second filter.


In accordance with examples, there is provided a non-transitory storage device storing instructions which, when executed by a processor, cause the processor to perform at least some of the steps of the methods above and/or below and/or to implement a system as above or below and/or an apparatus as above and/or below.





BRIEF DESCRIPTION OF THE DRAWINGS

Embodiments of the present invention will be detailed subsequently referring to the appended drawings, in which:



FIG. 1 shows an encoder apparatus according to an example.



FIG. 2 shows a decoder apparatus according to an example.



FIG. 3A shows a technique according to an example.



FIGS. 3B and 3C show methods according to examples.



FIG. 4 shows methods according to examples.



FIG. 5 shows an encoder apparatus according to an example.



FIG. 6 shows a decoder apparatus according to an example.



FIG. 7 shows an encoder apparatus according to an example.



FIGS. 8A to 8C show signal evolutions according to examples.



FIG. 9 shows an encoder apparatus according to an example.



FIG. 10 shows a method according to an example.





DETAILED DESCRIPTION OF THE INVENTION


FIG. 1 shows an encoder apparatus 10. The encoder apparatus 10 may be for processing (and transmitting and/or storing) information signals, such as audio signals. An information signal may be divided into a temporal succession of frames. Each frame may be represented, for example, in the frequency domain, FD. The FD representation may be a succession of bins, each at a specific frequency. The FD representation may be a frequency spectrum.


The encoder apparatus 10 may, inter alia, comprise a temporal noise shaping, TNS, tool 11 for performing TNS filtering on an FD information signal 13 (Xs(n)). The encoder apparatus 10 may, inter alia, comprise a TNS controller 12. The TNS controller 12 may be configured to control the TNS tool 11 so that the TNS tool 11 performs filtering (e.g., for some frames) using at least one higher impulse response energy linear prediction (LP) filtering and (e.g., for some other frames) using at least one higher impulse response energy LP filtering. The TNS controller 12 is configured to perform a selection between higher impulse response energy LP filtering and lower impulse response energy LP filtering on the basis of a metrics associated to the frame (frame metrics). The energy of the impulse response of the first filter is higher than the energy of the impulse response of the second filter.


The FD information signal 13 (Xs(n)) may be, for example, obtained from a modified discrete cosine transform, MDCT, tool (or modified discrete sine transform MDST, for example) which has transformed a representation of a frame from a time domain, TD, to the frequency domain, FD.


The TNS tool 11 may process signals, for example, using a group of linear prediction (LP) filter parameters 14 (a(k)), which may be parameters of a first filter 14a. The TNS tool 11 may also comprise parameters 14′ (aw(k)) which may be parameters of a second filter 15a (the second filter 15a may have an impulse response with lower energy as compared to the impulse response of the first filter 14a). The parameters 14′ may be understood as a weighted version of the parameters 14, and the second filter 15a may be understood as being derived from the first filter 14a. Parameters may comprise, inter alia, one or more of the following parameters (or the quantized version thereof): LP coding, LPC, coefficients, reflection coefficients, RCs, coefficients rci(k) or quantized versions thereof rcq(k), arcsine reflection coefficients, ASRCs, log-area ratios, LARs, line spectral pairs, LSPs, and/or line spectral frequencies, LS, or other kinds of such parameters. In examples, it is possible to use any representation of filter coefficients.


The output of the TNS tool 11 may be a filtered version 15 (Xf(n)) of the FD information signal 13 (Xs(n)).


Another output of the TNS tool 11 may be a group of output parameters 16, such as reflection coefficients rci(k) (or quantized versions thereof rcq(k)).


Downstream to the components 11 and 12, a bitstream coder may encode the outputs 15 and 16 into a bitstream which may be transmitted (e.g., wirelessly, e.g., using a protocol such as Bluetooth) and/or stored (e.g., in a mass memory storage unit).


TNS filtering provides reflection coefficients which are in general different from zero. TNS filtering provides an output which is in general different from the input.



FIG. 2 shows a decoder apparatus 20 which may make use of the output (or a processed version thereof) of the TNS tool 11. The decoder apparatus 20 may comprise, inter alia, a TNS decoder 21 and a TNS decoder controller 22. The components 21 and 22 may cooperate to obtain a synthesis output 23 ({circumflex over (X)}s(n)). The TNS decoder 21 may be, for example, input with a decoded representation 25 (or a processed version thereof ({circumflex over (X)}f(n)) of the information signal as obtained by the decoder apparatus 20. The TNS decoder 21 may obtain in input (as input 26) reflection coefficients rci(k) (or quantized versions thereof rcq(k)). The reflection coefficients rci(k) or rcq(k) may be the decoded version of the reflection coefficients rci(k) or rcq(k) provided at output 16 by the encoder apparatus 10.


As shown in FIG. 1, the TNS controller 12 may control the TNS tool 11 on the basis, inter alia, of a frame metrics 17 (e.g., prediction gain or predGain). For example, the TNS controller 12 may perform filtering by choosing between at least a higher impulse response energy LP filtering and/or a lower impulse response energy LP filtering, and/or between filtering and non-filtering. Apart from the higher impulse response energy LP filtering and the lower impulse response energy LP filtering, at least one intermediate impulse response energy LP filtering are possible according to examples.


Reference numeral 17′ in FIG. 1 refers to information, commands and/or control data which are provided to the TNS tool 14 from the TNS controller 12. For example, a decision based on the metrics 17 (e.g., “use the first filter” or “use the second filter”) may be provided to the TNS tool 14. Settings on the filters may also be provided to the TNS tool 14. For example, an adjustment factor (γ) may be provided to the TNS filter so as to modify the first filter 14a to obtain the second filter 15a.


The metrics 17 may be, for example, a metrics associated to the energy of the signal in the frame (for example, the metrics may be such that the higher the energy, the higher the metrics). The metrics may be, for example, a metrics associated to a prediction error (for example, the metrics may be such that the higher the prediction error, the lower the metric). The metrics may be, for example, a value associated to the relationship between the prediction error and energy of the signal (for example, the metrics may be such that the higher the ratio between the energy and the prediction error, the higher the metrics). The metrics may be, for example, a prediction gain for a current frame, or a value associated or proportional to the prediction gain for the current frame (such as, for example, the higher the prediction gain, the higher the metrics). The frame metrics (17) may be associated to the flatness of the signal's temporal envelope.


It has been noted that artefacts due to TNS occur only (or at least prevalently) when the prediction gain is low. Therefore, when the prediction gain is high, the problems caused by TNS do not arise (or are less prone to arise) and it is possible to perform full TNS (e.g., higher impulse response energy LP). When the prediction gain is very low, it is advantageous not to perform TNS at all (non-filtering). When the prediction gain is intermediate, it is advantageous to reduce the effects of the TNS by using a lower impulse response energy linear prediction filtering (e.g., by weighting LP coefficients or other filtering parameters and/or reflection coefficients and/or using a filter whose impulse response has a lower energy). The higher impulse response energy LP filtering and the lower impulse response energy LP filtering are different from each other in that the higher impulse response energy LP filtering is defined so as to cause a higher impulse response energy than the lower impulse response energy LP filtering. A filter is in general characterized by the impulse response energy and, therefore, it is possible to identify it with its impulse response energy. The higher impulse response energy LP filtering means using a filter whose impulse response has a higher energy than the filter used in the lower impulse response energy LP filtering.


Hence, with the present examples, the TNS operations may be computed by:

    • performing high impulse response energy LP filtering when the metrics (e.g. prediction gain) is high (e.g., over a filtering type determination threshold);
    • performing low impulse response energy LP filtering when the metrics (e.g. prediction gain) is intermediate (e.g., between a TNS filtering determination threshold and the filtering type determination threshold); and
    • non-performing TNS filtering when the metrics (e.g. prediction gain) is low (e.g., under the TNS filtering determination threshold).


High impulse response energy LP filtering may be obtained, for example, using a first filter having a high impulse response energy. Low impulse response energy LP filtering may be obtained, for example, using a second filter having a lower impulse response energy. The first and second filter may be linear time-invariant (LTI) filters.


In examples, the first filter may be described using the filter parameters a(k) (14). In examples, the second filter may be a modified version of the first filter (e.g., as obtained by the TNS controller 12). The second filter (lower impulse response energy filter) may be obtained by downscaling the filter parameters of the first filter (e.g., using a parameter γ or γk such that 0<γk such that 0<γ<1, with k being a natural number such that k≤K, K being the order of the first filter).


Therefore, in examples, when the filter parameters are obtained, and on the basis of the metrics, it is determined that the lower impulse response energy filtering may be used, the filter parameters of the first filter may be modified (e.g., downscaled) to obtain filter parameters of the second filter, to be used for the lower impulse selection energy filter.



FIG. 10 shows a method 30 which may be implemented at the encoder apparatus 10.


At step S31, a frame metrics (e.g., prediction gain 17) is obtained.


At step S32, it is checked whether the frame metrics 17 is higher than a TNS filtering determination threshold or first threshold (which may be 1.5, in some examples). An example of metrics may be a prediction gain.


If at S32 it is verified that the frame metrics 17 is lower than the first threshold (thresh), no filtering operation is performed at S33 (it could be possible to say that an identity filter is used, the identity filter being a filter in which the output is the same of the input). For example, Xf(n)=Xs(n) (the output 15 of the TNS tool 11 is the same as the input 13), and/or the reflection coefficients rci(k) (and/or their quantized versions rc0(k)) are also set at 0. Therefore, the operations (and the output) of the decoder apparatus 20 will not be influenced by the TNS tool 11. Hence, at S33, neither the first filter nor the second filter may be used.


If at S32 it is verified that the frame metrics 17 is greater than the TNS filtering determination threshold or first threshold (thresh), a second check may be performed at step S34 by comparing the frame metrics with a filtering type determination threshold or second threshold (thresh2, which may be greater than the first threshold, and be, for example, 2).


If at S34 it is verified that the frame metrics 17 is lower than the filtering type determination threshold or second threshold (thresh2), lower impulse response energy LP filtering is performed at S35 (e.g., a second filter with lower impulse response energy is used, the second filter non-being an identity filter).


If at S34 it is verified that the frame metrics 17 is greater than the filtering type determination threshold or second threshold (thresh2), higher impulse response energy LP filtering is performed at S36 (e.g., a first filter whose response energy is higher than the lower energy filter is used).


The method 30 may be reiterated for a subsequent frame.


In examples, the lower impulse response energy LP filtering (S35) may differ from the higher impulse response energy LP filtering (S36) in that the filter parameters 14 (a(k)) may be weighted, for example, by different values (e.g., the higher impulse response energy LP filtering may be based on unitary weights and the lower impulse response energy LP filtering may be based on weights lower than 1). In examples, the lower impulse response energy LP filtering may differ from the higher impulse response energy LP filtering in that the reflection coefficients 16 obtained by performing lower impulse response energy LP filtering may cause a higher reduction of the impulse response energy than the reduction caused by the reflection coefficients obtained by performing higher impulse response energy LP filtering.


Hence, while performing higher impulse response energy filtering at the step S36, the first filter is used on the basis of the filter parameters 14 (a(k)) (which are therefore the first filter parameters). While performing lower impulse response energy filtering at the step S35, the second filter is used. The second filter may be obtained by modifying the parameters of the first filter (e.g., by weighting with weight less than 1).


The sequence of steps S31-S32-S34 may be different in other examples: for example, S34 may precede S32. One of the steps S32 and/or S34 may be optional in some examples.


In examples, at least one of the first and/or second thresholds may be fixed (e.g., stored in a memory element).


In examples, the lower impulse response energy filtering may be obtained by reducing the impulse response of the filter by adjusting the LP filter parameters (e.g., LPC coefficients or other filtering parameters) and/or the reflection coefficients, or an intermediate value used to obtain the reflection coefficients. For example, coefficients less than 1 (weights) may be applied to the LP filter parameters (e.g., LPC coefficients or other filtering parameters) and/or the reflection coefficients, or an intermediate value used to obtain the reflection coefficients.


In examples, the adjustment (and/or the reduction of the impulse response energy) may be (or be in terms of):






γ
=

{





1
-


(

1
-

γ
min


)





thresh





2

-
frameMetrics



thresh





2

-
thresh




,





if





frameMetrics

<

thresh





2












1
,



otherwise














where thresh2 is the filtering type determination threshold (and may be, for example, 2), thresh is the TNS filtering determination threshold (and may be 1.5), γmin is a constant (e.g., a value between 0.7 and 0.95, such as between 0.8 and 0.9, such as 0.85). γ values may be used to scale the LPC coefficients (or other filtering parameters) and/or the reflection coefficients. frameMetrics is the frame metrics.


In one example, the formula may be






γ
=

{





1
-


(

1
-

γ
min


)





thresh





2

-
predGain



thresh





2

-
thresh




,





if





predGain

<

thresh





2












1
,



otherwise














where thresh2 is the filtering type determination threshold (and may be, for example, 2), thresh is the TNS filtering determination threshold (and may be 1.5), γmin is a constant (e.g., a value between 0.7 and 0.95, such as between 0.8 and 0.9, such as 0.85). γ values may be used to scale the LPC coefficients (or other filtering parameters) and/or the reflection coefficients. predGain may be the prediction gain, for example.


From the formula it may be seen that a frameMetrics (or predGain) lower than thresh2 but close to it (e.g., 1.999) will cause the reduction of impulse response energy to be weak (e.g. γ≅1). Therefore, the lower impulse response energy LP filtering may be one of a plurality of different lower impulse response energy LP filterings, each being characterized by a different adjustment parameter γ, e.g., in accordance to the value of the frame metrics.


In examples of lower impulse response energy LP filtering, different values of the metrics may cause different adjustments. For example, a higher prediction gain may be associated to a higher a higher value of γ, and a lower reduction of the impulse response energy with respect to the first filter. γ may be seen as a linear function dependent from predGain. An increment of predGain will cause an increment of γ, which in turn will diminish the reduction of the impulse response energy. If predGain is reduced, γ is also reduced, and the impulse response energy will be accordingly also reduced.


Therefore, subsequent frames of the same signal may be differently filtered:

    • some frames may be filtered using the first filter (higher impulse response energy filtering), in which the filter parameters (14) are maintained;
    • some other frames may be filtered using the second filter (lower impulse response energy filtering), in which the first filter is modified to obtain a second filter with lower impulse response energy (the filter parameters 14 being modified, for example) to reduce the impulse response energy ‘with respect to the first filter;
    • some other frames may also be filtered using the second filter (lower impulse response energy filtering), but with different adjustment (as a consequence of a different values of the frame metrics).


Accordingly, for each frame, a particular first filter may be defined (e.g., on the basis of the filter parameters), while a second filter may be developed by modifying the filter parameters of the first filter.



FIG. 3A shows an example of the controller 12 and the TNS block 11 cooperating to perform TNS filtering operations.


A frame metrics (e.g., prediction gain) 17 may be obtained and compared to a TNS filtering determination threshold 18a (e.g., at a comparer 10a). If the frame metrics 17 is greater than the TNS filtering determination threshold 18a (thresh), it is permitted (e.g., by the selector 11a) to compare the frame metrics 17 with a filtering type determination threshold 18b (e.g., at a comparer 12a). If the frame metrics 17 is greater than the filtering type determination threshold 18b, then a first filter 14a whose impulse response has higher energy (e.g. γ=1) is activated. If the frame metrics 17 is lower than the filtering type determination threshold 18b, then a second filter 15a whose impulse response has lower energy (e.g., γ<1) is activated (element 12b indicates a negation of the binary value output by the comparer 12a). The first filter 14a whose impulse response has higher energy may perform filtering S36 with higher impulse response energy, and the second filter 15a whose impulse response has lower energy may perform filtering S35 with lower impulse response energy.



FIGS. 3B and 3C shows methods 36 and 35 for using the first and the second filters 14a and 15a, respectively (e.g., for steps S36 and S35, respectively).


The method 36 may comprise a step S36a of obtaining the filter parameters 14. The method 36 may comprise a step S36b performing filtering (e.g., S36) using the parameters of the first filter 14a. Step S35b may be performed only at the determination (e.g., at step S34) that the frame metrics is over the filtering type determination threshold (e.g., at step S35).


The method 35 may comprise a step S35a of obtaining the filter parameters 14 of the first filter 14a. The method 35 may comprise a step S35b of defining the adjustment factor γ (e.g., by using at least one of the thresholds thresh and thresh2 and the frame metrics). The method 35 may comprise a step 35c for modifying the first filter 14a to obtain a second filter 15a having lower impulse response energy with respect to the first filter 14a. In particular, the first filter 14a may be modified by applying the adjustment factor γ (e.g., as obtained at S35b) to the parameters 14 of the first filter 14a, to obtain the parameters of the second filter. The method 35 may comprise a step S35d in which the filtering with the second filter (e.g., at S35 of the method 30) is performed. Steps S35a, S35b, and S35c may be performed at the determination (e.g., at step S34) that the frame metrics is less than the filtering type determination threshold (e.g., at step S35).



FIG. 4 shows a method 40′ (encoder side) and a method 40″ (decoder side) which may form a single method 40. The methods 40′ and 40″ may have some contact in that a decoder operating according to the method 40′ may transmit a bitstream (e.g., wirelessly, e.g., using Bluetooth) to a decoder operating according to the method 40″.


The steps of method 40 (indicated as a sequence a)-b)-c)-d)-1)-2)-3)-e-f) and by the sequence S41′-S49′) is discussed here below.

    • a) Step S41′: The autocorrelation of the MDCT (or MDST) spectrum (FD value) may be processed, for example,








r


(
k
)


=




n
=

n
start




n
stop

-
k





c


(
n
)




c


(

n
+
k

)





,

k
=
0

,





,
K








      • where K is the LP filter order (e.g. K=8). Here, c(n) may be the FD value input to the TNS tool 11. For example, c(n) may refer to a bin associated to a frequency with index n.



    • b) Step S42′: The autocorrelation may be lag windowed:

      r(k)=r(k)w(k), k=0, . . . ,K
      • An example of lag windowing function may be, for example:

        w(k)=exp[−½(2παk)2], k=0, . . . ,K
      • where α is a window parameter (e.g. a=0.011).

    • c) Step S43′: LP filter coefficients may be estimated, using e.g. a Levinson-Durbin recursion procedure, such as:










e


(
0
)


=

r


(
0
)










a
0



(
0
)


=
1







for





k

=

1





to





K





do








r


c


(
k
)



=


-




n
=
0


k
-
1






a

k
-
1




(
n
)




r


(

k
-
n

)






e


(

k
-
1

)











a
k



(
k
)


=

r


c


(
k
)











a
k



(
0
)


=
1







for





n

=


1





to





k

-

1





do










a
k



(
n
)


=



a

k
-
1




(
n
)


+

r


c


(
k
)





a

k
-
1




(

k
-
n

)











e


(
k
)


=


(

1
-

r



c


(
k
)


2



)



e


(

k
-
1

)











      • where α(k)=αK (k), k=0, . . . , K are the estimated LPC coefficients (or other filtering parameters), rc(k), k=1, . . . , K are the corresponding reflection coefficients and e=e(K) is the prediction error.



    • d) Step S44′: The decision (step S44′ or S32) to turn on/off TNS filtering in the current frame may be based on e.g. a frame metrics, such as the prediction gain:
      • If predGain>thresh, then turn on TNS filtering
      • where the prediction gain is computed by









predGain
=


r


(
0
)


e









      • and thresh is a threshold (e.g. thresh=1.5).

      • 1) Step S45′: The weighting factor γ may be obtained (e.g., at step S45′) by











γ
=

{





1
-


(

1
-

γ
min


)





thresh

2

-

p

r

e

d

G

a

i

n




thr

esh

2

-
thresh




,










if





predGain





<

thresh

2








1
,








otherwise















        • where thresh2 is a second threshold (e.g. thresh2=2) and γmin is the minimum weighting factor (e.g. γmin=0.85). The thresh2 may be, for example, the filtering type determination threshold.

        • When γ=1, the first filter 14a is used. When 0<γ<1, the second filter 15a is used (e.g., at step S35b).



      • 2) Step S46′: The LPC coefficients (or other filtering parameters) may be weighted (e.g., at step S46′) using the factor γ:

        αw(k)=γkα(k), k=0, . . . ,K

      • γk is an exponentiation (e.g., γ2=γ*γ).

      • 3) Step S47′: The weighted LPC coefficients (or other filtering parameters) may be converted to reflection coefficients using, e.g., the following procedure (step S47′):














a
K



(
k
)


=


a
w



(
k
)



,

k
=
0

,





,

K





for







k
=

K





to





1





do








r


c


(
k
)



=


a
k



(
k
)








e
=


(

1
-

r



c


(
k
)


2



)






for







n
=


1





to





k

-

1





do










a

k
-
1




(
n
)


=




a
k



(
n
)


-

r


c


(
k
)





a
k



(

k
-
n

)




e







    • e) Step S48′:If TNS is on (as a result of the determination of at S32, for example), the reflection coefficients may be quantized (step S48′) using, e.g., scalar uniform quantization in the arcsine domain:










r



c
i



(
k
)



=

round


[


arcsin


(

r


c


(
k
)



)


Δ

]









r



c
q



(
k
)



=

sin


(

Δ

r



c
i



(
k
)



)








    • where Δ is the cell width









(


e
.
g
.




Δ

=

π

1

7



)





and round(.) is the rounding-to-nearest-integer function.

      • rci(k) are the quantizer output indices which are then encoded using e.g. arithmetic encoding.
      • rcq(k) are the quantized reflection coefficients.
    • f) Step S49′: If TNS is on, the MDCT (or MDST) spectrum is filtered (step S49′) using the quantized reflection coefficients and a lattice filter structure

      s0(nstart−1)=s1(nstart−1)= . . . =sK−1(nstart−1)=0
      • for n=nstart to nstop do
        • t0(n)=s0(n)=c(n)
        • for k=1 to K do
          • tk(n)=tk−1(n)+rcq(k)sk−1(n−1)
          • sk(n)=rcq(k)tk−1(n)+sk−1(n−1)
        • cf(n)=tK(n)


A bitstream may be transmitted to the decoder. The bitstream may comprise, together with an FD representation of the information signal (e.g., an audio signal), also control data, such as the reflection coefficients obtained by performing TNS operations described above (TNS analysis).


The method 40″ (decoder side) may comprise steps g) (S41″) and h) (S42″) in which, if TNS is on, the quantized reflection coefficients are decoded and the quantized MDCT (or MDST) spectrum is filtered back. The following procedure may be used:

s0(nstart−1)=s1(nstart−1)= . . . =sK−1(nstart−1)=0

for n=nstart to nstop do

    • tK(n)=c(n)
    • for k=K to 1 do
      • tk−1(n)=tk(n)−rcq(k)sk−1(n−1)
      • sk(n)=rcq(k)tk−1(n)+sk−1(n−1)
    • cf(n)=s0(n)=t0(n)


An example of encoder apparatus 50 (which may embody the encoder apparatus 10 and/or perform at least some of the operation of the methods 30 and 40′) is shown in FIG. 5.


The encoder apparatus 50 may comprise a plurality of tools for encoding an input signal (which may be, for example, an audio signal). For example, a MDCT tool 51 may transform a TD representation of an information signal to an FD representation. A spectral noise shaper, SNS, tool 52 may perform noise shaping analysis (e.g., a spectral noise shaping, SNS, analysis), for example, and retrieve LPC coefficients or other filtering parameters (e.g., a(k), 14). The TNS tool 11 may be as above and may be controlled by the controller 12. The TNS tool 11 may perform a filtering operation (e.g. according to method 30 or 40′) and output both a filtered version of the information signal and a version of the reflection coefficients. A quantizer tool 53 may perform a quantization of data output by the TNS tool 11. An arithmetic coder 54 may provide, for example, entropy coding. A noise level tool 55′ may also be used for estimating a noise level of the signal. A bitstream writer 55 may generate a bitstream associated to the input signal that may be transmitted (e.g., wireless, e.g., using Bluetooth) and/or stored.


A bandwidth detector 58′ (which may detect the bandwidth of the input signal) may also be used. It may provide the information on active spectrum of the signal. This information may also be used, in some examples, to control the coding tools.


The encoder apparatus 50 may also comprise a long term post filtering tool 57 which may be input with a TD representation of the input signal, e.g., after that the TD representation has been downsampled by a downsampler tool 56.


An example of decoder apparatus 60 (which may embody the decoder apparatus 20 and/or perform at least some of the operation of the method 40″) is shown in FIG. 6.


The decoder apparatus 60 may comprise a reader 61 which may read a bitstream (e.g., as prepared by the apparatus 50). The decoder apparatus 60 may comprise an arithmetic residual decoder 61a which may perform, for example, entropy decoding, residual decoding, and/or arithmetic decoding with a digital representation in the FD (restored spectrum), e.g., as provided by the decoder. The decoder apparatus 60 may comprise a noise filing tool 62 and a global gain tool 63, for example. The decoder apparatus 60 may comprise a TNS decoder 21 and a TNS decoder controller 22. The apparatus 60 may comprise an SNS decoder tool 65, for example. The decoder apparatus 60 may comprise an inverse MDCT (or MDST) tool 65′ to transform a digital representation of the information signal from the FD to the TD. A long term post filtering may be performed by the LTPF tool 66 in the TD. Bandwidth information 68 may be obtained from the bandwidth detector 58′, for example, ad applied to some of the tools (e.g., 62 and 21).


Examples of the operations of the apparatus above are here provided.


Temporal Noise Shaping (TNS) may be used by tool 11 to control the temporal shape of the quantization noise within each window of the transform.


In examples, if TNS is active in the current frame, up to two filters per MDCT-spectrum (or MDST spectrum or other spectrum or other FD representation) may be applied. It is possible to apply a plurality of filters and/or to perform TNS filtering on a particular frequency range. In some examples, this is only optional.


The number of filters for each configuration and the start and the stop frequency of each filter are given in the following table:


















num_






Band-
tns_
start_
stop_




width
filters
freq(f)
freq(f)
sub_start(f, s)
sub_stop(f, s)







NB
1
{12}
 {80}
{{12, 34, 57}}
{{34, 57, 80}}


WB
1
{12}
{160}
{{12, 61, 110}}
{{61, 110, 160}}


SSWB
1
{12}
{240}
{{12, 88, 164}}
{{88, 164, 240}}


SWB
2
{12,
{160,
{{12, 61, 110},
{{61, 110, 160},




160}
320}
{160, 213, 266}}
{213, 266, 320}}


FB
2
{12,
{200,
{{12, 74, 137},
{{74, 137, 200},




200}
400}
{200, 266, 333}}
{266, 333, 400}}









Information such as the start and stop frequencies may be signalled, for example, from the bandwidth detector 58′.


Where NB is narrowband, WB is wideband, SSWB is semi-super wideband, SWB is super wideband, and FB is full wideband.


The TNS encoding steps are described in the below. First, an analysis may estimate a set of reflection coefficients for each TNS filter. Then, these reflection coefficients may be quantized. And finally, the MDCT-spectrum (or MDST spectrum or other spectrum or other FD representation) may be filtered using the quantized reflection coefficients.


The complete TNS analysis described below is repeated for every TNS filter f, with f=0 . . . num_tns_filters−1 (num_tns_filters being provided by the table above).


A normalized autocorrelation function may be calculated (e.g., at step S41′) as follows, for each k=0 . . . 8







r


(
k
)


=

{








r
0



(
k
)


,





if









s
=
0

2



e


(
s
)




=
0










s
=
0

2







n
=

s

u


b
-



start


(

f
,
s

)






su


b
-


s

t

o


p


(

f
,
s

)



-
1
-
k






X
s



(
n
)





X
s



(

n
+
k

)





e


(
s
)




,



otherwise








with











r
0



(
k
)



=

{






1
,





if





k

=
0






0
,



otherwise








and










e


(
s
)



=





n
=

s

u


b
-



start


(

f
,
s

)






su


b
-


s

t

o


p


(

f
,
s

)



-
1







X
s



(
n
)


2






for





s


=

0.

.2











with sub_start(f, s) and sub_stop(f,s) are given in the table above.


The normalized autocorrelation function may be lag-windowed (e.g., at S42′) using, for example:

r(k)=r(k)exp[−½(0.02πk)2] for k=0 . . . 8


The Levinson-Durbin recursion described above may be used (e.g., at step S43′) to obtain LPC coefficients or other filtering parameters α(k), k=0 . . . 8 and/or a prediction error e.


The decision to turn on/off the TNS filter f in the current frame is based on the prediction gain:


If predGain>thresh, then turn on the TNS filter f


With, for example, thresh=1.5 and the prediction gain being obtained, for example, as:






predGain
=


r


(
0
)


e





The additional steps described below are performed only if the TNS filter f is turned on (e.g., if the step S32 has result “YES”).


A weighting factor γ is computed by






γ
=

{





1
-


(

1
-

γ
min


)





thresh

2

-

p

r

e

d

G

a

i

n




thresh

2

-
thresh




,










if





predGain





<

thresh

2








1
,








otherwise










with thresh2=2, γmin=0.85 and







tns_lpc

_weighting

=

{




1
,





if





nbits

<
480






0
,



otherwise








The LPC coefficients or other filtering parameters may be weighted (e.g., at step S46′) using the factor γ

αw(k)=γkα(k) for k=0 . . . 8


The weighted LPC coefficients or other filtering parameters may be converted (e.g., at step S47′) to reflection coefficients using, for example, the following algorithm:









a
K



(
k
)


=


a
w



(
k
)



,

k
=
0

,





,

K





for







k
=

K





to





1





do








r


c


(
k
)



=


a
k



(
k
)








e
=


(

1
-

r



c


(
k
)


2



)






for







n
=


1





to





k

-

1





do










a

k
-
1




(
n
)


=




a
k



(
n
)


-

r


c


(
k
)





a
k



(

k
-
n

)




e






wherein rc(k,f)=rc(k) are the final estimated reflection coefficients for the TNS filter f.


If the TNS filter f is turned off (e.g., outcome “NO” at the check of step S32), then the reflection coefficients may be simply set to 0: rc(k,f)=0, k=0 . . . 8.


The quantization process, e.g., as performed at step S48′, is now discussed.


For each TNS filter f, the reflection coefficients obtained may be quantized, e.g., using scalar uniform quantization in the arcsine domain







r



c
i



(

k
,
f

)



=



nint


[


arcsin


(

r


c


(

k
,
f

)



)


Δ

]


+

8





for





k


=

0.
.
8







and

rcq(k,f)=sin [Δ(rci(k,f)−8)] for k=0 . . . 8

wherein






Δ
=

π

1

7







and nint(.) is the rounding-to-nearest-integer function, for example. rci(k,f) may be the quantizer output indices and rcq(k,f) may be the quantized reflection coefficients.


The order of the quantized reflection coefficients may be calculated using

k=7

while k≥0 and rcq(k,f)=0 do

k=k−1
rcorder(f)=k+1


The total number of bits consumed by TNS in the current frame can then be computed as follows







nbits

T

N

S


=







f
=
0




num

_

tns



_

filters


-
1





2048
+

n

b

i

t



s

T

N


S

o

r

d

e

r






(
f
)



+


nbits

T

N


S

r

c






(
f
)




2

0

4

8










with









nbits

T

N


S

o

r

d

e

r






(
f
)


=

{







ac_tns

_order



_bits


[

tns_

1

pc_weighting

]




[


r



c
order



(
f
)



-
1

]



,





if







rc
order



(
f
)



>
0






0
,








otherwise









and











nbits

T

N


S

c

o

e

f






(
f
)



=

{








k
=
0




rc

o

r

d

e

r




(
f
)


-
1




ac_tns

_coef



_bits




[
k
]



[

r



c
i



(

k
,
f

)



]




,










if







rc
order



(
f
)



>
0







0
,



otherwise










The values of tab_nbits_TNS_order and tab_nbits_TNS_coef may be provided in tables.


The MDCT (or MDST) spectrum Xs(n) (input 15 in FIG. 1) may be filtered using the following procedure:

s0(start_freq(0)−1)=s1(start_freq(0)−1)= . . . =s7(start_freq(0)−1)=0

for f=0 to num_tns_filters−1 do

    • for n=start_freq(f) to stop_freq(f)−1 do
      • t0(n)=s0(n)=Xs(n)
      • for k=0 to 7 do
        • tk+1(n)=tk(n)+rcq(k)sk(n−1)
        • sk+1(n)=rcq(k)tk(n)+sk(n−1)
      • Xf(n)=t8(n)


        wherein Xf(n) is the TNS filtered MDCT (or MDST) spectrum (output 15 in FIG. 1).


With reference to operations performed at the decoder (e.g., 20, 60), quantized reflection coefficients may be obtained for each TNS filter f using

rcq(k,f)=sin [Δ(rci(k,f)−8)] k=0 . . . 8

wherein rcq(k,f) are the quantizer output indices.


The MDCT (or MDST) spectrum custom character(n) as provided to the TNS decoder 21 (e.g., as obtained from the global gain tool 63) may then be filtered using the following algorithm

s0(start_freq(0)−1)=s1(start_freq(0)−1)= . . . =s7(start_freq(0)−1)=0

for f=0 to num_tns_filters−1 do

    • for n=start_freq(f) to stop_freq(f)−1 do
      • tK(n)=custom character(n)
      • for k=7 to 0 do
        • tk(n)=tk+1(n)−rcq(k)sk(n−1)
        • sk+1(n)=rcq(k)tk(n)+sk(n−1)
      • custom character(n)=s0(n)=t0(n)


        wherein custom character(n) is the output of the TNS decoder.


        Discussion on the Invention


As explained above, TNS can sometimes introduce artefacts, degrading the quality of the audio coder. These artefacts are click-like or noise-like and appear in most of the cases with speech signals or tonal music signals.


It was observed that artefacts generated by TNS only occur in frames where the prediction gain predGain is low and close to a threshold thresh.


One could think that increasing the threshold would easily solve the problem. But for most of the frames, it is actually beneficial to turn on TNS even when the prediction gain is low.


Our proposed solution is to keep the same threshold but to adjust the TNS filter when the prediction gain is low, so as to reduce the impulse response energy.


There are many ways to implement this adjustment (which is some cases may be referred to as “attenuation”, e.g., when the reduction of impulse response energy is obtained by reducing the LP filter parameters, for example). We may choose to use weighting, which may be, for example, a weighting

a_w(k)=γ{circumflex over ( )}k a(k),k=0, . . . ,K

with a(k) are the LP filter parameters (e.g., LPC coefficients) computed in Encoder Step c) and a_w (k) are the weighted LP filter parameters. The adjustment (weighting) factor γ is made dependent on the prediction gain such that higher reduction of impulse response energy (γ<1) is applied for lower prediction gains and such that there is, for example, no reduction of impulse response energy (γ=1) for higher prediction gains.


The proposed solution was proven to be very effective at removing all artefacts on problematic frames while minimally affecting the other frames.


Reference can now be made to FIGS. 8A-8C. The figures show a frame of audio signal (continuous line) and the frequency response (dashed line) of the corresponding TNS prediction filter.



FIG. 8A: castanets signal



FIG. 8B: pitch pipe signal



FIG. 8C: speech signal


The prediction gain is related to the flatness of the signal's temporal envelope (see, for example, Section 3 of ref [2] or Section 1.2 of ref [3]).


A low prediction gain implies a tendentially flat temporal envelope, while a high prediction gain implies an extremely un-flat temporal envelope.



FIG. 8A shows the case of a very low prediction gain (predGain=1.0). It corresponds to the case of a very stationary audio signal, with a flat temporal envelope. In this case predGain=1<thresh (e.g., thresh=1.5): no filtering is performed (S33).



FIG. 8B shows the case of a very high prediction gain (12.3). It corresponds to the case of a strong and sharp attack, with a highly un-flat temporal envelope. In this case predGain=12.3>thresh2 (threh2=2): higher impulse response energy filtering is performed at S36.



FIG. 8C shows the case of a prediction gain between thresh and thresh2, e.g., in a 1.5-2.0 range (higher than the first threshold, lower than the second threshold). It corresponds to the case of a slightly un-flat temporal envelope. In this case thresh<predGain<thresh2: lower impulse response energy filtering is performed at S35, using the second filter 15a with lower impulse response energy.


Other Examples


FIG. 7 shows an apparatus 110 which may implement the encoding apparatus 10 or 50 and/or perform at least some steps of the method 30 and/or 40′. The apparatus 110 may comprise a processor 111 and a non-transitory memory unit 112 storing instructions which, when executed by the processor 111, may cause the processor 111 to perform a TNS filtering and/or analysis. The apparatus 110 may comprise an input unit 116, which may obtain an input information signal (e.g., an audio signal). The processor 111 may therefore perform TNS processes.



FIG. 9 shows an apparatus 120 which may implement the decoder apparatus 20 or 60 and/or perform the method 40′. The apparatus 120 may comprise a processor 121 and a non-transitory memory unit 122 storing instructions which, when executed by the processor 121, may cause the processor 121 to perform, inter alia, a TNS synthesis operation. The apparatus 120 may comprise an input unit 126, which may obtain a decoded representation of an information signal (e.g., an audio signal) in the FD. The processor 121 may therefore perform processes to obtain a decoded representation of the information signal, e.g., in the TD. This decoded representation may be provided to external units using an output unit 127. The output unit 127 may comprise, for example, a communication unit to communicate to external devices (e.g., using wireless communication, such as Bluetooth) and/or external storage spaces. The processor 121 may save the decoded representation of the audio signal in a local storage space 128. In examples, the systems 110 and 120 may be the same device.


Depending on certain implementation requirements, examples may be implemented in hardware. The implementation may be performed using a digital storage medium, for example a floppy disk, a Digital Versatile Disc (DVD), a Blu-Ray Disc, a Compact Disc (CD), a Read-only Memory (ROM), a Programmable Read-only Memory (PROM), an Erasable and Programmable Read-only Memory (EPROM), an Electrically Erasable Programmable Read-Only Memory (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. Therefore, the digital storage medium may be computer readable.


Generally, examples may be implemented as a computer program product with program instructions, the program instructions being operative for performing one of the methods when the computer program product runs on a computer. The program instructions may for example be stored on a machine readable medium.


Other examples comprise the computer program for performing one of the methods described herein, stored on a machine readable carrier. In other words, an example of method is, therefore, a computer program having a program instructions for performing one of the methods described herein, when the computer program runs on a computer.


A further example of the methods is, therefore, a data carrier medium (or a digital storage medium, or a computer-readable medium) comprising, recorded thereon, the computer program for performing one of the methods described herein. The data carrier medium, the digital storage medium or the recorded medium are tangible and/or non-transitionary, rather than signals which are intangible and transitory.


A further example comprises a processing unit, for example a computer, or a programmable logic device performing one of the methods described herein.


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


A further example comprises an apparatus or a system transferring (for example, electronically or optically) a computer program for performing one of the methods described herein to a receiver. The receiver may, for example, be a computer, a mobile device, a memory device or the like. The apparatus or system may, for example, comprise a file server for transferring the computer program to the receiver.


In some examples, 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 examples, a field programmable gate array may cooperate with a microprocessor in order to perform one of the methods described herein. Generally, the methods may be performed by any appropriate 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.

Claims
  • 1. An encoder apparatus comprising: a temporal noise shaping, TNS, tool for performing linear prediction, LP, filtering on an information signal comprising a plurality of frames; anda controller configured to control the TNS tool so that the TNS tool performs LP filtering with: a first filter whose impulse response comprises a higher energy; anda second filter whose impulse response comprises a lower energy, wherein the second filter is not an identity filter,wherein the controller is configured to choose between filtering with the first filter and filtering with the second filter on the basis of a frame metrics,wherein the controller is further configured to: modify the first filter so as to acquire the second filter in which the filter's impulse response energy is reduced.
  • 2. The encoder apparatus of claim 1, wherein the controller is further configured to: apply an adjustment factor to the first filter to acquire the second filter.
  • 3. The encoder apparatus of claim 2, configured to modify the first filter to acquire the second filter by modifying the amplitude of the parameters of the first filter using an adjustment factor.
  • 4. The encoder apparatus of claim 2, wherein the controller is further configured to: define the adjustment factor on the basis of a filtering type determination threshold used for selecting between filtering with the first filter and filtering with the second filter.
  • 5. The encoder apparatus of claim 2, wherein the controller is further configured to: define the adjustment factor on the basis of at least the frame metrics.
  • 6. The encoder apparatus of claim 2, wherein the controller is further configured to: define the adjustment factor on the basis of a TNS filtering determination threshold which is used for selecting between performing TNS filtering and non-performing TNS filtering.
  • 7. The encoder apparatus of claim 2, wherein the controller is further configured to: define the adjustment factor using a linear function of the frame metrics, the linear function being such that an increase in the frame metrics corresponds to an increase of the adjustment factor and/or of the filter's impulse response energy.
  • 8. The encoder apparatus of claim 2, configured to define the adjustment factor as
  • 9. The encoder apparatus of claim 2, configured to modify the parameters of the first filter to acquire the parameters of the second filter by applying: αw(k)=γkα(k), k=0, . . . ,K
  • 10. The encoder apparatus of claim 1, wherein the controller is further configured to: acquire the frame metrics from at least one of a prediction gain, an energy of the information signal and/or a prediction error.
  • 11. The encoder apparatus of claim 1, wherein the frame metrics comprises a prediction gain calculated as
  • 12. The encoder apparatus of claim 1, wherein the controller is configured so that: at least for a reduction of a prediction gain and/or a reduction of an energy of the information signal, the second filter's impulse response energy is reduced, and/or at least for an increase of the prediction error, the second filter's impulse response energy is reduced.
  • 13. The encoder apparatus of claim 1, wherein the controller is further configured to: compare the frame metrics with a filtering type determination threshold, so as to perform a filtering with the first filter when the frame metrics is lower than the filtering type determination threshold.
  • 14. The encoder apparatus of claim 1, wherein the controller is further configured to: choose between performing a filtering and non-performing filtering on the basis of the frame metrics.
  • 15. The encoder apparatus of claim 14, wherein the controller is further configured to: compare the frame metrics with a TNS filtering determination threshold, so as to choose to avoid TNS filtering when the frame metrics is lower than the TNS filtering determination threshold.
  • 16. The encoder apparatus of claim 1, further comprising: a bitstream writer to prepare a bitstream with reflection coefficients, or a quantized version thereof, acquired by the TNS tool.
  • 17. The encoder apparatus of claim 1, the filtering parameters of the first filter being chosen between LP coding, LPC, coefficients and/or any other representation of the filter coefficients.
  • 18. The encoder apparatus of claim 1, wherein the information signal is an audio signal.
  • 19. The encoder apparatus according to claim 1, wherein the controller is further configured to modify the first filter so as to acquire the second filter in which the filter's impulse response energy is reduced.
  • 20. The encoder apparatus of claim 1, wherein the frame metrics is associated to the flatness of the signal's temporal envelope.
  • 21. A method for performing temporal noise shaping, TNS, filtering on an information signal comprising a plurality of frames, the method comprising: for each frame, choosing between filtering with a first filter and filtering with a second filter, whose impulse response comprises a lower energy, on the basis of a frame metrics, wherein the second filter is not an identity filter;filtering the frame using the filtering with the filtering chosen between filtering with the first filter and filtering with the second filter; andmodify the first filter so as to acquire the second filter in which the filter's impulse response energy is reduced.
  • 22. A non-transitory digital storage medium having a computer program stored thereon to perform the method for performing temporal noise shaping, TNS, filtering on an information signal comprising a plurality of frames, the method comprising: for each frame, choosing between filtering with a first filter and filtering with a second filter, whose impulse response comprises a lower energy, on the basis of a frame metrics, wherein the second filter is not an identity filter;filtering the frame using the filtering with the filtering chosen between filtering with the first filter and filtering with the second filter; andmodify the first filter so as to acquire the second filter in which the filter's impulse response energy is reduced,
Priority Claims (1)
Number Date Country Kind
17201094 Nov 2017 EP regional
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of copending International Application No. PCT/EP2018/080339, filed Nov. 6, 2018, which is incorporated herein by reference in its entirety, and additionally claims priority from European Application No. EP 17 201 094.4, filed Nov. 10, 2017, which is incorporated herein by reference in its entirety.

US Referenced Citations (105)
Number Name Date Kind
4972484 Link et al. Nov 1990 A
5012517 Chhatwal et al. Apr 1991 A
5581653 Todd Dec 1996 A
5651091 Chen et al. Jul 1997 A
5781888 Herre Jul 1998 A
5812971 Herre Sep 1998 A
5819209 Inoue Oct 1998 A
5909663 Iijima et al. Jun 1999 A
5999899 Robinson Dec 1999 A
6018706 Huang et al. Jan 2000 A
6148288 Park Nov 2000 A
6507814 Gao Jan 2003 B1
6735561 Johnston May 2004 B1
7009533 Wegener Mar 2006 B1
7353168 Chen et al. Apr 2008 B2
7395209 Dokic et al. Jul 2008 B1
7539612 Chen et al. May 2009 B2
7546240 Chen et al. Jun 2009 B2
8015000 Chen et al. Sep 2011 B2
8095359 Boehm et al. Jan 2012 B2
8280538 Kim et al. Oct 2012 B2
8473301 Chen et al. Jun 2013 B2
8554549 Morii et al. Oct 2013 B2
8612240 Fuchs et al. Dec 2013 B2
8682681 Fuchs et al. Mar 2014 B2
8738385 Chen May 2014 B2
8751246 Bayer et al. Jun 2014 B2
8847795 Faure et al. Sep 2014 B2
8891775 Schug Nov 2014 B2
8898068 Fuchs et al. Nov 2014 B2
9123350 Zhao et al. Sep 2015 B2
9489961 Ragot Nov 2016 B2
9595262 Fuchs et al. Mar 2017 B2
10726854 Ghido et al. Jul 2020 B2
20030101050 Cuperman et al. May 2003 A1
20050015249 Chen et al. Jan 2005 A1
20070033056 Groeschl et al. Feb 2007 A1
20070118369 Chen May 2007 A1
20070127729 Breebaart et al. Jun 2007 A1
20070129940 Geyersberger et al. Jun 2007 A1
20070276656 Solbach et al. Nov 2007 A1
20080033718 Chen et al. Feb 2008 A1
20080126086 Kandhadai et al. May 2008 A1
20090076830 Taleb Mar 2009 A1
20090138267 Davidson et al. May 2009 A1
20100010810 Morii Jan 2010 A1
20100070270 Gao Mar 2010 A1
20100115370 Ramo et al. May 2010 A1
20100312552 Kandhadai et al. Dec 2010 A1
20100312553 Fang et al. Dec 2010 A1
20100324912 Oh et al. Dec 2010 A1
20110015768 Kim et al. Jan 2011 A1
20110019829 Morii Jan 2011 A1
20110022924 Malenovsky et al. Jan 2011 A1
20110035212 Briand et al. Feb 2011 A1
20110060597 Chen et al. Mar 2011 A1
20110071839 Budnikov et al. Mar 2011 A1
20110095920 Ashley et al. Apr 2011 A1
20110096830 Ashley et al. Apr 2011 A1
20110116542 Antonini et al. May 2011 A1
20110125505 Gournay et al. May 2011 A1
20110196673 Park et al. Aug 2011 A1
20110200198 Bayer et al. Aug 2011 A1
20110238425 Lecomte et al. Sep 2011 A1
20110238426 Borsum et al. Sep 2011 A1
20120010879 Kikuiri et al. Jan 2012 A1
20120022881 Geiger et al. Jan 2012 A1
20120214544 Rodriguez et al. Aug 2012 A1
20120245947 Baeckstroem et al. Sep 2012 A1
20120265540 Fuchs et al. Oct 2012 A1
20130030819 Carlsson et al. Jan 2013 A1
20130226594 Fuchs et al. Aug 2013 A1
20130282369 Ryu et al. Oct 2013 A1
20140052439 Nanjundaswamy et al. Feb 2014 A1
20140067404 Baumgarte Mar 2014 A1
20140108020 Bai et al. Apr 2014 A1
20140142957 Lee et al. May 2014 A1
20150010155 Lang et al. Jan 2015 A1
20150081312 Fuchs et al. Mar 2015 A1
20150142452 Lee et al. May 2015 A1
20150154969 Craven et al. Jun 2015 A1
20150170668 Kovesi Jun 2015 A1
20150221311 Jeon et al. Aug 2015 A1
20150302859 Aguilar et al. Oct 2015 A1
20150325246 Chen et al. Nov 2015 A1
20150371647 Faure et al. Dec 2015 A1
20160027450 Gao Jan 2016 A1
20160189721 Johnston et al. Jun 2016 A1
20160225384 Kjörling et al. Aug 2016 A1
20160293175 Atti et al. Oct 2016 A1
20160365097 Guan et al. Dec 2016 A1
20160372125 Atti et al. Dec 2016 A1
20160372126 Atti et al. Dec 2016 A1
20160379655 Truman et al. Dec 2016 A1
20170011747 Faure et al. Jan 2017 A1
20170053658 Atti et al. Feb 2017 A1
20170103769 Laaksonen et al. Apr 2017 A1
20170110135 Disch et al. Apr 2017 A1
20170133029 Doehla et al. May 2017 A1
20170140769 Dietz et al. May 2017 A1
20170154631 Bayer et al. Jun 2017 A1
20170154635 Doehla et al. Jun 2017 A1
20170221495 Oh et al. Aug 2017 A1
20170236521 Atti et al. Aug 2017 A1
20170294196 Bradley et al. Oct 2017 A1
Foreign Referenced Citations (69)
Number Date Country
101140759 Mar 2008 CN
102779526 Nov 2012 CN
107103908 Aug 2017 CN
104269173 Mar 2018 CN
0716787 Jun 1996 EP
0732687 Sep 1996 EP
797324 Nov 2004 EP
785631 Mar 2007 EP
1791115 May 2007 EP
2264698 Jun 2012 EP
2676266 Dec 2013 EP
2980796 Feb 2016 EP
2980799 Feb 2016 EP
3111624 Jan 2017 EP
2944664 Oct 2010 FR
H1091194 Apr 1998 JP
100261253 Jul 2000 KR
20030031936 Apr 2003 KR
20170000933 Jan 2017 KR
2337414 Oct 2008 RU
2376657 Dec 2009 RU
2413312 Feb 2011 RU
2419891 May 2011 RU
2439718 Jan 2012 RU
2483365 May 2013 RU
2520402 Jun 2014 RU
2568381 Nov 2015 RU
2591661 Jul 2016 RU
2596594 Sep 2016 RU
2596596 Sep 2016 RU
2015136540 Mar 2017 RU
2628162 Aug 2017 RU
2016105619 Aug 2017 RU
200809770 Feb 2008 TW
201005730 Feb 2010 TW
201126510 Aug 2011 TW
201131550 Sep 2011 TW
201207839 Feb 2012 TW
201243832 Nov 2012 TW
201612896 Apr 2016 TW
201618080 May 2016 TW
201618086 May 2016 TW
201642246 Dec 2016 TW
201642247 Dec 2016 TW
201705126 Feb 2017 TW
201711021 Mar 2017 TW
201713061 Apr 2017 TW
201724085 Jul 2017 TW
201732779 Sep 2017 TW
9916050 Apr 1999 WO
2004072951 Aug 2004 WO
2005086139 Sep 2005 WO
2007073604 Jul 2007 WO
2007138511 Dec 2007 WO
2008046505 Apr 2008 WO
2011048118 Apr 2011 WO
2011086066 Jul 2011 WO
2011086067 Jul 2011 WO
2012000882 Jan 2012 WO
2012000882 Jan 2012 WO
2012126893 Sep 2012 WO
2014165668 Oct 2014 WO
2014202535 Dec 2014 WO
2014202535 Dec 2014 WO
2015063045 May 2015 WO
2015063227 May 2015 WO
2015071173 May 2015 WO
2015174911 Nov 2015 WO
2016142337 Sep 2016 WO
Non-Patent Literature Citations (40)
Entry
ETSI TS 126 445 V13.2.0 (Aug. 2016), Universal Mobile Telecommunications System (UMTS); LTE; Codec for Enhanced Voice Services (EVS); Detailed algorithmic description (3GPP TS 26.445 version 13.2.0 Release 13) [Online]. Available: http://www.3gpp.org/ftp/Specs/archive/26_series/26.445/26445-d00.zip.
Geiger, “Audio Coding based on integer transform”, Ilmenau: https://www.db-thueringen.de/receive/dbt_mods_00010054, 2004.
Henrique S Malvar, “Biorthogonal and Nonuniform Lapped Transforms for Transform Coding with Reduced Blocking and Ringing Artifacts”, IEEE Transactions on Signal Processing, IEEE Service Center, New York, NY, US, (Apr. 1998), vol. 46, No. 4, ISSN 1053-587X, XP011058114.
Anonymous, “ISO/IEC 14496-3:2005/FDAM 9, AAC-ELD”, 82. MPEG Meeting;Oct. 22, 2007-Oct. 26, 2007; Shenzhen; (Motion Picture Expert Group or ISO/IEC JTC1/SC29/WG11),, (Feb. 21, 2008), No. N9499, XP030015994.
Virette, “Low Delay Transform for High Quality Low Delay Audio Coding”, Université de Rennes 1, (Dec. 10, 2012), pp. 1-195, URL: https://hal.inria.fr/tel-01205574/document, (Mar. 30, 2016), XP055261425.
ISO/IEC 14496-3:2001; Information technology—Coding of audio-visual objects—Part 3: Audio.
3GPP TS 26.403 v14.0.0 (Mar. 2017); General audio codec audio processing functions; Enhanced acPlus general audio codec; Encoder specification; Advanced Audio Coding (AAC) part; (Release 14).
ISO/IEC 23003-3; Information technology—MPEG audio technologies—Part 3: Unified speech and audio coding, 2011.
3GPP TS 26.445 V14.1.0 (Jun. 2017), 3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; Codec for Enhanced Voice Services (EVS); Detailed Algorithmic Description (Release 14), http://www.3gpp.org/ftp//Specs/archive/26_series/26.445/26445-e10.zip, Section 5.1.6 “Bandwidth detection”.
Eksler Vaclav et al, “Audio bandwidth detection in the EVS codec”, 2015 IEEE Global Conference on Signal and Information Processing (Globalsip), IEEE, (Dec. 14, 2015), doi:10.1109/GLOBALSIP.2015.7418243, pp. 488-492, XP032871707.
Oger M et al, “Transform Audio Coding with Arithmetic-Coded Scalar Quantization and Model-Based Bit Allocation”, International Conference on Acoustics, Speech, and Signalprocessing, IEEE, XX,Apr. 15, 2007 (Apr. 15, 2007), p. IV-545, XP002464925.
Asad et al., “An enhanced least significant bit modification technique for audio steganography”, International Conference on Computer Networks and Information Technology, Jul. 11-13, 2011.
Makandar et al, “Least Significant Bit Coding Analysis for Audio Steganography”, Journal of Future Generation Computing, vol. 2, No. 3, Mar. 2018.
ISO/IEC 23008-3:2015; Information technology—High efficiency coding and media delivery in heterogeneous environments—Part 3: 3D audio.
ITU-T G.718 (Jun. 2008): Series G: Transmission Systems and Media, Digital Systems and Networks, Digital terminal equipments—Coding of voice and audio signals, Frame error robust narrow-band and wideband embedded variable bit-rate coding of speech and audio from 8-32 kbit/s.
3GPP TS 26.447 V14.1.0 (Jun. 2017), Technical Specification, 3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; Codec for Enhanced Voice Services (EVS); Error Concealment of Lost Packets (Release 14).
DVB Organization, “ISO-IEC_23008-3_A3_(E)_(H 3DA FDAM3).docx”, DVB, Digital Video Broadcasting, C/O EBU—17A Ancienne Route—CH-1218 Grand Saconnex, Geneva—Switzerland, (Jun. 13, 2016), XP017851888.
Hill et al., “Exponential stability of time-varying linear systems,” Ima J Numer Anal, pp. 865-885, 2011.
3GPP TS 26.090 V14.0.0 (Mar. 2017), 3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; Mandatory Speech Codec speech processing functions; Adaptive Multi-Rate (AMR) speech codec; Transcoding functions (Release 14).
3GPP TS 26.190 V14.0.0 (Mar. 2017), Technical Specification, 3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; Speech codec speech processing functions; Adaptive Multi-Rate-Wideband (AMR-WB) speech codec; Transcoding functions (Release 14).
3GPP TS 26.290 V14.0.0 (Mar. 2017), Technical Specification, 3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; Audio codec processing functions; Extended Adaptive Multi-Rate-Wideband (AMR-WB-F) codec; Transcoding functions (Release 14).
Edler et al., “Perceptual Audio Coding Using a Time-Varying Linear Pre- and Post-Filter,” in AES 109th Convention, Los Angeles, 2000.
Gray et al., “Digital lattice and ladder filter synthesis,” IEEE Transactions on Audio and Electroacoustics, vol. vol. 21, no. No. 6, pp. 491-500, 1973.
Lamoureux et al., “Stability of time variant filters,” CREWES Research Report—vol. 19, 2007.
Herre et al., “Enhancing the performance of perceptual audio coders by using temporal noise shaping (TNS).” Audio Engineering Society Convention 101. Audio Engineering Society, 1996.
Herre et al., “Continuously signal-adaptive filterbank for high-quality perceptual audio coding.” Applications of Signal Processing to Audio and Acoustics, 1997. 1997 IEEE ASSP Workshop on. IEEE, 1997.
Herre, “Temporal noise shaping, quantization and coding methods in perceptual audio coding: A tutorial introduction.” Audio Engineering Society Conference: 17th International Conference: High-Quality Audio Coding. Audio Engineering Society, 1999.
Fuchs Guillaume et al, “Low delay LPC and MDCT-based audio coding in the EVS codec”, 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), IEEE, (Apr. 19, 2015), doi:10.1109/ICASSP.2015.7179068, pp. 5723-5727, XP033187858.
Niamut et al, “RD Optimal Temporal Noise Shaping for Transform Audio Coding”, Acoustics, Speech and Signal Processing, 2006. ICASSP 2006 Proceedings. 2006 IEEE International Conference on Toulouse, France May 14-19, 2006, Piscataway, NJ, USA,IEEE, Piscataway, NJ, USA, (Jan. 1, 2006), doi:10.1109/ICASSP.2006.1661244, ISBN 978-1-4244-0469-8, pp. V-V, XP031015996.
ITU-T G.711 (Sep. 1999): Series G: Transmission Systems and Media, Digital Systems and Networks, Digital transmission systems—Terminal equipments—Coding of analogue signals by pulse code modulation, Pulse code modulation (PCM) of voice frequencies, Appendix I: A high quality low-complexity algorithm for packet loss concealment with G.711.
Cheveigne et al.,“YIN, a fundamental frequency estimator for speech and music.” The Journal of the Acoustical Society of America 111.4 (2002): 1917-1930.
Ojala P et al, “A novel pitch-lag search method using adaptive weighting and median filtering”, Speech Coding Proceedings, 1999 IEEE Workshop on Porvoo, Finland Jun. 20-23, 1999, Piscataway, NJ, USA, IEEE, US, (Jun. 20, 1999), doi:10.1109/SCFT.1999.781502, ISBN 978-0-7803-5651-1, pp. 114-116, XP010345546.
“5 Functional description of the encoder”, Dec. 10, 2014 (Dec. 10, 2014), 3GPP Standard; 26445-C10_1_S05_S0501, 3rd Generation Partnership Project (3GPP)?, Mobile Competence Centre ; 650, Route Lucioles ; F-06921 Sophia-Antipolis Cedex ; France Retrieved from the Internet:URL: http://www.3gpp.org/ftp/Specs/2014-12/Rel-12/26_series/ XP050907035.
Rospatent Examiner, “Decision on Grant Patent for Invention for RU Application No. 2020118949”, dated Nov. 11, 2020, Rospatent, Russia.
O.E. Groshev, “Office Action for RU Application No. 2020118947”, dated Dec. 1, 2020, Rospatent, Russia.
O.I. Starukhina, “Office Action for RU Application No. 2020118968”, dated Dec. 23, 2020, Rospatent, Russia.
P.A. Volkov, “Office Action for RU Application No. 2020120251”, dated Oct. 28, 2020, Rospatent, Russia.
P.A. Volkov, “Office Action for RU Application No. 2020120256”, dated Oct. 28, 2020, Rospatent, Russia.
D.V.Travnikov, “Decision on Grant for RU Application No. 2020118969”, dated Nov. 2, 2020, Rospatent, Russia.
Santosh Mehtry, “Office Action for in Application No. 202037019203”, dated Mar. 19, 2021, Intellectual Property India, India.
Related Publications (1)
Number Date Country
20200265850 A1 Aug 2020 US
Continuations (1)
Number Date Country
Parent PCT/EP2018/080339 Nov 2018 US
Child 16868954 US