EP2656343B1 - Tonsignalkodierung mit geringer verzögerung unter alternierender verwendung von prädiktiver kodierung und transformationskodierung - Google Patents

Description

The present invention relates to the field of coding digital signals.

The invention is advantageously applied to the coding of sounds with alternating speech and music.

To effectively code speech sounds, CELP (Code Excited Linear Prediction) techniques are recommended. To effectively encode musical sounds, transform coding techniques are preferred.

CELP coders are predictive coders. They aim to model the production of speech from various elements: a short-term linear prediction to model the vocal tract, a long-term prediction to model the vibration of vocal cords in voiced period, and an excitation derived from a fixed dictionary (white noise, algebraic excitation) to represent the "innovation" which could not be modeled.

The most commonly used transform coders (MPEG AAC encoder or ITU-T G.722.1 Annex C for example) use critical-sampling transforms to compact the signal in the transformed domain. A "critical-sampling transform" is a transform for which the number of coefficients in the transformed domain is equal to the number of time samples analyzed.

One solution for effectively coding a signal containing these two types of content is to select the best technique over time. This solution has been recommended by the standardization organization 3GPP ("3rd Generation Partnership Project"), and a technique called AMR WB + has been proposed.

This technique is based on a CELP technology of the AMR-WB type, more specifically of the ACELP type (for "Algebraic Code Excited Linear Prediction") and a transform coding based on an overlapping Fourier transform in a TCX type model. (for "Transform Coded Excitement" in English).

ACELP coding and TCX coding are both linear predictive type techniques. It should be noted that the AMR-WB + codec has been developed for 3GPP PSS (for "Packet Switched Streaming" in English), MBMS (for "Multimedia Broadcast / Multicast Service") and MMS (for "Multimedia Messaging Service"). "in English), in other words for broadcast and storage services, without strong constraints on algorithmic delay.

This solution suffers from insufficient quality on the music. This deficiency comes particularly from transform coding. In particular, the overlapping Fourier transform is not a critical sampling transformation, and therefore, it is suboptimal.

In addition, the windows used in this encoder are not optimal vis-à-vis the concentration of energy: the frequency forms of these quasi-rectangular windows are sub-optimal.

An improvement of AMR-WB + coding combined with the principles of MPEG AAC coding (for "Advanced Audio Coding" in English) is given by the MPEG USAC codec (for "Unified Speech Audio Coding"), which is still in the process of development to ISO / MPEG. The applications targeted by MPEG USAC are not conversational, but correspond to broadcast and storage services, without strong constraints on the algorithmic delay.

• Pour les signaux de type parole: modes LPD (pour "Linear Prédictive Domain" en anglais) comprenant deux modes différents dérivés du codage AMR-WB+:
  • Un mode ACELP
  • Un mode TCX appelé wLPT (pour "weighted Linear Prédictive Transform" en anglais) utilisant une transformée de type MDCT (contrairement au codec AMR-WB+).
• Pour les signaux de type musique: mode FD (pour "Frequency Domain" en anglais) utilisant un codage par transformée MDCT (pour "Modified Discrete Cosine Transform" en anglais) de type MPEG AAC (pour "Advanced Audio Coding" en anglais) sur 1024 échantillons.

The initial version of the USAC codec, called RM0 (Model 0 Reference), is described in the M. Neuendorf et al., A Novel Scheme for Low Bitrate Unified Speech and Audio Coding - MPEG RM0, 7-10 May 2009, 126th AES Convention . This RM0 codec alternates between several coding modes:

• For speech type signals: LPD (for Linear Predictive Domain) modes comprising two different modes derived from the AMR-WB + coding:
  • ACELP mode
  • A TCX mode called wLPT (for "weighted Linear Predictive Transform" in English) using an MDCT-type transform (unlike the AMR-WB + codec).
• For music type signals: FD mode (for "Frequency Domain" in English) using a transform coding MDCT (for "Modified Discrete Cosine Transform" in English) MPEG AAC type (for "Advanced Audio Coding" in English) on 1024 samples.

Compared with the AMR-WB + codec, the major differences brought by the USAC RM0 coding for the mono part are the use of a MDCT type critical decimation transform for transform coding and quantization of the MDCT spectrum by scalar quantization with arithmetic coding. . It should be noted that the acoustic band coded by the different modes (LPD, FD) depends on the mode selected, which is not the case in the AMR-WB + codec where the ACELP and TCX modes operate at the same time. internal sampling frequency. In addition, the mode decision in the USAC RM0 codec is performed in open loop (or "open-loop" in English) for each frame of 1024 samples. It is recalled that a closed loop decision is made by executing the different coding modes in parallel and choosing a posteriori the mode that gives the best result according to a predefined criterion. In the case of an open-loop decision, the decision is made a priori based on available data and observations but without testing whether this decision is optimal or not.

In the USAC codec, the transitions between LPD and FD modes are crucial to ensure sufficient quality without switching faults, knowing that each mode (ACELP, TCX, FD) has a specific "signature" (in terms of artifacts) and that the FD and LPD modes are different in nature - the FD mode is based on transform coding in the signal domain, while the LPD modes use predictive linear coding in the perceptually weighted domain with filter memories to be handled correctly. The management of intermode switching in the USAC RM0 codec is detailed in the article of J. Lecomte et al., "Efficient cross-fade windows for transitions between LPC-based and non-LPC based audio coding", 7-10 May 2009, 126th AES Convention . As explained in this article, the main difficulty lies in the transitions between LPD to FD modes and vice versa. We retain here only the case of transitions from ACELP to FD.

To understand the operation, we recall here the principle of transform coding MDCT through a typical embodiment.

• Pondération du signal par une fenêtre appelé ici "fenêtre MDCT" de longueur 2M
• Repliement temporel (ou "time-domain aliasing" en anglais) pour former un bloc de longueur M
• Transformation DCT (pour "Discrete Cosine Transform" en anglais) de longueur M

At the coder the MDCT transformation is divided into three stages:

• Weighting of the signal by a window called here "MDCT window" of length 2M
• Time folding (or "time-domain aliasing") to form a block of length M
• Transformation DCT (for "Discrete Cosine Transform" in English) of length M

The MDCT window is divided into 4 adjacent portions of equal lengths M / 2, called "quarters".

The signal is multiplied by the analysis window and folds are made: the first quarter (windowed) is folded (ie inverted in time and overlapped) on the second quarter and the fourth quarter is folded on the third.

Specifically, folding from one quarter to another is done in the following way: The first sample of the first quarter is added (or subtracted) to the last sample of the second quarter, the second sample of the first quarter is added (or subtracted) the second-last sample in the second quarter, and so on until the last sample of the first quarter that is added (or subtracted) to the first sample of the second quarter.

We thus obtain, from 4 quarters, 2 folded quarters where each sample is the result of a linear combination of 2 samples of the signal to be coded. This linear combination is called temporal folding.

These folded quarters are then coded together after DCT transformation. For the next frame we shift one half of window (or 50% overlap), the third and fourth quarters of the previous frame then become the first and second quarter of the current frame. After folding, we send a second linear combination of the same pairs of samples as in the previous frame, but with different weights.

At the decoder, after inverse DCT transformation, the decoded version of these folded signals is thus obtained. Two consecutive frames contain the result of 2 different folds of the same quarters, that is to say for each pair of samples one has the result of 2 linear combinations with different but known weights: an equation system is thus solved to obtain the decoded version of the input signal, the time folding can be thus removed using 2 consecutive decoded frames.

The resolution of the systems of equations mentioned is generally made by unfolding, multiplication by a wisely selected synthesis window then addition-recovery of the common parts. This overlap addition ensures at the same time the smooth transition (without discontinuity due to quantization errors) between two consecutive decoded frames, in fact this operation behaves like a crossfade. When the window for the first quarter or fourth quarter is zero for each sample, we are talking about an MDCT transformation without time folding in this part of the window. In this case the smooth transition is not ensured by the MDCT transformation, it must be done by other means such as for example an external crossfade.

It should be noted that implementation variants of the MDCT transformation exist, in particular on the definition of the DCT transform, on how to temporally fold the block to be transformed (for example, it is possible to reverse the applied signs to the quarters folded to the left and right, or to fold the second and third quarter on respectively the first and fourth quarters), etc. These variants do not change the principle of the MDCT analysis-synthesis with the reduction of the sample block by windowing, temporal folding then transformation and finally windowing, folding and addition-recovery.

In the case of the USAC encoder RM0 described in the article by Lecomte et al., The transition between a frame coded by an ACELP coding and a frame coded by an FD coding is carried out as follows:

A transition window for the FD mode is used with a left overlap of 128 samples, as shown in figure 1 . The temporal folding on this overlapping zone is canceled by introducing an "artificial" time folding to the right of the reconstructed ACELP frame. The MDCT window used for the transition has a size of 2304 samples and the DCT transformation operates on 1152 samples whereas normally FD mode frames are coded with a window size of 2048 samples and a DCT transformation of 1024 samples. Thus the MDCT transformation of the normal FD mode is not directly usable for the transition window, the encoder must also integrate a modified version of this transformation which complicates the implementation of the transition for the FD mode.

These coding techniques of the state of the art AMR-WB + or USAC have algorithmic delays of the order of 100 to 200 ms. These delays are incompatible with conversational applications for which the coding delay is generally of the order of 20-25 ms for voice coders for mobile applications (eg GSM EFR, 3GPP AMR and AMR-WB) and in the order of 40 ms for conversational transform coders for videoconferencing (eg ITU-T G.722.1 Annex C and G.719).

