Multiple description coding communication system

Abstract

A method and apparatus reliably encode and decode information over a communication system. The method includes transforming two coefficients into two pairs of random variables, one random variable in each pair having substantially equal energy as one random variable in the other pair. The method further includes quantizing each of the pairs of random variables and entropy coding each quantized random variable separately creating an encoded bitstreams. The encoded bitstreams are received by a decoder which first determines which channels of the communication system are working. The encoded bitstream is entropy decoded, inversed quantized and inversed transformed. An inverse transform performs three different transformations depending upon which channels are working, i.e., whether the first, second or both channels are working.

Description

BACKGROUND OF THE INVENTION

The present invention relates generally to communication systems for processing information, and more particularly to computer-implemented processes and systems for reliably encoding and decoding information over a communication system.

One way to enhance the reliability of a communication system transmitting an information signal is by using multiple description coding (MDC) at a source coder. MDC decomposes the information signal (i.e., input data such as a video stream or an audio stream) into subsignals called samples. Each sample can then be quantized, coded, and transmitted over the communication system in the form of coded bitstreams (referred to as descriptions), via communication channels, independent from the other samples. MDC is designed such that a reconstructed signal can be assembled from any subset of the descriptions. Thus, the reconstructed signal can be assembled with fewer than all of the descriptions. The higher the number of descriptions used in the reconstruction, the higher the quality of the reconstructed signal.

Multiple description coding was first studied from a rate-distortion theory point of view. The motivation behind MDC is to combat signal loss due to path failures. To realize this goal, each coded sample (i.e.,description) carries sufficient information about the original signal. Essentially this requires a certain degree of redundancy to be embedded between the multiple descriptions. This reduces coding efficiency compared to conventional signal description coding (SDC) where there is no redundancy. As used herein, the term “coding” and “encoding” are used interchangeably.

Wolf, J. K., Wyner, A., and Ziv, J., “Source Coding for Multiple Descriptions,” The Bell System Technical Journal , vol. 59, pp. 1417-1426, Oct. 1980 showed that given R 1 and R 2 representing the bit rates for two descriptions, respectively, a total bit rate 2R, and E 2 (R 1 , R 2 ) representing a reconstruction error when both descriptions are received, the minimum distortion achievable by a single description coder, E min (2R), is less than the minimal distortion achievable by a multiple description coder when both descriptions are available, E 2 (R 1 , R 2 ), if R 1 +R 2 =2R. Wolf et al. showed this using a rate distortion analysis for an independent identically distributed binary source.

Ozarow, L., “On a Source Coding Problem With Two Channels and Three Receivers,” The Bell System Technical Journal , Vol. 59, p. 1921, Dec. 1980 also showed that the performance of a single description coder is better than the performance of a multiple description coder when both descriptions are available in the case of an independent identically distributed Gaussian source.

Specifically, Ozarow showed that if each coder is optimal in the rate distortion sense, i.e., E 1,j (R j ) is minimized for a given R j , then the joint coder will be far from optimal, i.e., E 2 (R 1 , R 2 ) is much larger than the minimal distortion achievable for this source E min (R 1 +R 2 ). The converse is also true: if the joint coder is optimal, i.e., E 2 (R 1 , R 2 )≈E min (R 1 +R 2 ), then either one of the coders will be far from optimal, i.e., E 1,j (R) is much larger than E min (R) for j=1 or j=2 or both.

With real image and video signals, the redundancy in the signal (such as the correlation among adjacent samples) can help reduce the loss in coding efficiency, but a certain amount of sacrifice in coding efficiency is unavoidable. However, this reduced coding efficiency is in exchange for increased robustness to long burst errors and/or channel failures. With SDC, one would have to spend many error-control bits and/or introduce additional latency to correct such channel errors. With MDC, a long burst error or even the loss of one description does not have a catastrophic effect, as long as not all the descriptions are experiencing failures simultaneously. Thus, one could use fewer error control bits for each description. In this sense, the MDC is a way of performing joint source and channel coding.

The first practical multiple description coding was proposed for speech coding. In this approach, a bitstream from a differential pulse code modulation (DPCM) coder is split into even and odd sample packets. If an even (odd) sample packet is lost, data contained in the odd (even) sample packet are used to interpolate the missing even (odd) samples. It was shown that this coder works well beyond what the analysis predicted. This is in part because the analytical results hold true at highly efficient coders while their proposed coder is not efficient. In fact, there is sufficient redundancy left in the coder output, to permit subsampling and high quality interpolation.

