ENCODING AND DECODING OF A DIGITAL SIGNAL

Abstract: The invention relates to methods for encoding/decoding of a digital signal which is transmitted over a packet switched network. Prediction samples are generated at the transmitting and receiving end. The digital signal is lossless encoded at the transmitting end, and lossless decoded at the receiving end, conditioned on the generated prediction samples.

Description: ENCODING AND DECODING OF A DIGITAL SIGNAL Technical field of the invention The present invention relates to encoding of a digital signal and its blocks of digital samples for transmission over a packet switched network. Consequently, the present invention further relates to decoding of a digital signal and its blocks of digital samples received from a packet switched network. Technical background and prior art Telephony over packet switched networks, such as IP (Internet Protocol) based networks (mainly the Internet or Intranet networks) has become increasingly attractive due to a number of features . These 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-realtime 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. 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 . Considering what has been described above as well as other particulars of a packet switched network, there are problems connected with how to provide the same quality in telephony over packet switched networks as in ordinary telephony over circuit switched networks. In order to solve these problems, the characteristics of a packet switched network have to be taken into consideration. In order to overcome the problems associated with lost or delayed data packets during real-time transmissions, it is suitable to introduce diversity for the transmission over the packet switched network. 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) . In packet transmission, 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. Many of the diversity schemes or diversity systems in the prior art have the disadvantage that the transmission of a sound signal does not benefit from the additional bandwidth needed by the transmitted redundant information under normal operating conditions. Thus, for most of the time, when there are no packet losses or delays, the additional bandwidth will merely be used for transmission of overhead information. Since 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. In "Design of Multiple Description Scalar Quantizers", V. A. Vaishampayan, IEEE Transactions on Information Theory, Vol. 39, No .3 , May 1993, the use of multiple descriptions in a diversity system is disclosed. The encoder sends two different descriptions of the same source signal over two different channels, and the decoder reconstructs the source signal based on information received from the channel (s) that are currently working. Thus, the quality of the reconstructed signal will be based on one description if only one channel is working. If both channels work, the reproduced source signal will be based on two descriptions and higher quality will be obtained at the receiving end. In the article, the author addresses the problem of index assignment in order to maximize the benefit of multiple descriptions in a diversity system. In a system that transmits data over packet switched networks, 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. To keep the packet assembling delay of data packets small, 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. To alleviate bandwidth problems, it is desirable to reduce the bit rate by suitable coding of the information to be transmitted. One scheme frequently used is to code information data using predictions of the data. These predictions are generated based on previous information data of the same information signal. However, due to the phenomenon that packets can be lost during transmission, it is not a good idea to insert dependencies between different packets. If a packet is lost and the reconstruction of a following information segment is dependent on the information contained in the lost packet, then the reconstruction of the following information segment will suffer. It is important that this type of error propagation is avoided. Therefore the HI Φ 03 Hi rt H Ω 0 13 rt 13 13 Λ 13 0 13 03 tr 13 03 K rt — rt rt Ω μ- s; μ- 3 ? 0 0 0 ii 13 Φ o * Φ O hj K !-T ii ii φ £ ii tr ii C pi ii μ- 0 ) 0 6 Φ 3- 0 3 tr 3 0 μ- Hi h ft ii Φ <! ii OJ 3 . H- Φ Φ Φ Φ Ω 0 ) Φ r Φ tr Ω Φ CQ h- 1 μ- Ω Φ Pi Hi Φ S3 3 Pi 0 Φ φ a 0 H- IQ i Pi φ 3 Pi 0i Pi rt < 3 h- 1 crj CQ tr μ- 0 3 3 J Pi 0 ) μ- ϋ >1 Ω rr <! 3 H- μ- ii H- H- H- rt μ- μ- μ- H $. μ- 0 ) ^ 13 μ- 3 tr 3 ϋ 0 Pi 3 Φ U • tr rt Φ CQ 3 Ω Φ Ω Ω <! μ- Ω 3 Ω OJ 0i O h- 1 Φ rt μ- μ- CQ H 3 rt s: 0 03 0J Ω 13 in Φ P Pi rt Ω rt rt φ ISl rt Φ rt Ω H £ H Φ 0i >Q rt tr OJ ii h- 1 Hi TJ ii Φ i 0 φ h- 1 H- Φ O H- hi φ O Pi Φ rt Pi 03 03 cn Ω h-< C rt Φ rt ) rt Φ Φ •<; H- 0 hj 03 & PJ Φ O H- ii 0 i hi i Φ 0 ) ro tr Φ ϋ 0 μ- 3 0 OJ rt Φ <! 13 rr 0 a 0 ) 03 3 <! 3 rt • Z Pi O (b 3 ≥! O Pi S3 0 CQ i ii Ω ^ Φ 0> 0J 0 ) PJ H ^ . H- Φ 0J 3 J 0 ) a j Pi £ 13 0 ) 0 Hi rt μ- 03 3 3 13 0i tr ) CQ £ rt a H- CQ Q < Pi rr CQ φ 3 m φ H Hi 01 01 o 3 i 0 Φ 3 Φ μ- ii rt 3 ^< 0> a- Φ rr CQ rt 3 01 H- Pi 3 * a 3 J ϋ 13 3 Φ 1 i μ- ii • 13 rt 0 0 03 0 rr H- Pi H- H- ϊf rt 01 I- 1 13 rt IO. 13 μ- Φ 0 rt rt 1 3 ii 0 rt < 3 ii 0 rf H- 0 N a Φ O I- 1 3 ϋ t 3 ii rt 03 13 3 μ- μ- μ- ω Q a > O Hi μ- μ- Φ μ- Hi tr 0 0 ) $31 0 ) Φ Φ φ 0 ) Φ i H ii < t CQ 1 μ- μ- 3 <! 3 i H 03 01 Φ a 0 tr rt H 13 tr 03 Pi Qi Oi hi Φ Φ rt Φ Φ t Pi 0 Hi Φ 13 CQ Φ i 03 S^ S^ <! 0 H- ϋ H- ) 3 H- rt H- 3 Φ i 03 3 J • i Ω M φ Hi Hi Φ ii 0 μ- Pi 03 3 H- Φ O CQ Φ rt 3 H- Ω hi Hi Ω CO CQ μ- £ Φ 0 1 0 Φ X Ω Φ Pi 13 o μ- μ- n Hi ii Φ a H- P 13 rt ) ii rt 3 C Ω h- 1 m 03 3 o 3 23 ii pi 0 & 0i H 3 0 3 Φ • CQ μ- H H- 3 o μ- μ- h- 1 rt rt 0 tr μ- 13 1 ^ 0 ) φ 3 Pi μ- rt Φ 13 CQ P. 0 ) 0 ) 0 a Ω 0 ) Φ O 03 3 O rt rt μ- i φ LQ £ LO 3 13 μ- Ω pi Pi i Ω CQ H- rt Hi $D rt rt Φ 3 3 3 rt μ- 3 0 μ- 3 rt 1 ≥; Φ rt h- 1 3 rt μ- 0 3 J μ- 13 Ω 13 13 13- I- 1 H- Φ 0 ) 3 H- 0 ) Φ 3 CQ Hi Q Ω P Φ ! Hi μ- Φ CQ μ- 13 Ω 13 0 ) Q H rt 0 ) 0 ) H- rt • 0 rt 0 ) Φ rt Φ Pi KQ μ- 0 Pi CQ O 0i 0 01 rt 0i 3 3 Φ H- Ω Ω CQ U 3 Q tr Hi rt 13 ϋ rt rt 3 3 o • ii μ- φ 3 Ω μ- CQ 3 O P. O W W φ CQ 0 ) rt I- 1 H H- ii ϋ rt 13 3- tr 0i 13 03 tr μ> 3 CQ Hi Ϊ 0 0 ) Φ μ- a Φ Φ o Φ <! l-T φ O 3 Φ 0 O H Φ Φ £ 01 ■ <! <H 03 TJ Hi μ- Φ 3 rt h- 1 Ω rr rt μ- φ ϋ H- Φ i KQ ϋ Φ rt 3 01 .. o rt μ- ffi ct μ- 03 μ- <~t " cπ <l a ϋ rt u 3 0 ) H- Pi 03 CQ CQ Φ 13 Oi H 1 ; s 3" Ω 03 μ- 0 >. 03 μ- PJ H- Q &. ii O CQ ii £ Φ Ω μ- μ- μ- c Pi UJ PJ 13 Φ μ- 0i 3 3 0 CQ $, 0 0 ) h 03 Φ ii H- 3 rt 03 ϋ Ω LQ tr 3 Φ *ϋ CD 3 ii ^^ Φ ■ t 03 3 3 £ H- 0 n rt Ω Φ Ct . o Φ rt 3 rt 13 13 - hi ^ rt μ- α 13 3 Ω μ- Oi μ- 0 Φ h- 1 ΓT Hi 03 03 Φ Ω !-r • ii 0 ) Ω μ- 0 ) H ii Φ 3 Ό ϋ Ω 0 rt H 3 rt rt 0 Ω CQ l- 1 H- H- H- O i Φ 0 0 ) φ Φ μ- Pi 0 ) Ω n Φ ; 3 3 ^ 13 tr Ω 0 Ω C * φ H- Φ CQ 3 <i 3 0 ) H Ω Pi μ- 3 Ω i . μ- H 3 μ- > rt CQ CQ a Ω Φ 03 s Pi 3 ) c a> Φ 0 Φ a 3 ^ O Φ < 03 r s; μ- φ Ω 3 J Pi 13 μ- 0 < Ω 03 Hi h . ϋ Ω a O m Φ ii rt Ω H- hi Pi μ- Φ i μ- 3 J Ω . rt Φ Ω μ- 3 0 ^« 03 Hi Φ Ω o 0 ) i ) 03 ii 3 ii 3 O μ- rt 0 ^ Φ Ω rt • μ- Φ μ- a. £ S! a &. tr hi Φ C f-> Φ rt CQ H 13 3 Ω μ- rt ϋ 13 • 03 0 μ- Φ 3 Ω rt rt Ω Ω h- 1 t Φ H- H- l-T Φ 3 Ω Ω Ω O 0 0 h- 1 tr 0 & ii i < . Φ φ tr ty μ- a pi Φ t a pi rt 0 ) Pi Pi rt !3 0 13 Φ ii Φ μ- 3 Φ tr Φ ≥; 01 φ Φ r 03 φ φ Φ rr a = > to, r CQ 03 C μ- 3 O 0i 3 03 μ- P i o 3 hi Hi 3 J 0 i 13 3 Φ 0 "~-~. 3 0 1 Cj 1 3 Pi μ- C 03 03 13 03 μ- t- 1 i 03 Ω 0 0 ii μ- Φ H rt rt pi OJ i Pi 0J 0 ) Pi ι-3 3 ft H- hi 03 CQ rt 0 ) i Φ Ω 0 ϋ rt φ F ^ Φ 0 01 * Φ 3 H- Φ μ- 3 J rt 3 Φ Pi rt •> > Pi Pi 0i Ω μ- Pi Hi Φ H- 13 Ω to φ ϊ > 3 H- 0 Pi 0 ) 3 ω rt 3 O 13 μ- 13 μ- μ- i μ- (3 3- 03 μ- O 3 0 ) O F- φ Ω 03 Hi rt LQ rt 3" to. μ- O 0 T3 13 03 3 Φ 3 Pi Φ Ω ti tr Ω Φ < ii ^ H- 3 Φ Φ tr φ Ω 3 3 i Ω CQ Ω μ- i 0 rt μ- ft w OJ μ- Φ Φ ^ rt 0 rt Φ rt a rt H Φ rt Φ μ- ϋ CQ 0 μ- rt rt tT φ α. a a Φ 13 μ- H- 3 * 3 0 ii !-r tr ii μ- μ- 0 ) 0 3 Ω 0 Φ 13 03 13 0 tf Φ fi ¬ CQ CQ . O CQ 3 Φ 0 ) Φ 0 03 0 Hi rt 0 ) CQ 0 ) Φ 03 ^ H 3 μ- i a φ s: P 0 rt rt ii 3 μ- rt Φ 03 Φ μ- 03 O 03 PJ nrr 0 0 P. Φ Hi 3 ^ Φ rt 0 ) Ω μ- Pi μ- Ω CQ rt tr rt al 0 Hi H- H O Φ Pi 3" μ- Φ 0 3 3- 3 Φ h- 1 Φ CQ Hi Φ 03 3 μ- CQ 0 ) 3 φ Φ 3 CQ 3 3 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 reason being that if 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 . If a diversity system is implemented based on multiple descriptions, the incorporation of prediction will face additional problems which are due to the fact that the sound signal has several representations. If the above described scheme for predictive encoding/decoding is used together with multiple description quantizers, one of two problems will be present. The problem will be dependent on how the predictors are utilized at the transmitting/receiving end. If each of the multiple description quantizers at the receiving end were to feed independent prediction filters, the prediction value for each description would be independent of the arrival of the other multiple descriptions. However, with this solution the offset of the different encoded representations will be different between different independent predictor outputs. Thereby the regular spacing between representations from the multiple quantizers is lost, and with that the optimized improvement from receiving multiple descriptions is also lost . Alternatively, all multiple descriptions could be constructed from the same predictor, thereby maintaining the optimized improvement from receiving multiple descriptions. However, if 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. Thus, as stated above, there is a problem in how to use prediction for reducing the bit rate of a speech or audio signal for transmission over a packet network, since a lost packet with a signal information segment negatively will affect the reconstruction of the following signal information segment. When using multiple descriptions, the transmission of the sound signal will require more bandwidth than if a single description was used. In such a system, it would be even more interesting to use prediction in order to reduce the required bandwidth. However, as described above, there is a problem in how to implement the predictive encoding/decoding mechanism in such a system, while maintaining the basic gain of multiple description quantization. Summary of the invention 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. According to the present invention this object is achieved by the methods having the features as defined by the independent claims 1, 15, 29 and 30. 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. Thus, the output from the conditional lossless encoder is a function of two variables: the quantized digital sample and the prediction sample. Correspondingly, 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. OJ ) ISJ t μ> μ 1 cπ o cπ o cπ o cπ coarsely quantized estimate of the signal or prediction error variance, or other coarsely quantized features extracted from the past of the signal. Thus, 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. Hence, 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 f atures 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. However, 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. Preferably, the encoder/decoder of the present invention is a multiple description encoder/decoder, i.e. an encoder/decoder which generates/receives at least two ω ω M D H cπ o cπ o cπ o cπ O O IO to 1 μ» cπ σ cπ o cπ o cπ 03 μ- 03 CQ μ- 3 SD μ- CQ rt 3 CQ 3 φ 13 3 OJ Hi SD h- 1 13 Φ H" Hj CQ 03 Φ . 0 OJ rt tr 3 Φ rt 13 Pi 0J Q μ- Φ OJ O 3 Q - φ O Pi hj Φ 0J μ- O OJ rt 13 ϋ 03 tr fi φ Φ Φ OJ Hj i X 3 μ- rt •<; SD Ω Hi rt SD Hi 13 μ- Ω 0 Hi O rt Hj Φ 3 Φ 3 Pi Pi μ- 03 0 Ω PJ Hi K M Hi rt 3 Hi μ- 13 o 13 0 h- 1 3 Hj 3 Φ Φ O P 0 μ- 3 μ- Hi 03 Φ Ω rt SD 3 O μ- 3 φ Hi o PJ 3 SD 3 3 Ω rt O 0 rt hi Hi 3 rt φ SD O OJ 0 tr Hi i φ μ- μ- CQ rt μ- Q rt SD representation obtained or extracted from one or more of the digital signal samples. Finally, a quantization level of a digital sample is either the index or the value of a quantized digital sample. Brief description of the drawings Further features and advantages of the invention will become more readily apparent from the appended claims and the following detailed description of a number of exemplifying embodiments of the invention when taken in conjunction with the accompanying drawings in which like reference characters are used for like features, and wherein: Fig. 1 shows one exemplifying way of realizing multiple descriptions in accordance with state of the art ; Fig. 2 shows an overview of the transmitting part of a system for transmission of sound over a packet switched network; Fig. 3 shows an overview of the receiving part of a system for transmission of sound over a packet switched network; Figs. 4a and 4b show overviews of a Sound Encoder at the transmitting part and of a Sound Decoder at the receiving part, respectively, of a system for transmission of sound over a packet switched network in accordance with an embodiment of the present invention; Figs. 5a and 5b show overviews of a Sound Encoder at the transmitting part and of a Sound Decoder at the receiving part, respectively, of a system for transmission of sound over a packet switched network in accordance with yet another embodiment of the present invention; and Fig. 6 shows some of the element of the transmitting part of a system for transmission of sound over a packet switched network in accordance with a further embodiment of the present invention. co co to O μ> μ > cπ o cπ o cπ o cπ Pi μ- s 3 03 0 a Hi μ- Ω rt Q rt KQ 13 Λ Hi Ω φ 03 tr μ- S Hi 3 o 3 0 tr 3 tr 3 O φ S3 μ- 0 o 03 α μ- Ω μ- SD ϋ Ω i φ SD Φ J H Hi SD 3 o μ- i Ω Hi rt SD 3 Hi φ 3 03 3 Hi 3 Φ ' • Hj Φ Ω tr O Ω rt 13 φ i -J rt φ rt Φ O rt Hi μ- Φ 13 0 13 tr 03 H μ- Hi SD μ- μ- X Hj μ- 3 ^ Pi φ 3 μ- tr Φ ■• < 3 N O 03 rQ N N OJ 3 N SD Hj 3 < 03 O i 03 Φ <! φ i 3 φ φ SD 3 SD Φ ■ g rt 0 •Q a. Φ s rt 1 Hj μ- 0 0J hi < rt 13 3 Hj OJ μ- 3 £ φ Hj CQ φ 3 Φ μ- i 0 Hj a φ μ- Ω 03 3 0 OJ 3 rt SD φ 3 CQ 13 μ- Hi rt € O Φ φ " rt 3 rt rt Φ M to rt • Hi 3 tr μ- O 03 3 μ- tr μ- Hi 13 μ> 3 Hi O CQ rt μ- N 3 •> O SD N Φ rt 0 μ-> o O 0 to < tr CQ 0J h- 1 1 μ- Hi 0J Φ CQ > <; 3 DO φ Hi μ- 3 φ tr rt i μ- φ Hi tr rt SD φ • ISO Pi rt r 0J Pi 3 μ- • <! SD μ- μ- Pi rt o O rt μ- tr td O tr φ φ Φ rt 0 03 rt H3 tr OJ μ- Hj tr 3 rt μ- - 3 Φ • 0J 03 3 s; s Φ 3 13 03 SD Q μ- rt CQ Ω μ- H rt 0 H3 Hj 3 0 13 rt S3 " SD • " tr 3 0J CQ O μ- 03 tr O 03 03 Ω SD HJ tr Φ CQ CQ rt rt & Ω 0 Φ vQ i - 3 ϊ? φ SD μ- < Φ rt Φ i h- 1 Φ Φ SD φ SD 3 3 3 O μ- 03 rt 03 Φ Pi 0 OJ Φ φ 13 03 Hi 03 SD Ω 03 Pi μ- i Φ μ j rt Ω CQ O Ω Ω Ω SD 3 Φ 3 03 μ- 3 φ 3. CQ Hi SD Ω Hi Hi 03 O Hj ^ Φ ■3 rt • μ- SD CQ 03 s; μ- O Hj μ- μ- μ- 13 μ- SD O CQ h- 1 Ω tr $, ϋ $ μ- 3 O N ty 1 13 O μ- 1 N 3 H 3 Hi φ hi Φ 0 O μ- 13 φ ?d Φ μ- rt rt Hi μ- Φ tr SD μ- 3 3 rt Hi h- 1 rt 3 μ- μ 1 tr 3 Si (D Φ O 3 α 13 Ω tr μ- Q μ- φ O Φ rt CQ 3 Hi φ rt 3 O Pi Φ O 3 CQ Si- 3 tr μ- SD 03 O 03 μ- CQ 3 Hi 3 SD DO CQ 03 Φ Hi a 0 03 Hi Ω G μ- 03 Hi Ω tr Φ 3 Hj . i SD SD rt 0 3 0 Hi 3 a rt Φ 0 μ- rQ μ> rt Φ Φ M CQ rt O CQ 3 3 rt μ- 03 CQ μ- Λ rt 3 o μ- tQ 03 O 13 0 Φ Pi 3 tr 13 rt 3 Cj 1 CQ μ- o N S3- 03 Ω O h-« 3 i Φ Pi Φ rt μ- rt 3 μ- μ- . HJ φ μ- μ- Hj μ- 3 O μ- μ- μ- 3 £ rt Hi 3 Φ 0J h HS 3 μ- SD Hi Q Φ 03 O rt O 03 O Φ φ Φ μt 3 Φ CQ 13 3 CQ μ- Ω < Hi rt Pi Hi DO Pi $ i rt i 03 rt rt rt 13 Φ SD Φ Ω SD CO μ- rt μ- Hi μ- tr 0J Hi μ- Hj 3 SD O Pi OJ tr μ» rt rt tr 0 μ> SD CQ Φ μ- Ω CQ i OJ CQ tr Φ μ- μ» tr O Φ 3 μ> rt 3 Ω W SD 3 Hj μ- μ- CQ Hi rt o o φ SD CQ Hi Φ μ- O 03 CQ rt Ω μ- CQ tr 3 rt μ> o O 03 & 13 rt Hi φ 3 CQ ii 3 tr μ- SD 3 DO μ- 3 Hi μ- SD rt μ- μ- φ rt SD rt rt O o SD 03 SD a 3 CQ Ω μ- O μQ Hi 13 Hi O 03 Ω 3 PJ 3 13 w 3 3 3 μ- tr rt H tr a s; ∞ rt SD φ CQ φ 0J Ω Φ μ- Ω ιJ SD 0 μ- CO tr rt 3 SD 3 O O rt rt SD rt O rt μ- tr ^ 13 Hi rt 3 3 ϋ Φ tr ii t h tr LQ ■ <: to 0J μ- μ- rt Φ Φ CQ φ 3 μ» SD Hi 3 N μ> tϋ φ SD J cπ rt φ Φ O + 3 hi hi o μ 1 03 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. In a typical system, the transmitting end includes a Sound Encoder 230 in order to compress the sampled digital signal further. According to the present invention, 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. In Fig. 3 a block diagram of the receiving part of a system for transmission of sound over a packet switched network is shown. 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. The design and operation of the Sound Encoder and the Sound Decoder, in accordance with an embodiment of the invention, will now be described in greater detail with reference to Figs 4a and 4b. 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. In Fig. 4a, 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. Correspondingly, in Fig. 4b, 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 CO co DO DO μ> 1 cπ o cπ cπ cπ In Fig. 4a digital samples of a digital signal received from the A/D-converter are quantized by quantizer 400 into quantized digital samples. For each quantized digital sample 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. Alternatively, 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. In 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. For each quantized digital sample 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 . In the same way as at the transmitting end, 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. In alternative embodiments, the Sound Encoder includes the De-quantizer 410 and/or the second Quantizer 440 as depicted in Fig. 4a. Correspondingly, the Sound Decoder in accordance with these alternative embodiments includes the Quantizer 470 and/or the De-quantizer 463. Using 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. If the Predictors 430 and 480 do not include quantization tables for outputting quantization levels, such as indices, of the generated prediction samples, should that be desired, the Sound Encoder/Decoder will include Quantizers 440, 470 for providing quantization levels, e.g. indices, of the generated prediction samples. Thus, using the Quantizers 440 and 470 it may be ascertained that the quantization levels of the generated prediction samples will be valid levels belonging to a predefined set of levels, and not levels falling between different valid quantization levels. According to the invention, in order to avoid error propagation, 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. In accordance with an embodiment, this is achieved by setting a predictor state of Predictor 430 to zero before a new block with quantized digital samples is encoded. Correspondingly, in the Sound Decoder at the receiving end, the predictor state of Predictor 480 is set to zero before decoding a new block with quantized digital samples. As an alternative to setting the predictor state to zero, 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. Thus, 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. However, for sound signals 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. Also 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. 1453 -1456, 1994, can be used in the encoding/decoding scheme of the present invention. According to the 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. In Fig. 5a, the Sound Encoder 530 at the transmitting end includes a Multiple Description Encoder 510 and a Diversity Controller 520. Correspondingly, the Sound Decoder 570 of Fig. 5b at the receiving end includes a Diversity Controller 550 and a Multiple Description Decoder 580. Turning now to Fig. 5a, 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. As previously described, 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. Correspondingly, if three descriptions were to be provided, 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. Thus, as indicated in Fig. 5a, the sound signal may be encoded using more than two descriptions without departing from the scope of the present invention. However, for ease of description, 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. Thus, 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. Correspondingly, 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. In Fig. 5a, the different segment descriptions of the same sound segment are transferred in respective packets to the Diversity Controller 520. In Fig. 5a, two descriptions have been indicated, Di and D 2 . The consecutive segments n, n+1, n+2 , and so on, are represented by description Di as segment descriptions Dι(n), D 1 (n+1), Dι(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. Correspondingly, 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. Thus, 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χ(n+1) of description D x 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. In Fig. 5a 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. For example, as indicated in Fig. 5a, the two segment descriptions Di (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 ! and t 2 . Thus, a delay of t 2 ~ i \ ϊ- s introduced to create time diversity. A typical delay t 2 -t x that could be used, in connection with typical sound segment lengths of 20 ms, is 10 ms . Upon reception of a packet from the Diversity Controller 520, the Controller 540 formats the packet, such as adding sequencing and destination address information, for immediate transmission on the packet switched network. Thus, the Controller 540 adds a header, H, with information to each packet. In the case of IPv4 transport using UDP (User Datagram Protocol) and RTP (Real Time Protocol), 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. If each speech segment is represented by two segment descriptions, the headers of the packets transferring the segment descriptions will together require a bit rate of 2*16 = 32 kbit/s. This can be compared to the bit rate of 64 kbit/s for standard PCM (Pulse Code Modulated) telephony. Consequently, the overhead bit rate will be 50% (32 divided with 64) of the payload rate . As previously described with reference to Fig. 3, packets are received at the receiver end by a Controller 350. The Controller removes header information and transfers the packets to the Jitter buffer 360, which in turn transfers the packets to the Sound Decoder 370. Turning now to Fig. 5b, 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. Thus, as illustrated in the Fig. 5b, the Multiple Description Decoder 580 will e.g. receive both packets 571 and 572 with respective segment descriptions Di (n) and D 2 (n) of sound segment n at the same time, and then both packets 574 and 575 with respective segment descriptions Dι(n+1) and D 2 (n+1) of sound segment n+1, and so on. 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. If, e.g., segment description D x (n) did not arrive at the receiver end, or arrived too late, 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. In 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. As described with reference to Figs. 5a and 5b, the overhead resulting from the headers of the different packets transferring different segment descriptions of the same sound segment is quite extensive. To alleviate this, 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. As shown in Fig. 6 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 Di (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. Thus, just as in the embodiment of Fig. 5, 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. In Fig. 6, the two segment descriptions D 2 (n) and Dι(n+1) of sound segment n and n+1 are delivered to the Controller 640 in packet 622. Thus, segment n+1 must have been encoded before segment description D 2 (n) can be transferred to the controller. Segment description Di (n) on the other hand was transferred in a previous packet 621 to the controller. If a sound segment is 20 ms, the transfer of D 2 (n) must be delayed with 20 ms compared with the transfer of Di (n) since D 2 (n) is to be scheduled in the same packet 622 as D ι (n+1) . Thus, this scheme will automatically provide time diversity since different segment descriptions of the same sound segment will be transferred to the Controller 640 with a 20 ms interval (given a sound segment length of 20 ms) . Thus, in comparison with the embodiment of Fig. 5, an additional delay between the two segment descriptions of the same sound segment is automatically introduced with this scheme of assembling packets with several segment descriptions. This additional delay between segment descriptions provides an O co DO DO μ> μ> cπ o cπ O cπ σ cπ descriptions of one and the same sound segment. Correspondingly, 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. Thus, 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. According to the embodiment, 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. Thus, 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. Alternatively, the PCM Encoder is a standard 64 kbit/s PCM Encoder using A-law log compression. In this case the number of levels in the quantizer is 256, which is one more than in a μ-law coder. To represent these 256 levels using two new quantization grids, and be able to fully reconstruct the signal, one grid with 128 levels and one with 129 levels is needed. It would be desired to use two 7-bit grids like in the μ-law case, however the problem with the extra quantization level has to be solved. According to the invention 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. The exact same rule as in the μ-law case is used to form the new indices, except when representing index number 255. The 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 . If the digital signal received by the Sound Encoder already is represented as a 64 kbit/s PCM bitstream, and if the Sound Decoder at the receiving part should output a 64 kbit/s PCM bitstream, the PCM Encoder at the transmitting part and the PCM Decoder at the receiving part will not be needed. In this case 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 . At the receiver end of the system 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 . Although the invention has been described above by way of example with reference to different embodiments thereof, it will be appreciated that various modifications and changes can be made without departing from the scope of the invention as defined in the appended claims.

