EP1299879B1 - Codage et decodage d'un signal numerique - Google Patents

Codage et decodage d'un signal numerique Download PDF

Info

Publication number
EP1299879B1
EP1299879B1 EP01930394A EP01930394A EP1299879B1 EP 1299879 B1 EP1299879 B1 EP 1299879B1 EP 01930394 A EP01930394 A EP 01930394A EP 01930394 A EP01930394 A EP 01930394A EP 1299879 B1 EP1299879 B1 EP 1299879B1
Authority
EP
European Patent Office
Prior art keywords
samples
digital
quantization
digital samples
descriptions
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.)
Expired - Lifetime
Application number
EP01930394A
Other languages
German (de)
English (en)
Other versions
EP1299879A1 (fr
Inventor
Tina Abrahamsson
Soren Vang Andersen
Roar Hagen
W. Bastiaan Kleijn
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.)
Global IP Solutions GIPS AB
Global IP Solutions Inc
Original Assignee
Global IP Sound Europe AB
Global IP Sound 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 Global IP Sound Europe AB, Global IP Sound Inc filed Critical Global IP Sound Europe AB
Publication of EP1299879A1 publication Critical patent/EP1299879A1/fr
Application granted granted Critical
Publication of EP1299879B1 publication Critical patent/EP1299879B1/fr
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/38—Flow control; Congestion control by adapting coding or compression rate
    • 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
    • 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/005—Correction of errors induced by the transmission channel, if related to the coding algorithm
    • 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