In another approach to MDC, multiple descriptions are obtained by quantizing each sample using two quantizers. The quantizers are designed so that the combination of the two quantizers leads to a finer quantizer, while each quantizer itself is a coarse quantizer. The simplest implementation of this approach uses two quantizers whose decision regions shift by half of the quantizer interval with respect to each other. In this case, 2R bits are required to match the performance of a single quantizer with R+1 bits. Therefore, the loss in coding efficiency is quite significant, for the value of R being relatively high. Although more sophisticated quantizer mappings can be designed to improve the coding efficiency, a direct application of this approach to the original samples of a signal is not advisable in terms of loss in coding efficiency. Recently, this approach has been applied to transform coefficients in transform coders, with applications in both speech, image, and video. The loss in coding efficiency is less severe in this case, but still quite high, up to 30%.

While offering a good redundancy rate distortion performance at low redundancies, a serious drawback of the two sample transform-based MDC methods is that they fail to reduce one-channel distortion to levels close to two-channel distortion with high redundancies (i.e., near half the total bit rate). This is due to the fact that the two sample transform-based MDC sends one variable on each channel, regardless of the redundancy.

The present invention is therefore directed to the problem of developing a method and apparatus for performing multiple description coding that improves the coding efficiency for a two sample transform.

SUMMARY OF THE INVENTION

The present invention describes a method and apparatus for reliably encoding and decoding information over a communication system. The method includes transforming two samples into two pairs of random variables, one random variable in each pair having substantially equal energy as one random variable in the other pair. The method further includes quantizing each of the pairs of random variables separately and entropy coding each quantized random variable separately creating encoded bitstreams. The encoded bitstreams are received by a decoder which first determines which channels of the communication system are working. The encoded bitstreams are entropy decoded, inversed quantized and transformed. The inverse transformation performs three different transformations depending upon which channels are working, i.e., whether the first, second or both channels are working.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG 1 is a block diagram of a coding/decoding system according to an embodiment of the present invention.

FIG 2 depicts a block diagram of a multiple description coding (MDC) encoder for two samples according to an embodiment of the present invention.

FIG 3 depicts a block diagram of an MDC transformer used in an embodiment of the present invention.

FIG 4 depicts an alternative embodiment of a MDC encoder for two samples according to an embodiment of the present invention.

FIG 5 depicts a block diagram of a multiple description decoder according to an embodiment of the present invention for use with the MDC encoder of FIG. 2 .

FIG 6 depicts block diagram of an alternative embodiment of a multiple description decoder according to an embodiment of the present invention for use with the MDC encoder of FIG. 4 .

FIG. 7 depicts a block diagram of an estimator according to an embodiment of the present invention.

FIG 8 depicts a block diagram of an inverse transformer according to an embodiment of the present invention.

FIG. 9 depicts a block diagram of a forward integer-to-integer transformer according to an embodiment of the present invention.

FIG 10 depicts a block diagram of a forward transformer according to an embodiment of the present invention.

FIG 11 depicts a block diagram of an inverse integer-to-integer transformer according to an embodiment of the present invention.

FIG 12 depicts an example of a quantization scheme according to the principles of the present invention.

FIG 13 depicts a block diagram of the MDC encoder according to an alternative embodiment of the present invention.

FIG 14 depicts an exemplary embodiment of the method according to the present invention.

DETAILED DESCRIPTION

The present invention modifies a conventional transform coder to a multiple description coding (MDC) encoder. Given a block of L samples created from a input signal as in a conventional transform coder, these samples are first transformed into a block of L coefficients using a Discrete Cosine Transform (DCT), for example. It is possible, however to use other types of transforms. Instead of directly quantizing and coding this block of coefficients, the present invention transforms the block of L coefficients into L/2 pairs of random variables. Each pair of random variables is then quantized. After quantization, each random variable is separately encoded and again paired for bitstream formation and transmission. Ideally, the conversion is such that if both bitstreams are received, then the original transform coefficients can be recovered perfectly in the absence of the quantization error. If only one bitstream is received, the original transform coefficients can still be recovered to a certain degree of accuracy.

In an alternative embodiment of the present invention, the block of L samples are not transformed by a DCT. Thus, the L block of samples would be directly transformed into L/2 pairs of random variables.

