EP3175443A1 - Bestimmung eines budgets für lpd-/fd-übergangsrahmencodierung - Google Patents
Bestimmung eines budgets für lpd-/fd-übergangsrahmencodierungInfo
- Publication number
- EP3175443A1 EP3175443A1 EP15745542.9A EP15745542A EP3175443A1 EP 3175443 A1 EP3175443 A1 EP 3175443A1 EP 15745542 A EP15745542 A EP 15745542A EP 3175443 A1 EP3175443 A1 EP 3175443A1
- Authority
- EP
- European Patent Office
- Prior art keywords
- frame
- coding
- transition
- bits
- predictive
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 230000007704 transition Effects 0.000 title claims abstract description 209
- 238000000034 method Methods 0.000 claims abstract description 57
- 238000009826 distribution Methods 0.000 claims abstract description 25
- 238000001914 filtration Methods 0.000 claims description 7
- 238000004590 computer program Methods 0.000 claims description 3
- 230000001131 transforming effect Effects 0.000 claims description 2
- 230000001419 dependent effect Effects 0.000 claims 1
- 238000012952 Resampling Methods 0.000 description 17
- 238000003786 synthesis reaction Methods 0.000 description 16
- 230000003044 adaptive effect Effects 0.000 description 15
- 230000015572 biosynthetic process Effects 0.000 description 15
- 230000015654 memory Effects 0.000 description 15
- 230000009466 transformation Effects 0.000 description 15
- 238000005070 sampling Methods 0.000 description 10
- 238000004458 analytical method Methods 0.000 description 7
- 230000002123 temporal effect Effects 0.000 description 7
- 238000010586 diagram Methods 0.000 description 6
- 238000011084 recovery Methods 0.000 description 6
- 230000004044 response Effects 0.000 description 4
- 230000005236 sound signal Effects 0.000 description 4
- 238000001228 spectrum Methods 0.000 description 4
- 230000000295 complement effect Effects 0.000 description 3
- 230000003111 delayed effect Effects 0.000 description 3
- 230000005284 excitation Effects 0.000 description 3
- 230000005540 biological transmission Effects 0.000 description 2
- 238000004422 calculation algorithm Methods 0.000 description 2
- 230000006835 compression Effects 0.000 description 2
- 238000007906 compression Methods 0.000 description 2
- 230000006837 decompression Effects 0.000 description 2
- 238000007781 pre-processing Methods 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 238000013139 quantization Methods 0.000 description 2
- 230000000630 rising effect Effects 0.000 description 2
- 230000001360 synchronised effect Effects 0.000 description 2
- 230000006978 adaptation Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000001427 coherent effect Effects 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000003116 impacting effect Effects 0.000 description 1
- 238000003780 insertion Methods 0.000 description 1
- 230000037431 insertion Effects 0.000 description 1
- 230000007774 longterm Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000012805 post-processing Methods 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 230000000717 retained effect Effects 0.000 description 1
- 238000007493 shaping process Methods 0.000 description 1
- 238000003860 storage Methods 0.000 description 1
- 210000001260 vocal cord Anatomy 0.000 description 1
- 230000001755 vocal effect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G10—MUSICAL INSTRUMENTS; ACOUSTICS
- G10L—SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING
- G10L19/00—Speech or audio signals analysis-synthesis techniques for redundancy reduction, e.g. in vocoders; Coding or decoding of speech or audio signals, using source filter models or psychoacoustic analysis
- G10L19/002—Dynamic bit allocation
-
- G—PHYSICS
- G10—MUSICAL INSTRUMENTS; ACOUSTICS
- G10L—SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING
- G10L19/00—Speech or audio signals analysis-synthesis techniques for redundancy reduction, e.g. in vocoders; Coding or decoding of speech or audio signals, using source filter models or psychoacoustic analysis
- G10L19/02—Speech or audio signals analysis-synthesis techniques for redundancy reduction, e.g. in vocoders; Coding or decoding of speech or audio signals, using source filter models or psychoacoustic analysis using spectral analysis, e.g. transform vocoders or subband vocoders
- G10L19/0212—Speech or audio signals analysis-synthesis techniques for redundancy reduction, e.g. in vocoders; Coding or decoding of speech or audio signals, using source filter models or psychoacoustic analysis using spectral analysis, e.g. transform vocoders or subband vocoders using orthogonal transformation
-
- G—PHYSICS
- G10—MUSICAL INSTRUMENTS; ACOUSTICS
- G10L—SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING
- G10L19/00—Speech or audio signals analysis-synthesis techniques for redundancy reduction, e.g. in vocoders; Coding or decoding of speech or audio signals, using source filter models or psychoacoustic analysis
- G10L19/04—Speech or audio signals analysis-synthesis techniques for redundancy reduction, e.g. in vocoders; Coding or decoding of speech or audio signals, using source filter models or psychoacoustic analysis using predictive techniques
- G10L19/08—Determination or coding of the excitation function; Determination or coding of the long-term prediction parameters
- G10L19/12—Determination or coding of the excitation function; Determination or coding of the long-term prediction parameters the excitation function being a code excitation, e.g. in code excited linear prediction [CELP] vocoders
-
- G—PHYSICS
- G10—MUSICAL INSTRUMENTS; ACOUSTICS
- G10L—SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING
- G10L19/00—Speech or audio signals analysis-synthesis techniques for redundancy reduction, e.g. in vocoders; Coding or decoding of speech or audio signals, using source filter models or psychoacoustic analysis
- G10L19/04—Speech or audio signals analysis-synthesis techniques for redundancy reduction, e.g. in vocoders; Coding or decoding of speech or audio signals, using source filter models or psychoacoustic analysis using predictive techniques
- G10L19/16—Vocoder architecture
- G10L19/18—Vocoders using multiple modes
- G10L19/24—Variable rate codecs, e.g. for generating different qualities using a scalable representation such as hierarchical encoding or layered encoding
Definitions
- the present invention relates to the field of coding / decoding of digital signals.
- the invention is advantageously applied to the coding / decoding of sounds that can contain speech and music mixed or alternately.
- CELP Code Excited Linear Prediction
- 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 ⁇ "innovation" which could not be modeled.
- Transform coders such as MPEG AAC, AAC-LD, AAC-ELD 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 in each frame analyzed.
- One solution for efficiently coding a mixed speech / music content signal consists in selecting, over time, the best technique between at least two coding modes, one of the CELP type, the other of the transformed type.
- RMO Model 0 Reference
- LPD Linear Predictive Domain
- FD mode for "Frequency Domain” in English
- MDCT for "Modified Discrete Cosine Transform” in English
- MPEG AAC type for "Advanced Audio Coding" out of 1024 samples.
- the MDCT transformation is typically divided into three steps, the signal being cut into frames of M samples before MDCT coding:
- the MDCT window is divided into 4 adjacent portions of equal lengths M / 2, here 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.
- the temporal 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 of 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.
- the folded two quarters are then coded together after DCT (Type IV) transformation.
- DCT Type IV transformation
- the third and fourth quarters of the previous frame then become the first and second quarter of the current frame.
- the decoded version of these folded signals is thus obtained.
- Two consecutive frames contain the result of 2 different folds of the same quarters, ie for each pair of samples we have the result of 2 linear combinations with different but known weights: an equation system can be solved for to obtain the decoded version of the input signal, the temporal folding can thus be suppressed by using two consecutive decoded frames.
- implementation variants of the MDCT transformation exist, in particular on the definition of the DCT transform, on how to fold the block to be transformed temporarily (for example, the signs applied to the folded quarters can be reversed). left and right, or fold the second and third quarter over the first and fourth quarters respectively), 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.
- a transition window for the FD mode is used with a left overlap of 128 samples.
- 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 serving at the transition has a size of 2304 samples and the DCT transformation operates on 1152 samples whereas normally FD mode frames are encoded with a window size of 2048 samples and a DCT transformation of 1024 samples.
- 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.
- This coding technique of the state of the art has an algorithmic delay of the order of 100 to 200 ms.
- This delay is incompatible with conversational applications for which coding delay is generally of the order of 20 to 25 ms for speech 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).
- the fact of punctually increasing the DCT transformation size (2304 against 2048) generates a peak of complexity at the time of the transition.
- the international patent application WO2012 / 085451 proposes a new method for encoding a transition frame.
- the transition frame is defined as the transform-encoded current frame that succeeds a previous frame encoded by predictive coding.
- a part of the transition frame for example a subframe of 5 ms, in the case of a CELP coding at 12.8 kHz, and two additional CELP frames of 4 ms each, in the case of a CELP coding at 16 kHz, are coded by a predictive coding restricted with respect to the predictive coding of the previous frame.
- Restricted predictive coding consists in using the stable parameters of the preceding frame coded by a predictive coding, such as the coefficients of the linear prediction filter and coding only a few minimum parameters for the additional subframe in the transition frame.
- the aforementioned patent application WO2012 / 085451 also proposes modifying the first half of the MDCT window so as not to have time folding in the first quarter normally folded. It is also proposed to integrate an addition-recovery part (also called “fade-in” or “overlap-add” in English) between the decoded CELP frame and the decoded MDCT frame by modifying the coefficients of the analysis window. /synthesis.
- the mixed lines lines alternating points and lines
- the bold lines separate the frames of new samples at the input of the encoder.
- the coding of a new MDCT frame can be started when a so-defined frame of new input samples is fully available. It is It is important to note that these lines in bold at the coder do not correspond to the current frame but to the successive blocks of new samples arriving for each frame: the current frame is in fact delayed by 8.75 ms which corresponds to an anticipation, called "lookahead". " in English.
- the bold lines separate the decoded frames at the output of the decoder.
- the transition window is zero to the point of folding.
- the portion between the folding point and the end of the CELP transition subframe (TR) corresponds to a sinusoidal half-window.
- the same window is applied to the signal.
- the coefficients of the window correspond to a window of form sin 2 .
- the application WO2012 / 085451 provides for the allocation of a bit budget for the coding of the CELP sub-frame which would correspond to the budget necessary for the CELP coding of a conventional frame, reduced to a single sub-frame. The remaining budget for the coding of the transform transition frame is then insufficient and can lead to a drop in quality at low bit rate.
- the present invention improves this situation.
- a first aspect of the invention relates to a method for determining a coding bit distribution of a transition frame.
- This method is implemented in an encoder / decoder for the coding / decoding of a digital signal.
- the transition frame is preceded by a preceding prediction coded frame and the coding of this transition frame comprises transform coding and predictive coding of a single subframe of the transition frame.
- the method comprises the following steps:
- bit rate for the predictive encoding of the transition subframe, the bit rate being at least the bit rate between the transform coding of the transition frame and a first predetermined bit rate
- the bit rate of the predictive coding is therefore limited by a maximum value.
- the number of bits allocated to the predictive coding depends on this bit rate. Since the lower the bit rate, the smaller the number of bits allocated to the coding, a minimum remaining budget is ensured for the coding of the transform transition frame.
- the number of bits allocated to the predictive coding of the subframe is optimized with respect to the bit rate of the transform coding. Indeed, if the bit rate of the transform coding of the transition frame is less than the first predetermined value, the bit rate for the predictive coding and the bit rate for the transform coding is identical. The coherence of the signals thus generated is thus improved, which simplifies the subsequent steps of coding (channel coding) and the processing of the frames received at the decoder.
- the encoder / decoder includes a first working heart, for predictive coding / decoding of a signal frame, at a first frequency, and a second working heart, for predictive coding / decoding of a signal frame, at a second frequency.
- the first predetermined bit rate value depends on the core selected from the first and second cores for encoding / decoding the prediction encoded previous frame.
- the operating frequency of the encoder / decoder core influences the number of bits required to correctly represent the input digital signal. For example, for certain operating frequencies, it is necessary to provide additional bits for encoding frequency bands not directly processed by the core.
- the assigned bit rate is furthermore equal to the maximum between the bit rate of the transform coded transition frame and the minus a second predetermined value of bit rate, the second value being less than the first value.
- a minimum bit rate is guaranteed in order to avoid excessively large bit rates between the different coded frames.
- the digital signal is decomposed into at least one low frequency band and one high frequency band.
- the first calculated bit count is assigned to the predictive encoding of the transition subframe for the low frequency band.
- a third predetermined number of bits is then allocated to an encoding of the transition subframe for the high frequency band.
- the second number of bits allocated for the transform coding of the transition frame is then further determined from the third predetermined number of bits.
- the number of bits available for encoding the transition frame is fixed. This reduces the complexity of the coding steps.
- the second number of bits is equal to the fixed number of coding bits of the transition frame minus the first number of bits minus the third number of bits.
- the final determination of the distribution of the bits in the transition frame is thus limited to a subtraction of integer values which simplifies the coding.
- the second number of bits is equal to the fixed number of coding bits of the transition frame minus the first number of bits minus the third number of bits minus a first bit minus a second bit.
- the first bit indicates whether low-pass filtering is performed when determining the parameters of the predictive coding of the transition subframe, the parameters being related to the pitch delay.
- the second bit indicates the frequency used by the encoder / decoder heart for the predictive coding / decoding of the transition subframe. Such an indication allows a more flexible coding.
- a second aspect of the invention relates to a method of coding a digital signal in an encoder able to code signal frames according to a predictive coding or according to a transform coding, comprising the following steps:
- the coding of the transition frame comprising a transform coding and a predictive coding of a single subframe of the transition frame, the coding the current frame including the following substeps:
- this coding ensures a balanced distribution between the predictive coding and the transform coding within the transition frame.
- the predictive coding comprises generating predictive coding parameters determined for the assigned bit rate when distributing the bits in the transition frame.
- the use of such predictive parameters optimizes the ratio between the bit rate assigned to the predictive coding and the remaining bit rate assigned to the transform coding, and thus optimizes the quality of the reconstructed signal. Indeed, at constant quality, the number of bits allocated to one or another predictive parameter can vary in non-linear proportions with respect to the bit rate assigned to the predictive coding.
- the predictive coding comprises generating predictive coding parameters 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. So, at decoding, additional information is extracted from the previous frame to complete the decoding of the transition subframe to be decoded. This reduces the number of bits that must be reserved for the predictive encoding of the transition subframe.
- a third aspect of the invention relates to a method for decoding a coded digital signal by predictive coding and by transform coding, comprising the steps of:
- decoding of a transition frame coding a current frame of samples of the digital signal, the coding of the transition frame comprising a transform coding and a predictive coding of a single subframe of the transition frame, comprising the sub-steps of:
- the method for determining the distribution of bits in the transition frame is directly reproducible at the decoder. Indeed, the bit distribution is determined solely from the bit rate of the portion of the transform coded transition frame. No additional bit is therefore necessary to implement this step of determining the distribution of the bits and a saving of bandwidth is therefore achieved.
- a fourth aspect of the invention further provides a computer program comprising instructions for implementing the method according to the aspects of the invention described above, when these instructions are executed by a processor.
- a fifth aspect of the invention relates to a device for determining a coding bit distribution of a transition frame, this device being implemented in an encoder / decoder for the coding / decoding of a digital signal, the transition frame being preceded by a preceding prediction coded frame, the coding of the transition frame comprising a transform coding and a predictive coding of a single subframe of the transition frame, the number of coding bits of the transition frame being fixed, the device comprising a processor arranged to perform the following operations: assigning a bit rate for the predictive coding of the transition subframe, said bit rate being at least equal between the bit rate of the transform coding of the transition frame and a first predetermined bit rate value, at;
- a sixth aspect of the invention is further directed to an encoder capable of coding frames of a digital signal according to predictive coding or according to transform coding, comprising:
- a predictive encoder comprising a processor arranged to perform the following operations:
- the processor being arranged to perform the predictive encoding operation of the transition subframe on the first number of allocated bits;
- a transform coder comprising a processor arranged to perform transform coding of the transition frame on the second number of allocated bits.
- a seventh aspect of the invention is further directed to a decoder of a digital signal encoded by predictive coding and transform coding, comprising:
- a predictive decoder comprising a processor arranged to perform the following operations:
- the processor being arranged to perform the predictive decoding operation of the transition subframe on the first number of allocated bits;
- a transform decoder comprising a processor arranged to carry out a decoding by transforming the transition frame on the second number of allocated bits.
- FIG. 1 illustrates an audio coder according to an embodiment of the invention
- FIG. 2 is a diagram illustrating the steps of an encoding method, implemented by the audio coder of FIG. 1, according to one embodiment of the invention
- FIG. 3 shows a transition between CELP and MDCT frames according to one embodiment of the invention
- FIG. 4 is a diagram illustrating the steps of a method for determining a coding bit distribution of a transition frame, according to an embodiment of the invention
- FIG. 5 illustrates an audio decoder according to an embodiment of the invention
- FIG. 6 is a diagram illustrating the steps of a decoding method, implemented by the audio decoder of FIG. 5, according to one embodiment of the invention
- FIG. 7 illustrates a device for determining the distribution of bits in a transition frame according to one embodiment of the invention.
- Figure 1 illustrates an audio encoder 100 according to one embodiment of the invention.
- FIG. 2 is a diagram illustrating the steps of an encoding method, implemented by the audio coder 100 of FIG. 1, according to one embodiment of the invention.
- the encoder 100 comprises a reception unit 101 for receiving, at a step 201, an input signal sampled at a given frequency fs (for example 8, 16, 32 or 48 kHz) and decomposed into subframes, for example 20 ms.
- fs for example 8, 16, 32 or 48 kHz
- a preprocessing unit 102 On receipt of a current frame, a preprocessing unit 102 is able to select, in a step 202, the coding mode which is the most suitable for the coding of the current frame, among at least one LPD mode and one FD mode.
- the coding mode which is the most suitable for the coding of the current frame, among at least one LPD mode and one FD mode.
- an MDCT encoding is used for the FD mode
- a CELP encoding is used for the LPD mode.
- the CELP coding may be replaced by another type of predictive coding
- the MDCT transform may be replaced by another type of transform.
- the frame type is transmitted explicitly via block 206, with for example a fixed length coding indicating the mode selected from a predefined list. In variants of the invention, this coding of the mode chosen in each frame may be of variable length. It is also expected that the CELP coding type (12.8 or 16 kHz) can be transmitted explicitly via a bit to facilitate the decoding of the transition frame.
- a step 203 verifies that the CELP encoding has been selected in step 202.
- the signal frame is transmitted to a CELP encoder 103 for encoding a CELP frame at a step 204
- the CELP coder may use two "cores" operating at two respective internal sampling frequencies, for example set at 12.8 kHz and 16 kHz, which require the use of a sampling of the input signal (at the frequency fs). at the internal frequency of 12.8 or 16 kHz.
- Such a resampling can be implemented in a resampling unit in the preprocessing block 102 or in the CELP coder 103.
- the frame is then coded by prediction by the CELP coder 103 by deducing parameters CELP which generally depend on a classification of the signal.
- CELP parameters typically include LPC coefficients, an adaptive and fixed gain vector, an adaptive dictionary vector, a fixed dictionary vector. This list can also be modified according to a signal class in the frame, as in ITU-T G.718 coding. The parameters thus calculated can then be quantized, multiplexed and transmitted at a step 206 to the decoder by a transmission unit 108.
- CELP coding parameters such as the LPC coefficients, the adaptive and fixed gain vector, the adaptive dictionary vector , the fixed dictionary vector as well as states of the CELP decoder may also be stored, in a step 205, in a memory 107 in the case where the frame following the current frame would be a transition frame MDCT.
- a band extension may also be performed with associated coding of the high band when the current frame is of CELP type.
- the MDCT encoder 105 can encode a frame covering 28.75 ms of un-resampled signal, including 20 ms of frame and 8.75 ms of lookahead for example. No restrictions are attached to the size of the MDCT window.
- a delay corresponding to the delay of the CELP coder due to the re-sampling of the input signal is applied to the frame coded by the MDCT coder, so that the MDCT and CELP frames are synchronized.
- Such an encoder delay may be 0.9375 ms depending on the type of resampling before CELP coding.
- the transform coded frame MDCT is transmitted to the decoder at step 206.
- the current frame is a transition frame and is transmitted to a transition unit 104.
- the MDCT transition frame comprises an additional CELP subframe.
- the transition unit 104 is able to implement the following steps: to anticipate, in a step 209, the budget of bits necessary for the coding of the CELP subframe to define the available budget for the MDCT encoding of the current frame.
- the budget may depend on the bit rate of the current frame.
- the budget can be evaluated according to the CELP core used.
- the invention can provide for limiting the coding rate of the CELP subframe. It comprises for this purpose a device for determining the distribution of bits in a transition frame, such as the device 700 of Figure 7;
- At least one of these steps is performed by the transition frame coding unit 106 described hereinafter.
- the transition MDCT frame is encoded by the MDCT encoder 105, at a step 212, as described in the following, and based on the bit budget allocated in step 209.
- the additional CELP subframe is also encoded by the CELP encoder 103, in a step 213, as described in the following with reference to Figure 3, and according to the bit budget allocated in step 209.
- the CELP coding can be performed before or after MDCT coding.
- Figure 3 shows the transition between CELP and MDCT frames to the encoder, before coding, and to the decoder, before decoding.
- a frame to be coded 301 is received at the encoder 100 and is encoded by the CELP encoder 103.
- a current frame 302 is then received at the input of the encoder 100 to be encoded by the MDCT transform. It is therefore a transition frame.
- the next frame 303 received at the input of the coder is also coded by MDCT transform. According to the invention, the next frame 303 could be coded by CELP coding and no restriction is attached to the coding used for the next frame 303.
- An asymmetric MDCT window 304 may be used for encoding the current frame.
- This window 304 has a rising edge 307 of 14.375 ms, a bearing with a gain of 1 at 11.25 ms, a falling edge 309 of 8.75 ms corresponding to the lookahead, and a zero portion 310 of 5.265 ms.
- the addition of the zero part 310 reduces the lookahead and thus the corresponding delay.
- the shape of this MDCT analysis window for the MDCT encoding is modified, for example, to further reduce the lookahead or to use a symmetrical window whose examples are given in the patent application WO2012 / 085451.
- the dashed line 312 represents the middle of the MDCT window 304. On either side of the line 312, the 10 ms quarters of the MDCT window 212 are folded as described in FIG. introductory part. Continuous line 311 indicates the folding area between the first and second quarters of the MDCT window 304.
- the MDCT window of the next frame 303 is referenced 306 and has a covering addition area with the MDCT window 304 corresponding to the falling edge 309 of the MDCT window 304.
- An MDCT window 305 theoretically represents the window that would be applied to the previous frame if it had been coded by MDCT transform. However, since the preceding frame 301 is coded by the CELP coder 103, it is necessary, in order to allow the decoder to unfold the first part of the MDCT transformed coded frame, that the window be zero in the first quarter (since the second part of the previous MDCT frame is not available).
- the MDCT window 304 is modified into an MDCT window 313 whose first quarter is zero, thus allowing time folding in the first part of the MDCT frame to the decoder.
- the analysis windows 304, 305, 306 and 313 respectively correspond to synthesis windows 324, 325, 326 and 327.
- This synthesis window is therefore inverted temporally with respect to the corresponding analysis window.
- the windows of analysis and synthesis may be identical, sinusoidal type or otherwise.
- a first frame 320 of new samples encoded by CELP coding is received at the decoder. It corresponds to the coded version of the CELP frame 301. It is recalled here that the decoded frame is shifted by 8.75 ms with respect to the frame 320.
- the coded version of the transition frame 302 is then received (references 321 and 322 forming a complete frame).
- a hole or GAP is created.
- a quarter window MDCT being 10 ms
- the zero part of the synthesis window MDCT 324 which covers the CELP frame 320 being 5.625 ms (corresponding to the part 310 of the analysis window MDCT 204)
- the hole is 4.375 ms.
- the delay between the CELP frame 320 and the start of the MDCT window 327 is extended by the required length.
- a satisfactory recovery addition length of 1.875 ms the aforementioned delay (corresponding to a missing signal length) thus being increased to 6.25 ms, as represented by FIG. reference 321 in FIG.
- the signal frames shown in Figure 3 may contain signals at different sampling rates which are 12.8 or 16 kHz for CELP coding / decoding and fs for MDCT coding / decoding; however at the decoder, after resampling of the CELP synthesis and time shift of the MDCT synthesis the frames remain synchronized and the representation of Figure 3 remains accurate.
- the application WO2012 / 085451 proposes to code an additional CELP subframe of 5 ms at the beginning of the transition frame MDCT, in the case of a CELP coding at 12.8 kHz, and two additional CELP frames of 4 ms each at the beginning. of the MDCT transition frame, in the case of 16 kHz CELP coding.
- the decoder is only 0.625 ms of overlap, which is insufficient.
- the present invention can provide for encoding a single additional CELP subframe at 12.8 or 16 kHz by the CELP encoder 103. Additional samples are generated at the decoder, as detailed below, in order to generate the missing signal over the length of 6.25 ms above.
- the unit 106 may reuse at least one CELP parameter from the previous CELP frame.
- the unit 106 can reuse the linear prediction coefficients A (z) of the preceding CELP sub-frame as well as the innovation energy of the previous frame (stored in the memory 107 as previously described) in order to to encode only the adaptive dictionary vector, the adaptive gain, the fixed gain and the fixed dictionary vector of the transition CELP subframe.
- the additional CELP subframe can be encoded with the same core (12.8 kHz or 16 kHz) as the previous CELP frame.
- a transition frame coding unit 106 provides the coding of a transition frame according to the invention.
- the invention may further provide for the insertion by the unit 106 into the bit stream of an additional bit indicating that the coded frame 322 is a transition frame, however in the general case this transition frame indication may also be transmitted in the global coding mode indication of the current frame, without taking any additional bits.
- the invention may further provide that this unit 106 encodes the high band of the signal at steps 204 and 214 (so-called "band extension" method), when this is required, with a fixed budget since the frequency of sampling of the synthesis signal at the decoder is not necessarily identical to the frequency of the CELP core.
- transition frame coding unit 106 can implement the following steps:
- Such filtering can be implemented by a finite impulse response filter, FIR, of the CELP encoder 103;
- the delay may be coded on 6 bits and the gain on 6 bits).
- FIG. 4 is a diagram illustrating the steps of a method for determining a transition coding bit distribution according to one embodiment of the invention.
- the aforementioned method is implemented in the same manner to the encoder and the decoder, but is presented, for illustrative purposes only, on the coder side.
- the total bit rate (in bits / s), denoted core_brate, which can be allocated to the coding of the current frame is set equal to the output rate of the MDCT encoder.
- the duration of the frame being considered in this example as being 20 ms, the number of frames per second is 50 and the total budget in bits is equal to core_brate / 50.
- the total budget can be fixed, in the case of a fixed rate encoder, or variable, in the case of a variable rate encoder when an adaptation of the coding rate is implemented. In the following, we use a variable num_bits, initialized to the value core_brate / 50.
- the transition unit 104 determines the CELP core, from at least two CELP cores, which was used for encoding the previous CELP frame.
- the transition unit 104 determines the CELP core, from at least two CELP cores, which was used for encoding the previous CELP frame.
- two CELP cores operating at frequencies of 12.8 kHz and 16 kHz respectively.
- a single CELP core is implemented at the coding and / or decoding.
- the method comprises a step 402 for assigning a bit rate, noted cbrate, for the CELP coding of the subframe transition, the bit rate being equal to the minimum between the bit rate of the MDCT coding of the transition frame and a first predetermined bit rate value.
- the first predetermined value can be set at 24.4 kbit / s, for example, which makes it possible to ensure a satisfactory bit budget for the transform coding.
- cbrate min (core_bitrate, 24400). This limitation amounts to restricting the operation of the restricted CELP coding limited to the supplementary subframe with CELP parameters coded as if they were encoded by a CELP coding of not more than 24.40 kbit / s.
- the affected bit rate is compared to a CID rate of 11.60 kbit / s. If the assigned bit rate is higher, a bit may be reserved to encode an adaptive dictionary low pass filtering binary indication (as for example in the AMR-WB coding at rates greater than or equal to 12.65 kbit / s).
- the num_bits variable is updated:
- num_bits: num_bits - 1
- a first number of bits, denoted budgl is allocated for the predictive coding of the additional CELP subframe.
- the first number of bits budgl represents the number of bits representing the CELP parameters used for the coding of the CELP subframe.
- the coding of the CELP subframe can be restricted in that a small number of CELP parameters are used, some parameters used for the coding of the preceding CELP frame being reused advantageously.
- the excitation can be modeled for the coding of the additional CELP subframe, and bits are thus reserved only for the fixed dictionary vector, for the adaptive dictionary vector and for the gain vector.
- the number of bits allocated to each of these parameters is deduced from the bit rate assigned to the coding of the additional CELP sub-frame in step 402.
- Table 1 / G722.2 - Bit allocation of the algorithm of AMR-WB coding for 20ms frame, from the July 2003 release of the ITU-T G.722.2 standard gives examples of bit allocations per CELP parameter as a function of the affected bit rate.
- budgl is the sum of the bits allocated respectively to the adaptive dictionary, the fixed dictionary and the gain vector. For example, for an assigned bit rate of 19.85 kbit / s, referring to the aforementioned Table / G722, 9 bits are allocated to the adaptive dictionary (tonal delay), 72 bits are allocated to the fixed dictionary (algebraic code), and 7 bits are allocated to the gain vector (directory gain). In this case, budgl is equal to 88 bits.
- the num_bits variable can thus be updated:
- num_bits: num_bits - budgl
- the invention can also provide for taking into account frame classes in the bit allocation to the CELP parameters.
- the ITU-T G.718 standard in its June 2008 version, sections 6.8 and 8.1, gives the budgets to allocate to each CELP parameter according to classes, or modes such as unvoiced mode. (UC), the voiced mode (VC), the transition mode (TC) and the generic mode (GC), and according to the allocated bit rate (layerl or layer2, corresponding to rates of 8kbit / s and 8 respectively). +4 kbit / s).
- the G.718 encoder is a hierarchical coder, but it is possible to combine the CELP coding principles using a G.718 classification with the AMR-WB multi-bit allocation.
- the method comprises a step 405 of assigning a bit rate, noted cbrate, for coding CELP of the transition subframe, the bit rate being equal to the minimum between the bit rate of the MDCT coding of the transition frame and a first predetermined value of bit rate.
- the first predetermined value can be set at 22.6 kbit / s, for example, which ensures a satisfactory bit budget for the transform coding.
- the first predetermined value depends on the CELP core used for encoding the previous CELP frame.
- threshold values may be applied when assigning a bit rate to the CELP encoding.
- the assigned bit rate is furthermore equal to the maximum between the bit rate of the transform coded transition frame and at least a second predetermined bit rate value, the second value being less than the first value.
- the second predetermined value of bit rate may for example be equal to 14.8 kbit / s.
- the bit rate assigned to the CELP encoding of the transition subframe may be 14.8 kbit / s.
- bit rate of the transform coded transition frame is less than 8 kbit / s
- bit rate assigned may be 8 kbit / s.
- the affected bit rate is compared to a CID rate of 11.60 kbit / s. If the assigned bit rate is higher, a bit may be reserved to encode an adaptive dictionary low pass filter bit indication.
- the num_bits variable is updated:
- num_bits: num_bits - 1
- a first number of budgl bits is allocated for the predictive coding of the additional CELP subframe, and budgl depends on the bit rate assigned to the CELP coding of the sub-frame. -Transition frame.
- a second number of bits allocated for the transform coding of the transition frame is calculated from the first number of bits budgl and the total number of bits of the transition frame.
- budget2 is equal to the num_bits variable.
- the mode of the current transition frame is assumed here imputed to the MDCT coding budget, so this information is not explicitly taken into account here.
- the preceding steps may have been implemented for the coding of a low frequency band of the transition subframe, in the case where the audio signal is decomposed into at least one low band of frequencies and one high band of frequencies. .
- the method may include, prior to step 410, also common to encodings at different core frequencies, the allocation of a third predetermined number of bits, denoted budg3, to the coding of the high frequency band of the transition subframe. .
- the second number of bits budg2 is calculated from both the first number of budgl bits and the third number of bits budget3.
- the coding of the high frequency band (or band extension) of the transition subframe may be based on a correlation between the previous frame of the audio signal and the transition subframe.
- the coding of the high frequency band can be broken down into two stages.
- the previous frame and the current frame of the audio signal are filtered by a high-pass filter to keep only the upper part of the spectrum.
- the upper part of the spectrum may correspond to frequencies higher than that of the CELP core used. For example, if the CELP core used is the 12.8 kHz CELP core, the high band is the audio signal for which frequencies below 12.8 kHz have been filtered.
- Such filtering can be implemented by means of an FIR filter.
- a correlation search between the filtered parts of the previous frame and the current frame is performed.
- Such a correlation search makes it possible to estimate a delay parameter and then a gain.
- the gain corresponds to the amplitude ratio between the filtered part of the current frame and the predicted signal by applying the delay.
- 6 bits can be allocated for gain and 6 bits for delay.
- the third number of bits budget3 is then equal to 12.
- the num_bits variable can then be updated:
- num_bits: num_bits - budget3.
- the second number of bits budg2 is then equal to the variable num_bits update.
- FIG. 5 illustrates an audio decoder 500 according to one embodiment of the invention
- FIG. 6 is a diagram illustrating the steps of a decoding method according to an embodiment of the invention, implemented in the audio decoder. 500 of Figure 5.
- the decoder 500 comprises a reception unit 501 for receiving, in a step 601, the coded digital signal (or bit stream) coming from the encoder 100 of FIG. 1.
- the bit stream is subjected to a classification unit 502 able to determine, in a step 602 if the current frame is a CELP frame, an MDCT frame or a transition frame.
- the classification unit 502 is able to deduce from the bit stream information indicating whether the current frame is a transition frame or not, and information indicating the CELP core to be used for decoding a CELP frame or a CELP transition subframe.
- the current frame is a transition frame. If the current frame is not a transition frame, it is verified at a step 604 that the current frame is a CELP frame. If this is the case, the frame is transmitted to a decoder CELP 504 capable of decoding a CELP frame at a step 605, at the core frequency indicated by the classification unit 502. Following the decoding of a CELP frame, the The decoder CELP 504 can store, in a step 606, in a memory 506 parameters such as the coefficients of the linear prediction filter A (z) and internal states such as the predictive energy in the case where the following frame would be a frame of transition.
- parameters such as the coefficients of the linear prediction filter A (z) and internal states such as the predictive energy in the case where the following frame would be a frame of transition.
- the signal can be resampled, at a step 607, at the output frequency of the decoder 500 by a resampling unit 505.
- the unit resampling includes an FIR filter and resampling introduces a delay of (for example) 1.25 ms.
- postprocessing may be applied to the CELP decoding before or after resampling.
- a band extension can also be performed by a band extension management unit 5051 at steps 6071 and 6151, with associated decoding of the high band when the current frame is of type CELP.
- the high band is then combined with the CELP coding with possibly additional delay applied to the low band CELP synthesis.
- the decoder 500 further comprises an MDCT decoder 507.
- the decoder MDCT 507 is able to decode the frame MDCT in a conventional way at one stage. 609.
- a delay corresponding to the delay required for applying the resampling of the signal from the CELP decoder 504 is applied to the decoder output by a delay unit 508, so as to synchronize the MDCT synthesis with the synthesis.
- CELP at step 610.
- the MDCT decoded and delayed signal is transmitted to the output interface 510 of the decoder at step 608.
- a device for determining the bit distribution 503 is able to determine, in a step 611, the first number of bits. budgl allocated to the CELP encoding of the transition subframe and the second number of budget bits3 allocated to transform coding of the transition frame.
- the device 503 may correspond to the device 700 described in detail with reference to FIG. 7.
- the MDCT decoder 507 uses the third number of bits budget3 calculated by the determination unit 503 to adjust the rate necessary to decode the transition frame.
- the MDCT decoder 507 also sets the memory of the MDCT transformation to zero and decodes the transition frame at a step 612.
- the signal from the MDCT decoder is then delayed by the delay unit 508 at a step 613.
- the CELP decoder 504 decodes the transition CELP subframe according to the first number of budgl bits, at a step 614.
- the CELP decoder 504 decodes for this purpose the CELP parameters which may depend on the class of the current frame , and which include for example the pitch values of the adaptive dictionary, fixed dictionary and gains of the CELP subframe and uses the coefficients of the linear prediction filter.
- the CELP decoder 504 updates the CELP decoding states. These states can typically include the predictive energy of the innovation from the previous CELP frame to generate the 4ms or 5ms signal subframe depending on whether the CELP core at 12.8 kHz or 16 kHz is used (in the case of a restricted coding of the transition CELP subframe).
- the application WO2012 / 085451 provides the additional coding of a 5ms subframe for the 12.8 kHz CELP core and of two additional 4ms subframes for the 16 kHz CELP core.
- the decoder only has 0.625 ms of overlap addition. , which is insufficient.
- An independent aspect of the invention provides, from a single additional CELP transition sub-frame, the partial generation of a second sub-frame by reusing coding parameters used for the coding of the CELP sub-frame of transition.
- the delay is thus bridged, ensuring a sufficient addition-recovery, and without impacting the rate of the MDCT coding of the transition frame.
- the invention also provides a method for decoding P of a coded digital signal, in a decoder 500 capable of decoding signal frames according to a predictive decoding or according to a transform decoding, comprising the following steps:
- step 501 receiving, in step 501, a first set of predictive coding parameters coding a first frame of the digital signal
- step 605 of the first frame based on the first set of predictive coding parameters
- step 614 samples of a second transition subframe, based on at least one predictive coding parameter of the second set.
- the invention furthermore aims at the decoder 500 for implementing the decoding method P, as well as a computer program comprising instructions for implementing the decoding method P, when these instructions are executed by a processor.
- the CELP parameters reused for the generation of the second sub-frame can be the vector of gains, the vector of the adaptive dictionary and the vector of the fixed dictionary.
- a minimum overlap value can be predefined for the transform decoding and the number of generated samples of the second subframe is determined according to the minimum overlap value.
- This latter sub-frame can be generated without additional information by extending the CELP synthesis by repeating the pitch prediction with the same pitch delay and the same adaptive dictionary gain as in the first subframe, and performing a LPC filtering of synthesis with the same LPC coefficients and a deemphasis or deemphasis.
- the second CELP sub-frame can then be truncated to retain only 1.25 ms of signal in the case of the CELP core at 12.8 kHz, and 2.25 ms of signal in the case of the 16 kHz CELP core. .
- the first sub-frame CELP is thus completed so as to have 6.25 ms of additional signal making it possible to fill the hole and to ensure a satisfactory addition-recovery (minimum value of overlap, for example of 1.875 ms) with the frame of MDCT transition.
- the additional CELP subframe has an extended length of 6.25 ms for CELP cores at 12.8 and 16 kHz, which implies changing the "normal" CELP coding to have such a extended subframe length, especially for the fixed dictionary.
- the method P may further comprise a re-sampling step 615 implemented by a finite impulse response filter.
- the FIR filter can be integrated in the resampling unit 505.
- the resampling uses the memory of the FIR filter of the previous CELP frame and the processing induces an additional delay of 1.25 ms in this example. .
- the method P may further comprise a step of adding an additional signal obtained from samples stored in the memory of the finite impulse response filter, to fill the delay introduced by the resampling step.
- 1.25 ms of signal in addition to the 6.25 ms of additional signal previously generated, are generated by the decoder 500, these samples advantageously making it possible to bridge the delay introduced by the resampling of the 6.25 ms of signal. additional.
- the memory of the FIR filter of the resampling unit 505 can be saved at each frame after CELP decoding. The number of samples in this memory corresponds to 1.25 ms at the frequency of the CELP core considered (12.8 or 16 kHz).
- the resampling of the stored samples is performed by an interpolation method introducing a second delay less than the first delay of the finite impulse response filter, which can be considered as zero.
- the 1.25 ms of signal generated from the memory of the FIR filter are resampled according to a method involving a lesser delay.
- a re-sampling of the 1.25 ms of signal generated by the memory of the FIR filter can be implemented by cubic interpolation, which implies a delay of only two samples, less delay compared to the delay of the FIR filter.
- two additional signal samples are required to re-sample the aforementioned 1, 25 ms of signal: these two additional samples can be obtained by repeating the last value of the re-sampling memory of the FIR filter.
- the decoder may further decode the high frequency part of the 6.25 msec CELP signal obtained from the first and second transition subframes.
- the decoder CELP 504 can use the adaptive gain and the vector of the fixed dictionary of the last subframe of the previous CELP frame.
- the decoder 500 further comprises a recovery-addition unit 509 capable of providing overlap-addition, in a step 616, between the decoded and resampled CELP transition subframes, the samples resampled by the cubic interpolation, and the decoded signal of the transition frame from the MDCT decoder 507.
- a recovery-addition unit 509 capable of providing overlap-addition, in a step 616, between the decoded and resampled CELP transition subframes, the samples resampled by the cubic interpolation, and the decoded signal of the transition frame from the MDCT decoder 507.
- the unit 509 applies the modified synthetic window 327 of FIG. 3.
- the windowed samples are set to zero.
- the windowed samples are divided by the unmodified window 324 of FIG. 3, and multiplied by a sine-type window so that, combined with the window applied to the encoder, the total window either in sin 2 .
- samples from the CELP and 0-delay resampling are weighted by a window in cos 2
- the transition frame thus obtained is transmitted to the output interface 510 of the decoder at step 608.
- FIG. 7 represents an exemplary device 700 for determining the distribution of the bits of a transition frame.
- the device comprises a random access memory 704 and a processor 703 for storing instructions for implementing the method for determining the distribution of the bits of a transition frame described above.
- the device also has a mass memory 705 for storing data to be retained after the application of the method.
- the device 700 further comprises an input interface 701 and an output interface 706 respectively intended to receive the frames of the digital signal and to issue the detail of the budget allocated to these different frames.
- the device 700 may further comprise a digital signal processor (DSP) 702.
- DSP 702 receives the digital signal frames for shaping, demodulating and amplifying, in a manner known per se, these frames.
- the compression or decompression devices are entities in their own right.
- these devices can be embedded in any type of larger device such as a digital camera, a camera, a mobile phone, a computer, a movie projector, etc.
- DSP digital signal processor
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Computational Linguistics (AREA)
- Signal Processing (AREA)
- Health & Medical Sciences (AREA)
- Audiology, Speech & Language Pathology (AREA)
- Human Computer Interaction (AREA)
- Acoustics & Sound (AREA)
- Multimedia (AREA)
- Quality & Reliability (AREA)
- Spectroscopy & Molecular Physics (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
FR1457353A FR3024581A1 (fr) | 2014-07-29 | 2014-07-29 | Determination d'un budget de codage d'une trame de transition lpd/fd |
PCT/FR2015/052073 WO2016016566A1 (fr) | 2014-07-29 | 2015-07-27 | Détermination d'un budget de codage d'une trame de transition lpd/fd |
Publications (2)
Publication Number | Publication Date |
---|---|
EP3175443A1 true EP3175443A1 (de) | 2017-06-07 |
EP3175443B1 EP3175443B1 (de) | 2018-04-11 |
Family
ID=51894138
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP15745542.9A Active EP3175443B1 (de) | 2014-07-29 | 2015-07-27 | Bestimmung eines budgets für lpd-/fd-übergangsrahmenkodierung |
Country Status (8)
Country | Link |
---|---|
US (2) | US10586549B2 (de) |
EP (1) | EP3175443B1 (de) |
JP (1) | JP6607921B2 (de) |
KR (2) | KR102485835B1 (de) |
CN (2) | CN112133315B (de) |
ES (1) | ES2676832T3 (de) |
FR (1) | FR3024581A1 (de) |
WO (1) | WO2016016566A1 (de) |
Families Citing this family (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
FR3024581A1 (fr) * | 2014-07-29 | 2016-02-05 | Orange | Determination d'un budget de codage d'une trame de transition lpd/fd |
CN107004417B (zh) * | 2014-12-09 | 2021-05-07 | 杜比国际公司 | Mdct域错误掩盖 |
CN111133510B (zh) * | 2017-09-20 | 2023-08-22 | 沃伊斯亚吉公司 | 用于在celp编解码器中高效地分配比特预算的方法和设备 |
CN111402908A (zh) * | 2020-03-30 | 2020-07-10 | Oppo广东移动通信有限公司 | 语音处理方法、装置、电子设备和存储介质 |
CN111431947A (zh) * | 2020-06-15 | 2020-07-17 | 广东睿江云计算股份有限公司 | 一种云桌面客户端优化显示的方法及*** |
Family Cites Families (43)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
ATE302991T1 (de) * | 1998-01-22 | 2005-09-15 | Deutsche Telekom Ag | Verfahren zur signalgesteuerten schaltung zwischen verschiedenen audiokodierungssystemen |
US6782360B1 (en) * | 1999-09-22 | 2004-08-24 | Mindspeed Technologies, Inc. | Gain quantization for a CELP speech coder |
US6604070B1 (en) * | 1999-09-22 | 2003-08-05 | Conexant Systems, Inc. | System of encoding and decoding speech signals |
US6804218B2 (en) * | 2000-12-04 | 2004-10-12 | Qualcomm Incorporated | Method and apparatus for improved detection of rate errors in variable rate receivers |
US6885988B2 (en) * | 2001-08-17 | 2005-04-26 | Broadcom Corporation | Bit error concealment methods for speech coding |
CA2365203A1 (en) * | 2001-12-14 | 2003-06-14 | Voiceage Corporation | A signal modification method for efficient coding of speech signals |
US6647366B2 (en) * | 2001-12-28 | 2003-11-11 | Microsoft Corporation | Rate control strategies for speech and music coding |
US7937271B2 (en) * | 2004-09-17 | 2011-05-03 | Digital Rise Technology Co., Ltd. | Audio decoding using variable-length codebook application ranges |
US7630902B2 (en) * | 2004-09-17 | 2009-12-08 | Digital Rise Technology Co., Ltd. | Apparatus and methods for digital audio coding using codebook application ranges |
US8090573B2 (en) * | 2006-01-20 | 2012-01-03 | Qualcomm Incorporated | Selection of encoding modes and/or encoding rates for speech compression with open loop re-decision |
FR2897733A1 (fr) * | 2006-02-20 | 2007-08-24 | France Telecom | Procede de discrimination et d'attenuation fiabilisees des echos d'un signal numerique dans un decodeur et dispositif correspondant |
PT2102619T (pt) * | 2006-10-24 | 2017-05-25 | Voiceage Corp | Método e dispositivo para codificação de tramas de transição em sinais de voz |
KR100848324B1 (ko) * | 2006-12-08 | 2008-07-24 | 한국전자통신연구원 | 음성 부호화 장치 및 그 방법 |
CN101206860A (zh) * | 2006-12-20 | 2008-06-25 | 华为技术有限公司 | 一种可分层音频编解码方法及装置 |
CN101025918B (zh) * | 2007-01-19 | 2011-06-29 | 清华大学 | 一种语音/音乐双模编解码无缝切换方法 |
CN100578619C (zh) * | 2007-11-05 | 2010-01-06 | 华为技术有限公司 | 编码方法和编码器 |
EP2077550B8 (de) * | 2008-01-04 | 2012-03-14 | Dolby International AB | Audiokodierer und -dekodierer |
CN101261836B (zh) * | 2008-04-25 | 2011-03-30 | 清华大学 | 基于过渡帧判决及处理的激励信号自然度提高方法 |
MX2011000369A (es) * | 2008-07-11 | 2011-07-29 | Ten Forschung Ev Fraunhofer | Codificador y decodificador de audio para codificar marcos de señales de audio muestreadas. |
EP2144171B1 (de) * | 2008-07-11 | 2018-05-16 | Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. | Audiokodierer und -dekodierer zur Kodierung und Dekodierung von Frames eines abgetasteten Audiosignals |
PL3002750T3 (pl) * | 2008-07-11 | 2018-06-29 | Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. | Koder i dekoder audio do kodowania i dekodowania próbek audio |
KR101315617B1 (ko) * | 2008-11-26 | 2013-10-08 | 광운대학교 산학협력단 | 모드 스위칭에 기초하여 윈도우 시퀀스를 처리하는 통합 음성/오디오 부/복호화기 |
KR101622950B1 (ko) * | 2009-01-28 | 2016-05-23 | 삼성전자주식회사 | 오디오 신호의 부호화 및 복호화 방법 및 그 장치 |
KR101410312B1 (ko) * | 2009-07-27 | 2014-06-27 | 연세대학교 산학협력단 | 오디오 신호 처리 방법 및 장치 |
ES2441069T3 (es) * | 2009-10-08 | 2014-01-31 | Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. | Decodificador multimodo para señal de audio, codificador multimodo para señal de audio, procedimiento y programa de computación que usan un modelado de ruido en base a linealidad-predicción-codificación |
MX2012004648A (es) * | 2009-10-20 | 2012-05-29 | Fraunhofer Ges Forschung | Codificacion de señal de audio, decodificador de señal de audio, metodo para codificar o decodificar una señal de audio utilizando una cancelacion del tipo aliasing. |
CA2862715C (en) * | 2009-10-20 | 2017-10-17 | Ralf Geiger | Multi-mode audio codec and celp coding adapted therefore |
CN102222505B (zh) * | 2010-04-13 | 2012-12-19 | 中兴通讯股份有限公司 | 可分层音频编解码方法***及瞬态信号可分层编解码方法 |
CN102985968B (zh) * | 2010-07-01 | 2015-12-02 | Lg电子株式会社 | 处理音频信号的方法和装置 |
US8990094B2 (en) * | 2010-09-13 | 2015-03-24 | Qualcomm Incorporated | Coding and decoding a transient frame |
FR2969805A1 (fr) * | 2010-12-23 | 2012-06-29 | France Telecom | Codage bas retard alternant codage predictif et codage par transformee |
MY160265A (en) * | 2011-02-14 | 2017-02-28 | Fraunhofer-Gesellschaft Zur Forderung Der Angewandten Forschung E V | Apparatus and Method for Encoding and Decoding an Audio Signal Using an Aligned Look-Ahead Portion |
CN102737636B (zh) * | 2011-04-13 | 2014-06-04 | 华为技术有限公司 | 一种音频编码方法及装置 |
FR2977439A1 (fr) * | 2011-06-28 | 2013-01-04 | France Telecom | Fenetres de ponderation en codage/decodage par transformee avec recouvrement, optimisees en retard. |
AU2012276367B2 (en) * | 2011-06-30 | 2016-02-04 | Samsung Electronics Co., Ltd. | Apparatus and method for generating bandwidth extension signal |
FR2981781A1 (fr) * | 2011-10-19 | 2013-04-26 | France Telecom | Codage hierarchique perfectionne |
KR20140085453A (ko) * | 2011-10-27 | 2014-07-07 | 엘지전자 주식회사 | 음성 신호 부호화 방법 및 복호화 방법과 이를 이용하는 장치 |
EP2830062B1 (de) * | 2012-03-21 | 2019-11-20 | Samsung Electronics Co., Ltd. | Verfahren und vorrichtung für hochfrequente codierung/decodierung zur bandbreitenerweiterung |
CN109448745B (zh) * | 2013-01-07 | 2021-09-07 | 中兴通讯股份有限公司 | 一种编码模式切换方法和装置、解码模式切换方法和装置 |
CN105378835B (zh) * | 2013-02-20 | 2019-10-01 | 弗劳恩霍夫应用研究促进协会 | 使用依赖瞬态位置的重叠对音频信号编码或译码的设备及方法 |
EP2980797A1 (de) | 2014-07-28 | 2016-02-03 | Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. | Audiodecodierer, Verfahren und Computerprogramm mit Zero-Input-Response zur Erzeugung eines sanften Übergangs |
FR3024581A1 (fr) * | 2014-07-29 | 2016-02-05 | Orange | Determination d'un budget de codage d'une trame de transition lpd/fd |
TWI602172B (zh) * | 2014-08-27 | 2017-10-11 | 弗勞恩霍夫爾協會 | 使用參數以加強隱蔽之用於編碼及解碼音訊內容的編碼器、解碼器及方法 |
-
2014
- 2014-07-29 FR FR1457353A patent/FR3024581A1/fr active Pending
-
2015
- 2015-07-27 KR KR1020227015119A patent/KR102485835B1/ko active IP Right Grant
- 2015-07-27 US US15/329,671 patent/US10586549B2/en active Active
- 2015-07-27 KR KR1020177005825A patent/KR20170037660A/ko not_active Application Discontinuation
- 2015-07-27 EP EP15745542.9A patent/EP3175443B1/de active Active
- 2015-07-27 WO PCT/FR2015/052073 patent/WO2016016566A1/fr active Application Filing
- 2015-07-27 CN CN202010879909.4A patent/CN112133315B/zh active Active
- 2015-07-27 JP JP2017504670A patent/JP6607921B2/ja active Active
- 2015-07-27 CN CN201580044697.5A patent/CN106605263B/zh active Active
- 2015-07-27 ES ES15745542.9T patent/ES2676832T3/es active Active
-
2020
- 2020-01-29 US US16/775,569 patent/US11158332B2/en active Active
Also Published As
Publication number | Publication date |
---|---|
WO2016016566A1 (fr) | 2016-02-04 |
US20180182408A1 (en) | 2018-06-28 |
US20200168236A1 (en) | 2020-05-28 |
KR102485835B1 (ko) | 2023-01-09 |
US10586549B2 (en) | 2020-03-10 |
JP2017527843A (ja) | 2017-09-21 |
ES2676832T3 (es) | 2018-07-25 |
EP3175443B1 (de) | 2018-04-11 |
KR20170037660A (ko) | 2017-04-04 |
JP6607921B2 (ja) | 2019-11-20 |
CN112133315B (zh) | 2024-03-08 |
CN112133315A (zh) | 2020-12-25 |
CN106605263A (zh) | 2017-04-26 |
US11158332B2 (en) | 2021-10-26 |
FR3024581A1 (fr) | 2016-02-05 |
KR20220066412A (ko) | 2022-05-24 |
CN106605263B (zh) | 2020-11-27 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP1905010B1 (de) | Hierarchischen Audio-kodierung/-dekodierung | |
EP1907812B1 (de) | Verfahren zum umschalten der raten- und bandbreitenskalierbaren audiodecodierungsrate | |
EP2277172B1 (de) | Verbergung von übertragungsfehlern in einem digitalsignal in einer hierarchischen decodierungsstruktur | |
RU2584463C2 (ru) | Кодирование звука с малой задержкой, содержащее чередующиеся предсказательное кодирование и кодирование с преобразованием | |
EP2104936B1 (de) | Transformationsködierung mit geringer verzögerung unter verwendung von gewichtgsfenstern | |
EP3175443B1 (de) | Bestimmung eines budgets für lpd-/fd-übergangsrahmenkodierung | |
EP3161659A1 (de) | Wiederabtastung eines tonsignals durch interpolation zur codierung/decodierung mit geringer verzögerung | |
CA2512179C (fr) | Procede de codage et de decodage audio a debit variable | |
EP3175444B1 (de) | Rahmenverlustverwaltung in einem fd-/ldp-übergangskontext | |
EP2080195A1 (de) | Synthese verlorener blöcke eines digitalen audiosignals mit tonhöhenperiodenkorrektur | |
EP1047045A2 (de) | Schallsynthesiergerät und Verfahren dafür | |
EP3069340B1 (de) | Übergang von einer transformationscodierung/-decodierung zu einer prädiktiven codierung/decodierung | |
FR2977439A1 (fr) | Fenetres de ponderation en codage/decodage par transformee avec recouvrement, optimisees en retard. | |
EP3138095A1 (de) | Verbesserte frameverlustkorrektur mit sprachinformationen | |
WO2010040937A1 (fr) | Codage a echantillonnage critique avec codeur predictif | |
EP2589045B1 (de) | Adaptive lineare prädiktive codierung/decodierung | |
FR2911227A1 (fr) | Codage par transformee, utilisant des fenetres de ponderation et a faible retard | |
FR2737360A1 (fr) | Procedes de codage et de decodage de signaux audiofrequence, codeur et decodeur pour la mise en oeuvre de tels procedes | |
FR2830970A1 (fr) | Procede et dispositif de synthese de trames de substitution, dans une succession de trames representant un signal de parole | |
FR2980620A1 (fr) | Traitement d'amelioration de la qualite des signaux audiofrequences decodes |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
17P | Request for examination filed |
Effective date: 20170124 |
|
AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR |
|
AX | Request for extension of the european patent |
Extension state: BA ME |
|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
DAV | Request for validation of the european patent (deleted) | ||
DAX | Request for extension of the european patent (deleted) | ||
R17P | Request for examination filed (corrected) |
Effective date: 20170124 |
|
GRAP | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOSNIGR1 |
|
INTG | Intention to grant announced |
Effective date: 20171201 |
|
GRAS | Grant fee paid |
Free format text: ORIGINAL CODE: EPIDOSNIGR3 |
|
GRAA | (expected) grant |
Free format text: ORIGINAL CODE: 0009210 |
|
AK | Designated contracting states |
Kind code of ref document: B1 Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR |
|
REG | Reference to a national code |
Ref country code: GB Ref legal event code: FG4D Free format text: NOT ENGLISH |
|
REG | Reference to a national code |
Ref country code: CH Ref legal event code: EP |
|
REG | Reference to a national code |
Ref country code: AT Ref legal event code: REF Ref document number: 988826 Country of ref document: AT Kind code of ref document: T Effective date: 20180415 |
|
REG | Reference to a national code |
Ref country code: IE Ref legal event code: FG4D Free format text: LANGUAGE OF EP DOCUMENT: FRENCH |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R096 Ref document number: 602015009948 Country of ref document: DE |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: PLFP Year of fee payment: 4 |
|
REG | Reference to a national code |
Ref country code: ES Ref legal event code: FG2A Ref document number: 2676832 Country of ref document: ES Kind code of ref document: T3 Effective date: 20180725 |
|
REG | Reference to a national code |
Ref country code: NL Ref legal event code: MP Effective date: 20180411 |
|
REG | Reference to a national code |
Ref country code: LT Ref legal event code: MG4D |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: NL Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180411 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: BG Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180711 Ref country code: NO Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180711 Ref country code: AL Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180411 Ref country code: FI Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180411 Ref country code: SE Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180411 Ref country code: LT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180411 Ref country code: PL Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180411 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: HR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180411 Ref country code: RS Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180411 Ref country code: GR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180712 Ref country code: LV Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180411 |
|
REG | Reference to a national code |
Ref country code: AT Ref legal event code: MK05 Ref document number: 988826 Country of ref document: AT Kind code of ref document: T Effective date: 20180411 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: PT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180813 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R097 Ref document number: 602015009948 Country of ref document: DE |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: SK Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180411 Ref country code: RO Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180411 Ref country code: CZ Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180411 Ref country code: DK Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180411 Ref country code: AT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180411 Ref country code: EE Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180411 |
|
PLBE | No opposition filed within time limit |
Free format text: ORIGINAL CODE: 0009261 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: SM Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180411 |
|
REG | Reference to a national code |
Ref country code: CH Ref legal event code: PL |
|
26N | No opposition filed |
Effective date: 20190114 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: LU Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20180727 Ref country code: MC Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180411 |
|
REG | Reference to a national code |
Ref country code: BE Ref legal event code: MM Effective date: 20180731 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: CH Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20180731 Ref country code: LI Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20180731 |
|
REG | Reference to a national code |
Ref country code: IE Ref legal event code: MM4A |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: BE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20180731 Ref country code: SI Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180411 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: IE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20180727 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: MT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180411 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: TR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180411 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: MK Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20180411 Ref country code: CY Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180411 Ref country code: HU Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT; INVALID AB INITIO Effective date: 20150727 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: IS Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180811 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: IT Payment date: 20230620 Year of fee payment: 9 Ref country code: FR Payment date: 20230621 Year of fee payment: 9 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: GB Payment date: 20230620 Year of fee payment: 9 Ref country code: ES Payment date: 20230801 Year of fee payment: 9 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: DE Payment date: 20230620 Year of fee payment: 9 |