Definitions

  • the present invention relates to encoding of a digital signal and its blocks of digital samples for transmission over a packet switched network.
  • the present invention further relates to decoding of a digital signal and its blocks of digital samples received from a packet switched network.
  • IP Internet Protocol
  • IP Internet Protocol
  • IP Internet Protocol
  • features include such things as relatively low operating costs, easy integration of new services, and one network for voice and data.
  • the speech or audio signal in packet switched systems is converted into a digital signal, i.e. into a bitstream, which is divided in portions of suitable size in order to be transmitted in data packets over the packet switched network from a transmitter end to a receiver end.
  • Packet switched networks were originally designed for transmission of non-real-time data and voice transmissions over such networks causes some problems. Data packets can be lost during transmission, as they can be deliberately discarded by the network due to congestion problems or transmission errors. In non-real-time applications this is not a problem since a lost packet can be retransmitted. However, retransmission is not a possible solution for real-time applications. A packet that arrives too late to a real-time application cannot be used to reconstruct the corresponding signal since this signal already has been, or should have been, delivered to the receiving speaker. Therefore, a packet that arrives too late is equivalent to a lost packet.
  • IP-network One characteristic of an IP-network is that if a packet arrives the content of it is undamaged.
  • An IP-packet has a header which includes a CRC (Cyclic Redundancy Check) field.
  • the CRC is used to check if the content of the packet is undamaged. If the CRC indicates an error, the packet is discarded. In other words, bit errors do not exist, only packet losses.
  • the main problem with lost or delayed data packets is the introduction of distortion in the reconstructed speech or audio signal.
  • the distortion results from the fact that signal segments conveyed by lost or delayed data packets cannot be reconstructed.
  • the speech coders in use today were originally designed for circuit switched networks with error free channels or with channels having bit-error characteristics. Therefore, a problem with these speech coders is that they do not handle packet losses very well.
  • Diversity is a method which increases robustness in transmission by spreading information in time (as in interleaving in mobile telephony) or over some physical entity (as when using multiple receiving antennas).
  • diversity is preferably introduced on a packet level by finding some way to create diversity between packets.
  • the simplest way of creating diversity in a packet switched network is to transmit the same packet payload twice in two different packets. In this way, a lost or delayed packet will not disturb the transmission of the payload information since another packet with identical payload, most probably, will be received in due time. It is evident that transmission of information in a diversity system will require more bandwidth than transmission of information in a regular system.
  • bandwidth most often is a limited resource, it would be desirable if a transmitted sound signal somehow could benefit from the additional bandwidth required by a diversity system. Preferably, it would be desirable if the additional bandwidth could be used for improving the quality of the decoded sound signal at the receiving end.
  • one or more headers are added to each data packet. These headers contain data fields with information about the destination of the packet, the sender address, the size of the data within the packet, as well as other packet transport related data fields.
  • the size of the headers added to the packets constitutes overhead information that must be taken into account.
  • the payload of the data packets have limited size.
  • the payload is the information within a packet which is used by an application.
  • the size of the payload compared to the size of the actually transmitted data packet with its included overhead information, is an important measure when considering the amount of available bandwidth.
  • a problem with transmitting several relatively small data packets is that the size of the headers will be substantial in comparison with the size of the information which is useful for the application. In fact, the size of the headers will not seldom be greater than the size of the useful information.
  • prediction is a common method in speech coding to improve coding efficiency, i.e. for decreasing the bit rate.
  • An example is the predictive coding technique for Differential PCM (DPCM) coders disclosed in "Digital Coding of Waveforms: Principles and Applications to Speech and Video", N.S. Jayant and P. Noll, Prentice Hall, ISBN 0-13-211913-7 01, 1984.
  • the prediction of a signal sample is computed by a predictor based on a previous quantized signal sample, i.e. the prediction is backward adaptive.
  • the computed prediction sample is then subtracted from the original sample which is to be predicted. The result of the subtraction is the error obtained when predicting the signal sample using the predictor.
  • This resulting prediction error is then quantized and transmitted to a receiving end.
  • the prediction error is added to a regenerated prediction signal from a predictor corresponding to the predictor at the transmitting end.
  • This combination of the received prediction error with a calculated prediction value will enable a reconstruction of the original signal sample at the receiver end.
  • This kind of coding leads to bit rate savings since redundancy is removed and the prediction error signal has lower power than the original signal, so that less bits are needed for the quantization of the error signal at a given noise level.
  • this kind of encoding/decoding of speech or audio over a packet switched network leads to error propagation if a packet is lost.
  • the prediction value calculated in the decoder will be based on samples of the last packet that was received. This will result in a prediction value in the decoder that differs from the corresponding prediction value in the encoder. Thus, the received quantized prediction error will be added to the wrong prediction value in the decoder. Hence, a lost packet will lead to error propagation. If one would consider to reset the prediction state after each transmitted/received packet, there would be no error propagation. However, this would lead to a low quality of the decoded signal.
  • the predictor state is set to zero, the result will be a low quality of the prediction value during encoding and, thus, the generation of a prediction error with more information content. This in turn will result in a low quality of the quantized signal with a high noise level since the quantizer is not adapted to quantize signals with such high information content.
  • all multiple descriptions could be constructed from the same predictor, thereby maintaining the optimized improvement from receiving multiple descriptions.
  • this prediction is from a predefined representation, e.g. a best representation obtained from a merger of all descriptions, then synchronization of the decoder with the encoder is lost if one (or more) description of the multiple descriptions is not received due to a packet loss when transmitting that description from the encoder at the transmitting end to the decoder at the receiving end.
  • An object of the present invention is to overcome at least some of the above-mentioned problems of using predictive coding/decoding for reducing the bandwidth required when transmitting a digitized sound signal over a packet switched network.
  • the present invention provides an advantageous way of encoding/decoding digital samples for transmission/reception over a packet switched network. This is performed by lossless encoding the digital samples, and lossless decoding of the corresponding code words, conditioned on generated prediction samples.
  • the output from the conditional lossless encoder is a function of two variables: the quantized digital sample and the prediction sample.
  • the output from the conditional lossless decoder is a function of two variables: the code word and the prediction sample.
  • Edge effects due to bad prediction values e.g. if a previous packet has been lost, will be alleviated since the lossless encoding still is continuously performed with respect to the quantized digital samples of the digital signal itself. In comparison, if the lossless encoding were performed with respect to the prediction errors only, this would lead to severe edge effects. The reason for this is that a lost packet will imply that the predictor state is reset, or forced to zero, resulting in a great variance of the predictor error. Thus, signals with high information content will be present if a predictor state is forced to zero, or otherwise manipulated, in the beginning of a new block in order to avoid error propagation between different blocks of digital samples. In such a case the prediction error signal would basically be the original digital signal. However, with the solution according to the invention, this is alleviated since the lossless encoding and decoding still will be based on quantized digital signal samples and code words, respectively, conditioned by the prediction value rather than based on prediction errors only.
  • the present invention enables that the predictor state, in an embodiment, may be set to zero when generating predictions samples during lossless encoding/decoding of a beginning of a block of digital samples, thus alleviating the effect that lost packets have on error propagation when using predictions in the encoding/decoding process.
  • any quantization of the generated prediction samples are performed separately from the quantization of the digital samples.
  • the predictions may then, in an embodiment, be used in the index domain in the form of quantized indices during encoding/decoding of the digital signal.
  • One advantage of using predictions in this way is that the predictor can be configured to operate in the same way at the receiving end as at the transmitting end, and it will not be necessary to transmit any extra prediction information to the receiving end.
  • predictions based on the quantized digital samples may be generated directly as quantization indices of prediction samples, or as samples which are quantized after its generation using the same set of quantization levels as used for the quantized digital samples, or a completely different set of quantization levels.
  • the lossless encoding/decoding is conditioned by generated prediction sample by using these for selecting one out of several look-up tables with which quantized digital samples are losslessly encoded to code words, or code words are losslessly decoded to quantized digital samples.
  • the prediction used to condition the lossless encoding/decoding, can be complemented by, e.g., a coarsely quantized estimate of the signal or prediction error variance, or other coarsely quantized features extracted from the past of the signal.
  • a number of features can be extracted from the past of the signal, be coarsely quantized, and then used to condition a lossless encoder or decoder.
  • a lossless encoder/decoder can be independently optimized and used for each possible combination of indexes from the quantization of the extracted features.
  • Examples of useful features for the encoding of speech signals are: a quantized prediction; the quantizer index from not only one but from several previous samples in the signal; a quantized estimate of signal or prediction-error variance; an estimate for the direction of the waveform; and/or a voiced/unvoiced classification.
  • Some of the above features can be extracted per sample or per block of samples in the encoder and transmitted as side-information.
  • Waveform direction is an example of such a feature suitable for transmission as side-information, e.g., by use of a high-dimensional block code.
  • a voiced/unvoiced classification is another.
  • the side-information results in a product code for the lossless encoding.
  • the encoding of this product code can be made either sequentially or with analysis-by-synthesis.
  • the advantage of the bit rate reduction by lossless encoding/decoding based on predictions is less significant, and the bandwidth still a problem, if a very large overhead in the form of a header is added to the encoded information before transmission of the data packet. This problem will occur if multiple descriptions of the digital signal is used in order to obtain diversity, a problem which however is solved by the present invention.
  • the encoder/decoder of the present invention is a multiple description encoder/decoder, i.e. an encoder/decoder which generates/receives at least two different descriptions of a digital signal.
  • the multiple descriptions thereby provide multiple block descriptions for each block of digital samples.
  • the invention provides diversity based on multiple descriptions by transmitting/receiving different individual block descriptions of the same block of digital samples in different data packets at different time instances.
  • This so called time diversity provided by the delay between the block descriptions is particularly advantageous when a time localized bottleneck occurs in the packet switched network, since the chance of receiving at least one of the block descriptions of a certain block increases when the different block descriptions are transmitted at different points in time in different packets.
  • Preferably a predefined time interval between the transmissions of two individual block descriptions of the same block of digital samples is introduced.
  • block descriptions of different descriptions of the digital signal and relating to different blocks of digital samples are grouped together in the same packet. At least two consecutive blocks are represented by individual block descriptions from different descriptions of the digital signal. This is advantageous since it avoids the extra overhead required by the headers of the packets that transmit the different block descriptions for one and the same block of digital samples, while still only one block description of a specific block of digital samples is lost or delayed when a packet is lost or delayed.
  • lossless encoding/decoding is performed for each different block description individually. This will reduce the bit rate needed for the multiple descriptions that are transmitted. Furthermore, individual predictors of the same type are used for the different descriptions at the transmitting and the receiving end, respectively. This eliminates the problem of lost synchronization between an encoder and a decoder which otherwise can occur if a packet with a block description is lost when using a single predictor for the lossless encoding/decoding at the transmitting/receiving end.
  • the invention is suitable for a digital signal consisting of a digitized sound signal, in which case a block of digital samples corresponds to a sound segment of the digitized sound signal.
  • the digital signal is optionally an n-bit PCM encoded digitized sound signal.
  • a 64 kbit/s PCM signal in accordance with the standard G.711.
  • the n-bit PCM encoded signal description is transcoded by a multiple description encoder to at least two descriptions using fewer than n bits for its representation, e.g. two (n-1)-bit representations, three (n-1)-bit representations or four (n-2)-bit representations.
  • a multiple description decoder transcodes the received descriptions back to a single n-bit PCM encoded sound signal.
  • the transcoding corresponds to a translation between a code word of one description and respective code words of at least two different descriptions.
  • the invention enables the use of predictive coding/decoding when using multiple descriptions for transmitting a digital signal, such as a digitized sound signal, over a packet switched network.
  • digital signal sample used herein is meant to be interpreted as either the actual sample or as any form of representation of the signal obtained or extracted from one or more of its samples.
  • a prediction sample is meant to be interpreted as either a prediction of an actual digital signal sample or as any form of prediction of a representation obtained or extracted from one or more of the digital signal samples.
  • a quantization level of a digital sample is either the index or the value of a quantized digital sample.
  • Fig. 1 one exemplifying way of realizing multiple descriptions of a source signal, such as a sound signal, is illustrated.
  • This approach is known in the art and is one example of multiple descriptions that can be used by the present invention.
  • other suitable ways of implementing multiple descriptions may equally well be used together with the present invention.
  • Fig. 1 the quantization levels of two different descriptions 100, 110 from two corresponding quantizers are shown. As illustrated, both descriptions have the same quantization step size Q, but description 110 has quantization levels that are shifted with half of the quantization step size Q with respect to the quantization levels of description 100. From these two descriptions 100 and 110, a combination leads to a combined description 120 with finer quantization step size Q/2.
  • bit rate R a bit rate of 2R is required to match the performance of a single fine quantizer with bit rate R+1. For example, if each description 100 and 110 has 4 quantization levels, each will require 2 bits to code these levels, i.e. a total of 4 bits. If a finer quantizer would be used for the combined description 120, the 7 quantization levels would require 3 bits when coded. For high R, this will constitute a significant increase of the bit rate when using two coarse quantizers for providing multiple descriptions instead of one finer quantizer providing a single description.
  • Fig. 2 a block diagram of the transmitting part of a system for transmission of sound over a packet switched network is shown.
  • the sound is picked up by a microphone 210 to produce an analog electric signal 215, which is sampled and quantized into digital format by an A/D converter 220.
  • the sampling rate of the sound signal is dependent on the source of the sound signal and the desired quality. Typically, the sampling rate is 8 or 16kHz for speech signals, and up to 48kHz for audio signals.
  • the quality of the digital signal is also affected by the accuracy of the quantizer of the A/D converter. For speech signals the accuracy is usually between 8 and 16 bits per sample.
  • the transmitting end includes a Sound Encoder 230 in order to compress the sampled digital signal further.
  • an additional purpose of the Sound Encoder 230 is to modify the representation of the sound signal before transmission, with the intent to increase the robustness against packet losses and delays in the packet switched network.
  • the sampled signal 225 is input to the Sound Encoder 230 which encodes the sampled signal and packetizes the obtained encoded signal into data packets.
  • the data packets 235 are then transferred to a Controller 240 which adds sequencing and destination address information to the data packets, in order to make the packets suitable for transmission over a packet switched network.
  • the data packets 245 are then transmitted over the packet switched network to a receiver end.
  • a Controller 350 receives data packets from the packet switched network, strips addressing information and places the data packets 355 in a Jitter buffer 360.
  • the Jitter buffer 360 is a storage medium, typically RAM, which regulates the rate by which data packets 365 exit the Jitter buffer 360.
  • the physical capacity of the jitter buffer is such that incoming data packets 355 can be stored.
  • Data packets 365 which exit the Jitter buffer 360 are inputted to a Sound Decoder 370.
  • the Sound Decoder 370 decodes the information in the data packets into reproduced samples of a digital sound signal.
  • the digital signal 375 is then converted by a D/A-converter 380 into an analog electric signal 385, which analog signal drives a sound reproducing system 390, e.g. a loudspeaker, to produce sound at the receiver end.
  • a Sound Encoder for encoding a digital signal at a transmitting end in accordance with an embodiment of the invention is shown.
  • the Sound Encoder includes a first Quantizer 400, a De-quantizer 410, a Delay block 420, a Predictor 430, a second Quantizer 440 and a Conditional Lossless Encoder 450.
  • the De-quantizer 410 and the second Quantizer 440 are depicted with dashed lines since they are not necessary elements of this embodiment. The use of these optional elements will be described later in an alternative embodiment.
  • a Sound Decoder for decoding a digital signal at a receiving end in accordance with an embodiment of the invention is shown.
  • the Sound Decoder includes a Conditional Lossless Decoder 455, a Quantizer 470, a Predictor 480, a Delay block 490 and De-quantizers 460 and 463.
  • the Quantizer 470 and the De-quantizer 463 are depicted with dashed lines since they are not necessary elements of this embodiment. The use of these optional elements will be described later in an alternative embodiment.
  • the purpose of performing lossless encoding/decoding by means of the Conditional Lossless Encoder 450 and the Conditional Lossless Decoder 455 is to find a less bit-consuming way to describe the data that is transmitted from the transmitting end to the receiving end without loosing any information.
  • Lossless encoding uses statistical information about the input signal to reduce the average bit rate. This is, e.g., performed in such way that the code words are ordered in a table after how often they occur in the input signal. The most common code words are then represented with fewer bits than the rest of the code words.
  • An example of a Lossless Encoder known in the art that uses this idea is the Huffman coder.
  • Lossless encoding only works well in networks without bit errors in the received data.
  • the code words used in connection with lossless encoding are of different length, and if a bit error occurs it is not possible to know when a code word ends and a new begin. Thus, a single bit error does not only introduce an error in the decoding of the current code word, but in the whole block of data.
  • IP Internet Protocol
  • the code words of an encoded block of quantized digital samples are losslessly decoded to quantized digital samples which then are de-quantized by De-quantizer 460 to a reconstructed original block of digital samples.
  • digital samples of a digital signal received from the A/D-converter are quantized by quantizer 400 into quantized digital samples.
  • a prediction sample is generated by Predictor 430 based on one or more previously quantized digital samples.
  • the predictor 430 generates for the prediction sample, possibly a quantization index thereof, based on the quantization levels, i.e. quantization indices or quantization values, for these previous, quantized digital samples, which levels have been outputted by the Quantizer 400 and delayed by the Delay block 420.
  • the prediction sample, or its quantization index is used for selecting one out of several look-up tables with code words within the Conditional Lossless Encoder 450.
  • the quantized level, such as the index, of the current quantized digital sample from Quantizer 400 is used to select a specific entry of the selected look-up table.
  • the Conditional Lossless Encoder will then output a code word corresponding to this specific entry of the selected table.
  • the code words of a complete encoded block of quantized digital samples are eventually assembled to a separate packet which is transferred to a Controller.
  • each code word of an encoded block is collected by the Controller and then assembled to a separate packet for the encoded block.
  • the Controller adds header information before transmitting the data packet over a packet switched network.
  • Fig. 4b the Sound Decoder corresponding to the embodiment of Fig. 4a is shown.
  • Packets with code words, or code words of disassembled packets are received from a Jitter buffer by the Conditional Lossless Decoder 455.
  • a prediction sample is generated by Predictor 480 based on one or more previous, quantized digital samples.
  • Predictor 480 at the receiving end is configured to operate in the same way as Predictor 430 at the transmitting end.
  • the configuration of these predictors is typically such that the predictor state is zero, or close to zero, when generating prediction samples corresponding to the initial quantized digital samples of a digital signal.
  • predictor 480 may generate a quantization index of a predictor sample based on the quantization levels, i.e. quantization indices or quantization values, of previous, quantized digital samples, which levels implicitly have been outputted by the Lossless Decoder 455 and delayed by the Delay block 490.
  • the generated prediction sample at the receiving end is used for selecting a look-up table, out of several tables, within the Conditional Lossless Decoder 455.
  • a code word received from the Jitter buffer is used to address a specific entry of the selected table, after which a corresponding quantized digital sample is outputted for de-quantization by a De-quantizer 460, after which the digital sample is transferred to a D/A-converter.
  • the Sound Encoder includes the De-quantizer 410 and/or the second Quantizer 440 as depicted in Fig. 4a.
  • the Sound Decoder in accordance with these alternative embodiments includes the Quantizer 470 and/or the De-quantizer 463.
  • De-quantizers 410 and 463 quantization values of quantized digital samples will be inputted to the Predictor 430 and 480 rather than quantization indices and the Predictors will generate prediction samples based on values rather than indices.
  • the Sound Encoder/Decoder will include Quantizers 440, 470 for providing quantization levels, e.g. indices, of the generated prediction samples.
  • quantization levels e.g. indices
  • a generated prediction sample corresponding to a digital sample of one block of digital samples should not be based on digital samples of a previous block.
  • this is achieved by setting a predictor state of Predictor 430 to zero before a new block with quantized digital samples is encoded.
  • the predictor state of Predictor 480 is set to zero before decoding a new block with quantized digital samples.
  • state information can be included in each block of digital samples, or, the encoding/decoding can follow a scheme which uses no or little state information when encoding/decoding the beginning of a block.
  • the Sound Encoder/Decoder of the present invention is designed to reduce the bit rate needed when transmitting a digital signal over a packet switched network.
  • the block of digital samples on which the Sound Encoder/Decoder operates on are preferably sound segments with digitized sound samples.
  • the present invention is not optimized for any specific kind of predictor.
  • one choice of predictor is the one obtained by LPC analysis of the quantized signal, eventually refined with a long-term predictor as is well known for a person skilled in the art.
  • non-linear predictors such as the one defined by the oscillator model disclosed in "Time-Scale Modification of Speech Based on a Non-linear Oscillator Model", G. Kubin and W. B. Kleijn, in Proc. Int. Conf . Acoust. Speech Sign. Process., (Adelaide), pp. I453-I456, 1994, can be used in the encoding/decoding scheme of the present invention.
  • the Sound Encoder/Decoder is further designed to increase the robustness against packet losses and delays in the packet switched network.
  • This design to increase the robustness relies on representing the sound signal, or any digital signal in the general case, with multiple descriptions.
  • This design is illustrated in Figs. 5a and 5b in accordance with an embodiment of the invention. Apart from what is being described below with respect to the sound encoding/decoding blocks, the overall operation correspond to that previously described with reference to Figs. 2 and 3.
  • the Sound Encoder 530 at the transmitting end includes a Multiple Description Encoder 510 and a Diversity Controller 520.
  • the Sound Decoder 570 of Fig. 5b at the receiving end includes a Diversity Controller 550 and a Multiple Description Decoder 580.
  • the Multiple Description Encoder 510 of the Sound Encoder 530 encodes a sampled sound signal 525 in two different ways, thereby obtaining two different bitstream representations, i.e. two different descriptions, of the sound signal.
  • each description has its own set of quantization levels, achieved, e.g., by shifting the quantization levels of one description with half a quantization step.
  • the quantization levels of the second description would be shifted with a third step with respect to the first description, and the third description with a third step with respect to the second description.
  • the sound signal may be encoded using more than two descriptions without departing from the scope of the present invention.
  • only two signal descriptions will be used in the herein disclosed embodiments of the invention.
  • Each description provides a segment description of an encoded sound signal segment of the sound signal.
  • the Multiple Description Encoder 510 generates each description and its segment descriptions by conditional lossless encoding of the digitized sound samples in accordance with what has previously been described with reference to Fig. 4a.
  • a respective set of all the elements shown in Fig. 4a will be present in a Multiple Description Encoder 410 referred to by Fig. 5a for each generated description.
  • a respective set of all the elements shown in Fig. 4b will be present for each description used in a Multiple Description Decoder referred to by Fig. 4b.
  • Fig. 5a the different segment descriptions of the same sound segment are transferred in respective packets to the Diversity Controller 520.
  • D 1 and D 2 two descriptions have been indicated, D 1 and D 2 .
  • the consecutive segments n, n+1, n+2, and so on, are represented by description D 1 as segment descriptions D 1 (n), D 1 (n+1), D 1 (n+2) ..., which segment descriptions are transferred in respective consecutive data packets 515, 516, 517 from the Multiple Description Encoder 510 to the Diversity Controller 520.
  • the same segments are also represented as segment descriptions D 2 (n), D 2 (n+1), D 2 (n+2) ...by description D 2 and are also transferred in respective data packets to the Diversity Controller.
  • each sound segment of the sound signal 625 is represented by one segment description of each description, e.g. in Fig. 5a sound segment n+1 is represented by segment description D 1 (n+1) of description D 1 and by segment description D 2 (n+1) of description D 2 .
  • the Diversity Controller 520 dispatches the packets received from the Multiple Description Encoder 510 in accordance with the diversity scheme used.
  • the Diversity Controller 520 sequences each segment description of one sound segment in separate packets.
  • the packets containing different segment descriptions of the same sound segment are transferred to the Controller 540 at different time instances.
  • the two segment descriptions D 1 (n) and D 2 (n) of sound segment n is delivered to the Controller 540 in separate packets 521 and 522 at different points of time t 1 and t 2 .
  • a delay of t 2 -t 1 is introduced to create time diversity.
  • a typical delay t 2 - t 1 that could be used, in connection with typical sound segment lengths of 20 ms, is 10 ms.
  • the Controller 540 formats the packet, such as adding sequencing and destination address information, for immediate transmission on the packet switched network.
  • the Controller 540 adds a header, H, with information to each packet.
  • the header size is 320 bits. For a typical speech segment length of 20 ms, this leads to 320 bits per 20 ms, i.e. to 16 kbit/s for the headers of each description used.
  • PCM Pulse Code Modulated
  • a Controller 350 removes header information and transfers the packets to the Jitter buffer 360, which in turn transfers the packets to the Sound Decoder 370.
  • the Diversity Controller 550 of the Sound Decoder 570 receives the packets with the different segment descriptions from a jitter buffer. The Diversity Controller then schedules the different segment descriptions of the same sound segment for transfer to the Multiple Description Decoder 580 at the same time.
  • the Multiple Description Decoder 580 will e.g.
  • the Multiple Description Decoder 580 will for each sound segment extract the joint information from the different packets and decode the sound signal segment for transfer to a D/A-converter.
  • the Diversity Controller 550 will only schedule D 2 (n) (if two descriptions are used) to the Multiple Description Decoder 580, which then will decode sound segment n of the sound signal with adequate quality from the single segment description D 2 (n) received.
  • Fig. 6 another embodiment of the present invention is shown. This embodiment differs from the one previously described with reference to Figs. 5a and 5b with respect to the organization of segment descriptions in the packets transmitted by the packet switched network. Thus, the difference lies in the packet assembling/disassembling performed at the transmitting/receiving end by the Diversity Controller of the Sound Encoder/Decoder. This difference will now be described below.
  • the overhead resulting from the headers of the different packets transferring different segment descriptions of the same sound segment is quite extensive.
  • segment descriptions of different descriptions and relating to different sound segments are grouped together in the same packet before transmission of the packet over the packet switched network.
  • the Diversity Controller 620 of the Sound Encoder at the transmitting end groups two individual segment descriptions of two consecutive sound segments together in each packet.
  • the two segment descriptions of a packet belong to respective descriptions of the sound signal. For example, one packet will contain segment description D 2 (n-1) of sound segment n-1 and segment description D 1 (n) of sound segment n.
  • the Controller 640 will as previously described add header information to each packet before transmitting the packet including the two segment descriptions over the packet switched network.
  • the Diversity Controller 620 of this embodiment will sequence each segment description of a sound segment in separate packets, and, as in the embodiment of Fig. 5, the packets containing different segment descriptions of the same sound segment will be transferred to the Controller 640 at different time instances.
  • the two segment descriptions D 2 (n) and D 1 (n+1) of sound segment n and n+1 are delivered to the Controller 640 in packet 622.
  • segment n+1 must have been encoded before segment description D 2 (n) can be transferred to the controller.
  • Segment description D 1 (n) on the other hand was transferred in a previous packet 621 to the controller.
  • the amount of payload data in one packet corresponds to the total amount of data generated from one sound segment, therefore, the overhead information is not increased when creating time diversity with this scheme.
  • the Diversity Controller at the receiver end in this embodiment will divide the received packets in their segment description parts before transferring the segment descriptions to the Multiple Description Decoder, in correspondence with what has been shown in Fig. 5b.
  • the Sound Encoder/Decoder encodes/decodes PCM indices of a standard 64 kbit/s PCM bitstream.
  • This embodiment is for ease of description described by again referring to Figs 4a and 4b.
  • the elements in respective Figs. 4a and 4b are present for each description generated/decoded by the Sound Encoder/Decoder.
  • the Quantizer 400 of Fig. 4a and De-quantizer 460 of Fig. 4b are exchanged with a respective Transcoder to be described below.
  • the Sound Encoder includes a PCM Encoder prior to its Transcoder and the Sound Decoder includes a PCM Decoder after its Transcoder.
  • the Sound Encoder again includes a Multiple Description Encoder feeding a Diversity Controller with multiple descriptions of one and the same sound segment.
  • the Sound Decoder includes a Multiple Description Decoder receiving multiple descriptions of one and the same sound segment from a Diversity Controller at the receiving end.
  • the Multiple Description Encoder of the Sound Encoder consists of an ordinary PCM Encoder followed by a Transcoder.
  • the digital signal received by the Sound Encoder from the A/D converter is encoded using an ordinary PCM Encoder.
  • the obtained PCM bitstream is then transcoded, i.e. translated, into several bitstreams by the Transcoder, after which each bitstream gives a coarse representation of the PCM signal.
  • the corresponding Multiple Description Decoder at the receiving end includes a Transcoder for transcoding received multiple bitstream descriptions to a single PCM bitstream.
  • This PCM bitstream is then decoded by an ordinary PCM Decoder before being transferred to a D/A-converter.
  • the method of transcoding, or translating is exemplified below where one 64 kbit/s PCM bitstream is transcoded into two bitstreams which provide multiple descriptions of the PCM signal.
  • a standard 64 kbit/s PCM Encoder using ⁇ -law log compression encodes the samples using 8 bits/sample. This gives 256 different code words, but the quantizer only consists of 255 different levels.
  • the zero-level is represented by two different code words to simplify the implementation in hardware.
  • each quantization level is represented by an integer index, starting with zero for the most negative level and up to 254 for the highest level.
  • the first of the two bitstreams is achieved by removing the least significant bit of each of the integer indices. This new index represents a quantization level in the first of the two coarse quantizers.
  • the second bitstream is achieved by adding one to each index before removing the least significant bit.
  • two 7-bit representations are achieved from the original 8-bit PCM representation.
  • Decoding of the two representations can either be performed on each individual representation, in case of packet loss, or on the two representations in which case the original PCM signal is reconstructed.
  • the decoding is simply a transcoding back into the PCM indices, followed by table look-up.
  • the PCM Encoder is a standard 64 kbit/s PCM Encoder using A-law log compression.
  • the number of levels in the quantizer is 256, which is one more than in a ⁇ -law coder.
  • each quantization level is represented by an integer index, starting with zero for the most negative level and up to 255 for the highest level.
  • index number 255 is represented with index number 126 for the first quantizer and index number 127 for the second instead of 128 and 127, which would be obtained if the rule would be followed.
  • the decoder has to check this index representation when transcoding the two bitstreams into the A-law PCM bitstream. If only the first of the two descriptions is received after transmission, and the 255 th index was encoded, the decoder will introduce a quantization error that is a little higher than for the other indices.
  • An encoded PCM signal includes a high degree of redundancy. Therefore, it is particularly advantageous to combine the use of PCM signals with lossless encoding/decoding of the multiple descriptions derived from a PCM signal.
  • the Multiple Description Encoder of the present invention receives the PCM bitstream and converts the PCM indices to the 0 to 254 representation described above. This representation is fed directly to the Transcoder, which transcodes the bitstream into two new bitstreams using the simple rules given above.
  • the information in the received packets are collected by the Diversity Controller. If all packets arrive the Transcoder merges and translates the information from the multiple descriptions back into the original PCM bitstream. If some packets are lost the original bitstream cannot be exactly reconstructed, but a good approximation is obtained from the descriptions that did arrive.

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Signal Processing (AREA)
  • Audiology, Speech & Language Pathology (AREA)
  • Computational Linguistics (AREA)
  • Health & Medical Sciences (AREA)
  • Human Computer Interaction (AREA)
  • Acoustics & Sound (AREA)
  • Multimedia (AREA)
  • Spectroscopy & Molecular Physics (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)
  • Reduction Or Emphasis Of Bandwidth Of Signals (AREA)