FIG. 1 is a block diagram of a coding/decoding system according to an embodiment of the present invention. The system includes a MDC encoder 20 provided in communication with a multiple description decoder (MDD) 40 over channels 201 and 202 . MDC encoder 20 includes one or more of the following components: an analog to digital (A/D) converter 1 , a Discrete Cosine Transformer (DCT) 2 , a MDC transformer 21 , a quantizer 22 and an entropy coder 206 .

As shown in FIG 1 , MDC encoder 20 receives an information signal such as video or audio data stream. The information signal is forwarded to A/D converter 1 . A/D converter 1 converts the time-and amplitude continuous information signal to a time-and amplitude-discrete signal. Known sampling techniques are also performed on the converted information signal creating samples of the information signal.

These samples are presented to DCT 2 . DCT 2 transforms the samples into coefficients. According to an embodiment of the present invention, the coefficients are then transformed into random variables by MDC transformer 21 . These random variables are further processed by quantizer 22 and entropy encoder 206 before being transmitted over channels 201 and 202 . MDC encoder 20 generates coded bitstreams of the original information signal and outputs the coded bitstream to channels 201 and 202 . Channels 201 and 202 may be a communication link, such as those provided by telecommunications networks or computer networks. The MDC 4 40 retrieves the coded information data from channels 201 and 202 . MDC 4 40 inverts the encoding process performed by MDC encoder 20 using entropy decoder 207 , inverse quantizer 44 inverse transformer 46 , inverse DCT 5 and D/A converter 4 to reconstruct the original information signal. Depending upon the coding/decoding techniques used, the reconstructed information signal may be either an exact replica or merely a close approximation of the original information signal.

Two-Variable Multiple Description Encoder

FIG. 2 depicts a two variable MDC encoder 20 according to an embodiment the present invention. When L=2 (the L samples created from A/D converter 1 ) coefficients A and B are the resulting coefficients that may have been transformed using DCT 2 , but they need not have been first transformed by DCT 2 .

In FIG. 2 , coefficients A and B enter the MDC transformer 21 , which outputs two pair of random variables C, C-perp, D-perp, and D. The two pairs of random variables are formed with C and C-perp being paired and also D and D-perp being paired. One random variable in each pair of random variables has the same energy level as one random variable in the other pair. The details of transform 21 will be discussed later with reference to FIG. 3 .

MDC transformer 21 paired outputs are then quantized by quantizers 22 and 23 . As shown in FIG. 2 , the random variables may be paired such that random variable C and D-perp form one pair and random variables C-perp and D form the other pair. This pairing scheme minimizes quantization error. However, any such pairing of the random variables is contemplated within the scope of the present invention.

As shown, each pair is jointly quantized and produces quantized random variables (C′, D′-perp) and (D′, C′-perp). These quantized random variables are each individually encoded using a coding technique such as entropy coding, with entropy encoders 24 - 27 . Other encoding technique can also be used. The encoded random variables are paired such the (C′, C′-perp) are formatted into a bitstream and sent over channel 1 while the coded random variables (D′, D′-perp) are paired and formatted into a bitstream and sent over channel 2 . Again, any such pairing of the random variables for transmission is contemplated within the scope of the present invention.

The relationship between the four coded random variables ({tilde over (C)}, {tilde over (C)}-perp) and ({tilde over (D)}, {tilde over (D)}-perp) is as follows:

i) The output pair C′ and D′, carries all the information needed to reconstruct coefficients A and B in their full (or nearly full) precision.

ii) The output pair C′ and D′, is constructed to be correlated with each other. This correlation allows one to be estimated from the other when a channel is lost. The correlation between C and D is one way to control the redundancy of the system.

iii) C′ and C′-perp (likewise, D′ and D′-perp) are uncorrelated variables which without quantization, would fully represent the coefficients A and B. However, in typical usage, the C′-perp (likewise D′-perp) variable will be much more coarsely quantized than the C′ variable. Due to i), there is no (or little) need for C′-perp when no channel is lost. Thus, bits spent on C′-perp constitute system redundancy, and coding of C′-perp (likewise D′-perp) provide a second way to control the overall system redundancy.

The general framework described above is used to implement two methods of quantization according to the principles of the present invention.