Claims: CLAIMS 1. A method of encoding a digital signal and its blocks of digital samples for transmission over a packet switched network, the method including the steps of: quantizing the binary representations of the digital samples to more coarsely representations of the digital samples ; generating prediction samples as fixed point or floating point representations based on previous, quantized digital samples of said quantizing step; and lossless encoding the quantized digital samples conditioned on the fixed point or floating point representations of the generated prediction samples. 2. The method as claimed in claim 1, wherein the lossless encoding of the quantized digital samples is based on table look-ups. 3. The method as claimed in claim 2, wherein table look-ups are performed by means of a quantized digital sample for generating two quantization region boundary levels corresponding to the quantized digital sample, wherein the levels by means of the common generated prediction value and another table are mapped onto a pair of likelihood values that are used for lossless encoding the quantized digital sample. 4. The method as claimed in claim 1 or 2 , wherein said lossless encoding step for a specific quantized digital sample includes outputting a specific code word which corresponds to a specific entry of a table with code words, said specific entry being derived by means of the generated prediction sample corresponding to said specific quantized digital sample. 5. The method as claimed in claim 4, wherein said table with code words is chosen among several tables with code words based upon said generated prediction sample, wherein said specific entry is derived as the entry corresponding to said quantization index of said quantized digital sample. 6. The method as claimed in any one of claims 1 - 5, wherein said step of generating prediction samples is preceded by de-quantization of the quantized digital samples, thereby obtaining the quantization values of said quantized digital samples. 7. The method as claimed in any one of claims 1 - 6, including the step of quantizing the generated prediction samples, wherein said lossless encoding step is based on generated prediction samples having quantization levels of a predefined set of quantization levels. 8. The method as claimed in any one of claims 1 - 7, including the step of setting a state of a predictor generating said prediction samples to zero before starting to encode one of said blocks with digital samples . 9. The method as claimed in claim 7 or 8, wherein said lossless encoding step is conditioned on the quantization indices of said generated prediction samples . 10. The method as claimed in any one of claims 1 - 9, wherein said encoding is performed by a multiple description encoder, which multiple description encoder encodes each block of said blocks of digital samples by means of multiple block descriptions by performing the steps of the encoding method individually for each generated block description. 11. The method as claimed in claim 10, including the additional step of transmitting, for each block of said blocks of digital samples, at least two different block descriptions in respective data packets with a predefined time interval between the packets. 12. The method as claimed in claim 11, including grouping a respective block description of at least two different blocks of digital samples together for transmission in one and the same data packet. 13. The method as claimed in any one of claims 10 - 12, wherein said digital signal is a digitized sound signal and said blocks of digital samples are sound segments, and wherein the encoding method in said multiple description encoder includes an initial step of transcoding an n-bit PCM represented digitized sound signal to at least two representations represented by fewer than n bits each and with respective sets of quantization levels for the segment descriptions of the sound segments of said digitized sound signal. 14. The method as claimed in any one of claims 1 - 12, wherein said digital signal is a digitized sound signal and said blocks of digital samples are sound segments . 15. A method of decoding a digital signal and its blocks of digital samples received from a packet switched network, the method including the steps of: generating prediction samples as fixed point or floating point representations based on previous, quantized digital samples of said digital signal resulting from a lossless decoding of received code words ; lossless decoding received code words conditioned on the fixed point or floating point representations of the generated prediction samples; and de-quantizing quantized digital samples resulting from the lossless decoding step into binary representations of the digital samples of said digital signal . 16. The method as claimed in claim 15, wherein the lossless decoding of the received code words is based on table look-ups. 17. The method as claimed in claim 16, wherein the received code words represents likelihood values, wherein two likelihood values by means of a generated prediction value and a table are mapped onto two quantization region boundary levels of a corresponding quantized digital sample, said levels being used to derive the corresponding quantized digital sample by performing table look-ups. 18. The method as claimed in claim 15 or 16, wherein said lossless decoding step for a specific quantized digital sample includes outputting a specific quantization level which corresponds to a specific entry of a table with quantization levels, said specific entry being selected by means of a received code word corresponding to said specific quantized digital sample. 19. The method as claimed in claim 18, wherein said table with quantization levels is chosen among several tables with quantization levels based upon a generated prediction sample corresponding to said specific quantized digital sample. 20. The method as claimed in any one of claims 15 - 19, wherein said step of generating prediction samples is preceded by de-quantization of the quantized digital samples resulting from the lossless decoding step, thereby obtaining the quantization values of said quantized digital samples. 21. The method as claimed in any one of claims 15 - 20, including the step of quantizing the generated prediction samples, wherein said lossless decoding step is based on generated prediction samples having quantization levels of a predefined set of quantization levels . 22. The method as claimed in any one of claims 15 - 21, including the step of setting a state of a predictor generating said prediction samples to zero before starting to decode one of said blocks with digital samples . 23. The method as claimed in claim 21 or 22, wherein said lossless decoding step is conditioned on the quantization indices of said generated prediction samples . 24. The method as claimed in any one of claims 15 - 23, wherein said decoding is performed by a multiple description decoder, which multiple description decoder decodes each block of said blocks of digital samples based on at least two different received block descriptions by performing the steps of the decoding method preceding the de-quantizing step individually for each received block description. 25. The method as claimed in any one of claims 15 - 24, including the steps of: waiting a predefined time period for reception of at least two different packets including different block descriptions of one and the same block of digital samples; performing the steps of the decoding method preceding the de-quantizing step with respect to those, one or several, different block descriptions of said block of digital samples received within said predefined time period; and de-quantizing the one, or a merger of the several, block descriptions. 26. The method as claimed in claim 25, wherein each received packet includes several block descriptions of several different blocks of digital samples grouped together, the method including the step of dividing successively received packets with respect to the included block descriptions, thereby obtaining several different block descriptions for each block of digital samples to be decoded. 27. The method as claimed in any one of claims 25 - 26, wherein said digital signal is a digitized sound signal and said blocks of digital samples are sound segments, and wherein said digitized sound signal is a PCM encoded bitstream, and wherein any merger of said de- quantizing step involves transcoding at least two segment representations, each represented by fewer than n bits, to a single n-bit PCM representation of said one and the same sound signal segment. 28. The method as claimed in any one of claims 15 - 26, wherein said digital signal is a digitized sound signal and said blocks of digital samples are sound segments . 29. A computer readable medium having computer executable instructions for causing a digital signal and its blocks of digital samples to be encoded for transmission over a packet switched network, the computer executable instructions performing the steps of the method as claimed in any one of claims 1 - 14. 30. A computer readable medium having computer executable instructions for causing a digital signal and its blocks of digital samples received from a packet switched network to be decoded, the computer executable instructions performing the steps of the method as claimed in any one of claims 15 - 28.

Inventors: ABRAHAMSSON TINA, HAGEN ROAR, KLEIJN W BASTIAAN, VANG ANDERSEN SOREN, ABRAHAMSSON, TINA, HAGEN, ROAR, KLEIJN, W., BASTIAAN, VANG ANDERSEN, SOREN
Applicants: ABRAHAMSSON TINA, GLOBAL IP SOUND AB, HAGEN ROAR, KLEIJN W BASTIAAN, VANG ANDERSEN SOREN, ABRAHAMSSON, TINA, HAGEN, ROAR, KLEIJN, W., BASTIAAN, VANG ANDERSEN, SOREN
Application year: 2001
Main classification: G10L19
IPC codes: G10L19