Claims (30)

  1. Procédé de codage d'un signal numérique et de ses blocs d'échantillons numériques en vue d'une transmission sur un réseau à commutation de paquets, le procédé comprenant les étapes consistant à :
    quantifier les représentations binaires des échantillons numériques selon des représentations plus approximatives des échantillons numériques ;
    générer des échantillons de prédiction en tant que représentations de point fixe ou de point flottant sur la base des échantillons numériques quantifiés précédents de ladite étape de quantification ; et
    coder sans perte les échantillons numériques quantifiés conditionnés sur les représentations de point fixe ou de point flottant des échantillons de prédiction générés.
  2. Procédé selon la revendication 1, dans lequel le codage sans perte des échantillons numériques quantifiés est basé sur des consultations de tables.
  3. Procédé selon la revendication 2, dans lequel les consultations de tables sont effectuées à l'aide d'un échantillon numérique quantifié afin de générer deux niveaux de limite de zone de quantification correspondant à l'échantillon numérique quantifié, dans lequel les niveaux, à l'aide de la valeur de prédiction commune générée et d'une autre table, sont mappés par rapport à une paire de valeurs de probabilité qui sont utilisées pour le codage sans perte de l'échantillon numérique quantifié.
  4. Procédé selon la revendication 1 ou 2, dans lequel ladite étape de codage sans perte destinée à un échantillon numérique quantifié spécifique comprend la sortie d'un mot de code spécifique qui correspond à une entrée spécifique d'une table avec des mots de code, ladite entrée spécifique étant dérivée à l'aide de l'échantillon de prédiction généré correspondant audit échantillon numérique quantifié spécifique.
  5. Procédé selon la revendication 4, dans lequel ladite table avec les mots de code est choisie parmi plusieurs tables avec des mots de code sur la base dudit échantillon de prédiction généré, dans lequel ladite entrée spécifique est dérivée comme l'entrée correspondant audit index de quantification dudit échantillon numérique quantifié.
  6. Procédé selon l'une quelconque des revendications 1 à 5, dans lequel ladite étape de génération d'échantillons de prédiction est précédée d'une dé-quantification des échantillons numériques quantifiés, fournissant ainsi les valeurs de quantification desdits échantillons numériques quantifiés.
  7. Procédé selon l'une quelconque des revendications 1 à 6, comprenant l'étape de quantification des échantillons de prédiction générés, dans lequel ladite étape de codage sans perte est basée sur des échantillons de prédiction générés possédant des niveaux de quantification d'un ensemble prédéfini de niveaux de quantification.
  8. Procédé selon l'une quelconque des revendications 1 à 7, comprenant l'étape de définition d'un état d'un prédicteur générant lesdits échantillons de prédiction comme étant nul avant de commencer à coder l'un desdits blocs avec des échantillons numériques.
  9. Procédé selon la revendication 7 ou 8, dans lequel ladite étape de codage sans perte est conditionnée sur les index de quantification desdits échantillons de prédiction générés.
  10. Procédé selon l'une quelconque des revendications 1 à 9, dans lequel ledit codage est effectué par un encodeur à descriptions multiples, ledit encodeur à description multiples codant chaque bloc desdits blocs d'échantillons numériques à l'aide des descriptions de blocs multiples en effectuant les étapes du procédé de codage individuellement pour chaque description de bloc générée.
  11. Procédé selon la revendication 10, comprenant l'étape supplémentaire de transmission, pour chaque bloc desdits blocs d'échantillons numériques, d'au moins deux descriptions de blocs différentes dans des paquets de données respectifs avec un intervalle de temps prédéfini entre les paquets.
  12. Procédé selon la revendication 11, comprenant le groupage d'une description de bloc respective d'au moins deux blocs différents d'échantillons numériques en vue d'une transmission dans un seul et même paquet.
  13. Procédé selon l'une quelconque des revendications 10 à 12, dans lequel ledit signal numérique est un signal sonore numérisé et lesdits blocs d'échantillons numériques sont des segments sonores, et dans lequel le procédé de codage dudit encodeur à descriptions multiples comprend une étape initiale de transcodage d'un signal sonore numérisé représenté par un PCM de n bit en au moins deux représentations représentées par moins de n bits chacune, et avec des ensembles respectifs de niveaux de quantification pour les descriptions de segments des segments sonores dudit signal sonore numérisé.
  14. Procédé selon l'une quelconque des revendications 1 à 12, dans lequel ledit signal numérique est un signal sonore numérisé et lesdits blocs d'échantillons numériques sont des segments sonores.
  15. Procédé de décodage d'un signal numérique et de ses blocs d'échantillons numériques reçus de la part d'un réseau à commutation de paquets, le procédé comprenant les étapes consistant à :
    générer des échantillons de prédiction en tant que représentations de point fixe ou de point flottant sur la base des échantillons numériques quantifiés précédents dudit signal numérique résultant d'un décodage sans perte de mots de code reçus ;
    décoder sans perte des mots de code reçus conditionnés sur les représentations de point fixe ou de point flottant des échantillons de prédiction générés ; et
    dé-quantifier les échantillons numériques quantifiés résultant de l'étape de décodage sans perte, en représentations binaires des échantillons numériques dudit signal numérique.
  16. Procédé selon la revendication 15, dans lequel le décodage sans perte des mots de code reçus est basé sur des consultations de tables.
  17. Procédé selon la revendication 16, dans lequel les mots de code reçus représentent des valeurs de probabilité, où deux valeurs de probabilité, à l'aide d'une valeur de prédiction générée et d'une table, sont mappées par rapport à deux niveaux de limite de zone de quantification d'un échantillon numérique quantifié correspondant, lesdits niveaux étant utilisés pour dériver l'échantillon numérique quantifié correspondant en effectuant des consultations de tables.
  18. Procédé selon la revendication 15 ou 16, dans lequel ladite étape de décodage sans perte destinée à un échantillon numérique quantifié spécifique comprend la sortie d'un niveau de quantification spécifique qui correspond à une entrée spécifique d'une table avec des niveaux de quantification, ladite entrée spécifique étant sélectionnée à l'aide d'un mot de code reçu correspondant audit échantillon numérique quantifié spécifique.
  19. Procédé selon la revendication 18, dans lequel ladite table avec des niveaux de quantification est choisie parmi plusieurs tables avec des niveaux de quantification, sur la base d'un échantillon de prédiction généré correspondant audit échantillon numérique quantifié spécifique.
  20. Procédé selon l'une quelconque des revendications 15 à 19, dans lequel ladite étape de génération d'échantillons de prédiction est précédée d'une dé-quantification des échantillons numériques quantifiés résultant de l'étape de décodage sans perte, fournissant ainsi les valeurs de quantification desdits échantillons numériques quantifiés.
  21. Procédé selon l'une quelconque des revendications 15 à 20, comprenant l'étape de quantification des échantillons de prédiction générés, dans lequel ladite étape de décodage sans perte est basée sur des échantillons de prédiction générés possédant des niveaux de quantification d'un ensemble prédéfini de niveaux de quantification.
  22. Procédé selon l'une quelconque des revendications 15 à 21, comprenant l'étape de définition d'un état d'un prédicteur générant lesdits échantillons de prédiction comme étant nul avant de commencer à décoder l'un desdits blocs avec des échantillons numériques.
  23. Procédé selon la revendication 21 ou 22, dans lequel ladite étape de décodage sans perte est conditionnée sur les index de quantification desdits échantillons de prédiction générés.
  24. Procédé selon l'une quelconque des revendications 15 à 23, dans lequel ledit décodage est effectué par un décodeur à descriptions multiples, ledit décodeur à descriptions multiples décodant chaque bloc desdits blocs d'échantillons numériques sur la base d'au moins deux descriptions de blocs reçues différentes, en effectuant les étapes du procédé de décodage précédant l'étape de dé-quantification de manière individuelle pour chaque description de bloc reçue.
  25. Procédé selon l'une quelconque des revendications 15 à 24, comprenant les étapes consistant à :
    attendre une période de temps prédéfmie en vue de la réception d'au moins deux paquets différents comprenant des descriptions de blocs différentes d'un seul et même bloc d'échantillons numériques ;
    réaliser les étapes du procédé de décodage précédant l'étape de dé-quantification par rapport aux descriptions de blocs différentes, uniques ou multiples, dudit bloc d'échantillons numériques reçu dans ladite période de temps prédéfinie ; et
    dé-quantifier la description de bloc ou un ensemble de plusieurs descriptions de blocs.
  26. Procédé selon la revendication 25, dans lequel chaque paquet reçu comprend plusieurs descriptions de blocs de plusieurs blocs différents d'échantillons numériques regroupés, le procédé comprenant l'étape de division de paquets reçus de manière successive par rapport aux descriptions de blocs incluses, fournissant ainsi plusieurs descriptions de blocs différentes pour chaque bloc d'échantillons numériques à décoder.
  27. Procédé selon l'une quelconque des revendications 25 à 26, dans lequel ledit signal numérique est un signal sonore numérisé et lesdits blocs d'échantillons numériques sont des segments sonores, et dans lequel ledit signal sonore numérisé est un flux binaire encodé PCM, et dans lequel tout regroupement de ladite étape de dé-quantification implique un transcodage d'au moins deux représentations de segments, représentée chacune par moins de n bits, en une seule représentation PCM de n bit dudit et unique segment de signal sonore.
  28. Procédé selon l'une quelconque des revendications 15 à 26, dans lequel ledit signal numérique est un signal sonore numérisé et lesdits blocs d'échantillons numériques sont des segments sonores.
  29. Support informatique possédant des instructions exécutables par un ordinateur pour réaliser chacune des étapes du procédé selon l'une quelconque des revendications 1 à 14 lorsqu'il est exécuté sur un ordinateur.
  30. Support informatique possédant des instructions exécutables par un ordinateur afin de réaliser chacune des étapes du procédé selon l'une quelconque des revendications 15 à 28 lorsqu'il est exécuté sur un ordinateur.