The first method of quantization creates variables C′, D′, C′-perp and D′-perp. The second method of quantization jointly introduces redundancy into the system by correlating C and D and by coding random variables C-perp and D-perp. The purpose of this joint quantization scheme is to allow C′-perp and D′-perp to provide some improvement in reconstruction accuracy in the case when both channels are received. This is in contrast to the first quantization method which only uses C-perp and D-perp when one channel is lost. FIG. 12 illustrates the joint quantization method for C′-perp and D′ according to the present invention. Note, C′-perp and D′ can be viewed as representing extra information which, along with C′, fully represents the coefficients (A,B). When both channels are received, D′ is coupled with C′ to reconstruct (A,B). One reason for sending C′-perp is to provide some small information about D′, even when the channel is carrying D′ is lost. As shown in FIG. 12 , C′-perp provides much more coarsely quantized information about {tilde over (D)}, even when both channels are received. Consider the example when D′=2. For this case, C′-perp can either equal 0 or 1 . For this example, knowledge of C′-perp allows an additional bit of resolution in the representation of {tilde over (D)}. Of course, this improvement would not be realized if D=0 or D′=1. This improvement (in bits) from the scheme will be

(1 bit)*(Probability {tilde over (D)} in {−2, 2, 6, 10, . . . })

C′-perp and D′ need not be coded with scalar quantizers as shown in FIG. 12 . Indeed, a range of other methods can be used to allow knowledge of C′-perp to reduce quantization noise of the variable D′, when both channels are received.

MDC Transformer

FIG. 3 depicts MDC transformer 21 according to an embodiment in the present invention. MDC transformer 21 includes multipliers ( 32 , 33 , 34 and 35 ), adders ( 36 , 37 , 38 and 39 ) and memory devices ( 300 , 301 , 302 and 303 ). According to one embodiment of the present invention, coefficients A and B are received by MDC transformer 21 . Coefficient A provides the same information to A 1 and A 2 . The information contained in Al is multiplied by multiplier 32 with a value stored in memory device 300 and the information contained in A 2 is multiplied by multiplier 33 with a value stored in memory device 301 Likewise, coefficient B provides its information to both B 1 and B 2 wherein the information from B 1 is multiplied multiplier 35 with a value stored in memory device 303 and information contained in B 2 is multiplied by multiplier 35 with a value stored in memory device 302 . To form the random variable C, the outputs of the multipliers 32 , 35 are input to adder 36 and then are added. To form the random variable D, the outputs of the multipliers 32 , 35 are input to adder 39 and are added. To form the random variable C-perp, the outputs of the multipliers 34 , 33 are input to adder 38 and are added. Similarly, to form the random variable D-perp, the output of the multipliers 33 , 34 are input to adder 37 and are then added.

FIG. 4 is an alternative embodiment of a MDC encoder according to an embodiment of the present invention. The MDC encoder depicted in FIG. 4 is a joint transform/quantizer MDC encoder. The joint transform/quantizer MDC encoder includes forward integer-to-integer transformer 31 , described in full detail with regard to FIG. 9 , forward transformer 32 , described in full detail with regard to FIG. 10 , fine quantizers 41 , coarse quantizer 42 , multipliers 43 , inverse quantizers 44 and adders 45 . Coefficients A and B are input into the joint transform/quantizer encoder. Coefficients A and B are sent to fine quantizers 41 and as well as being sent to forward transformer 32 . For clarity, coefficients A and B sent to forward transformer 32 will be referred to coefficients A and B, respectively,

With respect to coefficients A and B, after quantization, these quantized coefficients are received by integer-to-integer transformer 31 . Referring to FIG. 9 , integer-to-integer-transformer includes memory devices 91 , 92 and 92 , floor functions 95 , as well as a plurality of adders 97 and multipliers 96 . Floor function 95 operates such it converts real numbers into the integer values such that A′ and B′ are recoverable. Both quantized coefficients are forwarded to transformer 31 and presented to entropy encoders 206 to produce quantized random variables, C′ and D′, as discussed above in FIG. 2 . The value of these coded random variables is as follows: $$ C = 1 2 ⁢ β ⁢ A + β 2 ⁢ B $$ D = - 1 2 ⁢ β ⁢ A + β 2 ⁢ B

