EP2255358A1 - Encodage vocal et audio extensible utilisant un encodage combinatoire de spectre mdct - Google Patents

Encodage vocal et audio extensible utilisant un encodage combinatoire de spectre mdct

Info

Publication number
EP2255358A1
EP2255358A1 EP08843220A EP08843220A EP2255358A1 EP 2255358 A1 EP2255358 A1 EP 2255358A1 EP 08843220 A EP08843220 A EP 08843220A EP 08843220 A EP08843220 A EP 08843220A EP 2255358 A1 EP2255358 A1 EP 2255358A1
Authority
EP
European Patent Office
Prior art keywords
spectral lines
transform
signal
encoding
residual signal
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
Application number
EP08843220A
Other languages
German (de)
English (en)
Other versions
EP2255358B1 (fr
Inventor
Yuriy Reznik
Pengjun Huang
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Qualcomm Inc
Original Assignee
Qualcomm Inc
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Qualcomm Inc filed Critical Qualcomm Inc
Publication of EP2255358A1 publication Critical patent/EP2255358A1/fr
Application granted granted Critical
Publication of EP2255358B1 publication Critical patent/EP2255358B1/fr
Not-in-force legal-status Critical Current
Anticipated expiration legal-status Critical

Links

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/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
    • 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/032—Quantisation or dequantisation of spectral components
    • G10L19/038—Vector quantisation, e.g. TwinVQ audio
    • 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

Definitions

  • the following description generally relates to encoders and decoders and, in particular, to an efficient way of coding modified discrete cosine transform (MDCT) spectrum as part of a scalable speech and audio codec.
  • MDCT modified discrete cosine transform
  • One goal of audio coding is to compress an audio signal into a desired limited information quantity while keeping as much as the original sound quality as possible.
  • an audio signal in a time domain is transformed into a frequency domain.
  • Perceptual audio coding techniques such as MPEG Layer-3 (MP3), MPEG-2 and MPEG-4, make use of the signal masking properties of the human ear in order to reduce the amount of data. By doing so, the quantization noise is distributed to frequency bands in such a way that it is masked by the dominant total signal, i.e. it remains inaudible. Considerable storage size reduction is possible with little or no perceptible loss of audio quality.
  • MP3 MPEG Layer-3
  • MPEG-2 MPEG-2
  • MPEG-4 make use of the signal masking properties of the human ear in order to reduce the amount of data. By doing so, the quantization noise is distributed to frequency bands in such a way that it is masked by the dominant total signal, i.e. it remains inaudible. Considerable storage size reduction is possible with little or no perceptible loss of audio quality.
  • Perceptual audio coding techniques are often scalable and produce a layered bit stream having a base or core layer and at least one enhancement layer. This allows bit-rate scalability, i.e. decoding at different audio quality levels at the decoder side or reducing the bit rate in the network by traffic shaping or conditioning.
  • Code excited linear prediction is a class of algorithms, including algebraic CELP (ACELP), relaxed CELP (RCELP), low-delay (LD-CELP) and vector sum excited linear predication (VSELP), that is widely used for speech coding.
  • CELP Analysis-by-Synthesis
  • AbS Analysis-by-Synthesis
  • the encoding is performed by perceptually optimizing the decoded (synthesis) signal in a closed loop.
  • the best CELP stream would be produced by trying all possible bit combinations and selecting the one that produces the best-sounding decoded signal. This is obviously not possible in practice for two reasons: it would be very complicated to implement and the "best sounding" selection criterion implies a human listener.
  • the CELP search is broken down into smaller, more manageable, sequential searches using a perceptual weighting function.
  • the encoding includes (a) computing and/or quantizing (usually as line spectral pairs) linear predictive coding coefficients for an input audio signal, (b) using codebooks to search for a best match to generate a coded signal, (c) producing an error signal which is the difference between the coded signal and the real input signal, and (d) further encoding such error signal (usually in an MDCT spectrum) in one or more layers to improve the quality of a reconstructed or synthesized signal.
  • This technique utilizes the sparseness property of perceptually-quantized MDCT spectrum in defining the structure of the code, which includes an element describing positions of non-zero spectral lines in a coded band, and uses combinatorial enumeration techniques to compute this element.
  • a method for encoding an MDCT spectrum in a scalable speech and audio codec is provided.
  • Such encoding of a transform spectrum may be performed by encoder hardware, encoding software, and/or a combination of the two, and may be embodied in a processor, processing circuit, and/or machine readable-medium.
  • a residual signal is obtained from a Code Excited Linear Prediction (CELP)-based encoding layer, where the residual signal is a difference between an original audio signal and a reconstructed version of the original audio signal.
  • CELP Code Excited Linear Prediction
  • the reconstructed version of the original audio signal may be obtained by: (a) synthesizing an encoded version of the original audio signal from the CELP-based encoding layer to obtain a synthesized signal, (b) re-emphasizing the synthesized signal, and/or (c) up-sampling the re-emphasized signal to obtain the reconstructed version of the original audio signal.
  • the residual signal is transformed at a Discrete Cosine Transform (DCT)-type transform layer to obtain a corresponding transform spectrum having a plurality of spectral lines.
  • the DCT-type transform layer may be a Modified Discrete Cosine Transform (MDCT) layer and the transform spectrum is an MDCT spectrum.
  • MDCT Modified Discrete Cosine Transform
  • the transform spectrum spectral lines are encoded using a combinatorial position coding technique.
  • Encoding of the transform spectrum spectral lines may include encoding positions of a selected subset of spectral lines based on representing spectral line positions using the combinatorial position coding technique for non-zero spectral lines positions.
  • a set of spectral lines may be dropped to reduce the number of spectral lines prior to encoding.
  • the combinatorial position coding technique may include generating a lexicographical index for a selected subset of spectral lines, where each lexicographic index represents one of a plurality of possible binary strings representing the positions of the selected subset of spectral lines.
  • the lexicographical index may represent spectral lines in binary string in fewer bits than the length of the binary string.
  • the combinatorial position coding technique may include generating an index representative of positions of spectral lines within a binary string, the positions of the spectral lines being encoded based a combinatorial formula:
  • the plurality of spectral lines may be split into a plurality of sub-bands and consecutive sub-bands may be grouped into regions.
  • a main pulse selected from a plurality of spectral lines for each of the sub-bands in the region may be encoded, where the selected subset of spectral lines in the region excludes the main pulse for each of the sub-bands.
  • positions of a selected subset of spectral lines within a region may be encoded based on representing spectral line positions using the combinatorial position coding technique for non-zero spectral lines positions.
  • the selected subset of spectral lines in the region may exclude the main pulse for each of the sub-bands.
  • Encoding of the transform spectrum spectral lines may include generating an array, based on the positions of the selected subset of spectral lines, of all possible binary strings of length equal to all positions in the region.
  • the regions may be overlapping and each region may include a plurality of consecutive sub- bands.
  • a method for decoding a transform spectrum in a scalable speech and audio codec is provided.
  • Such decoding of a transform spectrum may be performed by decoder hardware, decoding software, and/or a combination of the two, and may be embodied in a processor, processing circuit, and/or machine readable- medium.
  • An index representing a plurality of transform spectrum spectral lines of a residual signal is obtained, where the residual signal is a difference between an original audio signal and a reconstructed version of the original audio signal from a Code Excited Linear Prediction (CELP)-based encoding layer.
  • CELP Code Excited Linear Prediction
  • the index may represent nonzero spectral lines in a binary string in fewer bits than the length of the binary string.
  • the obtained index may represent positions of spectral lines within a binary string, the positions of the spectral lines being encoded based a combinatorial formula:
  • the index is decoded by reversing a combinatorial position coding technique used to encode the plurality of transform spectrum spectral lines.
  • a version of the residual signal is synthesized using the decoded plurality of transform spectrum spectral lines at an Inverse Discrete Cosine Transform (IDCT)-type inverse transform layer.
  • Synthesizing a version of the residual signal may include applying an inverse DCT-type transform to the transform spectrum spectral lines to produce a time-domain version of the residual signal.
  • Decoding the transform spectrum spectral lines may include decoding positions of a selected subset of spectral lines based on representing spectral line positions using the combinatorial position coding technique for non-zero spectral lines positions.
  • the DCT-type inverse transform layer may be an Inverse Modified Discrete Cosine Transform (IMDCT) layer and the transform spectrum is an MDCT spectrum.
  • IMDCT Inverse Modified Discrete Cosine Transform
  • FIG. 1 is a block diagram illustrating a communication system in which one or more coding features may be implemented.
  • FIG. 2 is a block diagram illustrating a transmitting device that may be configured to perform efficient audio coding according to one example.
  • FIG. 3 is a block diagram illustrating a receiving device that may be configured to perform efficient audio decoding according to one example.
  • FIG. 4 is a block diagram of a scalable encoder according to one example.
  • FIG. 5 is a block diagram illustrating an MDCT spectrum encoding process that may be implemented by an encoder.
  • FIG. 7 illustrates a general approach for encoding an audio frame in an efficient manner.
  • FIG. 8 is a block diagram illustrating an encoder that may efficiently encode pulses in an MDCT audio frame.
  • FIG. 9 is a flow diagram illustrating a method for obtaining a shape vector for a frame.
  • FIG. 11 is a block diagram illustrating an example of a decoder.
  • FIG. 12 is a block diagram illustrating a method for encoding a transform spectrum in a scalable speech and audio codec.
  • FIG. 13 is a block diagram illustrating a method for decoding a transform spectrum in a scalable speech and audio codec.
  • a Modified Discrete Cosine Transform may be used in one or more coding layers where audio signal residuals are transformed (e.g., into an MDCT domain) for encoding.
  • MDCT domain a frame of spectral lines may be divided into sub-bands and regions of overlapping sub-bands are defined.
  • a main pulse i.e., strongest spectral line or group of spectral lines in the sub-band
  • the position of the main pulses may be encoded using an integer to represent its position within each of their sub-bands.
  • the amplitude/magnitude of each of the main pulses may be separately encoded. Additionally, a plurality (e.g., four) of sub-pulses (e.g., remaining spectral lines) in the region are selected, excluding the already selected main pulses. The selected sub-pulses are encoded based on their overall position within the region. The positions of these sub-pulses may be encoded using a combinatorial position coding technique to produce lexicographical indexes that can be represented in fewer bits than the over all length of the region. By representing main pulses and sub-pulses in this manner, they can be encoded using a relatively small number of bits for storage and/or transmission.
  • FIG. 1 is a block diagram illustrating a communication system in which one or more coding features may be implemented.
  • a coder 102 receives an incoming input audio signal 104 and generates and encoded audio signal 106.
  • the encoded audio signal 106 may be transmitted over a transmission channel (e.g., wireless or wired) to a decoder 108.
  • the decoder 108 attempts to reconstructs the input audio signal 104 based on the encoded audio signal 106 to generate a reconstructed output audio signal 110.
  • the coder 102 may operate on a transmitter device while the decoder device may operate on receiving device. However, it should be clear that any such devices may include both an encoder and decoder.
  • FIG. 2 is a block diagram illustrating a transmitting device 202 that may be configured to perform efficient audio coding according to one example.
  • An input audio signal 204 is captured by a microphone 206, amplified by an amplifier 208, and converted by an A/D converter 210 into a digital signal which is sent to a speech encoding module 212.
  • the speech encoding module 212 is configured to perform multi- layered (scaled) coding of the input signal, where at least one such layer involves encoding a residual (error signal) in an MDCT spectrum.
  • the speech encoding module 212 may perform encoding as explained in connection with FIGS. 4, 5, 6, 7, 8, 9 and 10.
  • Output signals from the speech encoding module 212 may be sent to a transmission path encoding module 214 where channel decoding is performed and the resulting output signals are sent to a modulation circuit 216 and modulated so as to be sent via a D/A converter 218 and an RF amplifier 220 to an antenna 222 for transmission of an encoded audio signal 224.
  • FIG. 3 is a block diagram illustrating a receiving device 302 that may be configured to perform efficient audio decoding according to one example.
  • An encoded audio signal 304 is received by an antenna 306 and amplified by an RF amplifier 308 and sent via an A/D converter 310 to a demodulation circuit 312 so that demodulated signals are supplied to a transmission path decoding module 314.
  • An output signal from the transmission path decoding module 314 is sent to a speech decoding module 316 configured to perform multi-layered (scaled) decoding of the input signal, where at least one such layer involves decoding a residual (error signal) in an IMDCT spectrum.
  • the speech decoding module 316 may perform signal decoding as explained in connection with FIG. 11, 12, and 13.
  • Output signals from the speech decoding module 316 are sent to a D/A converter 318.
  • An analog speech signal from the D/A converter 318 is the sent via an amplifier 320 to a speaker 322 to provide a reconstructed output audio signal 324.
  • the coder 102 (FIG. 1), decoder 108 (FIG. 1), speech/audio encoding module 212 (FIG. 2), and/or speech/audio decoding module 316 (FIG. 3) may be implemented as a scalable audio codec.
  • Such scalable audio codec may be implemented to provide high-performance wideband speech coding for error prone telecommunications channels, with high quality of delivered encoded narrowband speech signals or wideband audio/music signals.
  • One approach to a scalable audio codec is to provide iterative encoding layers where the error signal (residual) from one layer is encoded in a subsequent layer to further improve the audio signal encoded in previous layers.
  • Codebook Excited Linear Prediction is based on the concept of linear predictive coding in which a codebook of different excitation signals is maintained on the encoder and decoder.
  • the encoder finds the most suitable excitation signal and sends its corresponding index (from a fixed, algebraic, and/or adaptive codebook) to the decoder which then uses it to reproduce the signal (based on the codebook).
  • the encoder performs analysis-by-synthesis by encoding and then decoding the audio signal to produce a reconstructed or synthesized audio signal.
  • the encoder finds the parameters that minimize the energy of the error signal, i.e., the difference between the original audio signal and a reconstructed or synthesized audio signal.
  • the output bit- rate can be adjusted by using more or less coding layers to meet channel requirements and a desired audio quality.
  • Such scalable audio codec may include several layers where higher layer bitstreams can be discarded without affecting the decoding of the lower layers.
  • Examples of existing scalable codecs that use such multi-layer architecture include the ITU-T Recommendation G.729.1 and an emerging ITU-T standard, code- named G. EV-VBR.
  • G. EV-VBR Embedded Variable Bit Rate
  • an Embedded Variable Bit Rate (EV-VBR) codec may be implemented as multiple layers Ll (core layer) through LX (where X is the number of the highest extension layer).
  • Such codec may accept both wideband (WB) signals sampled at 16 kHz, and narrowband (NB) signals sampled at 8 kHz.
  • WB wideband
  • NB narrowband
  • the codec output can be wideband or narrowband.
  • Ll core layer
  • L5 the highest extension layer
  • CELP Code Excited Linear Prediction
  • the core layer Ll may be derived from a variable multi-rate wideband (VMR-WB) speech coding algorithm and may comprise several coding modes optimized for different input signals. That is, the core layer Ll may classify the input signals to better model the audio signal.
  • VMR-WB variable multi-rate wideband
  • the coding error (residual) from the core layer Ll is encoded by the enhancement or extension layer L2, based on an adaptive codebook and a fixed algebraic codebook.
  • the error signal (residual) from layer L2 may be further coded by higher layers (L3-L5) in a transform domain using a modified discrete cosine transform (MDCT).
  • MDCT modified discrete cosine transform
  • Side information may be sent in layer L3 to enhance frame erasure concealment (FEC).
  • the core layer Ll codec is essentially a CELP -based codec, and may be compatible with one of a number of well-known narrow-band or wideband vocoders such as Adaptive Multi-Rate (AMR), AMR Wideband (AMR-WB), Variable Multi- Rate Wideband (VMR-WB), Enhanced Variable Rate codec (EVRC), or EVR Wideband (EVRC-WB) codecs.
  • AMR Adaptive Multi-Rate
  • AMR-WB AMR Wideband
  • VMR-WB Variable Multi- Rate Wideband
  • EVRC Enhanced Variable Rate codec
  • EVR Wideband EVR Wideband
  • Layer 2 in a scalable codec may use codebooks to further minimize the perceptually weighted coding error (residual) from the core layer Ll.
  • side information may be computed and transmitted in a subsequent layer L3. Independently of the core layer coding mode, the side information may include signal classification.
  • the weighted error signal after layer L2 encoding is coded using an overlap-add transform coding based on the modified discrete cosine transform (MDCT) or similar type of transform. That is, for coded layers L3, L4, and/or L5, the signal may be encoded in the MDCT spectrum. Consequently, an efficient way of coding the signal in the MDCT spectrum is provided.
  • MDCT modified discrete cosine transform
  • FIG. 4 is a block diagram of a scalable encoder 402 according to one example.
  • an input signal 404 is high-pass filtered 406 to suppress undesired low frequency components to produce a filtered input signal S HP (II).
  • the high-pass filter 406 may have a 25 Hz cutoff for a wideband input signal and 100 Hz for a narrowband input signal.
  • the filtered input signal S HP O 1 is then resampled by a resampling module 408 to produce a resampled input signal Si2.8(n).
  • the original input signal 404 may be sampled at 16 kHz and is resampled to 12.8 kHz which may be an internal frequency used for layer Ll and/or L2 encoding.
  • a pre-emphasis module 410 then applies a first-order high-pass filter to emphasize higher frequencies (and attenuate low frequencies) of the resampled input signal S 12. g(n).
  • the resulting signal then passes to an encoder/decoder module 412 that may perform layer Ll and/or L2 encoding based on a Code-Excited Linear Prediction (CELP)-based algorithm where the speech signal is modeled by an excitation signal passed through a linear prediction (LP) synthesis filter representing the spectral envelope.
  • CELP Code-Excited Linear Prediction
  • the signal energy may be computed for each perceptual critical band and used as part of layers Ll and L2 encoding. Additionally, the encoded encoder/decoder module 412 may also synthesize (reconstruct) a version of the input signal. That is, after the encoder/decoder module 412 encodes the input signal, it decodes it and a de- emphasis module 416 and a resampling module 418 recreate a version s 2 (n) of the input signal 404.
  • the residual signal x 2 (n) is then perceptually weighted by weighting module 424 and transformed by an MDCT module 428 into the MDCT spectrum or domain to generate a residual signal X 2 (A).
  • the residual signal Xi(U) is then provided to a combinatorial spectrum encoder 432 that encodes the residual signal Xi(K) to produce encoded parameters for layers L3, L4, and/or L5.
  • the combinatorial spectrum encoder 432 generates an index representing non-zero spectral lines (pulses) in the residual signal X 2 (A).
  • the index may represent one of a plurality of possible binary strings representing the positions of non-zero spectral lines. Due to the combinatorial technique, the index may represent non-zero spectral lines in a binary string in fewer bits than the length of the binary string.
  • the parameters from layers Ll to L5 can then serve as an output bitstream 436 and can be subsequently be used to reconstruct or synthesize a version of the original input signal 404 at a decoder.
  • Quasi-periodic segments are encoded with Voiced coding (VC) mode.
  • Voiced coding selection is conditioned by a smooth pitch evolution.
  • the Voiced coding mode may use ACELP technology.
  • TC Transition coding
  • the adaptive codebook in the subframe containing the glottal impulse of the first pitch period is replaced with a fixed codebook.
  • the signal may be modeled using a CELP-based paradigm by an excitation signal passing through a linear prediction (LP) synthesis filter representing the spectral envelope.
  • the LP filter may be quantized in the Immitance spectral frequency (ISF) domain using a Safety-Net approach and a multi-stage vector quantization (MSVQ) for the generic and voiced coding modes.
  • An open-loop (OL) pitch analysis is performed by a pitch-tracking algorithm to ensure a smooth pitch contour.
  • two concurrent pitch evolution contours may be compared and the track that yields the smoother contour is selected.
  • Two sets of LPC parameters are estimated and encoded per frame in most modes using a 20 ms analysis window, one for the frame-end and one for the mid-frame.
  • Mid- frame ISFs are encoded with an interpolative split VQ with a linear interpolation coefficient being found for each ISF sub-group, so that the difference between the estimated and the interpolated quantized ISFs is minimized.
  • two codebook sets (corresponding to weak and strong prediction) may be searched in parallel to find the predictor and the codebook entry that minimize the distortion of the estimated spectral envelope. The main reason for this Safety-Net approach is to reduce the error propagation when frame erasures coincide with segments where the spectral envelope is evolving rapidly.
  • the weak predictor is sometimes set to zero which results in quantization without prediction.
  • the path without prediction may always be chosen when its quantization distortion is sufficiently close to the one with prediction, or when its quantization distortion is small enough to provide transparent coding.
  • a sub-optimal code vector is chosen if this does not affect the clean-channel performance but is expected to decrease the error propagation in the presence of frame-erasures.
  • the ISFs of UC and TC frames are further systematically quantized without prediction. For UC frames, sufficient bits are available to allow for very good spectral quantization even without prediction. TC frames are considered too sensitive to frame erasures for prediction to be used, despite a potential reduction in clean channel performance.
  • the pitch estimation is performed using the L2 excitation generated with unquantized optimal gains. This approach removes the effects of gain quantization and improves pitch-lag estimate across the layers.
  • WB wideband
  • standard pitch estimation Ll excitation with quantized gains
  • Layer 2 - Enhancement Encoding In layer L2, the encoder/decoder module 412 may encode the quantization error from the core layer Ll using again the algebraic codebooks. In the L2 layer, the encoder further modifies the adaptive codebook to include not only the past Ll contribution, but also the past L2 contribution. The adaptive pitch-lag is the same in Ll and L2 to maintain time synchronization between the layers.
  • the adaptive and algebraic codebook gains corresponding to Ll and L2 are then re-optimized to minimize the perceptually weighted coding error.
  • the updated Ll gains and the L2 gains are predictively vector-quantized with respect to the gains already quantized in Ll.
  • the CELP layers (Ll and L2) may operate at internal (e.g. 12.8 kHz) sampling rate.
  • the output from layer L2 thus includes a synthesized signal encoded in the 0-6.4 kHz frequency band.
  • the AMR-WB bandwidth extension may be used to generate the missing 6.4-7 kHz bandwidth.
  • a frame-error concealment module 414 may obtain side information from the encoder/decoder module 412 and uses it to generate layer L3 parameters.
  • the side information may include class information for all coding modes.
  • Previous frame spectral envelope information may be also transmitted for core layer Transition coding.
  • phase information and the pitch- synchronous energy of the synthesized signal may also be sent.
  • the residual signal X 2 ( ⁇ ) resulting from the second stage CELP coding in layer L2 may be quantized in layers L3, L4 and L5 using an MDCT or similar transform with overlap add structure. That is, the residual or "error" signal from a previous layer is used by a subsequent layer to generate its parameters (which seek to efficiently represent such error for transmission to a decoder).
  • the MDCT coefficients may be quantized by using several techniques. In some instances, the MDCT coefficients are quantized using scalable algebraic vector quantization. The MDCT may be computed every 20 milliseconds (ms), and its spectral coefficients are quantized in 8-dimensional blocks.
  • An audio cleaner (MDCT domain noise-shaping filter) is applied, derived from the spectrum of the original signal. Global gains are transmitted in layer L3. Further, few bits are used for high frequency compensation. The remaining layer L3 bits are used for quantization of MDCT coefficients. The layer L4 and L5 bits are used such that the performance is maximized independently at layers L4 and L5 levels.
  • the MDCT coefficients may be quantized differently for speech and music dominant audio contents.
  • the discrimination between speech and music contents is based on an assessment of the CELP model efficiency by comparing the L2 weighted synthesis MDCT components to the corresponding input signal components.
  • AVQ scalable algebraic vector quantization
  • L3 and L4 For speech dominant content, scalable algebraic vector quantization (AVQ) is used in L3 and L4 with spectral coefficients quantized in 8-dimensional blocks. Global gain is transmitted in L3 and a few bits are used for high-frequency compensation. The remaining L3 and L4 bits are used for the quantization of the MDCT coefficients.
  • the quantization method is the multi-rate lattice VQ (MRLVQ).
  • a novel multi-level permutation-based algorithm has been used to reduce the complexity and memory cost of the indexing procedure.
  • the rank computation is done in several steps: First, the input vector is decomposed into a sign vector and an absolute-value vector. Second, the absolute-value vector is further decomposed into several levels. The highest-level vector is the original absolute-value vector. Each lower-level vector is obtained by removing the most frequent element from the upper-level vector. The position parameter of each lower-level vector related to its upper-level vector is indexed based on a permutation and combination function. Finally, the index of all the lower- levels and the sign are composed into an output index.
  • a band selective shape-gain vector quantization may be used in layer L3, and an additional pulse position vector quantizer may be applied to layer L4.
  • band selection may be performed firstly by computing the energy of the MDCT coefficients. Then the MDCT coefficients in the selected band are quantized using a multi-pulse codebook.
  • a vector quantizer is used to quantize sub-band gains for the MDCT coefficients. For layer L4, the entire bandwidth may be coded using a pulse positioning technique.
  • certain frequencies of the L2 layer output may be attenuated to allow the MDCT coefficients to be coded more aggressively.
  • the amount of attenuation applied may be up to 6 dB, which may be communicated by using 2 or fewer bits.
  • Layer L5 may use additional pulse position coding technique.
  • layers L3, L4, and L5 perform coding in the MDCT spectrum (e.g., MDCT coefficients representing the residual for the previous layer), it is desirable for such MDCT spectrum coding to be efficient. Consequently, an efficient method of MDCT spectrum coding is provided.
  • the input to this process is either a complete MDCT spectrum of an error signal (residual) after CELP core (Layers Ll and/or L2) or a residual MDCT spectrum after previous a previous layer. That is, at layer L3, a complete MDCT spectrum is received and is partially encoded. Then at layer L4, the residual MDCT spectrum of the encoded signal at layer L3 is encoded. This process may be repeated for layer L5 and other subsequent layers.
  • FIG. 5 is a block diagram illustrating an example MDCT spectrum encoding process that may be implemented at higher layers of an encoder.
  • the encoder 502 obtains the MDCT spectrum of a residual signal 504 from the previous layers.
  • Such residual signal 504 may be the difference between an original signal and a reconstructed version of the original signal (e.g., reconstructed from an encoded version of the original signal).
  • the MDCT coefficients of the residual signal may be quantized to generate spectral lines for a given audio frame.
  • a sub-band/region selector 508 may divide the residual signal 504 into a plurality (e.g., 17) of uniform sub-bands. For example, given an audio frame of three hundred twenty (320) spectral lines, the first and last twenty-four (24) points (spectral lines) may be dropped, and the remaining two hundred seventy-two (272) spectral lines may be divided into seventeen (17) sub-bands of sixteen (16) spectral lines each. It should be understood that in various implementations a different number of sub-bands may be used, the number of first and last points that may be dropped may vary, and/or the number of spectral lines that may be split per sub-band or frame may also vary.
  • FIG. 6 is a diagram illustrating one example of how an audio frame 602 may be selected and divided into regions and sub-bands to facilitate encoding of an MDCT spectrum.
  • the plurality of regions 606 may be arranged to overlapped with each neighboring region and to cover the full bandwidth (e.g., 7 kHz). Region information may be generated for encoding.
  • the MDCT spectrum in the region is quantized by a shape quantizer 510 and gain quantizer 512 using shape-gain quantization in which a shape (synonymous with position location and sign) and a gain of the target vector are sequentially quantized.
  • Shaping may comprise forming a position location, a sign of the spectral lines corresponding to a main pulse and a plurality of sub-pulses per sub-band, along with a magnitude for the main pulses and sub-pulses. In the example illustrated in FIG.
  • spectral lines within a region 606 may be represented by a shape vector consisting of 5 main pulses (one main pulse for each of 5 consecutive sub-bands 604a, 604b, 604, c, 604d, and 604e) and 4 additional sub-pulses per region. That is, for each sub-band 604, a main pulse is selected (i.e., the strongest pulse within the 16 spectral lines in that sub-band). Additionally, for each region 606, an additional 4 sub- pulses (i.e., the next strongest spectral line pulses within the 80 spectral lines) are selected. As illustrated in FIG. 6, in one example the combination of the main pulse and sub-pulse positions and signs can be encoded with 50 bits, where:
  • Each main pulse may be represented by its position within a 16 spectral line sub-band using 4 bits (e.g., a number 0-16 represented by 4 bits). Consequently, for five (5) main pulses in a region, this takes 20 bits total.
  • the sign of each main pulse and/or sub-pulse may be represented by one bit (e.g., either 0 or 1 for positive or negative).
  • the position of each of the four (4) selected sub-pulses within a region may be encoded using a combinatorial position coding technique (using binomial coefficients to represent the position of each selected sub-pulse) to generate lexicographical indexes, such that a total of number of bits used to represent the position of the four sub-pulses within the region are less than the length of the region.
  • a pulse amplitude/magnitude may be encoded using two bits (i.e., 00 - no pulse, 01 - sub-pulse, and/or 10 - main pulse).
  • a gain quantization is performed on calculated sub-band gains. Since the region contains 5 sub-bands, 5 gains are obtained for the region which can be vector quantized using 10 bits.
  • the vector quantization exploits a switched prediction scheme. Note that an output residual signal 516 may be obtained (by subtracting 514 the quantized residual signal S quant from the original input residual signal 504) which can be used as the input for the next layer of encoding.
  • FIG. 7 illustrates a general approach for encoding an audio frame in an efficient manner.
  • a region 702 of N spectral lines may be defined from a plurality of consecutive or contiguous sub-bands, where each sub-band 704 has L spectral lines.
  • the region 702 and/or sub-bands 704 may be for a residual signal of an audio frame.
  • a main pulse is selected 706. For instance, the strongest pulse within the L spectral lines of a sub-band is selected as the main pulse for that sub-band. The strongest pulse may be selected as the pulse that has the greatest amplitude or magnitude in the sub-band.
  • a first main pulse P A is selected for Sub-Band A 704a
  • a second main pulse P B is selected for Sub-Band B 704b
  • C 1 the position of each spectral line within the region 702 can be denoted by C 1 (for 1 ⁇ i ⁇ N).
  • the first main pulse P A may be in position c 3
  • the second main pulse P B may be in position C 24
  • a third main pulse Pc may be in position C 41
  • a fourth main pulse P D may be in position C 59
  • a fifth main pulse P E may be in position C 79 .
  • a string w is generated from the remaining spectral lines or pulses in the region 708. To generate the string, the selected main pulses are removed from the string w, and the remaining pulses W 1 ... W N P remain in the string (where p is the number of main pulses in the region). Note that the string may be represented by zeros "0" and "1", where "0" represents no pulse is present at a particular position and "1" represents a pulse is present at a particular position.
  • a plurality of sub-pulses is selected from the string w based on pulse strength 710. For instance, four (4) sub-pulses S 1 , S 2 , S3, and S 4 may be selected based on their strength (amplitude/magnitude) (i.e., the strongest 4 pulses remaining in the string w are selected).
  • a first sub-pulse Si may be in position w 2 o
  • a second sub- pulse S 2 may be in position w 2 9
  • a third sub-pulse S3 may be in position w 51
  • a fourth sub- pulse S 4 may be in position w 69 .
  • FIG. 8 is a block diagram illustrating an encoder that may efficiently encode pulses in an MDCT audio frame.
  • the encoder 802 may include a sub-band generator 802 that divides a received MDCT spectrum audio frame 801 into multiple bands having a plurality of spectral lines.
  • a region generator 806 then generates a plurality of overlapping regions, where each region consists of a plurality of contiguous sub-bands.
  • a main pulse selector 808 selects a main pulse from each of the sub-bands in a region.
  • a main pulse may be the pulse (one or more spectral lines or points) having the greatest amplitude/magnitude within a sub-band.
  • the selected main pulse for each sub- band in a region is then encoded by a sign encoder 810, a position encoder 812, a gain encoder 814, and an amplitude encoder 816 to generate corresponding encoded bits for each main pulse.
  • sub-pulse selector 809 selects a plurality (e.g., four) sub-pulses from across the region (i.e., without regard as to which sub-band the sub- pulses belong).
  • the sub-pulses may be selected from the remaining pulses in the region (i.e., excluding the already selected main pulses) having the greatest amplitude/magnitude within a sub-band.
  • FIG. 9 is a flow diagram illustrating a method for obtaining a shape vector for a frame.
  • the shape vector consists of 5 main and 4 sub-pulses (spectral lines), which position locations (within 80-lines region) and signs are to be communicated by using the fewest possible number of bits.
  • the magnitude of main pulses is assumed to be higher than the magnitude of sub-pulses, and that ratio may be a preset constant (e.g. 0.8).
  • This means that proposed quantization technique may assigns one of three possible reconstruction levels (magnitudes) to the MDCT spectrum in each sub-band: zero (0), sub-pulse level (e.g. 0.8), and main pulse level (e.g., 1).
  • each 16-point (16-spectral line) sub-band has exactly one main pulse (with dedicated gain, which is also transmitted once per sub-band). Consequently, a main pulse is present for each sub-band in a region.
  • a sub-pulse may represent the maximum number of bits used to represent the spectral lines in the sub-band. For instance, four (4) sub-pulses in a sub- band can represent 16 spectral lines in any sub-band, thus, the maximum number of bits used to represent 16 spectral lines in a sub-band is 4.
  • an encoding method for pulses can be derived as follows.
  • a frame (having a plurality of spectral lines) is divided into a plurality of sub- bands 902.
  • a plurality of overlapping regions may be defined, where each region includes a plurality of consecutive/contiguous sub-bands 904.
  • a main pulse is selected in each sub-band in the region based on pulse amplitude/magnitude 906.
  • a position index is encoded for each selected main pulse 908.
  • a main pulse may fall anywhere within a sub-band having 16 spectral lines, its position can be represented by 4 bits (e.g., integer value in 0 ...15).
  • a sign, amplitude, and/or gain may be encoded for each of the main pulses 910.
  • the sign may be represented by 1 bit (either a 1 or 0). Because each index for a main pulse will take 4 bits, 20 bits may be used to represent five main pulse indices (e.g., 5 sub-bands) and 5 bits for the signs of the main pulses, in addition to the bits used for gain and amplitude encoding for each main pulse.
  • a binary string is created from a selected plurality of sub-pulses from the remaining pulses in a region, where the selected main pulses are removed 912.
  • a lexicographic index is then computed of this binary string w for a set of all possible binary strings with a plurality k of non-zero bits 914.
  • a sign, amplitude, and/or gain may also be encoded for each of the selected sub-pulses 916.
  • the lexicographic index representing the selected sub-pulses may be generated using a combinatorial position coding technique based on binomial coefficients.
  • the binary string w may be computed for a set of all possible (A binary
  • ⁇ k strings of length n with k non-zero bits (each non-zero bit in the string w indicating the position of a pulse to be encoded).
  • the following combinatorial formula may be used to generate an index that encodes the position of all k pulses within the binary string w:
  • this can be represented Iog2l285826 ⁇ 20.294...bits. Using the nearest integer will result in 21 bits usage. Note that this is smaller than the 75 bits for the binary string or the bits remaining in the 80-bit region.
  • a lexicographical index for a binary string representing the positions of selected sub-pulses may be calculated based on binomial coefficients, which in one possible implementation can be pre-computed and stored in a triangular array (Pascal's triangle) as follows:
  • a binomial coefficient may be calculated for a binary string w representing a plurality of sub-pulses (e.g., a binary "1") at various positions of the binary string w.
  • index of a (n,k) sequence */ static int index (unsigned w, int n, int k)
  • FIG. 10 is a block diagram illustrating a method for encoding a transform spectrum in a scalable speech and audio codec.
  • a residual signal is obtained from a Code Excited Linear Prediction (CELP)-based encoding layer, where the residual signal is a difference between an original audio signal and a reconstructed version of the original audio signal 1002.
  • the reconstructed version of the original audio signal may be obtained by: (a) synthesizing an encoded version of the original audio signal from the CELP-based encoding layer to obtain a synthesized signal, (b) re-emphasizing the synthesized signal, and/or (c) up-sampling the re-emphasized signal to obtain the reconstructed version of the original audio signal.
  • the residual signal is transformed at a Discrete Cosine Transform (DCT)-type transform layer to obtain a corresponding transform spectrum having a plurality of spectral lines 1004.
  • the DCT-type transform layer may be a Modified Discrete Cosine Transform (MDCT) layer and the transform spectrum is an MDCT spectrum.
  • the transform spectrum spectral lines are encoded using a combinatorial position coding technique 1006. Encoding of the transform spectrum spectral lines may include encoding positions of a selected subset of spectral lines based on representing spectral line positions using the combinatorial position coding technique for non-zero spectral lines positions.
  • a set of spectral lines may be dropped to reduce the number of spectral lines prior to encoding.
  • the combinatorial position coding technique may include generating a lexicographical index for a selected subset of spectral lines, where each lexicographic index represents one of a plurality of possible binary strings representing the positions of the selected subset of spectral lines.
  • the lexicographical index may represent spectral lines in binary string in fewer bits than the length of the binary string.
  • the combinatorial position coding technique may include generating an index representative of positions of spectral lines within a binary string, the positions of the spectral lines being encoded based a combinatorial formula:
  • the plurality of spectral lines may be split into a plurality of sub- bands and consecutive sub-bands may be grouped into regions.
  • a main pulse selected from a plurality of spectral lines for each of the sub-bands in the region may be encoded, where the selected subset of spectral lines in the region excludes the main pulse for each of the sub-bands.
  • positions of a selected subset of spectral lines within a region may be encoded based on representing spectral line positions using the combinatorial position coding technique for non-zero spectral lines positions.
  • the selected subset of spectral lines in the region may exclude the main pulse for each of the sub-bands.
  • Encoding of the transform spectrum spectral lines may include generating an array, based on the positions of the selected subset of spectral lines, of all possible binary strings of length equal to all positions in the region.
  • the regions may be overlapping and each region may include a plurality of consecutive sub-bands.
  • FIG. 11 is a block diagram illustrating an example of a decoder.
  • the decoder 1102 may receive an input bitstream 1104 containing information of one or more layers.
  • the received layers may range from Layer 1 up to Layer 5, which may correspond to bit rates of 8 kbit/s to 32 kbit/s.
  • This means that the decoder operation is conditioned by the number of bits (layers), received in each frame.
  • the output signal 1132 is WB and that all layers have been correctly received at the decoder 1102.
  • the core layer (Layer 1) and the ACELP enhancement layer (Layer 2) are first decoded by a decoder module 1106 and signal synthesis is performed.
  • the synthesized signal is then de-emphasized by a de-emphasis module 1108 and resampled to 16 kHz by a resampling module 1110 to generate a signal s l6 (n) .
  • a post-processing module further processes the signal s l6 (n) to generate a synthesized signal s 2 (n) of the Layer 1 or Layer 2.
  • Higher layers are then decoded by a combinatorial spectrum decoder module 1116 to obtain an MDCT spectrum signal X 234 (A:) .
  • the MDCT spectrum signal X 234 (A:) is inverse transformed by inverse MDCT module 1120 and the resulting signal x w 234 (n) is added to the perceptually weighted synthesized signal s w 2 (n) of Layers 1 and 2.
  • Temporal noise shaping is then applied by a shaping module 1122.
  • a weighted synthesized signal s w 2 (n) of the previous frame overlapping with the current frame is then added to the synthesis.
  • Inverse perceptual weighting 1124 is then applied to restore the synthesized WB signal.
  • a pitch post-filter 1126 is applied on the restored signal followed by a high-pass filter 1128.
  • the post-filter 1126 exploits the extra decoder delay introduced by the overlap-add synthesis of the MDCT (Layers 3, 4, 5). It combines, in an optimal way, two pitch post-filter signals.
  • One is a high- quality pitch post-filter signal S 2 (n) of the Layer 1 or Layer 2 decoder output that is generated by exploiting the extra decoder delay.
  • the other is a low-delay pitch post- filter signal s(n) of the higher-layers (Layers 3, 4, 5) synthesis signal.
  • the filtered synthesized signal s HP (n) is then output by a noise gate 1130.
  • FIG. 12 is a block diagram illustrating a decoder that may efficiently decode pulses of an MDCT spectrum audio frame.
  • a plurality of encoded input bits are received including sign, position, amplitude, and/or gain for main and/or sub-pulses in an MDCT spectrum for an audio frame.
  • the bits for one or more main pulses are decoded by a main pulse decoder that may include a sign decoder 1210, a position decoder 1212, a gain decoder 1214, and/or an amplitude decoder 1216.
  • a main pulse synthesizer 1208 then reconstructs the one or more main pulses using the decoded information.
  • the bits for one or more sub-pulses may be decoded at a sub- pulse decoder that includes a sign decoder 1218, a position decoder 1220, a gain decoder 1222, and/or an amplitude decoder 1224.
  • the position of the sub- pulses may be encoded using a lexicographic index based on a combinatorial position coding technique. Consequently, the position decoder 1220 may be a combinatorial spectrum decoder.
  • a sub-pulse synthesizer 1209 then reconstructs the one or more sub- pulses using the decoded information.
  • a region re-generator 1206 then regenerates a plurality of overlapping regions in based on the sub-pulses, where each region consists of a plurality of contiguous sub-bands.
  • a sub-band re-generator 1204 then regenerates the sub-bands using the main pulses and/or sub-pulses leading to a reconstructed MDCT spectrum for an audio frame 1201.
  • an inverse process may be performed to obtain a sequence or binary string based on a given the given lexicographic index.
  • One example of such inverse process can be implemented as follows:
  • the decoding process can be accomplished by the following algorithm:
  • FIG. 13 is a block diagram illustrating a method for decoding a transform spectrum in a scalable speech and audio codec.
  • An index representing a plurality of transform spectrum spectral lines of a residual signal is obtained, where the residual signal is a difference between an original audio signal and a reconstructed version of the original audio signal from a Code Excited Linear Prediction (CELP)-based encoding layer 1302.
  • CELP Code Excited Linear Prediction
  • the index may represent non-zero spectral lines in a binary string in fewer bits than the length of the binary string.
  • the obtained index may represent positions of spectral lines within a binary string, the positions of the spectral lines being encoded based a combinatorial formula:
  • the index is decoded by reversing a combinatorial position coding technique used to encode the plurality of transform spectrum spectral lines 1304.
  • a version of the residual signal is synthesized using the decoded plurality of transform spectrum spectral lines at an Inverse Discrete Cosine Transform (IDCT)-type inverse transform layer 1306.
  • Synthesizing a version of the residual signal may include applying an inverse DCT-type transform to the transform spectrum spectral lines to produce a time-domain version of the residual signal.
  • Decoding the transform spectrum spectral lines may include decoding positions of a selected subset of spectral lines based on representing spectral line positions using the combinatorial position coding technique for non-zero spectral lines positions.
  • the DCT-type inverse transform layer may be an Inverse Modified Discrete Cosine Transform (IMDCT) layer and the transform spectrum is an MDCT spectrum.
  • IMDCT Inverse Modified Discrete Cosine Transform
  • a CELP-encoded signal encoding the original audio signal may be received 1308.
  • the CELP-encoded signal may be decoded to generate a decoded signal 1310.
  • the decoded signal may be combined with the synthesized version of the residual signal to obtain a (higher-fidelity) reconstructed version of the original audio signal 1312.
  • a process is terminated when its operations are completed.
  • a process may correspond to a method, a function, a procedure, a subroutine, a subprogram, etc.
  • a process corresponds to a function
  • its termination corresponds to a return of the function to the calling function or the main function.
  • various examples may employ a general purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array signal (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components or any combination thereof designed to perform the functions described herein.
  • a general purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller or state machine.
  • a processor may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core or any other such configuration.
  • various examples may employ firmware, middleware or microcode.
  • the program code or code segments to perform the necessary tasks may be stored in a computer-readable medium such as a storage medium or other storage(s).
  • a processor may perform the necessary tasks.
  • a code segment may represent a procedure, a function, a subprogram, a program, a routine, a subroutine, a module, a software package, a class, or any combination of instructions, data structures, or program statements.
  • a code segment may be coupled to another code segment or a hardware circuit by passing and/or receiving information, data, arguments, parameters, or memory contents. Information, arguments, parameters, data, etc. may be passed, forwarded, or transmitted via any suitable means including memory sharing, message passing, token passing, network transmission, etc.
  • a component may be, but is not limited to being, a process running on a processor, a processor, an object, an executable, a thread of execution, a program, and/or a computer.
  • an application running on a computing device and the computing device can be a component.
  • One or more components can reside within a process and/or thread of execution and a component may be localized on one computer and/or distributed between two or more computers.
  • these components can execute from various computer readable media having various data structures stored thereon.
  • the components may communicate by way of local and/or remote processes such as in accordance with a signal having one or more data packets (e.g., data from one component interacting with another component in a local system, distributed system, and/or across a network such as the Internet with other systems by way of the signal).
  • the functions described may be implemented in hardware, software, firmware, or any combination thereof. If implemented in software, the functions may be stored on or transmitted over as one or more instructions or code on a computer-readable medium.
  • Computer-readable media includes both computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another.
  • a storage media may be any available media that can be accessed by a computer.
  • such computer-readable media can comprise RAM, ROM, EEPROM, CD- ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer.
  • any connection is properly termed a computer-readable medium.
  • Disk and disc includes compact disc (CD), laser disc, optical disc, digital versatile disc (DVD), floppy disk and blu-ray disc where disks usually reproduce data magnetically, while discs reproduce data optically with lasers. Combinations of the above should also be included within the scope of computer-readable media.
  • Software may comprise a single instruction, or many instructions, and may be distributed over several different code segments, among different programs and across multiple storage media.
  • An exemplary storage medium may be coupled to a processor such that the processor can read information from, and write information to, the storage medium.
  • the storage medium may be integral to the processor.
  • the methods disclosed herein comprise one or more steps or actions for achieving the described method.
  • the method steps and/or actions may be interchanged with one another without departing from the scope of the claims.
  • the order and/or use of specific steps and/or actions may be modified without departing from the scope of the claims.
  • FIGS. 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, and/or 13 may be rearranged and/or combined into a single component, step, or function or embodied in several components, steps, or functions. Additional elements, components, steps, and/or functions may also be added.
  • the apparatus, devices, and/or components illustrated in FIGS. 1, 2, 3, 4, 5, 8, 11 and 12 may be configured or adapted to perform one or more of the methods, features, or steps described in FIGS. 6-7 and 10-13.
  • the algorithms described herein may be efficiently implemented in software and/or embedded hardware.

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)

Abstract

L'invention concerne un codec vocal et audio extensible qui met en œuvre un encodage de spectre combinatoire. Un signal résiduel est obtenu à partir d'une couche d'encodage sur la base d'une prévision linéaire excitée par code (CELP), le signal résiduel étant une différence entre un signal audio d'origine et une version reconstituée du signal audio d'origine. Le signal résiduel est transformé au niveau d'une couche de transformation de type transformée en cosinus discrète (DCT) pour obtenir un spectre de transformation correspondant ayant une pluralité de lignes spectrales. Les lignes spectrales de spectre de transformation sont transformées en utilisant une technique de codage de position combinatoire. La technique de codage de position combinatoire comprend la génération d'un index lexicographique pour un sous-ensemble sélectionné de lignes spectrales, chaque index lexicographique représentant une parmi une pluralité de chaînes binaires possibles représentant les positions du sous-ensemble sélectionné de lignes spectrales. L'index lexicographique représente des lignes spectrales non nulles dans une chaîne binaire en moins de bits que la longueur de la chaîne binaire.
EP08843220.8A 2007-10-22 2008-10-22 Encodage vocal et audio a echelle variable utilisant un encodage combinatoire de spectre mdct Not-in-force EP2255358B1 (fr)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
US98181407P 2007-10-22 2007-10-22
US12/255,604 US8527265B2 (en) 2007-10-22 2008-10-21 Low-complexity encoding/decoding of quantized MDCT spectrum in scalable speech and audio codecs
PCT/US2008/080824 WO2009055493A1 (fr) 2007-10-22 2008-10-22 Encodage vocal et audio extensible utilisant un encodage combinatoire de spectre mdct

Publications (2)

Publication Number Publication Date
EP2255358A1 true EP2255358A1 (fr) 2010-12-01
EP2255358B1 EP2255358B1 (fr) 2013-07-03

Family

ID=40210550

Family Applications (1)

Application Number Title Priority Date Filing Date
EP08843220.8A Not-in-force EP2255358B1 (fr) 2007-10-22 2008-10-22 Encodage vocal et audio a echelle variable utilisant un encodage combinatoire de spectre mdct

Country Status (13)

Country Link
US (1) US8527265B2 (fr)
EP (1) EP2255358B1 (fr)
JP (2) JP2011501828A (fr)
KR (1) KR20100085994A (fr)
CN (2) CN102968998A (fr)
AU (1) AU2008316860B2 (fr)
BR (1) BRPI0818405A2 (fr)
CA (1) CA2701281A1 (fr)
IL (1) IL205131A0 (fr)
MX (1) MX2010004282A (fr)
RU (1) RU2459282C2 (fr)
TW (1) TWI407432B (fr)
WO (1) WO2009055493A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11276412B2 (en) 2017-09-20 2022-03-15 Voiceage Corporation Method and device for efficiently distributing a bit-budget in a CELP codec

Families Citing this family (58)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100647336B1 (ko) * 2005-11-08 2006-11-23 삼성전자주식회사 적응적 시간/주파수 기반 오디오 부호화/복호화 장치 및방법
ES2817906T3 (es) 2007-04-29 2021-04-08 Huawei Tech Co Ltd Método de codificación de impulsos de las señales de excitación
WO2010044593A2 (fr) 2008-10-13 2010-04-22 한국전자통신연구원 Appareil de codage/décodage de signal résiduel lpc de dispositif de codage vocal/audio unifié basé sur une transformée en cosinus discrète modifiée (mdct)
KR101649376B1 (ko) 2008-10-13 2016-08-31 한국전자통신연구원 Ｍｄｃｔ 기반 음성/오디오 통합 부호화기의 ｌｐｃ 잔차신호 부호화/복호화 장치
CN101931414B (zh) * 2009-06-19 2013-04-24 华为技术有限公司 脉冲编码方法及装置、脉冲解码方法及装置
EP2490216B1 (fr) * 2009-10-14 2019-04-24 III Holdings 12, LLC Codage de la parole par couches
JP5707410B2 (ja) 2009-10-20 2015-04-30 フラウンホッファー−ゲゼルシャフト ツァ フェルダールング デァ アンゲヴァンテン フォアシュンク エー．ファオ 前に復号されたスペクトル値のグループの検出を使用した、オーディオ符号器、オーディオ復号器、オーディオ情報を符号化するための方法、オーディオ情報を復号するための方法、および、コンピュータプログラム
JP5746974B2 (ja) * 2009-11-13 2015-07-08 パナソニック インテレクチュアル プロパティ コーポレーション オブアメリカＰａｎａｓｏｎｉｃ Ｉｎｔｅｌｌｅｃｔｕａｌ Ｐｒｏｐｅｒｔｙ Ｃｏｒｐｏｒａｔｉｏｎ ｏｆ Ａｍｅｒｉｃａ 符号化装置、復号装置およびこれらの方法
US9031835B2 (en) * 2009-11-19 2015-05-12 Telefonaktiebolaget L M Ericsson (Publ) Methods and arrangements for loudness and sharpness compensation in audio codecs
CN102081926B (zh) * 2009-11-27 2013-06-05 中兴通讯股份有限公司 格型矢量量化音频编解码方法和系统
JP5624159B2 (ja) 2010-01-12 2014-11-12 フラウンホーファーゲゼルシャフトツール フォルデルング デル アンゲヴァンテン フォルシユング エー．フアー． オーディオ符号化器、オーディオ復号器、オーディオ情報を符号化および復号するための方法、ならびに以前に復号されたスペクトル値のノルムに基づいてコンテキストサブ領域値を取得するコンピュータプログラム
EP3002752A1 (fr) * 2010-01-15 2016-04-06 LG Electronics, Inc. Procédé et appareil de traitement de signal audio
EP2357649B1 (fr) 2010-01-21 2012-12-19 Electronics and Telecommunications Research Institute Procédé et appareil pour décoder un signal audio
CN102918590B (zh) * 2010-03-31 2014-12-10 韩国电子通信研究院 编码方法和装置、以及解码方法和装置
WO2011142709A2 (fr) * 2010-05-11 2011-11-17 Telefonaktiebolaget Lm Ericsson (Publ) Procédé et dispositif de traitement de signaux audio
CN102299760B (zh) 2010-06-24 2014-03-12 华为技术有限公司 脉冲编解码方法及脉冲编解码器
CN102959873A (zh) * 2010-07-05 2013-03-06 日本电信电话株式会社 编码方法、解码方法、装置、程序及记录介质
US8924222B2 (en) * 2010-07-30 2014-12-30 Qualcomm Incorporated Systems, methods, apparatus, and computer-readable media for coding of harmonic signals
US8879634B2 (en) 2010-08-13 2014-11-04 Qualcomm Incorporated Coding blocks of data using one-to-one codes
US9208792B2 (en) 2010-08-17 2015-12-08 Qualcomm Incorporated Systems, methods, apparatus, and computer-readable media for noise injection
CN103650038B (zh) 2011-05-13 2016-06-15 三星电子株式会社 比特分配、音频编码和解码
CN103946918B (zh) * 2011-09-28 2017-03-08 Lg电子株式会社 语音信号编码方法、语音信号解码方法及使用其的装置
EP2733699B1 (fr) * 2011-10-07 2017-09-06 Panasonic Intellectual Property Corporation of America Dispositif et procédé de codage audio echelonnable
US8924203B2 (en) 2011-10-28 2014-12-30 Electronics And Telecommunications Research Institute Apparatus and method for coding signal in a communication system
BR112013026452B1 (pt) * 2012-01-20 2021-02-17 Fraunhofer-Gellschaft Zur Förderung Der Angewandten Forschung E.V. aparelho e método para codificação e decodificação de áudio empregando substituição sinusoidal
US9905236B2 (en) 2012-03-23 2018-02-27 Dolby Laboratories Licensing Corporation Enabling sampling rate diversity in a voice communication system
KR101398189B1 (ko) * 2012-03-27 2014-05-22 광주과학기술원 음성수신장치 및 음성수신방법
JP6096896B2 (ja) * 2012-07-12 2017-03-15 ノキア テクノロジーズ オーユー ベクトル量子化
EP2720222A1 (fr) * 2012-10-10 2014-04-16 Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. Appareil et procédé de synthèse efficace de sinusoïdes et balayages en utilisant des motifs spectraux
BR112015009352B1 (pt) * 2012-11-05 2021-10-26 Panasonic Intellectual Property Corporation Of America Dispositivo de codificação de fala/áudio, dispositivo de decodificação de fala/áudio, método de codificação de fala/áudio e método de decodificação de fala/áudio
MY189267A (en) 2013-01-29 2022-01-31 Fraunhofer Ges Forschung Apparatus and method for selecting one of a first encoding algorithm and a second encoding algorithm
CA2898024C (fr) * 2013-01-29 2018-09-11 Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V. Concept d'introduction de bruit
DK3098811T3 (en) 2013-02-13 2019-01-28 Ericsson Telefon Ab L M Blur of frame defects
KR102148407B1 (ko) * 2013-02-27 2020-08-27 한국전자통신연구원 소스 필터를 이용한 주파수 스펙트럼 처리 장치 및 방법
EP2936814B1 (fr) 2013-03-26 2018-03-14 Dolby Laboratories Licensing Corporation Encodage de contenu de vidéo quantifié perceptivement dans un codage vdr à couches multiples
PT3011555T (pt) 2013-06-21 2018-07-04 Fraunhofer Ges Forschung Reconstrução de uma estrutura de discurso
AU2014283393A1 (en) 2013-06-21 2016-02-04 Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V. Apparatus and method for improved concealment of the adaptive codebook in ACELP-like concealment employing improved pitch lag estimation
EP2830064A1 (fr) 2013-07-22 2015-01-28 Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. Appareil et procédé de décodage et de codage d'un signal audio au moyen d'une sélection de tuile spectrale adaptative
CN110634495B (zh) * 2013-09-16 2023-07-07 三星电子株式会社 信号编码方法和装置以及信号解码方法和装置
US10388293B2 (en) 2013-09-16 2019-08-20 Samsung Electronics Co., Ltd. Signal encoding method and device and signal decoding method and device
PL3058567T3 (pl) * 2013-10-18 2017-11-30 Telefonaktiebolaget Lm Ericsson (Publ) Kodowanie pozycji pików spektralnych
CN111009249B (zh) 2013-10-18 2021-06-04 弗劳恩霍夫应用研究促进协会 编码器/解码器、编码/解码方法和非瞬时性存储介质
JP5981408B2 (ja) * 2013-10-29 2016-08-31 株式会社Ｎｔｔドコモ 音声信号処理装置、音声信号処理方法、及び音声信号処理プログラム
KR101854297B1 (ko) 2013-10-31 2018-06-08 프라운호퍼 게젤샤프트 쭈르 푀르데룽 데어 안겐반텐 포르슝 에. 베. 시간 도메인 여기 신호를 기초로 하는 오류 은닉을 사용하여 디코딩된 오디오 정보를 제공하기 위한 오디오 디코더 및 방법
KR101941978B1 (ko) 2013-10-31 2019-01-24 프라운호퍼 게젤샤프트 쭈르 푀르데룽 데어 안겐반텐 포르슝 에. 베. 시간 도메인 여기 신호를 변형하는 오류 은닉을 사용하여 디코딩된 오디오 정보를 제공하기 위한 오디오 디코더 및 방법
CN104751849B (zh) 2013-12-31 2017-04-19 华为技术有限公司 语音频码流的解码方法及装置
WO2015122752A1 (fr) 2014-02-17 2015-08-20 삼성전자 주식회사 Procédé et appareil de codage de signal, et procédé et appareil de décodage de signal
KR20240008413A (ko) * 2014-02-17 2024-01-18 삼성전자주식회사 신호 부호화방법 및 장치와 신호 복호화방법 및 장치
CN107369453B (zh) * 2014-03-21 2021-04-20 华为技术有限公司 语音频码流的解码方法及装置
ES2976438T3 (es) 2014-04-17 2024-08-01 Voiceage Evs Llc Métodos, codificador y decodificador para codificación y decodificación predictiva lineal de señales de sonido tras la transición entre tramas que tienen diferentes velocidades de muestreo
EP2980797A1 (fr) 2014-07-28 2016-02-03 Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. Décodeur audio, procédé et programme d'ordinateur utilisant une réponse d'entrée zéro afin d'obtenir une transition lisse
KR102742778B1 (ko) 2014-07-28 2024-12-16 삼성전자주식회사 신호 부호화방법 및 장치와 신호 복호화방법 및 장치
FR3024582A1 (fr) 2014-07-29 2016-02-05 Orange Gestion de la perte de trame dans un contexte de transition fd/lpd
CN107004417B (zh) * 2014-12-09 2021-05-07 杜比国际公司 Mdct域错误掩盖
WO2016142002A1 (fr) 2015-03-09 2016-09-15 Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V. Codeur audio, décodeur audio, procédé de codage de signal audio et procédé de décodage de signal audio codé
US10504525B2 (en) * 2015-10-10 2019-12-10 Dolby Laboratories Licensing Corporation Adaptive forward error correction redundant payload generation
CN112669860B (zh) * 2020-12-29 2022-12-09 北京百瑞互联技术有限公司 一种增加lc3音频编解码有效带宽的方法及装置
WO2022158943A1 (fr) 2021-01-25 2022-07-28 삼성전자 주식회사 Appareil et procédé de traitement d'un signal audio multicanal

Family Cites Families (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH0969783A (ja) 1995-08-31 1997-03-11 Nippon Steel Corp オーディオデータ符号化装置
JP3849210B2 (ja) * 1996-09-24 2006-11-22 ヤマハ株式会社 音声符号化復号方式
US6263312B1 (en) * 1997-10-03 2001-07-17 Alaris, Inc. Audio compression and decompression employing subband decomposition of residual signal and distortion reduction
KR100335611B1 (ko) 1997-11-20 2002-10-09 삼성전자 주식회사 비트율 조절이 가능한 스테레오 오디오 부호화/복호화 방법 및 장치
US6782360B1 (en) * 1999-09-22 2004-08-24 Mindspeed Technologies, Inc. Gain quantization for a CELP speech coder
US6351494B1 (en) 1999-09-24 2002-02-26 Sony Corporation Classified adaptive error recovery method and apparatus
US6662154B2 (en) * 2001-12-12 2003-12-09 Motorola, Inc. Method and system for information signal coding using combinatorial and huffman codes
CN1266673C (zh) * 2002-03-12 2006-07-26 诺基亚有限公司 可伸缩音频编码的有效改进
CN100583241C (zh) * 2003-04-30 2010-01-20 松下电器产业株式会社 音频编码设备、音频解码设备、音频编码方法和音频解码方法
JP4603485B2 (ja) * 2003-12-26 2010-12-22 パナソニック株式会社 音声・楽音符号化装置及び音声・楽音符号化方法
JP4445328B2 (ja) 2004-05-24 2010-04-07 パナソニック株式会社 音声・楽音復号化装置および音声・楽音復号化方法
US7783480B2 (en) 2004-09-17 2010-08-24 Panasonic Corporation Audio encoding apparatus, audio decoding apparatus, communication apparatus and audio encoding method
JP5036317B2 (ja) 2004-10-28 2012-09-26 パナソニック株式会社 スケーラブル符号化装置、スケーラブル復号化装置、およびこれらの方法
CN101111887B (zh) 2005-02-01 2011-06-29 松下电器产业株式会社 可扩展编码装置和可扩展编码方法
JP5058152B2 (ja) * 2006-03-10 2012-10-24 パナソニック株式会社 符号化装置および符号化方法
US8711925B2 (en) * 2006-05-05 2014-04-29 Microsoft Corporation Flexible quantization
US7461106B2 (en) * 2006-09-12 2008-12-02 Motorola, Inc. Apparatus and method for low complexity combinatorial coding of signals
US9653088B2 (en) * 2007-06-13 2017-05-16 Qualcomm Incorporated Systems, methods, and apparatus for signal encoding using pitch-regularizing and non-pitch-regularizing coding

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See references of WO2009055493A1 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11276412B2 (en) 2017-09-20 2022-03-15 Voiceage Corporation Method and device for efficiently distributing a bit-budget in a CELP codec
US11276411B2 (en) 2017-09-20 2022-03-15 Voiceage Corporation Method and device for allocating a bit-budget between sub-frames in a CELP CODEC

Also Published As

Publication number Publication date
WO2009055493A1 (fr) 2009-04-30
TW200935402A (en) 2009-08-16
CA2701281A1 (fr) 2009-04-30
EP2255358B1 (fr) 2013-07-03
RU2459282C2 (ru) 2012-08-20
US8527265B2 (en) 2013-09-03
TWI407432B (zh) 2013-09-01
IL205131A0 (en) 2010-11-30
CN102968998A (zh) 2013-03-13
BRPI0818405A2 (pt) 2016-10-11
RU2010120678A (ru) 2011-11-27
CN101836251B (zh) 2012-12-12
JP2013178539A (ja) 2013-09-09
JP2011501828A (ja) 2011-01-13
AU2008316860B2 (en) 2011-06-16
CN101836251A (zh) 2010-09-15
AU2008316860A1 (en) 2009-04-30
MX2010004282A (es) 2010-05-05
KR20100085994A (ko) 2010-07-29
US20090234644A1 (en) 2009-09-17

Similar Documents

Publication Publication Date Title
AU2008316860B2 (en) Scalable speech and audio encoding using combinatorial encoding of MDCT spectrum
US8515767B2 (en) Technique for encoding/decoding of codebook indices for quantized MDCT spectrum in scalable speech and audio codecs
KR101344174B1 (ko) 오디오 신호 처리 방법 및 오디오 디코더 장치
Ragot et al. Itu-t g. 729.1: An 8-32 kbit/s scalable coder interoperable with g. 729 for wideband telephony and voice over ip
CA2923218C (fr) Extension de bande passante adaptative et son appareil
CN1890714B (zh) 一种优化的复合编码方法
CA2636493A1 (fr) Procede et dispositif pour codage et decodage de signal
WO2004059618A1 (fr) Procede et dispositif pour une quantification fiable d'un vecteur de prediction de parametres de prediction lineaire dans un codage vocal a debit binaire variable

Legal Events

Date Code Title Description
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

17P Request for examination filed

Effective date: 20100813

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MT NL NO PL PT RO SE SI SK TR

AX Request for extension of the european patent

Extension state: AL BA MK RS

DAX Request for extension of the european patent (deleted)
17Q First examination report despatched

Effective date: 20110908

REG Reference to a national code

Ref country code: DE

Ref legal event code: R079

Ref document number: 602008025811

Country of ref document: DE

Free format text: PREVIOUS MAIN CLASS: G10L0019140000

Ipc: G10L0019240000

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

RIC1 Information provided on ipc code assigned before grant

Ipc: G10L 19/03 20130101ALI20130116BHEP

Ipc: G10L 19/24 20130101AFI20130116BHEP

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): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MT NL NO PL PT RO SE SI SK TR

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: AT

Ref legal event code: REF

Ref document number: 620165

Country of ref document: AT

Kind code of ref document: T

Effective date: 20130715

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602008025811

Country of ref document: DE

Effective date: 20130829

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

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: 20130703

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 620165

Country of ref document: AT

Kind code of ref document: T

Effective date: 20130703

REG Reference to a national code

Ref country code: NL

Ref legal event code: VDEP

Effective date: 20130703

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: 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: 20130703

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: 20130911

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: 20130703

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: 20131103

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: 20131104

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: 20130703

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: 20130703

Ref country code: BE

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: 20130703

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: 20131003

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: ES

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: 20131014

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: 20130703

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: 20130703

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: 20131004

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: 20130703

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: 20130703

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

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: 20130703

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

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: 20130703

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: 20130703

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: 20130703

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: 20130703

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: 20130703

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: IT

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: 20130703

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: 20130703

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

26N No opposition filed

Effective date: 20140404

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602008025811

Country of ref document: DE

Effective date: 20140404

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: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20131031

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20131031

REG Reference to a national code

Ref country code: FR

Ref legal event code: ST

Effective date: 20140630

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20131031

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: 20131022

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20140925

Year of fee payment: 7

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20141028

Year of fee payment: 7

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: 20130703

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

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: 20081022

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: 20130703

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20131022

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: 20130703

REG Reference to a national code

Ref country code: DE

Ref legal event code: R119

Ref document number: 602008025811

Country of ref document: DE

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 20151022

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20160503

Ref country code: GB

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20151022