EP01930394A 2000-05-10 2001-05-10 Codage et decodage d'un signal numerique Expired - Lifetime EP1299879B1 (fr)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
SE0001728 2000-05-10
SE0001728A SE522261C2 (sv) 2000-05-10 2000-05-10 Kodning och avkodning av en digital signal
PCT/SE2001/001022 WO2001086636A1 (fr) 2000-05-10 2001-05-10 Codage et decodage d'un signal numerique

Publications (2)

Publication Number Publication Date
EP1299879A1 EP1299879A1 (fr) 2003-04-09
EP1299879B1 true EP1299879B1 (fr) 2006-07-19

Family

ID=20279622

Family Applications (1)

Application Number Title Priority Date Filing Date
EP01930394A Expired - Lifetime EP1299879B1 (fr) 2000-05-10 2001-05-10 Codage et decodage d'un signal numerique

Country Status (8)

Country Link
US (1) US6970479B2 (fr)
EP (1) EP1299879B1 (fr)
CN (1) CN1201289C (fr)
AT (1) ATE333696T1 (fr)
AU (1) AU2001256925A1 (fr)
DE (1) DE60121592T2 (fr)
SE (1) SE522261C2 (fr)
WO (1) WO2001086636A1 (fr)

Families Citing this family (27)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP3415126B2 (ja) * 2001-09-04 2003-06-09 三菱電機株式会社 可変長符号多重化装置、可変長符号分離装置、可変長符号多重化方法及び可変長符号分離方法
US6882685B2 (en) * 2001-09-18 2005-04-19 Microsoft Corporation Block transform and quantization for image and video coding
JP4027318B2 (ja) * 2001-11-27 2007-12-26 シーメンス アクチエンゲゼルシヤフト 少なくとも２つの加入者端末機器間において異なる符号化規則に従って形成された有効情報を交換する方法
SE521600C2 (sv) * 2001-12-04 2003-11-18 Global Ip Sound Ab Lågbittaktskodek
US7408918B1 (en) * 2002-10-07 2008-08-05 Cisco Technology, Inc. Methods and apparatus for lossless compression of delay sensitive signals
US7313236B2 (en) * 2003-04-09 2007-12-25 International Business Machines Corporation Methods and apparatus for secure and adaptive delivery of multimedia content
TWI236819B (en) * 2003-07-18 2005-07-21 Hon Hai Prec Ind Co Ltd A network telephony system and method
US7738554B2 (en) 2003-07-18 2010-06-15 Microsoft Corporation DC coefficient signaling at small quantization step sizes
US10554985B2 (en) 2003-07-18 2020-02-04 Microsoft Technology Licensing, Llc DC coefficient signaling at small quantization step sizes
WO2005033198A1 (fr) * 2003-10-07 2005-04-14 Coloplast A/S Composition utilisee en tant qu'adhesif et son utilisation
US7411528B2 (en) * 2005-07-11 2008-08-12 Lg Electronics Co., Ltd. Apparatus and method of processing an audio signal
GB2436191B (en) * 2006-03-14 2008-06-25 Motorola Inc Communication Unit, Intergrated Circuit And Method Therefor
EP1855271A1 (fr) * 2006-05-12 2007-11-14 Deutsche Thomson-Brandt Gmbh Procédé et appareil pour le recodage de signaux
US8856371B2 (en) 2006-08-07 2014-10-07 Oovoo Llc Video conferencing over IP networks
US9635315B2 (en) 2006-08-07 2017-04-25 Oovoo Llc Video conferencing over IP networks
US8557393B2 (en) * 2006-10-31 2013-10-15 Exxonmobil Chemical Patents Inc. Adhesive thermoplastic vulcanizates
KR101299155B1 (ko) * 2006-12-29 2013-08-22 삼성전자주식회사 오디오 부호화 및 복호화 장치와 그 방법
US8942289B2 (en) * 2007-02-21 2015-01-27 Microsoft Corporation Computational complexity and precision control in transform-based digital media codec
US7844539B2 (en) * 2007-03-02 2010-11-30 Chicago Board Options Exchange, Incorporated Hybrid trading system for concurrently trading combined orders for financial instruments through both electronic and open-outcry trading mechanisms
US8418032B2 (en) * 2007-12-10 2013-04-09 France Telecom Processing of bit errors in a digital audio bit frame
US8855211B2 (en) * 2008-01-22 2014-10-07 At&T Intellectual Property I, Lp Method and apparatus for managing video transport
JP2011024066A (ja) * 2009-07-17 2011-02-03 Sony Corp 画像処理装置および方法
EP2610865B1 (fr) * 2010-08-23 2014-07-23 Panasonic Corporation Dispositif de traitement de signal audio et procédé de traitement de signal audio
US8818797B2 (en) * 2010-12-23 2014-08-26 Microsoft Corporation Dual-band speech encoding
US9325639B2 (en) 2013-12-17 2016-04-26 At&T Intellectual Property I, L.P. Hierarchical caching system for lossless network packet capture applications
CN117957781A (zh) * 2021-09-27 2024-04-30 高通股份有限公司 高效的分组丢失保护数据编码和/或解码
CN116193156A (zh) * 2022-12-30 2023-05-30 北京天兵科技有限公司 航天遥测码流地面传输分组压缩编码方法、装置和系统