With respect to coefficients A and B, these coefficients are transformed by forward transformer 32 to produce transformed random variables C and D. Random variable C is added to inverse -quantized and γ-multiplied quantized coefficient D′. The output is then sent to coarse quantizer 42 for quantization and entropy coding. Likewise, random variable D is added to inverse -quantized and γ-multiplied quantized coefficient C′. The output is then sent to coarse quantizer 42 for quantization and entropy coding by entropy coder 206 . The coded random variables, C-perp and D-perp, as discussed above in FIG. 2 are given as follows: $$ D - perp = β ⁢ 2 ⁢ β ⁢   ⁢ σ B 2 σ A 2 + σ B 2 ⁢ β 2 ⁢ A + 2 ⁢ β ⁢   ⁢ σ A 2 σ A 2 + σ B 2 ⁢ β 2 ⁢ B $$ C - perp = β ⁢ 2 ⁢ β ⁢   ⁢ σ B 2 σ A 2 + σ B 2 ⁢ β 2 ⁢ A + 2 ⁢ β ⁢   ⁢ σ A 2 σ A 2 + σ B 2 ⁢ β 2 ⁢ B

wherein two coefficients, A and B are uncorrelated, with zero means and variances σ A 2 and σ B 2

As described above, a basic constituent of MDC of the present invention is the coding coefficients. Instead of coding the two coefficients independently, they are each transformed into two random variables, which are quantized separately, encoded and transmitted. In the receiver, if both transformed pairs of variables are available, they are inversely transformed to recover the two coefficients. If only one transformed pair of variables is received, one must be able to estimate the two coefficients.

Redundancy Allocation

Redundancy is due to the increased cost in bit rate for coding correlated pairs (C, C-perp) and (D, D-perp). One channel distortion is reduced because the correlation between (C, C-perp) and (D, D-perp) allows a lost channel to be estimated from the other when one channel is received. C and D are correlated and increase the redundancy and C-perp and D-perp are also correlated, but they increase the redundancy because they are typically not needed if both channels are recovered.

FIG. 13 illustrates a block diagram of the MDC encoder according to an alternative embodiment of the present invention. In this embodiment, redundancy allocation device 1000 is included to receive an indication of the amount of redundancy desired. The output of redundancy device 1000 is sent to MDC transformer 21 and quantizers 22 and 23 for processing. The desired redundancy is used to construct bitstreams having the optimal redundancy for reconstruction of the original information signal.

All approaches to MDC involve creating redundancy in the bitstreams transmitted over the different channels. However, redundancy can take on many forms, and may be difficult to quantify and compare. For example, simple replication of a bit on two channels and the creation of obscure relationships between the bits on two channels each create redundancy between the bitstreams. In the first case, it is easy to count the number of replicated bits, while in the second case, it may be unclear how to quantify redundancy.

The MDC encoder jointly minimizes two distortion measures:

D 0 : the distortion of the two-channel reconstruction; and

D 1 : the average distortion of the one-channel reconstruction given equi-probable loss of either channel.

The coder minimizing only D 0 is a single description decoder and its performance is characterized by rate-distortion function of the source. Redundancy is the bit rate sacrificed compared to the “D 0 -only” coder, for the purpose of lowering D 1 . More precisely, the redundancy in coding a source Y at a two-channel distortion D 0 , is the difference, ρ=R−R*, between the total transmitted bitrate R and R*=R y (D 0 ), the source rate-distortion function evaluated at D 0 . R* is the lowest rate any coder could have used to achieve the same two channel distortion. The purpose of introducing redundancy in a representation is to lower the one-channel distortion D 1 , and the function ρ(D 1 ;D 0 ) denotes the relationship between redundancy and D 1 . This redundancy rate-distortion function, describes how many bits of redundancy are required by a coder to achieve a desired D 1 at a given two-channel distortion D 0 . Like wise, the redundancy rate-distortion rate function D 1 (ρ;D 0 ) describes the achievable one-channel distortion D 1 for a given redundancy ρ and two-channel distortion D 0 .

According to the example described above, redundancy is due to the increased cost in bitrate for coding the correlated pairs. One channel distortion is reduced because the correlation between C and D and C-perp and D-perp allows a lost channel to be estimated form the other when only one channel is received.

The redundancy allocation for the example above, using the transformation equations for C and D yields: $$ ρ = log 2 ⁢ σ C ⁢ σ D σ A ⁢ σ B

where: $$ σ C 2 = 1 2 ⁢ β ⁢ σ A 2 + β 2 ⁢ σ B 2 = σ D 2

and C and C-perp are uncorrelated, that is the expected value E(C*C-perp)=0. Likewise, D and D-perp are also uncorrelated having an expected value E(D*D-perp)=0.