There is therefore a need for alternating coding of predictive and transform coding techniques for speech coding applications with alternating speech and music with good speech and music coding quality. an algorithmic delay compatible with conversational applications, typically of the order of 20 to 40 ms for frames of 20 ms.

The present invention improves the situation.

• codage d'une trame précédente d'échantillons du signal numérique selon un codage prédictif ;
• codage d'une trame courante d'échantillons du signal numérique selon un codage par transformée.

For this purpose, the present invention proposes a method for encoding a digital sound signal, comprising the steps of:

• encoding a previous frame of samples of the digital signal according to a predictive coding;
• encoding a current frame of samples of the digital signal according to transform coding.

The method is such that a first part of the current frame is coded by a predictive coding restricted with respect to the predictive coding of the preceding frame by reusing at least one parameter of the predictive coding of the preceding frame and coding only the non-predictive parameters. reused from this first part of the current frame.

Thus, for an alternating coding of predictive coding and transform coding, when passing a coded frame according to a predictive coding and a coded frame according to a transform coding, a transition frame is thus provided. The fact that the first part of the current frame is also coded by predictive coding makes it possible to recover folding terms that it would not be possible to recover solely by transform coding since the transform coding memory for this frame of transition is not available, the previous frame has not been transformed-encoded.

In addition, using a restricted predictive coding makes it possible to limit the impact on the coding rate of this part. Indeed, only the non-reused parameters of the previous frame are coded for the part of the current frame encoded by the restricted predictive coding.

In addition, the coding of this frame part does not induce additional delay since this first part is at the beginning of the transition frame.

Finally, this type of coding makes it possible to remain with a weighting window size of identical length for the transform coding whether for the coding of the transition frame or for the coding of the other frames coded by transform. The complexity of the coding method is therefore reduced.

The various particular embodiments mentioned below may be added independently or in combination with each other, to the steps of the method defined above.

In a particular embodiment, the restricted predictive coding uses a prediction filter copied from the preceding predictive coding frame.

The use of transform coding is generally selected when the coded segments are quasi-stationary. Thus, the spectral envelope parameter of the signal can be reused from one frame to another for a duration of a part of the frame, for example, a sub-frame, without having a significant impact on the quality of the coding. The use of the prediction filter used for the previous frame does not, therefore, affect the quality of the coding and makes it possible to dispense with additional bits for the transmission of its parameters.

In an alternative embodiment, the restricted predictive coding further uses a decoded value of the pitch and / or its associated gain of the previous predictive coding frame.

These parameters change little from one frame to another. The use of these same parameters from one frame to another will have little impact on the coding quality and will further simplify the predictive coding of the subframe.

In another variant embodiment, certain predictive coding parameters used for the restricted predictive coding are quantized in differential mode with respect to decoded parameters of the preceding predictive coding frame.

Thus, this further simplifies the predictive coding of the transition subframe.

According to a particular embodiment, the method comprises a step of obtaining the reconstructed signals resulting from predictive local codings and decodings and by transforming the first sub-frame of the current and combination frame by a cross-fading of these reconstructed signals.

Thus, the coding transition in the current frame is smooth and does not induce troublesome artifacts.

According to a particular embodiment, said crossfade of the reconstructed signals is performed on a portion of the first part of the current frame as a function of the shape of the transform coding weighting window.

This, for a better adaptation of the transform coding.

According to a particular embodiment, said crossfade of the reconstructed signals is performed on a portion of the first part of the current frame, said portion not containing time folding.

This makes it possible to carry out a perfect reconstruction of the signals in the absence of a quantization error, in the case where the reconstructed signal resulting from the transform coding of the first part of the current frame does not comprise temporal folding.

In a particular embodiment, for a low delay coding, the transform coding uses a weighting window comprising a chosen number of successive weighting coefficients of zero value at the end and at the beginning of the window.

In another particular embodiment, to improve the low-delay coding, the transform coding uses an asymmetric weighting window comprising a chosen number of successive weighting coefficients of zero value in at least one end of the window.

• décodage prédictif d'une trame précédente d'échantillons du signal numérique reçue et codée selon un codage prédictif ;
• décodage par transformée inverse d'une trame courante d'échantillons du signal numérique reçue et codée selon un codage par transformée;

le procédé est tel qu'il comporte en outre une étape de décodage par un décodage prédictif restreint par rapport au décodage prédictif de la trame précédente d'une première partie de la trame courante.The present invention also relates to a method for decoding a digital sound signal, comprising the steps of:

• predictive decoding of a previous frame of samples of the digital signal received and coded according to a predictive coding;
• inverse transform decoding of a current frame of samples of the received and encoded digital signal according to transform coding;

the method is such that it further comprises a step of decoding by a predictive decoding restricted with respect to the predictive decoding of the previous frame of a first part of the current frame.

The decoding method is the counterpart of the coding method and provides the same advantages as those described for the coding method.

Thus, in a particular embodiment, the decoding method comprises a step of combining by crossfading the decoded signals by inverse transform and by restricted predictive decoding for at least a portion of the first part of the current frame received and encoded according to a restricted predictive coding, reusing at least one parameter of the predictive decoding of the previous frame and decoding only the parameters received for this first part of the current frame.

In a preferred mode, the restricted predictive decoding uses a prediction filter decoded and used by the predictive decoding of the previous frame.

In a variant embodiment, the restricted predictive decoding furthermore uses a decoded value of the pitch and / or its associated gain of the predictive decoding of the preceding frame.

• un module de codage prédictif pour coder une trame précédente d'échantillons du signal numérique;
• un module de codage par transformée pour coder une trame courante d'échantillons du signal numérique. Le codeur comporte en outre un module de codage prédictif restreint par rapport au codage prédictif de la trame précédente pour coder une première partie de la trame courante, en réutilisant au moins un paramètre du codage prédictif de la trame précédente et en ne codant que les paramètres non réutilisés de cette première partie de la trame courante.

The present invention also relates to a digital sound signal encoder, comprising:

• a predictive coding module for encoding a previous frame of samples of the digital signal;
• a transform coding module for encoding a current frame of samples of the digital signal. The encoder further comprises a predictive coding module which is restricted in relation to the predictive coding of the preceding frame for coding a first part of the current frame, by reusing at least one parameter of the coding predictive of the previous frame and only coding the non-reused parameters of this first part of the current frame.

• un module de décodage prédictif pour décoder une trame précédente d'échantillons du signal numérique reçue et codée selon un codage prédictif ;
• un module de décodage par transformée inverse pour décoder une trame courante d'échantillons du signal numérique reçue et codée selon un codage par transformée. Le décodeur est tel qu'il comporte en outre un module de décodage prédictif restreint par rapport au décodage prédictif de la trame précédente pour décoder une première partie de la trame courante reçue et codée selon un codage prédictif restreint, en réutilisant au moins un paramètre du décodage prédictif de la trame précédente et en ne décodant que les paramètres reçus pour cette première partie de la trame courante.

Similarly, the invention relates to a digital sound signal decoder, comprising:

• a predictive decoding module for decoding a preceding frame of samples of the digital signal received and coded according to a predictive coding;
• an inverse transform decoding module for decoding a current frame of samples of the received and encoded digital signal according to transform coding. The decoder is such that it further comprises a predictive decoding module which is restricted compared with the predictive decoding of the preceding frame in order to decode a first part of the current frame received and coded according to a restricted predictive coding, by reusing at least one parameter of the predictive decoding of the previous frame and decoding only the parameters received for this first part of the current frame.

Finally, the invention relates to a computer program comprising code instructions for implementing the steps of the encoding method as described above and / or decoding as described above, when these instructions are executed by a processor.

The invention also relates to a storage means, readable by a processor, whether or not integrated into the encoder or decoder, possibly removable, storing a computer program implementing an encoding method and / or a decoding method as described. previously.

• la figure 1 illustre un exemple de fenêtre de transition de l'état de l'art pour la transition entre le codage CELP et le codage FD du codec MPEG USAC, décrit précédemment;
• la figure 2 illustre sous forme de schéma bloc, un codeur et un procédé de codage selon un mode de réalisation de l'invention;
• la figure 3a illustre un exemple de fenêtre de pondération utilisé pour le codage par transformée de l'invention;
• la figure 3b illustre le mode de codage par transformée à recouvrement utilisé par l'invention;
• la figure 4a illustre la transition entre une trame codée avec un codage prédictif et une trame codée par transformée selon un mode de réalisation du procédé de l'invention;
• les figures 4b, 4c et 4d illustrent la transition entre une trame codée avec un codage prédictif et une trame codée par transformée selon deux variantes de réalisation du procédé de l'invention;
• la figure 4e illustre la transition entre une trame codée avec un codage prédictif et une trame codée par transformée selon une des variantes de réalisation du procédé de l'invention pour le cas où la transformation MDCT utilise des fenêtres asymétriques;
• la figure 5 illustre un décodeur et un procédé de décodage selon un mode de réalisation de l'invention;
• les figures 6a et 6b illustrent sous forme d'organigramme les principales étapes du procédé de codage, respectivement du procédé de décodage selon l'invention; et
• la figure 7 illustre un mode possible de réalisation matérielle d'un codeur et d'un décodeur selon l'invention.

Other features and advantages of the invention will appear on examining the detailed description below, and the appended figures among which:

• the figure 1 illustrates an example of a state-of-the-art transition window for the transition between the CELP coding and the FD coding of the MPEG USAC codec, described previously;
• the figure 2 illustrates in the form of a block diagram, an encoder and a coding method according to one embodiment of the invention;
• the figure 3a illustrates an example of a weighting window used for the transform coding of the invention;
• the figure 3b illustrates the overlap transform coding mode used by the invention;
• the figure 4a illustrates the transition between a coded frame with a predictive coding and a transform coded frame according to an embodiment of the method of the invention;
• the Figures 4b , 4c and 4d illustrate the transition between a coded frame with a predictive coding and a transform coded frame according to two alternative embodiments of the method of the invention;
• the figure 4e illustrates the transition between a coded frame with a predictive coding and a transform coded frame according to one of the alternative embodiments of the method of the invention for the case where the MDCT transform uses asymmetric windows;
• the figure 5 illustrates a decoder and a decoding method according to an embodiment of the invention;
• the Figures 6a and 6b illustrate in flow chart form the main steps of the coding method, respectively of the decoding method according to the invention; and
• the figure 7 illustrates a possible embodiment of a hardware encoder and a decoder according to the invention.

The figure 2 represents a multi-mode encoder CELP / MDCT in which the coding method according to the invention is implemented.

This figure shows the coding steps performed for each signal frame. The input signal, denoted x ( n '), is sampled at 16 kHz and the frame length is 20 ms. The invention is generalized to cases where other sampling frequencies are used, for example for super-wide band signals sampled at 32 kHz, possibly with a split into two subbands to apply the invention in the band. low. The frame length is here chosen to correspond to that of the mobile encoders such as 3GPP AMR and AMR-WB, however other lengths are also possible (example: 10 ms).

By convention the samples of the current frame correspond to x ( n '), n ' = 0, ..., 319. This input signal is first filtered by a high-pass filter (block 200), in order to attenuate frequencies below 50 Hz and eliminate the DC component, and then downsampled to the internal frequency of 12.8 kHz (block 201) to obtain a frame of the signal, s (n) of 256 samples. It is considered that the decimation filter (block 201) is produced at a low delay by means of a finite impulse response filter (typically of order 60).

In the CELP coding mode, the current frame, s (n) of 256 samples is encoded according to the preferred embodiment of the invention by a CELP coder inspired by multi-rate ACELP coding (from 6.6 to 23.05 kbit / s) at 12.8 kHz described in 3GPP TS 26.190 or equivalent ITU-T G.722.2 - this algorithm is called AMR-WB (for "Adaptive MultiRate - WideBand").

The signal s (n) is first pre-emphasized (block 210) by 1 - α z ^-1 with α = 0.68, then coded (block 211) by the ACELP algorithm (as described in section 5 of 3GPP TS 26.190).

The successive frames of 20 ms contain 256 temporal samples at 12.8 kHz. The CELP coding uses a memory (or buffer) buf ( n ), n = -64, ..., 319, of 30 ms of signal: 5 ms of signal passed ("lookback" in English), 20 ms of current frame and 5 ms of future signal ("lookahead" in English).

The signal obtained after pre-emphasis of s (n) is copied in this buffer to the positions n = 64, ..., 319 so that the current frame corresponding to the positions n = 0,..., 255 includes 5 ms of signal passed ( n = 0, ..., 63) and 15 ms of the "new" signal to be coded ( n = 64, ..., 255) - it is in the buffer definition that the CELP coding applied here is differentiates from the ACELP coding of the AMR-WB standard because the "lookahead" is here exactly 5 ms without compensation of the subsampling filter delay (block 201).

1. a) Analyse LPC : Une fenêtre asymétrique de 30ms pondère le buffer buf (n) , puis une autocorrélation est calculée. Les coefficients de prédiction linéaire (pour un ordre 16) sont ensuite calculés via l'algorithme de Levinson-Durbin. On obtient ainsi le filtre de prédiction linéaire LPC A(z).

From this buffer, the CELP coding (block 211) comprises several steps implemented in a manner similar to the ACELP coding of the AMR-WB standard; the main steps are given here as an example of embodiment:

1. a) LPC analysis: An asymmetrical window of 30ms weights the buffer buf ( n ), then an autocorrelation is computed. The linear prediction coefficients (for an order 16) are then calculated via the Levinson-Durbin algorithm. The linear prediction filter LPC A ( z ) is thus obtained.

A conversion of the LPC coefficients into ISP spectral coefficients ("Immittance spectral pairs" in English) is performed as well as a quantization (which gives the quantized filter  ( z )).

• b) Pondération perceptuelle du signal : le signal pré-accentué est ensuite pondéré par le filtre défini par W(z) = A(z /γ)/(1-αz ^-1) où α =0,68 et γ=0,92.
• c) Calcul du pitch en boucle ouverte en cherchant le maximum de la fonction d'autocorrélation du signal pondéré (éventuellement sous-échantillonné pour réduire la complexité).
• d) Recherche de l' "excitation adaptative" en boucle fermée par analyse par synthèse parmi les valeurs en voisinage du pitch obtenu en boucle ouverte pour chacune des sous-trames de la trame courante. Un filtrage passe-bas de l'excitation adaptative est également effectué ou non. Un bit est donc produit pour indiquer l'application ou non du filtre. Cette recherche donne la composante notée v(n). Le pitch et le bit associé au filtre de pitch sont codés dans le train binaire.
• e) Recherche de l'innovation ou excitation fixe notée c(n) , en boucle fermée également par analyse par synthèse. Cette excitation est composée des zéros et d'impulsions signées, les positions et signes de ces impulsions sont codés dans le train binaire.
• f) Les gains de l'excitation adaptative et de l'excitation algébrique, ĝ_p, ĝ_c respectivement, sont codés conjointement dans le train binaire.

Finally an LPC filter for each subframe is calculated by subframe interpolation between the filter of the current frame and the filter of the previous frame. In this interpolation step is assumed here that the past frame was coded by the CELP mode, otherwise it is assumed that the states of the CELP coder have been updated.

• b) Perceptual weighting of the signal: the pre-accentuated signal is then weighted by the filter defined by W ( z ) = A (z / γ ) / (1-α z ^-1 ) where α = 0.68 and γ = 0 92.
• c) Calculation of the open loop pitch by seeking the maximum of the autocorrelation function of the weighted signal (possibly downsampled to reduce the complexity).
• d) Search for "closed-loop adaptive excitation" by synthesis analysis among the values in the vicinity of the pitch obtained in open loop for each of the subframes of the current frame. Low-pass filtering of the adaptive excitation is also performed or not. A bit is therefore produced to indicate the application or not of the filter. This search gives the component denoted v ( n ). The pitch and the bit associated with the pitch filter are encoded in the bit stream.
• e) Research of innovation or fixed excitation noted c ( n ), in closed loop also by analysis by synthesis. This excitation is composed of zeros and signed pulses, the positions and signs of these pulses are coded in the binary train.
• f) The gains of adaptive excitation and algebraic excitation, ĝ _p , ĝ _c respectively, are jointly coded in the bit stream.

In this exemplary embodiment, the CELP coder divides each 20 ms frame into 4 subframes of the 5 ms and the quantized LPC filter corresponds to the last (fourth) subframe.

The reconstructed signal ŝ _CELP (n) is obtained by the local decoder included in the block 211 by reconstructing the excitation u (n) = g _p v (n) + g _c c (n), possibly aftertreatment u ( n ), and filtering by the quantized synthesis filter 1 / Â ( z ) (as described in Section 5.10 of 3GPP TS 26.190). This signal is finally de-emphasized (block 212) by the transfer function filter 1 / (1-α z ^-1 ) to obtain the decoded signal CELP ŝ _CELP ( n ).

Of course, other variants of the CELP coding than the embodiment described above can be used without affecting the nature of the invention.

In a variant, the block 211 corresponds to the CELP coding at 8 kbit / s described in the ITU-T G.718 standard according to one of the four possible CELP coding modes: unvoiced mode (UC), voiced mode (VC), transition mode (TC) or generic mode (GC). In another variant another embodiment of the CELP coding is chosen, for example the ACELP coding in the mode interoperable with the AMR-WB coding of the ITU-T G.718 standard. The representation of the LPC coefficients in the form of ISF can be replaced by the spectral line pairs (LSF) or other equivalent representations.

When CELP mode is selected, block 211 delivers the CELP coded I _CELP indices to be multiplexed in the bit stream.