Family Cites Families (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4726019A (en) * 1986-02-28 1988-02-16 American Telephone And Telegraph Company, At&T Bell Laboratories Digital encoder and decoder synchronization in the presence of late arriving packets
JP2783534B2 (ja) * 1986-11-13 1998-08-06 キヤノン株式会社 符号化装置
US6006174A (en) * 1990-10-03 1999-12-21 Interdigital Technology Coporation Multiple impulse excitation speech encoder and decoder
FR2700632B1 (fr) * 1993-01-21 1995-03-24 France Telecom Système de codage-décodage prédictif d'un signal numérique de parole par transformée adaptative à codes imbriqués.
KR950008637B1 (ko) * 1993-04-08 1995-08-03 삼성전자주식회사 부밴드 코딩시스템의 신호처리장치
US5528625A (en) * 1994-01-03 1996-06-18 At&T Corp. High speed quantization-level-sampling modem with equalization arrangement
GB9509831D0 (en) * 1995-05-15 1995-07-05 Gerzon Michael A Lossless coding method for waveform data
JP2856185B2 (ja) * 1997-01-21 1999-02-10 日本電気株式会社 音声符号化復号化システム
GB2323754B (en) * 1997-01-30 2002-03-20 Peter Graham Craven Lossless compression using iir prediction filters
US6009387A (en) * 1997-03-20 1999-12-28 International Business Machines Corporation System and method of compression/decompressing a speech signal by using split vector quantization and scalar quantization
US6463410B1 (en) * 1998-10-13 2002-10-08 Victor Company Of Japan, Ltd. Audio signal processing apparatus
IL129752A (en) * 1999-05-04 2003-01-12 Eci Telecom Ltd Telecommunication method and system for using same

Also Published As

Publication number Publication date
CN1201289C (zh) 2005-05-11
ATE333696T1 (de) 2006-08-15
SE0001728L (sv) 2001-12-28
DE60121592D1 (de) 2006-08-31
US20020018490A1 (en) 2002-02-14
EP1299879A1 (fr) 2003-04-09
SE522261C2 (sv) 2004-01-27
AU2001256925A1 (en) 2001-11-20
WO2001086636A1 (fr) 2001-11-15
CN1436347A (zh) 2003-08-13
DE60121592T2 (de) 2007-06-28
US6970479B2 (en) 2005-11-29
SE0001728D0 (sv) 2000-05-10

Similar Documents

Publication Publication Date Title
EP1299879B1 (fr) Codage et decodage d'un signal numerique
EP1290835B1 (fr) Transmission sur des reseaux a commutation par paquets
JP3542610B2 (ja) オーディオ信号処理装置およびオーディオ情報データ・フレーム処理方法
Jayant et al. Effects of packet losses in waveform coded speech and improvements due to an odd-even sample-interpolation procedure
US7286562B1 (en) System and method for dynamically changing error algorithm redundancy levels
KR100919868B1 (ko) 패킷 손실 보상
US6366888B1 (en) Technique for multi-rate coding of a signal containing information
JPH047616B2 (fr)
JPH04127747A (ja) 可変レート符号化方式
JPH045200B2 (fr)
EP1946517A1 (fr) Format de paquets de donnees audio, procede de decodage de celui-ci, procede de correction d'erreur de configuration de codec de terminal de communication mobile et terminal de communication mobile mettant en oeuvre ce procede
JP2002221994A (ja) 音声信号の符号列のパケット組立方法、装置及びパケット分解方法、装置並びにこれらの方法を実行するプログラム、プログラムを記録する記録媒体
US20040054529A1 (en) Transmitter and receiver for speech coding and decoding by using additional bit allocation method
US5799272A (en) Switched multiple sequence excitation model for low bit rate speech compression
Jayant et al. Adaptive aperture coding for speech waveforms—I
US5956320A (en) Cell assembling/disassembling system for asynchronous transfer mode network
Steele et al. Variable-length packetization of µ-law PCM speech
JPH0525207B2 (fr)
JPS59123892A (ja) 音声符号化装置
JPH0250654A (ja) 音声パケット化装置
Clüver et al. Multiple-description coding of logarithmic PCM
JPS6251827A (ja) 音声符号化方式
JP2000315098A (ja) 音声データ処理装置
JPH02148926A (ja) 予測符号化方式
Buchanan et al. Speech and Audio Signals

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

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE TR

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE TR

AX Request for extension of the european patent

Extension state: AL LT LV MK RO SI

RIN1 Information on inventor provided before grant (corrected)

Inventor name: KLEIJN, W., BASTIAAN

Inventor name: HAGEN, ROAR

Inventor name: ABRAHAMSSON, TINA

Inventor name: VANG ANDERSEN, SOREN

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: GLOBAL IP SOUND EUROPE AB

Owner name: GLOBAL IP SOUND INC.

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: 7G 10L 19/14 A

Ipc: 7H 04L 12/56 B

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 CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE TR

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;WARNING: LAPSES OF ITALIAN PATENTS WITH EFFECTIVE DATE BEFORE 2007 MAY HAVE OCCURRED AT ANY TIME BEFORE 2007. THE CORRECT EFFECTIVE DATE MAY BE DIFFERENT FROM THE ONE RECORDED.

Effective date: 20060719

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

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

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

Ref country code: CH

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

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

Ref country code: LI

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

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REF Corresponds to:

Ref document number: 60121592

Country of ref document: DE

Date of ref document: 20060831

Kind code of ref document: P

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

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

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

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

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

NLV1 Nl: lapsed or annulled due to failure to fulfill the requirements of art. 29p and 29m of the patents act
ET Fr: translation filed
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

26N No opposition filed

Effective date: 20070420

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

Ref country code: MC

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

Effective date: 20070531

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

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

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

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

Ref country code: LU

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

Effective date: 20070510

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

REG Reference to a national code

Ref country code: DE

Ref legal event code: R082

Ref document number: 60121592

Country of ref document: DE

Representative=s name: GRUENECKER, KINKELDEY, STOCKMAIR & SCHWANHAEUS, DE

REG Reference to a national code

Ref country code: FR

Ref legal event code: TP

Owner name: GOOGLE INC., US

Effective date: 20120626

REG Reference to a national code

Ref country code: GB

Ref legal event code: 732E

Free format text: REGISTERED BETWEEN 20120712 AND 20120718

REG Reference to a national code

Ref country code: GB

Ref legal event code: 732E

Free format text: REGISTERED BETWEEN 20120809 AND 20120815

REG Reference to a national code

Ref country code: DE

Ref legal event code: R081

Ref document number: 60121592

Country of ref document: DE

Owner name: GOOGLE, INC., US

Free format text: FORMER OWNER: GLOBAL IP SOUND EUROPE AB, GLOBAL IP SOUND INC., , US

Effective date: 20120725

Ref country code: DE

Ref legal event code: R082

Ref document number: 60121592

Country of ref document: DE

Representative=s name: GRUENECKER, KINKELDEY, STOCKMAIR & SCHWANHAEUS, DE

Effective date: 20120725

Ref country code: DE

Ref legal event code: R082

Ref document number: 60121592

Country of ref document: DE

Representative=s name: GRUENECKER PATENT- UND RECHTSANWAELTE PARTG MB, DE

Effective date: 20120725

Ref country code: DE

Ref legal event code: R081

Ref document number: 60121592

Country of ref document: DE

Owner name: GOOGLE, INC., MOUNTAIN VIEW, US

Free format text: FORMER OWNER: GLOBAL IP SOUND EUROPE AB, GLOBAL IP SOUND INC., , US

Effective date: 20120725

Ref country code: DE

Ref legal event code: R081

Ref document number: 60121592

Country of ref document: DE

Owner name: GOOGLE, INC., MOUNTAIN VIEW, US

Free format text: FORMER OWNERS: GLOBAL IP SOUND EUROPE AB, STOCKHOLM, SE; GLOBAL IP SOUND INC., SAN FRANCISCO, CALIF., US

Effective date: 20120725

Ref country code: DE

Ref legal event code: R081

Ref document number: 60121592

Country of ref document: DE

Owner name: GOOGLE LLC (N.D.GES.D. STAATES DELAWARE), MOUN, US

Free format text: FORMER OWNERS: GLOBAL IP SOUND EUROPE AB, STOCKHOLM, SE; GLOBAL IP SOUND INC., SAN FRANCISCO, CALIF., US

Effective date: 20120725

REG Reference to a national code

Ref country code: GB

Ref legal event code: 732E

Free format text: REGISTERED BETWEEN 20120823 AND 20120829

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 16

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 17

REG Reference to a national code

Ref country code: DE

Ref legal event code: R082

Ref document number: 60121592

Country of ref document: DE

Representative=s name: GRUENECKER PATENT- UND RECHTSANWAELTE PARTG MB, DE

Ref country code: DE

Ref legal event code: R081

Ref document number: 60121592

Country of ref document: DE

Owner name: GOOGLE LLC (N.D.GES.D. STAATES DELAWARE), MOUN, US

Free format text: FORMER OWNER: GOOGLE, INC., MOUNTAIN VIEW, CALIF., US

REG Reference to a national code

Ref country code: FR

Ref legal event code: CA

Effective date: 20180213

Ref country code: FR

Ref legal event code: CD

Owner name: GOOGLE LLC, US

Effective date: 20180213

Ref country code: FR

Ref legal event code: CJ

Effective date: 20180213

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 18

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

Ref country code: DE

Payment date: 20200528

Year of fee payment: 20

Ref country code: FR

Payment date: 20200525

Year of fee payment: 20

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

Ref country code: GB

Payment date: 20200527

Year of fee payment: 20

REG Reference to a national code

Ref country code: DE

Ref legal event code: R071

Ref document number: 60121592

Country of ref document: DE

REG Reference to a national code

Ref country code: GB

Ref legal event code: PE20

Expiry date: 20210509

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

Ref country code: GB

Free format text: LAPSE BECAUSE OF EXPIRATION OF PROTECTION

Effective date: 20210509

P01 Opt-out of the competence of the unified patent court (upc) registered

Effective date: 20230516