If desirable, the desired redundancy p is less than $$ ρ = log 2 ⁢ r 2 + 1 2 ⁢ r $$ r 2 = σ A 2 σ β 2

then the optimal thing to do is not the send C-perp and D-perp. Apply all redundancy ρ to C and D. Else use ρ* redundancy for C and D and use the remaining redundancy for C-perp and D-perp.

For a given ρ; $$ β = σ A σ B × 2 2 ⁢ ρ ⁢ ( 1 - ( 1 - 2 - 4 ⁢ ρ ) ) 2

Multiple Description Decoder (MDD)

Consider the coding and transmission of A and B through two independent and equal channels. A and B are coded and transmitted independently. If one channel undergoes a failure so that A or B is lost, because A and B are independent, the best estimate of A or B is by the respective mean, and the corresponding estimation error is σ A 2 or σ B 2 . If one coefficient, for example A, has a significantly higher variance than B, then the failure of the channel carrying A will lead to a large error.

As stated above, coefficients A and B are transformed into random variables C, C-perp and D, D-perp using the unitary transform described above. If both C′, C′-perp and D′, D′-perp are received, the inverse is simply: $$ A _ = B 2 ⁢ ( C - D ) $$ B _ = 1 2 ⁢ B ⁢ ( C + D )

If only C, C-perp or D, D-perp are received, then estimators can be used to estimate A and B. The best linear estimator for D given C is

{tilde over (C)}=γD+D −perp

and the best linear estimator for C given D is

{tilde over (D)}=γC+C −perp

if all C, C-perp, D and D-perp are received in the absence of quantization, then {tilde over (C)}=C and {tilde over (D)}=D.

The coder which codes C-perp and D-perp is referred to as the four variable multiple description decoder (MDD).

FIG. 5 depicts a Multiple Description Decoder (MDD) 40 according to an embodiment of the present invention. The decoder 40 is used to decode the encoded bitstreams from MDC encoder 20 shown in FIG. 2 .

First, the block “Determine which channels working” 41 determines whether channel 1 , channel 2 , or both are working by monitoring their inputs to the decoder 40 . One possible embodiment for performing this function is to monitor the channel for the incoming error rate. For example, the device monitors the incoming bit stream to determine if the error rate is in excess of a predetermined value, for example, to make the decision whether the input is working or not. If the error exceeds the predetermined threshold, then the device determines that the input is not working and sets the switches as described below. If the error is within the predetermined threshold, then the device determines that the input is working and sets the switches as described below. Alternate embodiments for performing this function are well-known in the art, and could easily be implemented by one of skill in the art.

Referring to FIG. 5 , the inputs from each channel are entropy decoded using standard entropy decoders 42 , 43 , 420 and 430 . The outputs of the entropy decoders 42 , 43 , 420 and 430 are inverse quantized by inverse quantizers 44 , 45 , respectively, to obtain random variables C, D, C-perp and D-perp. Inverse quantizer 45 takes as input D′, C′-perp and switch values S 1 , S 2 and S 3 . If S 3 =c (channel two is only working), inverse quantizer 45 outputs D as the inverse quantization of {tilde over (D)}. If S 3 =A (channel one is only working), inverse quantizer 45 outputs C-perp as the inverse quantization of {tilde over (C)}-perp. If S 3 =b (both channels are working), the inverse quantizer 45 outputs a value for D that is consistent with the principles of inverse quantization and the quantization intervals, illustrated in FIG. 12 . For example, according to the illustration in FIG. 12 , suppose C′-perp takes the value 1 and D′ takes the value 2 . The output D of inverse quantizer 45 with S 3 =b is a value midway between the interval consistent with both D′=2 and C′-perp =1. Inverse quantizer 44 operates in a similar manner is that discussed above with respect to inverse quantizer 45 .

After processing by inverse quantizer 44 and 45 the random variables C, D, C-perp and D-perp as well as S 1 and S 2 then enter the an Estimator 47 which is shown in detail in FIG. 7 . Estimator 47 includes memory 8 , multipliers 61 and adders 62 . After processing by estimator 47 , the random variable are forwarded to inverse transformer 46 , shown in detail in FIG. 8 which produces outputs {overscore (A)} and {overscore (B)}. Referring to FIG. 8 , inverse transformer 46 includes memory 4 , 303 , memory 1 , 300 as well as adders 62 and multipliers 61 .