où M = 256 est la longueur de trame et Mz = 96 est le nombre de zéros à gauche et à droite dans la fenêtre w(n). La fenêtre w(n) est choisie dans le mode de réalisation privilégié comme une fenêtre "bas retard" symétrique de la forme: $$w_{\mathit{shift}}\left(m\right)=\{\begin{array}{cc}0& 0\le m<\frac{M}{2}-\frac{L_{\mathit{ov}}}{2}\\ \sin \left(\pi \frac{m-\left(\frac{M}{2}-\frac{L_{\mathit{ov}}}{2}\right)+\frac{1}{2}}{2L_{\mathit{ov}}}\right)& \frac{M}{2}-\frac{L_{\mathit{ov}}}{2}\le m<\frac{M}{2}+\frac{L_{\mathit{ov}}}{2}\\ 1& \frac{M}{2}+\frac{L_{\mathit{ov}}}{2}\le m<3\frac{M}{2}-\frac{L_{\mathit{ov}}}{2}\\ \sin \left(\pi \frac{\left(m-3\frac{M}{2}+\frac{L_{\mathit{ov}}}{2}\right)+\frac{1}{2}}{2L_{\mathit{ov}}}\right)& 3\frac{M}{2}-\frac{L_{\mathit{ov}}}{2}\le m<\frac{M}{2}+\frac{L_{\mathit{ov}}}{2}\\ 0& 3\frac{M}{2}+\frac{L_{\mathit{ov}}}{2}\le m<2M\end{array}$$

In the MDCT encoding mode of the figure 2 the current frame, s ( n ), n = 0, ..., 255, is first transformed (block 220) according to a preferred embodiment to obtain the following transformed coefficients: $$S\left(k\right)=\sqrt{\frac{2}{M}}{\displaystyle \underset{\mathrm{not}=\mathit{Mz}}{\overset{2M-M_z-1}{\Sigma }}}w\left(\mathrm{not}\right)\mathrm{.}s\left(\mathrm{not}-M_z\right)\mathrm{.}\cos \left(\frac{\pi }{M}\left(\mathrm{not}+\frac{M}{2}+\frac{1}{2}\right)\left(k+\frac{1}{2}\right)\right),k=0,...,M-1$$

where M = 256 is the frame length and Mz = 96 is the number of zeros on the left and right in the w ( n ) window. The window w (n) is chosen in the preferred embodiment as a "low delay" window symmetrical with the form: $$w_{\mathit{shift}}\left(m\right)=\{\begin{array}{cc}0& 0\le m<\frac{M}{2}-\frac{{\mathrm{The}}_{\mathit{ov}}}{2}\\ \sin \left(\pi \frac{m-\left(\frac{M}{2}-\frac{{\mathrm{The}}_{\mathit{ov}}}{2}\right)+\frac{1}{2}}{2{\mathrm{The}}_{\mathit{ov}}}\right)& \frac{M}{2}-\frac{{\mathrm{The}}_{\mathit{ov}}}{2}\le m<\frac{M}{2}+\frac{{\mathrm{The}}_{\mathit{ov}}}{2}\\ 1& \frac{M}{2}+\frac{{\mathrm{The}}_{\mathit{ov}}}{2}\le m<3\frac{M}{2}-\frac{{\mathrm{The}}_{\mathit{ov}}}{2}\\ \sin \left(\pi \frac{\left(m-3\frac{M}{2}+\frac{{\mathrm{The}}_{\mathit{ov}}}{2}\right)+\frac{1}{2}}{2{\mathrm{The}}_{\mathit{ov}}}\right)& 3\frac{M}{2}-\frac{{\mathrm{The}}_{\mathit{ov}}}{2}\le m<\frac{M}{2}+\frac{{\mathrm{The}}_{\mathit{ov}}}{2}\\ 0& 3\frac{M}{2}+\frac{{\mathrm{The}}_{\mathit{ov}}}{2}\le m<2M\end{array}$$

This low lag window w _shift ( m ), m = 0, ..., 511, for M = 256 and L _ov = 64, applies to the current frame corresponding to the indices n = 0, ..., 255 in taking w (n) = w _shift ( n + 96), which implies an overlap of 64 samples (5 ms).

This window is illustrated at figure 3a . Note that the window has 2 (M-Mz) = 320 non-zero samples, ie 25 ms at 12.8 kHz. The figure 3b illustrates how the window w ( n ) applies to each time frame of 20 ms, taking w ( n ) = w _hift ( n + 96).

This window applies to the current frame of 20 ms as well as to a future signal "lookahead" of 5 ms. It will be noted that the MDCT coding is therefore synchronized with the CELP coding insofar as the MDCT decoder can reconstruct by addition-overlap the entirety of the current frame, thanks to the overlap on the left and the intermediate "flat" of the MDCT window, and it also has an overlap on the future 5 ms frame. It is noted here for this window that the current MDCT frame induces a temporal folding on the first part of the frame (in fact on the first 5 ms) where the recovery takes place.

It is important to note that the frames reconstructed by the CELP and MDCT coders / decoders have coincident temporal supports. This temporal synchronization of the reconstructions facilitates the switching of coding models.

In variants of the invention, other MDCT windows than w (n) are also possible. The implementation of block 220 is not detailed here. An example is given in ITU-T G.718 (Clauses 6.11.2 and 7.10.6).

The coefficients S ( k ), k = 0,..., 255, are encoded by the block 221 which is inspired, in a preferred embodiment, from the "TDAC" coding (for "Time Domain Aliasing Cancellation"). of ITU-T G.729.1. Here we note B _tot the total bit budget allocated in each frame to the MDCT coding. The discrete spectrum S (k) is divided into subbands, then a spectral envelope, corresponding to the rms (for "root mean square" in English, that is to say the square root of the average energy ) per subband, is quantized in the logarithmic domain in steps of 3 dB and coded by entropy coding. The bit budget used by this envelope coding is noted here B _env ; it is variable because of entropy coding.

Unlike the "TDAC" coding of the G.729.1 standard, a predetermined number of bits denoted B _inj (budget function B _tot ) is reserved for the coding of noise injection levels in order to "fill" the coded coefficients. at a value of zero by noise and hide artifacts of "musical noise" that would otherwise be audible. Then the S ( k ) spectrum subbands are encoded by spherical vector quantization with the remaining budget of B _tot - B _env - B _inj bit. This quantization is not detailed, as is the adaptive allocation of the bits by sub-bands, since these details go beyond the scope of the invention. When selecting the MDCT mode or the transition mode, the block 221 delivers the MDCT indices coded I _MDCT to be multiplexed in the bitstream.

Block 222 decodes the bitstream produced by block 221 in order to reconstruct the decoded spectrum Ŝ ( k ), k = 0, ..., 255. Finally block 223 reconstructs the current frame to find the signal s _MDCT ( n ) , n = 0, ..., 255.

• Premier cas: La trame précédente a été codée par un mode MDCT. Dans ce cas, la mémoire (ou états) nécessaire à la synthèse MDCT dans le décodeur local (et distant) est disponible et l'opération d'addition/recouvrement utilisée par la MDCT pour annuler le repliement temporel est possible. La trame MDCT est correctement décodée sur toute la trame. Il s'agit ici du fonctionnement "normal" du codage/décodage MDCT.
• Deuxième cas: La trame précédente a été codée par un mode CELP. Dans ce cas, la reconstruction de la trame au décodeur (local et distant) n'est pas complète. Comme expliqué précédemment, la MDCT utilise pour la reconstruction une opération d'addition/recouvrement entre la trame courante et la trame précédente (avec des états stockés en mémoire) pour supprimer le repliement temporel de la trame à décoder et aussi éviter les effets de blocs et augmenter la résolution fréquentielle par l'utilisation de fenêtres plus longues qu'une trame. Avec les fenêtres MDCT les plus couramment utilisées (type sinusoïdal) la distorsion du signal due au repliement temporel est plus forte à l'extrémité de la fenêtre et quasi nulle au milieu de la fenêtre. Dans ce cas précis, si la trame précédente est de type CELP, la mémoire MDCT n'est pas disponible car la dernière trame n'a pas été codée par transformée MDCT.

Due to the nature of the transform coding MDCT (overlap between the frames), two cases are to be considered in the MDCT coding of a current frame:

• First case: The previous frame was coded by an MDCT mode. In this case, the memory (or states) necessary for the MDCT synthesis in the local (and remote) decoder is available and the addition / recovery operation used by the MDCT to cancel the temporal folding is possible. The MDCT frame is correctly decoded throughout the frame. This is the "normal" operation of the MDCT coding / decoding.
• Second case: The previous frame was coded by a CELP mode. In this case, the reconstruction of the frame at the decoder (local and remote) is not complete. As explained above, the MDCT uses for the reconstruction an addition / overlap operation between the current frame and the previous frame (with states stored in memory) to eliminate the temporal folding of the frame to be decoded and also to avoid the effects of blocks. and increase the frequency resolution by using windows longer than a frame. With the most commonly used MDCT windows (sinusoidal type) signal distortion due to time folding is stronger at the end of the window and near zero in the middle of the window. In this case, if the previous frame is of CELP type, the MDCT memory is not available because the last frame was not coded by MDCT transform.

The folded area of the start of the frame corresponds to the area of the signal in the MDCT frame which is disturbed by the time folding inherent in the MDCT transformation.

Thus, when the current frame is coded by the MDCT mode (block 220 to 223) and the previous frame has been coded by the CELP mode (blocks 210 to 212), a specific transition processing from CELP to MDCT is necessary.

In this case, as indicated by figure 4a , the first frame is coded by the CELP mode and can be completely reconstructed by the CELP decoder (local or remote). On the other hand, the second frame is coded by the MDCT mode; this second frame is considered to be the current frame. The overlap area on the left side of the MDCT window is problematic because the complementary part (with time folding) of this window is not available since the previous frame has not been coded by MDCT. Folding in this left part of the MDCT window can not be deleted.

For this transition, the coding method according to the invention comprises a step of encoding a block of samples of length less than or equal to the length of the frame, chosen for example as an additional subframe of 5 ms, in the transform coded current frame (MDCT), representing the left folding area of the current frame, by a transition predictive coder or restricted predictive coding. It should be noted that the type of coding in the frame preceding the transition MDCT frame could be another type of coding than the CELP coding, for example an ADPCM or a TCX coding. The invention applies in the general case where the previous frame has been coded by a coding not updating the MDCT memories in the signal domain and the invention involves coding a block of samples corresponding to a portion of the signal. the current frame by a transition coding using the information of the coding of the previous frame.

The transition predictive coding is restricted compared to the predictive coding of the previous frame; It consists in using the stable parameters of the previous frame coded by a predictive coding and coding only a few minimal parameters for the additional subframe in the current transition frame.

Thus, this restricted predictive coding reuses at least one parameter of the predictive coding of the preceding frame and therefore encodes only the parameters that are not reused. In this sense, one can speak of a restricted coding (by the restriction of the coded parameters).

The embodiments illustrated on the Figures 4a to 4e , assume that the left overlap of the first MDCT window is less than or equal to the subframe length (5 ms). In the opposite case, one or more additional CELP sub-frame (s) must also be coded, adaptive and / or fixed excitation dictionaries of a size adapted to the recovery length must be used. .

On the Figures 4a to 4e the mixed line (lines alternating points and lines) correspond to the MDCT coding folding lines and the lines of folding of MDCT decoding. At the top of these figures the bold lines separate the frames at the arrival of the encoder, it is possible to start the encoding of a new frame when a frame thus defined is entirely available. It is important to note that these bold lines in the encoder do not correspond to the current frame but to the block of new samples arriving for each frame; the current frame is in fact delayed by 5 ms. At the bottom, the bold lines separate the decoded frames at the output of the decoder.

The specific processing of the transition frame corresponds to blocks 230 to 232 and block 240 of the figure 2 . This processing is performed when the previous mode, noted _pre mode, that is to say the type of coding of the previous frame (CELP or MDCT), is of type CELP.

• Codage MDCT de la trame : dans l'exemple de réalisation illustrée en haut à la figure 4a, la fenêtre choisie pour ce codage est la fenêtre w(n) définie précédemment, avec une longueur effective de 25ms. D'autres formes de fenêtres pour remplacer w(n) dans la trame MDCT de transition (première trame MDCT suivant une trame CELP) sont illustrées en figures 4b, 4c, 4d et 4e avec une même longueur effective qui peut être différente de 25 ms. Pour le cas de la figure 4a, les 20ms de la trame courante sont placés au début de la portion non nulle de la fenêtre, tandis que les 5 ms restantes sont les 5 premières millisecondes de la future trame (« lookahead »). Après le calcul de la MDCT (par repliement et transformée en cosinus discret (DCT)), on obtient donc les 256 échantillons du spectre MDCT. La quantification de ces coefficients est ici faite par transmission de l'enveloppe spectrale et quantification vectorielle sphérique pour chaque sous-bande normalisée de l'enveloppe. La différence avec la description précédente du codage MDCT "normal" est que le budget alloué à la quantification vectorielle dans la trame de transition n'est plus de B_tot - B_env - B_inj mais de B_tot - B_env - B_inj - B_trans, B_trans représentant le nombre de bits nécessaires à la transmission des informations manquantes pour générer l'excitation d'entrée du filtre 1/Â(z) dans le codeur de transition. Ce nombre de bits, B_trans, est variable en fonction du débit total du codeur.
• Décodage du spectre quantifié (en bas sur les figures 4a à 4e) : après reconstruction du spectre quantifié et l'opération de transformation MDCT inverse partielle (par dépliement et multiplication par la fenêtre de synthèse mais sans addition-recouvrement car les mémoires MDCT ne sont pas disponibles à partir de la trame précédente), on obtient le signal temporel dans lequel les 5 premières millisecondes (première sous-trame) contiennent du repliement temporel, puis 15ms du signal reconstruit, les 5 dernières millisecondes servant enfin à alimenter la mémoire MDCT nécessaire à la reconstruction de la prochaine trame, si celle-ci est de type MDCT ; dans le cas où la prochaine trame est de type CELP, cette mémoire est en général inutile.
• Codage de la première sous-trame (zone grisée marquée « TR » des figures 4a à 4e) par le codage de transition comportant un codage prédictif restreint.

The coding of the current transition frame between coding CELP and MDCT (second frame of Figures 4a to 4e ), is based on several steps implemented by block 231:

• MDCT coding of the frame: in the exemplary embodiment illustrated at the top figure 4a , the window chosen for this encoding is the window w (n) defined previously, with an effective length of 25ms. Other forms of windows to replace w (n) in the transition MDCT frame (first MDCT frame following a CELP frame) are illustrated in FIG. Figures 4b , 4c , 4d and 4th with the same effective length that can be different from 25 ms. For the case of figure 4a , the 20ms of the current frame are placed at the beginning of the non-zero portion of the window, while the remaining 5 ms are the first 5 milliseconds of the future frame ("lookahead"). After calculating the MDCT (folding and discrete cosine transform (DCT)), we obtain the 256 samples of the MDCT spectrum. The quantization of these coefficients is here made by transmission of the spectral envelope and spherical vector quantization for each normalized subband of the envelope. The difference with the previous description of the "normal" MDCT coding is that the budget allocated to the vector quantization in the transition frame is no longer B _tot - B _env - B _inj but B _tot - B _env - B _inj - B _trans , B _trans representing the number of bits needed to transmit the missing information to generate the input excitation of the filter 1 / Â ( z ) in the transition encoder. This number of bits, B _trans , is variable as a function of the total rate of the encoder.
• Decoding of the quantified spectrum (down on Figures 4a to 4e ): after reconstruction of the quantized spectrum and the partial inverse MDCT transformation operation (by unfolding and multiplication by the synthesis window but without addition-recovery since the MDCT memories are not available from the previous frame), we obtain the time signal in which the first 5 milliseconds (first subframe) contain temporal folding, then 15ms of the reconstructed signal, the last 5 milliseconds serving finally to supply the memory MDCT necessary for the reconstruction of the next frame, if this one is of MDCT type; in the case where the next frame is of CELP type, this memory is generally useless.
• Encoding of the first sub-frame (shaded area marked "TR" of Figures 4a to 4e ) by the transition encoding with restricted predictive coding.

This restricted predictive coding has the following steps.

The filter ((z) of the first subframe is for example obtained by copying the filter ((z) of the fourth subframe of the previous frame. This saves the calculation of this filter and saves the number of bits associated with its coding in the bit stream.

This choice is justified because in an alternating codec CELP and MDCT, MDCT mode is generally selected in quasi-stationary segments where the coding in the frequency domain is more efficient than in the time domain. At the moment of switching between the ACELP and MDCT modes this stationarity is normally already established, it can be assumed that some parameters such as the spectral envelope evolve very little frame to frame. Thus the quantized synthesis filter 1 / Â ( z ) transmitted during the previous frame, representing the spectral envelope of the signal, can be reused effectively.

The pitch (for reconstructing the adaptive excitation by using the past excitation) is calculated in a closed loop for this first sub-transition frame. This is coded in the bitstream, possibly differentially with respect to the pitch of the last sub-frame CELP. The adaptive excitation v (n) (n = 0, ..., 63) is deduced from this. In a variant, the pitch value of the last CELP frame can also be reused, without transmitting it.

A bit is allocated to indicate whether the adaptive excitation v ( n ) was filtered or not by a coefficient low-pass filter (0.18, 0.64, 0.18). However, the value of this bit could be taken from the last previous CELP frame.

The search for the algebraic excitation of the sub-frame is performed in a closed loop only for this transition sub-frame, and the coding of the positions and signs of the excitation pulsations are coded in the bit stream, again with a number of bits depending on the encoder rate.

The gains ĝ _p , ĝ _c respectively associated with adaptive and algebraic excitation are encoded in the bit stream. The number of bits allocated to this coding depends on the rate of the encoder.

By way of example, for a total bit rate of 12.65 kbit / s, 9 bits are reserved for the absolute coding of the pitch of the sub-frame, 6 bits are reserved for the coding of the gain, 52 bits are reserved for the coding of the the fixed excitation, and a bit indicates whether the adaptive excitation has been filtered or not. So we reserve B _tr = 68 bits (3.4 kbit / s) for the encoding of this transition subframe, so there remains 9.25 kbit / s for the MDCT coding in the transition frame.

Once all the parameters obtained and coded, one can generate the missing subframe by excitation of the filter 1 / Â (z) with the obtained excitation. Block 231 also provides the parameters of the restricted predictive coding, I _TR , to be multiplexed in the bitstream. It is important to note that block 231 uses information, noted Mem. in the figure, the coding (block 211) carried out in the frame preceding the transition frame. For example, the information includes the LPC and pitch parameters of the last subframe.

The signal obtained is then de-emphasized (block 232) by the filter 1 / (1-α z ^-1 ) , to obtain the reconstructed signal ŝ _TR ( n ), n = 0, ..., 63, in the first subframe of the current transition frame CELP to MDCT.

Finally, it remains to combine the reconstructed signals ŝ _TR ( n ), n = 0, ..., 63, and ŝ _MDCT ( n ), n = 0, ..., 255 For this, a linear progressive mixture (fade-out or "cross-fade" in English) between the two signals is performed and gives the next output signal (block 240). For example, in a first embodiment, this cross-fade is performed on the first 5 ms in the following manner as illustrated in FIG. figure 4a : $${\hat{s}}_{\mathit{MDCT}}\left(\mathrm{not}\right)=\{\begin{array}{ccc}\left(1-\frac{\mathrm{not}}{64}\right){\hat{s}}_{\mathit{TR}}\left(\mathrm{not}\right)+\frac{\mathrm{not}}{64}{\tilde{s}}_{\mathit{MDCT}}\left(\mathrm{not}\right)& & \mathrm{not}=0,...,63\\ {\tilde{s}}_{\mathit{MDCT}}\left(\mathrm{not}\right)& & \mathrm{not}=64,...,255\end{array}$$

It should be noted that the fade-in between the two signals is here 5 ms, but it can be smaller. Assuming that the CELP coder and the MDCT encoder are perfect or almost perfect reconstruction, we can even do without cross-fade, in fact the first 5 milliseconds of the frame are coded perfectly (by the restricted CELP), and the next 15ms are also coded perfectly (by the MDCT encoder). Artifact attenuation by dissolving is theoretically no longer necessary. In this case, the signal ŝ _MDCT (n) can be written more simply: $$\begin{array}{lll}{\hat{s}}_{\mathit{MDCT}}\left(\mathrm{not}\right)=& {\tilde{s}}_{\mathit{TR}}\left(\mathrm{not}\right)& \mathrm{not}=\mathrm{0},...,\mathrm{63}\\ & {\tilde{s}}_{\mathit{MDCT}}\left(\mathrm{not}\right)& \mathrm{not}=\mathrm{64},...,\mathrm{255}\end{array}$$

In the variant of the figure 4b the window is replaced by a window identical to the analysis and synthesis with a rectangular shape without folding to the left $$w\left(\mathrm{not}\right)=\{\begin{array}{ccc}0& & \mathrm{not}=0,...,31\\ 1& & \mathrm{not}=32,...,255\end{array}$$

We do not specify here for n <0 and n> 255. For n <0 the value of w (n) is zero and for n> 255 the windows are determined by the analysis and synthesis windows MDCT used for the MDCT coding "Normal".

Fade to the figure 4b is done as follows: $${\hat{s}}_{\mathit{MDCT}}\left(\mathrm{not}\right)=\{\begin{array}{ccc}{\tilde{s}}_{\mathit{TR}}\left(\mathrm{not}\right)& & \mathrm{not}=0,...,31\\ \left(1-\frac{\mathrm{not}-32}{64}\right){\tilde{s}}_{\mathit{TR}}\left(\mathrm{not}\right)+\frac{\mathrm{not}-32}{64}{\tilde{s}}_{\mathit{MDCT}}\left(\mathrm{not}\right)& & \mathrm{not}=32,...,63\\ {\tilde{s}}_{\mathit{MDCT}}\left(\mathrm{not}\right)& & \mathrm{not}=64,...,255\end{array}$$

In the variant of Figures 4c the window is replaced by a window identical to the analysis and the synthesis with a form including a first part of null value on 1.25 ms, then a sinusoidal rising edge on 2.5 ms, and a flat of unit value on 1.25 ms: $$w\left(\mathrm{not}\right)=\{\begin{array}{ccc}0& & \mathrm{not}=0,...,15\\ \sin \left(\frac{\mathrm{not}-15.5}{32}\pi \right)& & \mathrm{not}=16,...,47\\ 1& & \mathrm{not}=48,...,255\end{array}$$

We do not specify here for n <0 and n> 255. For n <0 the value of w (n) is zero and for n> 255 the windows are determined by the analysis and synthesis windows MDCT used for the MDCT coding "Normal".

ce qui montre que la zone où le fondu enchaîné est effectué est exempte de repliement temporel.Fade to the figure 4c is done as follows: $${\hat{s}}_{\mathit{MDCT}}\left(\mathrm{not}\right)=\{\begin{array}{ccc}{\tilde{s}}_{\mathit{TR}}\left(\mathrm{not}\right)& & \mathrm{not}=0,...,37\\ \left(1-\frac{\mathrm{not}-48}{16}\right){\tilde{s}}_{\mathit{TR}}\left(\mathrm{not}\right)+\frac{\mathrm{not}-48}{16}{\tilde{s}}_{\mathit{MDCT}}\left(\mathrm{not}\right)& & \mathrm{not}=48,...,63\\ {\tilde{s}}_{\mathit{MDCT}}\left(\mathrm{not}\right)& & \mathrm{not}=64,...,255\end{array}$$

which shows that the zone where the cross-fade is performed is free of temporal folding.

In the variant of Figures 4d and 4th , we suppose that the MDCT analysis and synthesis weighting window in the current transition frame (n = 0, ..., 255) is given by: $$w\left(\mathrm{not}\right)=\{\begin{array}{ccc}0& & \mathrm{not}=0,...,31\\ \sin \left(\frac{\mathrm{not}-31.5}{64}\pi \right)& & \mathrm{not}=32,...,63\\ 1& & \mathrm{not}=64,...,255\end{array}$$

Note here that we do not specify for n <0 and n> 255. For n <0 the value of w (n) is zero and for n> 255 the windows are determined by the analysis and synthesis windows MDCT used for "normal" MDCT coding.

Crossfade is performed as follows, assuming: $${\hat{s}}_{\mathit{MDCT}}\left(\mathrm{not}\right)=\{\begin{array}{ccc}{\tilde{s}}_{\mathit{TR}}\left(\mathrm{not}\right)& & \mathrm{not}=0,...,31\\ {\cos }^2\left(\frac{\mathrm{not}-31.5}{64}\pi \right){\tilde{s}}_{\mathit{TR}}\left(\mathrm{not}\right)+{\tilde{s}}_{\mathit{MDCT}}\left(\mathrm{not}\right)& & \mathrm{not}=32,...,63\\ {\tilde{s}}_{\mathit{MDCT}}\left(\mathrm{not}\right)& & \mathrm{not}=64,...,255\end{array}$$

It should be noted that the dissolve Figures 4b to 4d could be used in the configuration of the figure 4a also. The advantage of doing so is that the cross-fade is performed on the decoded part MDCT where the folding error is the weakest. With the structure represented on the figure 4a we are closer to perfect reconstruction.

It is considered in the exemplary embodiment that the encoder operates with a closed-loop mode decision.

From the original signal at 12.8 kHz, s ( n ), n = 0, ..., 255, and signals reconstructed by each of the two modes, CELP and MDCT, ŝ _CELP ( n ) and ŝ _MDCT ( n ), n = 0, ..., 255, the mode decision for the current frame is taken (block 254) by calculating (blocks 250, 252) the coding errors s (n) - ŝ _CELP ( n ) and s ( n ) - ŝ _MDCT ( n ), then applying by subframes of 64 samples (5 ms) a perceptual weighting by the filter W ( z ) = A ( z / γ ) / (1- α z ^-1 ) with γ = 0.92 whose coefficients are derived from the states of the CELP coding (block 211), and finally by calculating a signal-to-noise ratio criterion per segmental (with 5 ms of time unit). The operation of the closed-loop decision (Block 254) is not described in greater detail. The decision of block 554 is coded (I _SEL ) and multiplexed in the bitstream.

The multiplexer 260 combines the coded decision I _SEL and the different bits coming from the coding modules in the bit stream bst as a function of the decision of the module 254: For a CELP frame the I _CELP bits are sent, for a purely MDCT frame the bits I _MDCT and for a transition frame CELP to MDCT the bits I _TR and I _MDCT .

It should be noted that the mode decision could also be made in open loop or specified externally to the encoder, without changing the nature of the invention.

The decoder according to one embodiment of the invention is illustrated on the figure 5 . The demultiplexer (block 511) receives the bit stream bst and first extracts the mode index I _SEL . This index controls the operation of the decoding modules and the switch 509. If the I _SEL index indicates a CELP frame, the CELP decoder 501 is activated and decodes the CELP I _CELP indices. The reconstructed signal s _CELP (n) by the CELP decoder 501 by reconstructing the excitation u (n) = g _p v (n) + g _c c (n), u optionally aftertreatment (n), and filter the quantized synthesis filter 1 / Â ( z ) is de-emphasized by the transfer function filter 1 / (1-α z ^-1 ) (block 502) to obtain the decoded signal CELP ŝ _CECP ( n ). The switch 509 selects this signal ŝ _CELP ( n ) as an output signal at 12.8 kHz ŝ ( n ) = ŝ _CELP ( n ). If the I _SEL index indicates a "purely" MDCT or transition frame the MDCT decoder 503 is activated; it decodes the MDCT I _MDCT indices. From the transmitted indices I _MDCT, the block 503 reconstructs the decoded spectrum Ŝ ( k ), k = 0, ..., 255, then the block 504 reconstructs the current frame to find the signal ŝ _MDCT ( n ), n = 0 , ..., 255. In a transition frame the indices I _TR are also decoded by the module 505. It is important to note that the block 505 uses information, noted Mem. in the figure, the decoding (block 501) carried out in the frame preceding the transition frame. For example, the information includes the LPC and pitch parameters of the last subframe.

Thus, the decoder reuses at least one predictive decoding parameter of the previous frame to decode a first portion of the transition frame. It also uses the only parameters received for this first part which correspond to the parameters not reused.

The output of block 505 is deemphasized by the transfer function filter 1 / (1-α z ^-1 ) (block 506) to obtain the signal reconstructed by the restricted predictive coding ŝ _TR ( n ). This processing (block 505 to 507) is performed when the previous mode, noted _pre mode, that is to say the type of decoding of the previous frame (CELP or MDCT), is of CELP type.

In a transition frame the signals ŝ _TR ( n ) and ŝ _MDCT ( n ) are combined by the block 507, typically a crossfade operation, as described above for the encoder implementing the invention, is carried out in the first part of the frame to obtain the signal ŝ _MDCT ( n ). In the case of a "pure" MDCT frame, that is, if the current and previous frames are coded by MDCT, _MDCT ( n ) = _MDCT ( n ). Switch 509 selects this signal ŝ _MDCT ( n ) as an output signal at 12.8 kHz ŝ ( n ) = ŝ _MDCT ( n ). Then the reconstructed signal x ( n ) at 16 kHz is obtained by oversampling from 12.8 kHz to 16 kHz (block 510). This rate change is considered to be performed using a polyphase finite impulse response filter (order 60).

Thus, according to the coding method of the invention, the samples corresponding to the first subframe of the current frame coded by transform coding, are coded by a restricted predictive coder to the detriment of the bits available to transform coding (case of constant flow rate) or by increasing the transmitted flow rate (variable flow rate).

In one embodiment of the invention illustrated on the figure 4a the folded area is used only for crossfading which provides a smooth and seamless transition between CELP reconstruction and MDCT reconstruction.

Note that in a variant, this cross-fade can be performed on the second part of the folded area or the folding effect is less strong. In this variant illustrated on the figure 4a by increasing the flow rate one does not converge towards the perfect reconstruction because a part of the signal used for the fade is disturbed by the temporal folding.

This variant can not be transparent even if this low-rate disturbance is quite acceptable and generally almost inaudible compared to the intrinsic degradation of the low-rate coding.

In another variant, in the MDCT frame immediately following a CELP (transition frame) frame (as illustrated in FIG. figure 4b ) A left-folding MDCT can be used, with a rectangular window starting in the middle of the subframe on the fold line.

In the framed and shaded part of the figure we can observe the evolution of the weights of the CELP and MDCT components in the dissolve. During the first 2.5 ms of the transition frame the output is identical to the decoded signal of the restricted predictive coding and then the transition is made during the second 2.5 ms following gradually decreasing the weight of the CELP component and increasing the weight of the MDCT component depending on the exact definition of the MDCT window. The transition is therefore made using the decoded signal MDCT without folding. Thus one can obtain a transparent coding by increasing the flow. However, rectangular windowing can cause block effects in the presence of MDCT coding noise.

The figure 4c illustrates another variant where the upward portion of the window (with time folding) on the left is shortened (for example to 2.5 ms) and thus the first 5 milliseconds of the signal reconstructed by the MDCT mode contain a portion (1.25 ms) without folding to right in this first 5 ms subframe. Thus the "flat" (that is, the constant value at 1 without folding) of the MDCT window is extended to the left in the subframe coded by the restricted predictive coding by comparing with the configuration of the figure 4a .

Again, in the framed and shaded part of the figure 4c we can observe the evolution of the weights of the CELP and MDCT components in the dissolve for this variant. According to the example given, during the first 3.75 milliseconds, the output is identical to the signal reconstructed by the restricted predictive decoding. For this zone, the MDCT component must not be decoded because it is not used. Therefore, the shape of the weighting window does not matter for this area. The transition is made during the last 1.25 ms by gradually decreasing the weight of the CELP component and increasing the weight of the MDCT component. By doing so the perfect reconstruction at high speed - so in the absence of quantification error - is ensured because the zone disturbed by the folding does not intervene in the fade. The fade-in of these reconstructed signals is performed on the part of the window where the reconstructed signal resulting from the transform coding of the first part of the current frame has no time folding. The advantage of this variant compared to that illustrated on the figure 4b is the best spectral property of the window used and the decrease of the block effects, without the rectangular part.

Note that the variant of figure 4b is an extreme case of the variant of the figure 4c where the rising portion of the window (with time folding) on the left is shortened to 0. In another variant of the invention the length of the rising portion of the window (with time folding) on the left depends on the flow rate: for example it is shortened with the increase of the flow rate. The weights of the crossfade used in this case can be adapted to the chosen window.

On the Figures 4a , 4b and 4c low delay MDCT windows have been represented, these include a chosen number of successive zero-weighting coefficients at the end and at the beginning of the window. The invention is also applicable for the case where conventional MDCT (sinusoidal) weighting windows are used.

The fade-in has been presented in the examples given above with linear weights. Obviously other functions of variation of the weights can also be used as the rising edge of a sinusoidal function for example. In general, the weight of the other component is always chosen so that the sum of the two weights is always equal to one.

It should also be noted that the weight of the cross-fading of the MDCT component can be integrated in the MDCT synthesis weighting window of the transition frame for all the variants presented, by multiplying the synthesis weighting window MDCT by the fade-in weights , which reduces the complexity of calculation.

In this case the transition between the restricted predictive coding component and the transform coding component is done by adding on the one hand the predictive coding component multiplied by the crossfade weights and on the other hand the transform coding component. thus obtained, without additional weighting by the weights. Moreover, in the case of the variant presented on the figure 4b the integration of the fade-in weights can be done in the analysis weighting window. This can advantageously be done in the variant of figure 4b because the cross-fade area is entirely in the non-folding portion of the frame and the original scan weighting window was zero for samples preceding the folding area.

This approach is even more interesting if we use the weights of the sinusoidal dissolve because this significantly improves the spectral properties of the analysis weighting window with respect to the rectangular window (left side) of the figure 4b or relative to a triangular window with linear weights. Even more advantageously, the same window can be used as an MDCT analysis and synthesis window, which reduces storage. This variant is illustrated on the figure 4d .

It is observed that the rising portion of the analysis / transition synthesis weighting window is in the non-folding zone (after the folding line). This rising part is here defined as a quarter of sinusoidal cycle, so that the combined effect of the analysis / synthesis windows implicitly gives fade weights in the form of a sine squared. This rising part is used for both MDCT windowing and cross fading. The fade-in weights for the restricted predictive coding component are complementary to the rising portion of the combined analysis / synthesis weighting windows, so that the sum of the two weights always gives 1 on the cross-fade area. is done. For the example of the MDCT analysis / synthesis windows with a rising part defined as a sine quarter cycle, the weights of the crossfade for the restricted predictive coding component are therefore in the form of a cosine squared (1 minus Sine squared) Thus the weights of the crossfade are integrated into both the analysis and synthesis weighting window of the transition frame. The variant illustrated in figure 4d allows to reach the perfect reconstruction with high flow because the dissolve is carried out on a zone without time folding.

The invention is also applicable to the case where MDCT windows are asymmetrical and in case the MDCT analysis and synthesis windows are not identical as in the ITU-T G.718 standard. Such an example is given on the figure 4e . In this example, the left side of the transition MDCT window (in bold in the figure) and the fade-in weights are identical to those of the figure 4d . Of course the window and the dissolve corresponding to the other modes of realization already presented (for example those of Figures 4a to 4c ) could also be used in the left part of the transition window.

We observe on the figure 4e , for asymmetric MDCT windows, that at the encoder, the right part of the transition analysis window is identical to the right part of the analysis window MDCT normally used and, at the decoder, the right part of the MDCT transition summary window is identical with the right part of the MDCT synthesis window normally used. As for the left side of the transition MDCT weighting window, we use the left part of one of the MDCT transition windows already presented to the Figures 4a to 4d (in the example of the figure 4e we use that of the figure 4d ).

The weights of the cross-fade are chosen according to the window used, as detailed in the embodiments of the invention described above (for example on Figures 4a to 4d ).

By generalizing, according to the invention, for the MDCT component in the transition frame, the left half of the MDCT analysis weighting window used is chosen such that the right part of the zone corresponding to this half of the window comprises no temporal aliasing (for example according to one of the examples of Figures 4a to 4e ) and the left half of the corresponding MDCT synthesis weighting window is chosen in such a way that after the combined effect of the analysis and synthesis windows this non-folding zone has a weight 1 at least on the right side (without any mitigation). The Figures 4a to 4e show examples of pairs of analysis and synthesis windows that verify these criteria. According to these examples, the left half of the transition MDCT weighting window is identical to the analysis and the synthesis, but this is not necessarily the case in all embodiments of the invention. Note, for example, that the synthesis window shape in the area where the weight of the MDCT component in the crossfade is zero is not important because these samples will not be used, it must not even be calculated. On the other hand, the contribution of the analysis and synthesis windows in the weights of the crossfade can be equally unequally distributed, which would give different analysis and synthesis windows in the left half of the MDCT weighting window. transition. As for the right half of the transition analysis and synthesis windows, they are identical with those of the MDCT weighting windows normally used in the only areas encoded by transform coding. To ensure a perfect reconstruction in the absence of quantization error (at very high speed), the cross-fade between the signal reconstructed by the restricted predictive decoder and the signal reconstructed by the transform decoder must be performed on a zone without temporal folding. . The combined effect of the analysis and synthesis windows can implicitly integrate the weights of the cross-fade of the component reconstructed by the transform decoder.

To limit the impact on the bit rate allocated to the MDCT coding, it is interesting to use the least bits possible for this restricted predictive coding while guaranteeing good quality. In an alternating CELP and MDCT codec, the MDCT mode is generally selected in quasi-stationary segments where the frequency domain coding is more efficient than in the time domain. However one can also consider cases where the mode decision is taken in open loop or driven externally to the encoder, without guarantee that the hypothesis of stationarity is verified.

When switching between the ACELP and MDCT modes this stationarity is normally already established, it can be assumed that certain parameters as the spectral envelope evolves very little frame to frame. Thus, the quantized synthesis filter 1 / A ( z ) transmitted during the previous frame, representing the spectral envelope of the signal, can be reused in order to save bits for the MDCT coding. The last synthesis filter transmitted in the CELP mode (the closest to the signal to be coded) is used.

The information used to code the signal in the transition frame is: the pitch (associated with the long-term excitation), the excitation vector (or innovation) as well as the associated gain (s) to excitement.

In another embodiment of the invention, the decoded value of the pitch and / or its gain associated with the last sub-frame can also be reused because these parameters are also changing slowly in the stationary zones. This further reduces the amount of information to be transmitted during a transition from CELP to MDCT.

It is also possible, in an alternative embodiment, to quantify these differential parameters on a few bits with respect to the decoded parameters in the last subframe of the previous CELP frame. In this case, we only code the correction that represents the slow evolution of these parameters.

One of the desired properties of the transition from CELP to MDCT is that at asymptotically high rate, when the CELP and MDCT coders are almost perfect reconstruction, the coding performed in the transition frame (MDCT frame following a CELP frame) must be himself with almost perfect reconstruction. The variants illustrated on the Figures 4b and 4c ensures almost perfect reconstruction at very high speed.

For reasons of quality homogeneity, the number of bits allocated to these parameters of the restricted predictive coding may be variable and proportional to the total bit rate.

In order to limit the transition effects of one type of coding to another, a gradual transition between the part of the signal coded by the predictive coding and the remainder of the transformed coded frame (fade-in) the transform component, "fade-out" for the predictive component) is performed. To achieve the transparent quality, this crossfade must be performed on a decoded signal MDCT without folding.

In addition to variants of Figures 4b and 4c in a further variant, to ensure possible high-speed transparency, the MDCT encoding principle is modified so that no time-to-left backward folding is used in the MDCT window of the transition frame. This variant involves using a modified version of the DCT transformation at the heart of the MDCT transformation because the length of the folded signal is different, since the time folding (reducing the size of the block) is only performed on the right.

It should be noted that the invention is described in Figures 4a to 4d for the simplified case of identical MDCT analysis and synthesis windows in each frame (except the transition frame) coded by the MDCT mode. In variants of the invention, the MDCT window may be asymmetrical as illustrated in FIG. figure 4e . In addition, the MDCT coding may use a window switching between at least one "long" window of typically 20-40 ms and a series of short windows of typically 5-10 ms ("window switching" in English).

Moreover, other variants are also defined in the case where the selection of CELP / MDCT modes is not optimal and the assumption of stationarity of the signal in the transition frame is not verified and the reuse of the parameters of the last CELP (LPC) frame can cause audible impairments. For such cases, the invention provides for the transmission of at least one bit to indicate a transition mode different from the method described above, in order to keep more CELP parameters and / or CELP subframes to be coded in the frame of transition from CELP to MDCT. For example, a first bit may indicate whether in the remainder of the bit stream the LPC filter is coded or the last received version may be used at the decoder, and another bit may signal the same for the pitch value. In the case where the encoding of a parameter is deemed necessary this can be done in differential with respect to the value transmitted in the last frame.

Thus, in general, in accordance with the embodiments described above, the coding method according to the invention can be illustrated in the form of a flowchart as shown in FIG. figure 6a .

For the signal to be coded s (n), it is verified in step E601 that it is in the case where the current frame is coded according to a transform coding and the previous frame has been coded according to a coding of predictive type. Thus, the current frame is a transition frame between predictive coding and transform coding.

In step E602, a restricted predictive coding is applied to a first part of the current frame. This predictive coding is restricted compared to the predictive coding used for the previous frame.

At the end of this restricted predictive coding step, the signal ŝ _TR ( n ) is obtained.

The MDCT coding of the current frame is performed in step E603, in parallel for the entire current frame.

At the end of this transform coding step, the signal ŝ _MDCT (n) is obtained.

According to the embodiments described for the invention, the method comprises a step of cross-fading in step E604, after reconstruction of the signals, making it possible to perform a smooth transition between the predictive coding and the transform coding in the transition frame. At the end of this step, a reconstructed signal ŝ _MDCT (n) is obtained.

Similarly, in general, the decoding method according to the invention is illustrated with reference to the figure 6b .

When at the decoding, a previous frame has been decoded according to a predictive type decoding method and the current frame is to be decoded according to a transform type decoding method (verification in E605), the decoding method includes a decoding step by a restricted predictive decoding of a first part of the current frame, in E606. It also comprises a step of decoding by transforming the current frame into E607.

A step E608 is then performed, according to the embodiments described above, to effect a combination of the decoded signals obtained, respectively ŝ _TR ( n ) and ŝ _MDCT ( n ), by fade-out over all or part of the current frame and thus obtain the decoded signal ŝ _MDCT (n) of the current frame.

Finally, the invention has been presented in the specific case of a transition from CELP to MDCT. It is obvious that this invention also applies in the case where the CELP coding is replaced by another type of coding, such as ADPCM, TCX, and where a transition coding on a part of the transition frame is performed using the encoding information of the frame preceding the transition MDCT frame.

With reference to the figure 7 Describes a material suitable device for carrying out an encoder or a decoder according to an embodiment of the present invention.

This device DISP comprises an input for receiving a digital signal SIG which in the case of the encoder is an input signal x (n ') and in the case of the decoder, the bit stream bst.

The device also comprises a processor PROC of digital signals adapted to perform coding / decoding operations in particular on a signal from the input E.

This processor is connected to one or more memory units MEM adapted to store information necessary for controlling the device for the device. coding / decoding. For example, these memory units comprise instructions for implementing the coding method described above and in particular for implementing the steps of coding a previous frame of samples of the digital signal according to a predictive coding, coding of a current frame of samples of the digital signal according to a transform coding, such that a first part of the current frame is coded by a predictive coding restricted with respect to the predictive coding of the preceding frame, when the device is encoder type.

When the device is of decoder type, these memory units comprise instructions for implementing the decoding method described above and in particular for implementing the predictive decoding steps of a previous frame of samples of the digital signal. received and coded according to a predictive coding, inverse transform decoding of a current frame of samples of the received digital signal and encoded by transform coding, and further a decoding step by a predictive decoding restricted with respect to the predictive decoding of the previous frame of a first part of the current frame.

These memory units may also include calculation parameters or other information.

More generally, a storage means, readable by a processor, integrated or not integrated into the encoder or decoder, possibly removable, stores a computer program implementing an encoding method and / or a decoding method according to the invention. The Figures 6a and 6b can for example illustrate the algorithm of such a computer program.

The processor is also adapted to store results in these memory units. Finally, the device comprises an output S connected to the processor for providing an output signal SIG * which in the case of the encoder is a signal in the form of a bit stream bst and in the case of the decoder, an output signal x ( n ' ).

Claims (16)

1. Method for coding a digital sound signal, comprising the steps of:

   - coding (E601) of a preceding frame of samples of the digital signal according to predictive coding;

   - coding (E603) of a current frame of samples of the digital signal according to transform coding,

   the method being characterized in that a first part of the current frame is coded (E602) by predictive coding that is restricted relative to the predictive coding of the preceding frame by reusing at least one parameter of the predictive coding of the preceding frame and by coding only the unreused parameters of this first part of the current frame.
2. Method according to Claim 1, characterized in that the restricted predictive coding uses a prediction filter copied from the preceding frame of predictive coding.
3. Method according to Claim 2, characterized in that the restricted predictive coding also uses a decoded value of the pitch and/or of its associated gain of the preceding frame of predictive coding.
4. Method according to Claim 1, characterized in that certain parameters of predictive coding used for the restricted predictive coding are quantized in differential mode relative to decoded parameters of the preceding frame of predictive coding.
5. Method according to Claim 1, characterized in that it comprises a step of obtaining the reconstructed signals originating from the predictive and transform local codings and decodings of the first part of the current frame and of combining (E604) by a cross-fade of these reconstructed signals.
6. Method according to Claim 5, characterized in that said cross-fade of the reconstructed signals is carried out on a portion of the first part of the current frame as a function of the shape of the window of the transform coding.
7. Method according to Claim 5, characterized in that said cross-fade of the reconstructed signals is carried out on a portion of the first part of the current frame, said portion containing no time-domain aliasing.
8. Method according to Claim 1, characterized in that the transform coding uses a weighting window comprising a chosen number of successive weighting coefficients of zero value at the end and beginning of the window.
9. Method according to Claim 1, characterized in that the transform coding uses an asymmetric weighting window comprising a chosen number of successive weighting coefficients of zero value at at least one end of the window.
10. Method for decoding a digital sound signal, comprising the steps of:

    - predictive decoding (E605) of a preceding frame of samples of the digital signal received and coded according to predictive coding;

    - inverse transform decoding (E607) of a current frame of samples of the digital signal received and coded according to transform coding;

    the method being characterized in that it also comprises a step of decoding (E606) by restricted predictive decoding relative to the predictive decoding of the preceding frame of a first part of the current frame received and coded according to restricted predictive coding, by reusing at least one parameter of the predictive decoding of the preceding frame and by decoding only the parameters received for this first part of the current frame.
11. Method according to Claim 10, characterized in that it comprises a step of combining (E608) by a cross-fade of the signals decoded by inverse transform and by restricted predictive decoding for at least one portion of the first part of the current frame.
12. Method according to Claim 10, characterized in that the restricted predictive decoding uses a prediction filter decoded and used by the predictive decoding of the preceding frame.
13. Method according to Claim 12, characterized in that the restricted predictive decoding also uses a decoded value of the pitch and/or of its associated gain of the predictive decoding of the preceding frame.
14. Digital sound signal encoder, comprising:

    - a predictive coding module (211) for coding a preceding frame of samples of the digital signal;

    - a transform coding module (221) for coding a current frame of samples of the digital signal,

    characterized in that it also comprises a predictive coding module (231) that is restricted relative to the predictive coding of the preceding frame in order to code a first part of the current frame, by reusing at least one parameter of the predictive coding of the preceding frame and by coding only the unreused parameters of this first part of the current frame.
15. Digital sound signal decoder, comprising:

    - a predictive decoding module (501) for decoding a preceding frame of samples of the digital signal received and coded according to predictive coding;

    - an inverse transform decoding module (503) for decoding a current frame of samples of the digital signal received and coded according to transform coding;

    characterized in that it also comprises a predictive decoding module (505) that is restricted relative to the predictive decoding of the preceding frame in order to decode a first part of the current frame received and coded according to restricted predictive coding, by reusing at least one parameter of the predictive decoding of the preceding frame and by decoding only the parameters received for this first part of the current frame.
16. Computer program comprising code instructions for the implementation of the steps of the coding method according to one of Claims 1 to 9 and/or of the decoding method according to one of Claims 10 to 13, when these instructions are executed by a processor.

Images