Switches S 1 , S 2 , and S 3 are set according to the determination, as indicated in Table 1. If both inputs are received (C′ and D′), the switch S 1 =1, S 2 =1, and S 3 =b. On the other hand, if only one input is received, then the switch corresponding to that input is set to zero, i.e., if only C′ is received then S 1 =0 and S 3 =a, and if only D′ is received then S 2 =0 and S 3 =c.

	TABLE 1
	S 1	S 2	S 3
	C′ and D′	1	1	b
	C′ only	0	—	a
	D′ only	—	0	c

The eight memory locations 300 - 307 are initialized at the values shown in Table 2.

TABLE 2
Memory
Location Values Stored in Memory Locations
1        1                                                                                                      2                                    ⁢                                    β
2        β                                  ⁢                                                                                                            2                                      ⁢                                      β                                      ⁢                                                                                                                                                           ⁢                                                                              σ                                        B                                        2                                                                                                                                                                                                                                                  σ                                    A                                    2                                                                    +                                                                                                            σ                                      B                                      2                                                                        ⁢                                                                          β                                      2
3        2                                    ⁢                                    β                                    ⁢                                                                                                                                                   ⁢                                                                          σ                                      A                                      2                                                                                                                                                                                                            σ                                    A                                    2                                                                    +                                                                                                            σ                                      B                                      2                                                                        ⁢                                                                          β                                      2
4        β                                  2
5        2                                    ⁢                                    β                                                                                                  ⁢                                                                  (                                                                      1                                    -                                                                                                                  β                                        2                                                                                                                                              )
6        1                                                                                                      2                                    ⁢                                    β
7        2                                    ⁢                                    β                                                                                                  -                                1
8        γ

As shown in FIG. 7 , Estimator 47 receives as input C, D-perp, C-perp and D. Depending on the position of switches S 1 (either 0 or 1) (switch S 1 is shown as elements 70 for simplicity), the value C is either multiplied by the values in memory location 8 (elements 307 ) and added to C-perp or simply outputted, respectively. Similarly, depending on the position of switch S 2 (either 0 or 1) (switch S 2 is shown as elements 71 for simplicity), the value D is either multiplied by the value in memory location 8 (element 307 ) and added to D-perp or simply outputted, respectively.

The outputs of Estimator 47 are presented to inverse transformer 46 . The output of inverse transformer yields coefficients  and {circumflex over (B)}.

FIG. 6 depicts block diagram of an alternative embodiment of MDD 4 49 according to an embodiment of the present invention for use with the coder of FIG. 4 . As in FIG. 5 , the decoder in FIG. 6 , determines which channel is working using Determine Which Channel is Working 41 . After determining which channel is working, the bitstreams are then entropy decoder with entropy decoders 42 , 43 , 420 and 430 . Determine Inverse Quantization Strategy block 60 takes and inputs the values of C′, C′-perp, D′, and D′-perp and outputs signal S 4 indicating whether either D′-perp or C′-perp refine the information known about C or D, respectively. If either if refined, then signal S 4 is 0 . If neither is refined, then signal S 4 is 1.

Inverse quantizer 44 accepts signal SI and values C ′ and D′-perp, and outputs C and D-perp. D-perp is ignored, and C is sent to Inverse Transformer 46 . Inverse Quantizer 45 accepts signal S 2 and values C ′-perp and D′, and outputs C-perp and D. C-perp is ignored and D is sent to Inverse Transformer 46 for processing. The output renders: $$ A _ = β 2 ⁢ ( C - D ) $$ B _ = 1 2 ⁢ β ⁢ ( C + D )

FIG. 14 depicts an exemplary embodiment of the method according to the present invention. The method starts at step 500 . Two coefficients are transformed into two pairs of random variables at step 510 . One random variable is each pair has substantially the equal energy as one random variable in the other pair.

In step 520 , each of the pairs of random variables is separately quantized. Finally, each quantized random variable is entropy encoded separately at step 530 .

The present invention provides a method for performing multiple description coding that improves the coding efficiency of an input signal. The method includes transforming two samples into two pairs of random variables, one random variable in each pair having substantially equal energy as one random variable in the other pair. The method further includes quantizing each of the pairs of random variables and entropy coding each quantized random variable separately creating encoded bitstreams. The encoded bitstreams are received by a decoder which first determines which channels of the communication system are working. The encoded bitstreams are entropy decoded, inversed quantized and transformed. The inverse transformation performs three different transformations depending upon which channels are working, i.e., whether the first, second or both channels are working.

Although the present invention has been described in detail, those skilled in the art should understand that they can make various changes, substitutions and alterations herein without departing from the spirit and scope of the invention in its broadest form.

Claims

1. A method for coding two coefficients comprising:a) transforming the two coefficients into two pairs of random variables, one random variable in each pair having substantially equal energy as one random variable in the other pair; b) quantizing each of the pairs of random variables; and c) entropy coding each quantized random variable separately.

2. The method according to claim 1, further comprising pairing said entropy coded random variables for transmission over a plurality of channels.

3. The method according to claim 1, wherein the transforming step further comprises transforming a first coefficient (A) and a second coefficient (B) into a first random variable(C), a second random variable(D), a third random variable (C-perp) and a fourth variable (D-perp) according to the following equations: C=12⁢β⁢A+β2⁢BD=-12⁢β⁢A+β2⁢BC-perp=-β⁢2⁢β⁢ ⁢σB2σA2+σB2⁢β2⁢A+2⁢β⁢ ⁢σA2σA2+σB2⁢β2⁢BD-perp=β⁢2⁢β⁢ ⁢σB2σA2+σB2⁢β2⁢A+2⁢β⁢ ⁢σA2σA2+σB2⁢β2⁢Bwhere σA2 and σB2 are the variances of A and B β=σAσB×22⁢ρ⁢(1-(1-2-4⁢ρ))2where ρ is a difference between a total transmitted bitrate and a lowest rate that a coder uses to achieve a two channel distortion.

4. The method according to claim 3, wherein the random variable D-perp includes information not represented in random variable D.

5. The method according to claim 3, wherein the random variable C-perp includes information not represented in random variable C.

6. The method according to claim 3, wherein entropy coded random variables C and D contain all information needed to reconstruct coefficients A and B.

7. The method according to claim 3, wherein entropy coded random variables C and D are correlated with each other.

8. The method according to claim 3, wherein entropy coded random variables C and C-perp are uncorrelated.

9. The method according to claim 1, wherein a first pair of random variables (C, D-perp) are jointly quantized and second pair of random variables (D, C-perp) are jointly quantized.

10. The method according to claim 1, wherein entropy coded random variables D and D-perp are uncorrelated.

11. A method for performing multiple description coding on a block of coefficients, comprising the steps of:a) pairing coefficients within the block of coefficients to form a plurality of coefficient pairs; b) transforming each coefficient pair into a first pair of transformed coefficients and a second pair of transformed coefficients; c) quantizing each of the first and second pair of transformed coefficients; and d) assigning the first and second pair of quantized and transformed coefficients to different channels.

12. The method according to claim 11, further comprising the step of:e) entropy encoding each member of the first pair of quantized and transformed coefficients and each member of the second pair of quantized and transformed coefficients separately prior to transmission.

13. The method according to claim 11, wherein the step of transforming further comprises transforming each coefficient pair (A, B) into a first transformed coefficient (C) a second transformed coefficient (D), a third transformed coefficient (C-perp) and a fourth transformed coefficient (D-perp) according to the following equations: C=12⁢β⁢A+β2⁢BD=-12⁢β⁢A+β2⁢BC-perp=-β⁢2⁢β⁢ ⁢σB2σA2+σB2⁢β2⁢A+2⁢β⁢ ⁢σA2σA2+σB2⁢β2⁢BD-perp=β⁢2⁢β⁢ ⁢σB2σA2+σB2⁢β2⁢A+2⁢β⁢ ⁢σA2σA2+σB2⁢β2⁢BC-perp=-β⁢2⁢β⁢ ⁢σB2σA2+σB2⁢β2⁢A+2⁢β⁢ ⁢σA2σA2+σB2⁢β2⁢BD-perp=β⁢2⁢β⁢ ⁢σB2σA2+σB2⁢β2⁢A+2⁢β⁢ ⁢σA2σA2+σB2⁢β2⁢Bwhere σA and σB are the variances of A and B, and β=σAσB×22⁢ρ⁢(1-(1-2-4⁢ρ))2where ρ is a difference between a total transmitted bitrate and a lowest rate that a coder uses to achieve a two channel distortion.

14. The method according to claim 11, wherein the transforming step further comprises transforming each coefficient pair into the first and second transformed coefficients using a unitary transform such that the first and second transformed coefficients have substantially equivalent energy.