Method for encoding and decoding an enhancement layer

Description

TECHNICAL FIELD

[0001] The present invention relates to a G.711 encoder and decoder, and more particularly, to a method of encoding and decoding an enhancement layer to reduce a quantization error in a G.711 codec.

BACKGROUND ART

[0002] It is difficult to directly apply a technology of sampling an analog voice signal and converting the sampled analog voice signal into a digital signal to the application with a limited bandwidth due to a relatively high bit rate. For example, a speech signal that is sampled at 8 KHz and quantized to 16 bits per sample, will result in a bit rate of 128,000 bits per second (bps). In order to effectively transmit a speech signal at a low bit rate in most communication networks, a codec apparatus for compressing and decompressing the speech signal is used.

[0003] Examples of a method of compressing and decompressing a speech signal include pulse coded modulation (PCM) and code-excited linear prediction (CELP). PCM is a method of compressing a respective voice samples to a predetermined number of bits, whereas CELP is a method of framing a speech signal into blocks and compressing the speech signal on the basis of a speech production model. Various codecs have been developed and standardized in a wide range of fields. One of the most widely used codecs is a log PCM codec that is adopted on a public switched telephone network (PSTN), internet telephony, and so on. The log PCM codec varies a quantization step depending on the magnitude of an input signal. That is, the log PCM codec uses a small quantization step when the level of an input signal is low, and uses a large quantization step when the level of an input signal is high. The log PCM codec can compress a digital sample with 16 bits per sample to a codeword with 8 bits per sample. Accordingly, if a signal is sampled at 8 KHz, a bit rate of 64,000 bps is obtained using the log PCM codec. There are two main coding laws, which are A-law and µ-law. The respective laws are expressed as


where x is an input sample, The µand A are constants for the respective coding laws, C() is a sample value compressed by each coding law, and ∥ is an absolute value operation.

[0004] The A-law and u-law have been standardized as ITU-T(international Telecommunication Union -Telecommunication Sector) Recommendation G.711 since 1972. The values of µand A in the G.711 are 255 (µ) and 87.56 (A), respectively. The G.711 codec actually uses a floating point quantization method, rather than directly calculates Equation 1. Among available bits per sample (e.g., 8 bits for the G.711), some bits are used to determine a quantization step and the remaining bits are used to express a position in the quantization step. The former bits are exponent bits and the latter bits are mantissa bits. In the A-law of the G.711, 3 bits are used for the exponent, 4 bits are used for the mantissa, and the remaining 1 bit is used to express a sign of a sample.

[0005] The G.71 provides a high quality of about 4 MOS (Mean Opinion Score) for narrowband speech, with less computational complexity and memory requirements. However, there is still quality degradation caused by quantization error, compared with an original speech signal.

[0006] The document "A G.711 EMBEDDED WIDEBAND SPEECH CODING FOR VOIP CONFERENCES", IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, INFORMATION & SYSTEMS SOCIETY, TOKYO, JP, vol. E89D, no. 9, 1 September 2006, pages 2542-2552, by HIWASAKI Y ET AL describes a wide-band extension to G.711 and proposes to reduce quantization noise by using a weighted vector quantization scheme.

BRIEF DESCRIPTION OF THE DRAWINGS

[0007] 

FIG. 1 is a block diagram of an encoder and a decoder for quality improvement of speech in a G.711 codec;

FIG. 2 is a schematic view illustrating an input sample and an output bitstream of an encoder to which a log pulse coded modulation (PCM) codec of a conventional G.711 codec is applied;

FIG. 3 is a schematic view illustrating an input sample and an output bitstream of an encoder to which enhancement layer encoding according to the present invention is applied;

FIGS. 4A and 4B illustrate an exponent maps for dynamically calculating the number of bits for additional mantissa information of each sample in a frame depending on the magnitude of an input signal according to an embodiment of the present invention;

FIG. 5 is a flowchart illustrating a method of generating a bit allocation table according to an embodiment of the present invention;

FIG. 6 is a block diagram of an enhancement layer encoder according to an embodiment of the present invention;

FIG. 7 is a block diagram of an enhancement layer decoder according to an embodiment of the present invention;

FIG. 8 is a block diagram of an enhancement layer encoder according to another embodiment of the present invention;

FIG. 9 is a flowchart illustrating a method of encoding an enhancement layer according to an embodiment of the present invention;

FIG. 10 is a block diagram of an enhancement layer decoder according to another embodiment of the present invention; and

FIG. 11 is a flowchart illustrating a method of decoding an enhancement layer according to an embodiment of the present invention.

DETAILED DESCRIPTION OF THE INVENTION

TECHNICAL PROBLEM

[0008] The present invention provides an apparatus and method for encoding and decoding an enhancement layer, which can reduce quantization error in a G.711 codec by adding extra bits to each G.711-coded sample.

[0009] The present invention also provides an enhancement layer encoder and decoder which can reduce quantization error in a G.711 codec.

TECHNICAL SOLUTION

[0010] According to an aspect of the present invention, there is provided a method of encoding an enhancement layer according to independent claim 1.

[0011] According to another aspect of the present invention, there is provided a method of decoding an enhancement layer according to independent claim 5.

ADVANTAGEOUS EFFECTS

[0012] As described above, according to the present invention, since additional bits for mantissa information are dynamically allocated to each sample by using exponent information obtained from a conventional log PCM codec like a conventional G.711 codec, a quantization error resulting from the log PCM codec can be reduced and the quality of speech can be improved. Also, since the present invention does not change the conventional log PCM codec, compatibility with a network employing an existing log PCM codec can be achieved.

MODE OF THE INVENTION

[0013] A method and apparatus for encoding and decoding an enhancement layer and an enhancement layer encoder and decoder according to the present invention will now be described more fully with reference to the accompanying drawings, in which exemplary embodiments of the invention are shown.

[0014] FIG. 1 is a block diagram of an encoder 100 and a decoder 150 for improving the quality of speech in a G.711 codec.

[0015] Referring to FIG. 1, the encoder 100 includes an input buffer 105, a G.711 encoding unit 110, an enhancement layer encoding unit 115, and a multiplexing unit 120. The decoder 150 includes a demultiplexing unit 155, a G.711 decoding unit 160, an enhancement layer decoding unit 165, a signal synthesizing unit 170, and an output buffer 175. The encoder 100 is connected to the decoder 150 through a communication channel 140.

[0016] The encoder 100 will be first explained.

[0017] The input buffer 105 stores a block of input samples with a predetermined size in order to process an input signal in block-by-block. For example, when an input signal is sampled at 8 KHz and processed at every 5 ms frame, the input buffer 105 stores 40 samples (= 8KHz * 5ms), The G.711 encoding unit 110 encodes the frame stored in the input buffer 105 using the conventional G.711 codec, and outputs a G.711 bitstream. Since the G.711 is a well-known codec standardized by the ITU-T, a detailed explanation thereof will not be given here. The enhancement layer encoding unit 115 encodes a quantization error, which is not represented by the G.711 encoding unit 110, using additional bits and outputs an enhancement bitstream. The multiplexing unit 120 multiplexes the G.711 bitstream of the G.711 encoding unit 110 and the enhancement bitstream of the enhancement layer encoding unit 115. The multiplexed bitstream is transmitted to the decoder 150 through the communication channel 140.

[0018] The decoder 150 will now be explained.

[0019] The demultiplexing unit 155 demultiplexes the multiplexed bitstream received from the encoder 100 through the communication channel 140 to a G.711 bitstream and an enhancement bitstream. The G.711 decoding unit 160 decodes the G.711 bitstream by using the G.711 codec and outputs a G.711 decoded signal. The enhancement layer decoding unit 165 decodes the enhancement bitstream and outputs an enhancement layer decoded signal. The signal synthesizing unit 170 combines the G.711 decoded signal from the G.711 decoding unit 160 and the enhancement layer decoded signal from the enhancement layer decoding unit 165 and outputs a synthesized signal. The output buffer 175 stores the synthesized signal from the signal synthesizing unit 170, and outputs the stored signal in frame-by-frame.

[0020] FIG. 2 is a schematic view illustrating an input bitstream and an output bitstream of an encoder to which a log PCM codec of a conventional G.711 codec is applied. FIG. 3 is a schematic view illustrating an input bitstream and an output bitstream of an encoder to which enhancement layer encoding according to the present invention is applied.

[0021] Referring to FIG. 2, of the conventional G.711 encoder compresses a 16-bit input sample 200 to an 8-bit sample 250. The 8-bit sample 250 is composed of 1-bit sign information 260, 3-bit exponent information 270, and 4-bit mantissa information 280. The exponent information 270 indicates a compander segment, and the mantissa information 280 indicates a position in the segment indicated by the exponents information 270.

[0022] Referring to FIG. 3, when enhancement layer encoding according to the present invention is used, a coded sample includes additional mantissa information 390 as well as a G.711-coded sample of 8 bits. The additional mantissa information 390 sub-divides a specific position indicated by mantissa information 380 in a segment indicated by exponent information 370, thereby reducing quantization error resulted from the G.711 codec.

[0023] When a bit rate of the enhancement layer is 16 Kbit/s and the enhancement layer operates on 5 ms frame, the total number of available bits for enhancement layer per frame is 80 bits. That is, when the number of samples in the frame is 40 samples, an additional 2 bits per sample can be allocated on the average. Since a quantization error in the G.711 codec depends on the magnitude of an input signal, it is preferable to dynamically allocating the number of bits for additional mantissa information of each sample according to the magnitude of each sample, rather than to allocate the same number of bits for the additional mantissa information of each sample.

[0024] In the case where 3 bits per sample are allocated to additional mantissa information in order to reduce quantization error further, the total number of bits of all samples in a frame i.e. 120 bits (40 samples * 3 bits) exceeds the available 80 bits. In this regard, bits ranging from 0 to 3 are allocated to the additional mantissa information based on the exponent value of each sample. Of course, the maximum number of bits per sample for the additional mantissa information may be set to 3, or more, or less, depending upon embodiments of the present invention.

[0025] FIGS. 4A and 4B illustrate exponent maps for dynamically allocating the number of bits of additional mantissa information to each sample in a frame depending on the magnitude of an input sample according to an embodiment of the present invention.

[0026] Referring to FIG. 4A, the exponent map is a matrix in which row indices are exponent indices of additional mantissa information derived from an exponent value of each sample and column indices are sample indices representing each sample. For example, when 0 to 3-bits for additional mantissa information are allocated to each sample in a frame of 40 samples, the exponent map is a 10 x 40 matrix.

[0027] In detail, exponent indices of each sample are proportional to the exponent value of each sample, are sequential, and the number of the exponent indices are the same as the number of bits of additional mantissa information. That is, exponent indices are obtained by incrementing the exponent value of each sample. For example, when the exponent value of a sample is "000" in binary, exponent indices corresponding to the sample are 0 (the exponent value + 0), 1 (the exponent value + 1), and 2 (the exponent value + 2). As another example, when the exponent value is 7 ("111" in binary), exponent indices are 7 (the exponent value + 0), 8 (the exponent value + 1), and 9 (the exponent value + 2). Accordingly, exponent indices of each sample for additional exponent information can range from 0 to 9.

[0028] All of elements in an exponent map are initialized to -1, and elements corresponding to an exponent index of a sample store a sample index. That is, (an exponent index, a sample index) = a sample index. For example, when the exponent value of the second sample in a frame is "011", possible exponent indices of the sample are 3, 4, and 5. From this, elements corresponding to the exponent indices 3, 4, 5, i.e., (3,2), (4,2), (5,2) are set to 2, respectively. And the remaining elements in a column of the sample index remain intact.

[0029] By repeating the procedure to set a sample index to corresponding elements for all samples in a frame, the exponent map is established. A bit allocation table indicating the number of additional bits allocated to each sample is created based on the exponent map. That is, 1 bit is allocated to each sample corresponding to the current exponent index which starts from the maximum value (i.e., 9) while decreasing by 1. The bit allocation is performed until the total number of bits allocated to the samples is equal to the available bits in a frame. The generation of the bit allocation table will be explained in detail later with reference to FIG. 5.

[0030] Referring to FIG. 4B, an exponent map is a matrix in which row indices are exponent indices of additional mantissa information derived from the exponent value of each sample and column indices are order indices indicating the number of samples with the same exponent index. Each of elements of the exponent map represents a sample index with an exponent index.

[0031] For example, in the case where the maximum number of bits for additional mantissa information is 3 and there are 40 samples in a frame, the exponent map would be a 10 x 40 matrix since all of samples in a frame can have the common exponent index.

[0032] A method of generating an exponent map with respect to an n-th sample will now be explained.

[0033] First, exponent indices of additional mantissa information of the n-th sample are obtained based on its exponent value. That is, the exponent indices of the n-th sample are (its exponent value + j), where j = 0, 1, and 2.

[0034] Once three exponent indices of the n-th sample are obtained, an index of the n-th sample is stored in elements corresponding to the exponent indices and order indices representing the current number of samples with the exponent indices, respectively. That is, (an exponent index, the current number of samples with the exponent index) = an index of the n-th sample. The current numbers of the samples with the exponent indices are increased by 1, respectively,

[0035] For example, when the exponent value of the 0-th sample in a frame is "110" in binary, the corresponding exponent indices are 6, 7, and 8. Elements corresponding to the exponent indices 6, 7, and 8, i.e., (6,0), (7,0), (8,0), are set to sample index 0, and the current numbers of samples with the exponent indices 6, 7, and 8 are set to 1, respectively. Next, when the exponent value of the 1-st sample is "100" in binary, the corresponding exponent indices are 4, 5, and 6. Elements corresponding to the exponent indices 4, 5, and 6, i.e., (4,0), (5,0), (8,1) are set to sample index 1. The reason why the (6,1)-th element is set to 1 is that the number of samples having the exponent index of 6 is already 1 in the previous sample. Accordingly, the numbers of the samples corresponding to the exponent indices 4, 5, 6, 7, and 8 are 1, 1, 2, 1, and 1, respectively. When the exponent map is completely generated in this way for all samples, the number of samples and sample indices corresponding to each exponent index can be obtained.

[0036] FIG. 5 is a flowchart illustrating a method of generating a bit allocation table according to an embodiment of the present invention,

[0037] Referring to FIG. 5, when it is assumed that the maximum number of additional bits per sample is 3 and the total number of available bits per frame is 80, an enhancement layer encoder outputs additional mantissa information to each sample based on an exponent value of each sample.

[0038] In detail, in operation S500, the enhancement layer encoder initializes all elements of a bit allocation table to 0, sets current available bits to the total number of available bits in a current frame, and sets a maximum value of the exponent indices as a current exponent index. In operation S510, the enhancement layer encoder calculates the number of samples corresponding to each exponent index, by referring to the exponent maps illustrated in FIGS. 4A and 4B. For example, there are two samples, whose sample indices are 0 and 39, corresponding to an exponent index 8 in the exponential map illustrated in FIG. 4A.

[0039] In operation S520, the enhancement layer encoder compares the number of samples corresponding to the current exponent index with current available bits, and then sets the smaller one of the two numbers as the number of usable bits. In operation S530, 1 bit is allocated to each sample corresponding to the current exponent index until the number of the usable bits is exhausted. In operation S540, the enhancement layer encoder sets a value subtracting the number of the usable bits from the current available bits as a new number of current available bits.

[0040] In operation S550, it is checked whether the current available bits are 0. If the current available bits are 0, the generation of a bit allocation table ends for the frame. If the current available bits are not 0, the enhancement layer proceeds to operation S560. In operation S560, the enhancement layer encoder updates the current exponent index by decrementing the current exponent index by 1, and returns to operation S520. Then the enhancement layer encoder repeats operations from S520 to S550.

[0041] FIG. 6 is a block diagram of an enhancement layer encoder according to an embodiment of the present invention.

[0042] Referring to FIG. 6, the enhancement layer encoder includes an exponent map generating unit 600, a bit allocation table generating unit 610, and a bit output unit 620. The enhancement layer encoder corresponds to an enhancement layer encoding unit 115 illustrated in FIG. 1.

[0043] The exponent map generating unit 600 computes exponent indices of additional mantissa information per sample based on the exponent value of each sample, and then generates an exponent map including the exponent indices of each sample. The exponent value of each sample can be extracted from the G.711 encoding unit 110 illustrated in FIG. 1. Since the exponent map is illustrated in FIG. 4A and 4B, a detailed explanation thereof will not be given here.

[0044] Referring to the exponent map, the bit allocation table generating unit 610 retrieves samples corresponding to each exponent index and allocates 1 bit to the retrieved samples by sequentially decrementing the exponent index by 1 from the maximum value. When this bit allocation procedure is completed for all of exponent indices, the bit allocation table generating unit 610 generates a bit allocation table containing the number of bits allocated to each sample. A method of generating the bit allocation table is illustrated in FIG. 5.

[0045] The bit output unit 620 outputs the most significant bits of the additional mantissa information in amount of the number of the bits allocated to each sample in an input frame by using the bit allocation table. That is, the bit output unit 620 outputs [the additional mantissa information] / (2^ [the number of the bits of the additional mantissa information - the allocated number of the bits]).

[0046] FIG. 7 is a block diagram of an enhancement layer decoder according to an embodiment of the present invention.

[0047] Referring to FIG. 7, the enhancement layer decoder includes an exponent map generating unit 700, a bit allocation table generating unit 710, and an additional mantissa decoding unit 720. The exponent map generating unit 700 and the bit allocation table generating unit 710 are the same as the exponent map generating unit 600 and the bit allocation table generating unit 610 illustrated in FIG. 6, and thus a detailed explanation thereof will not be given here.

[0048] The additional mantissa decoding unit 720 extracts and decodes additional mantissa information of each sample from an enhancement bitstream based on the number of bits of the additional mantissa information allocated to each sample.

[0049] FIG. 8 is a block diagram of an enhancement layer encoder according to another embodiment of the present invention.

[0050] Referring to FIG. 8, the enhancement layer encoder include an additional mantissa extracting unit 800, a bit allocating unit 810, and a bit output unit 820.

[0051] The additional mantissa extracting unit 800 extracts additional mantissa information from an input frame based on an exponent value obtained from the G.711 encoding performed on the input frame. That is, the additional mantissa extracting unit 800 extracts some bits followed by mantissa information (i.e., G.711 mantissa information of 4 bits) as additional mantissa information, based on the exponent value obtained from the G.711 encoding performed on the input frame. Although all of bits followed by the mantissa information may be the additional mantissa information, it is assumed in FIG. 8 that the maximum number of bits of the additional mantissa information is 3 in the current embodiment. In this case, a pseudo-code for the additional mantissa extracting unit 800 is as follows.

for(i=0; i<L; i++)

{

ext_bits[i]=exp[i]+3;

ext_mantissa[i]=x[i] & (2ext_bits[i]-1);

}

wherein L is the number of samples in a frame, exp[i] is an exponent value of an i-th sample, ext_bits[i] is the number of bits of additional mantissa information of the i-th sample, ext_mantissa[i] is the additional mantissa information of the i-th sample, x[i] is the i-th sample, and "&" is a bitwise AND operation.

[0052] For example, suppose that an input sample is "0000 0001 1010 1001" in binary. The input sample is encoded in G.711 A-law, which is a combination of a sign bit of "1", exponent bits of "001", and mantissa bits of "1010". Also the resulting additional mantissa information is "100", assuming that the maximum number of bits of additional mantissa information is 3.

[0053] The bit allocating unit 810 calculates the number of bits allocated to each sample by using the total number of available bits and exponent values of each sample. For example, if the bit-rate of an enhancement layer is 16 Kbit/s and the frame size is 5 ms, the total number of available bits per frame is 80 bits. The bit allocating unit 810 dynamically computes the number of bits for additional mantissa information per each sample based on the priorities of the additional mantissa information of each sample with criterion to minimize quantization error in each frame. For example, the priority may be determined from the exponent value of each sample which means a quantization step in a G.711 codec, In other words, since a sample with relatively larger exponent value results in more quantization error, its priority is higher so that more additional bits are allocated to the sample. A sample with a relatively smaller exponent value has a lower priority so that less additional bits are allocated to the sample because its quantization error is less.

[0054] The bit output unit 820 outputs the additional mantissa information in amount of the number of the bits allocated to each sample computed by the bit allocating unit 810. A pseudo-code for the bit output unit 820 is as follows.

for(i=0; i<L; i++)

{

tx_bit_enh[i]=ext_mantissa[i]>>(ext_bits[i]-bit_alloc[i]);

}

wherein bit_alloc[i] is the number of bits allocated to the i-th sample, tx_bit_enh[i] is an coded enhancement bitstream of the i-th sample, and x>>a" is an operation in which "x" is right-shifted by "a" bits.

[0055] For example, in the case where additional mantissa information of a sample is "100" and the number of bits allocated is 2 bits, the bit output unit 820 outputs "10" as its encoded enhancement bitstream.

[0056] In the embodiment, it is exemplified that the maximum number of bits per sample for additional mantissa information is extracted from the sample, and then is truncated to allocated number of bits for the sample. However, it is possible that the allocated number of bits is extracted from a sample after a bit allocation table is established, in another embodiment.

[0057] FIG. 9 is a flowchart illustrating a method of an enhancement layer encoding according to an embodiment of the present invention.

[0058] Referring to FIG. 9, in operation S900, an enhancement layer encoder extracts additional mantissa information based on an exponent value obtained from the G.711 encoding performed on the input frame. Although the additional mantissa information may be the whole remaining bits followed by mantissa information in the input frame, it is assumed in FIG. 9 that the maximum number of bits for the additional mantissa information is 3 in the current embodiment. Accordingly, the enhancement layer encoder extracts additional mantissa information of 3 bits only.

[0059] In operation S910, the enhancement layer encoder computes the number of additional bits for mantissa information per sample by using the exponent value obtained from the G.711 encoding. In detail, the enhancement layer encoder sets priorities for 3 respective bits of the additional mantissa information of each sample as being proportional to the exponent value of each sample. For example, an exponent index may be used as a priority as shown in FIGS. 4A and 4B. The enhancement layer encoder sequentially allocates 1 bit to samples with from the highest priority to the lowest priority until a total number of allocated bits exceeds a total number of available bits in the frame.

[0060] In operation S920, after the number of bits allocated to each sample is obtained in this way, the enhancement layer encoder outputs the most significant bits of the additional mantissa information in amount of the number of the bits allocated to each sample in an input frame.

[0061] FIG. 10 is a block diagram of an enhancement layer decoder according to another embodiment of the present invention.

[0062] Referring to FIG. 10, the enhancement layer decoder includes a decoder bit allocating unit 1000, an additional mantissa decoding unit 1010, and an enhancement signal synthesizing unit 1020.

[0063] The decoder bit allocating unit 1000 obtains the number of bits for additional mantissa information per sample by using the total number of available bits in a frame and exponent values obtained by G.711 decoding. The operation of the decoder bit allocating unit 1000 is the same as that of the bit allocating unit illustrated in FIG. 7, and thus a detailed explanation thereof will not be given here.

[0064] The additional mantissa decoding unit 1010 restores additional mantissa information from an enhancement bitstream, using the exponent value and the number of the bits for the additional mantissa information obtained by the decoder bit allocating unit 1000. That is, the additional mantissa decoding unit 1010 restores the additional mantissa information by extracting the same number of bits as the number of the bits of the additional mantissa information allocated to each sample from the enhancement bitstream. When the maximum number of the bits for the additional mantissa information is 3, a pseudo-code for operating the additional mantissa decoding unit 1010 is shown below. That is, the additional mantissa decoding unit 1010 inserts a bit string of "0"s to the decoded additional mantissa information in amount of difference between the maximum number of bits for the additional mantissa information and the number of allocated bits for the additional mantissa information.

for(i=0; i<L; i++)

{

ext_mantissa[i]==rx_bits_enh[i]<<(3 - bit_alloc[i]);

}

wherein rx_bit_enh[i] is the i-th enhancement bitstream.

[0065] The enhancement signal synthesizing unit 1020 restores an enhancement signal by using the restored additional mantissa information, exponent value and sign information obtained by G.711 decoding. A pseudo-code for operating the enhancement signal synthesizing unit 1020 is as follows. At first, the restored additional mantissa information is bit-shifted to left in amount of the exponent value, and then sign information is added in the way that if the sign information indicates a negative value, the bit-shifted additional mantissa information is multiplied by (-1), and otherwise, the bit-shifted additional mantissa information itself is an enhancement sample.

for(i=0; i<L; i++)

{

sig_enh[i] = ext_mantissa[i] << exp[i];

if(sign[i]=negative value)

sig_enh[i]=-sig_enh[i];

}

wherein sign[i] is sign information of the i-th sample which is obtained by G.711 decoding.

[0066] FIG. 11 is a flowchart illustrating a method of decoding an enhancement layer according to an embodiment of the present invention.

[0067] Referring to FIG. 11, in operation S1100, an enhancement layer decoder obtains the number of additional bits allocated to each sample by using the maximum number of available bits and exponent values in a frame obtained by a G.711 decoding unit. In operation S1110. the enhancement layer decoder extracts additional mantissa information, as many as the number of the additional bits allocated to each sample, from an enhancement bitstream. In operation S1120, the enhancement layer decoder restores additional mantissa information.

[0068] The present invention may be embodied as computer-readable codes on a computer-read able recording medium. The computer-readable recording medium is any data storage device that can store data which can be thereafter read by a computer system. Examples of the computer-readable recording medium include read-only memories (ROMs), random-access memories (RAMs), CD-ROMs, magnetic tapes, floppy disks, and optical data storage devices. The computer-readable recording medium can be dispersively installed in a computer system connected to a network, and stored and executed as a computer-readable code in a distributed computing environment.

[0069] While the present invention has been particularly shown and described with reference to exemplary embodiments thereof using specific terms, the embodiments and terms have been used to explain the present invention and should not be construed as limiting the scope of the present invention defined by the claims. Accordingly, it will be understood by those of ordinary skill in the art that various changes in form and details may be made therein without departing from the scope of the present invention as defined by the following claims.

Claims

1. A method of encoding an enhancement layer in a hierarchical encoding, the enhancement layer being combined with a base layer encoded with a G.711 codec, the base layer including exponent information and mantissa information of a sample, and the enhancement layer including additional mantissa information of the sample to reduce quantization error in the G.711 codec, the method comprising:

calculating the number of allocated bits for the additional mantissa information to extend the mantissa information; and

encoding the additional mantissa information according to the number of the allocated bits,

wherein the calculating the number of allocated bits is adaptively performed by referring to the exponent information of samples existing in an interval of predetermined length.

2. The method of claim 1, wherein the calculating the number of allocated bits is adaptively performed according to the relative magnitude of exponents of samples existing in a frame.

3. The method of claim 2, wherein the allocating of the bits comprises allocating bits according to the priorities based on the exponents of samples, wherein the number of bits allocated to one sample does not exceed a predetermined value.

4. The method of claim 2, wherein the calculating the number of allocated bits comprises:

generating an exponent map using the range of the exponents, the maximum number of bits to be allocated to each sample, and the number of samples per frame; and

calculating the number of bits allocated to each sample using the exponent map.

5. A method of decoding an enhancement layer signal in a hierarcihically encoded bitstream comprising a base layer bitstream, which includes exponent information and mantissa information of a sample, encoded with a G.711 codec and an enhancement layer bitstream, which includes additional mantissa information of the sample, to reduce quantization error in the G:711 codec, the method comprising:

calculating the number of bits allocated to each sample for the additional mantissa information, based upon the exponent information extracted from the base layer bitstream; and

extracting the additional mantissa information of the calculated number of the bits allocated to each sample from the enhancement layer bitstream.

6. The method of claim 5, wherein the calculating of the number of the bits is adaptively performed according to the relative magnitude of exponents of samples existing in a frame.

7. The method of claim 6, wherein the calculating of the number of the bits comprises allocating bits according to the priorities, based on the exponents of samples, wherein the number of bits allocated to one sample does not exceed a predetermined value.

8. The method of claim 6, wherein the calculating of the number of the bits comprises:

generating an exponent map using the range of the exponents, the maximum number of bits to be allocated per sample, and the number of samples per frame; and

calculating the number of bits allocated to each sample using the exponent map.

Ansprüche

1. Verfahren zum Codieren einer Erweiterungsschicht bei einer hierarchischen Codierung, wobei die Erweiterungsschicht mit einer mit einem G.711 Codec codierten Basisschicht kombiniert ist, wobei die Basisschicht Exponenteninformation und Mantisseninformation eines Samples enthält und wobei die Erweiterungsschicht zusätzliche Mantisseninformation des Samples enthält, um Quantisierungsfehler in dem G.711 Codec zu reduzieren, wobei das Verfahren umfasst:

Berechnen der Zahl von zugewiesenen Bits für die zusätzliche Mantisseninformation, um die Mantisseninformation zu erweitern; und

Codieren der zusätzlichen Mantisseninformation in Übereinstimmung mit der Zahl von zugewiesenen Bits,

wobei das Berechnen der Zahl von zugewiesenen Bits adaptiv durch Bezugnahme auf die Exponenteninformation von Samples durchgeführt wird, die in einem Intervall einer vorbestimmten Länge existieren.

2. Verfahren nach Anspruch 1, wobei das Berechnen der Zahl von zugewiesenen Bits in Übereinstimmung mit der relativen Größe von Exponenten von Samples adaptiv durchgeführt wird, die in einem Frame existieren.

3. Verfahren nach Anspruch 2, wobei das Zuweisen der Bits Zuweisen von Bits in Übereinstimmung mit den Prioritäten basierend auf den Exponenten von Samples umfasst, wobei die Zahl von Bits, welche einem Sample zugewiesen wird, einen vorbestimmten Wert nicht übersteigt.

4. Verfahren nach Anspruch 2, wobei das Berechnen der Zahl von zugewiesenen Bits umfasst:

Erzeugen eines Exponentenplans mittels der Spanne der Exponenten, der maximalen Zahl von Bits, die an jedes Sample zuzuweisen sind, und der Zahl von Samples pro Frame; und

Berechnen der Zahl von Bits, die jedem Sample zugewiesen ist, mittels des Exponentenplans.

5. Verfahren zum Decodieren eines Erweiterungsschicht-Signals in einem hierarchisch codierten Bitstrom, der einen mit einem G.711 Codec codierten Basisschicht-Bitstrom, welcher Exponenteninformation und Mantisseninformation eines Samples enthält, und einem Erweiterungsschicht-Bitstrom umfasst, welcher zusätzliche Mantisseninformation des Samples enthält, um einen Quantisierungsfehler in dem G.711 Codec zu reduzieren, wobei das Verfahren umfasst:

Berechnen der Zahl von Bits, die jedem Sample für die zusätzliche Mantisseninformation zugewiesen ist, basierend auf der Exponenteninformation, die von dem Basisschicht-Bitstrom extrahiert ist; und

Extrahieren der zusätzlichen Mantisseninformation der berechneten Zahl der Bits, die jedem Sample zugewiesen ist, von dem Erweiterungsschicht-Bitstrom.

6. Verfahren nach Anspruch 5, wobei das Berechnen der Zahl der Bits in Übereinstimmung mit der relativen Größe von Exponenten von Samples adaptiv durchgeführt wird, die in einem Frame existieren.

7. Verfahren nach Anspruch 6, wobei das Berechnen der Zahl der Bits Zuweisen von Bits in Übereinstimmung mit den Prioritäten basierend auf den Exponenten von Samples umfasst, wobei die Zahl von Bits, die einem Sample zugewiesen wird, einen vorbestimmten Wert nicht übersteigt.

8. Verfahren nach Anspruch 6, wobei das Berechnen der Zahl der Bits umfasst:

Erzeugen eines Exponentenplans mittels der Spanne der Exponenten, der maximalen Zahl von Bits, die je Sample zuzuweisen ist, und der Zahl von Samples je Frame, und

Berechnen der Zahl von Bits, die jedem Sample zugewiesen wird, mittels des Exponentenplans.

Revendications

1. Procédé de codage d'une couche d'amélioration dans un codage hiérarchique, la couche d'amélioration étant combinée à une couche de base codée avec un codec G.711, la couche de base comprenant des informations d'exposant et des informations de mantisse d'un échantillon, et la couche d'amélioration comprenant des informations de mantisse supplémentaires de l'échantillon afin de réduire une erreur de quantification dans le codec G.711, le procédé comprenant :

le calcul du nombre de bits attribués pour les informations de mantisse supplémentaires afin d'étendre les informations de mantisse ; et

le codage des informations de mantisse supplémentaires selon le nombre de bits attribués,

dans lequel le calcul du nombre de bits attribués est réalisé de façon adaptative en référence aux informations d'exposant d'échantillons existant dans un intervalle de longueur prédéterminé.

2. Procédé selon la revendication 1, dans lequel le calcul du nombre de bits attribués est réalisé de façon adaptative selon la grandeur relative d'exposants d'échantillons existants au sein d'une trame.

3. Procédé selon la revendication 2, dans lequel l'attribution des bits comprend l'attribution de bits selon les priorités sur la base des exposants d'échantillons, dans lequel le nombre de bits attribués à un échantillon ne dépasse pas une valeur prédéterminée.

4. Procédé selon la revendication 2, dans lequel le calcul du nombre de bits attribués comprend :

la génération d'une carte d'exposant en utilisant la plage des exposants, le nombre maximal de bits à attribuer à chaque échantillon, et le nombre d'échantillons par trame ; et

le calcul de nombre de bits attribués à chaque échantillon en utilisant la carte d'exposant.

5. Procédé de décodage d'un signal de couche d'amélioration dans un flux binaire codé hiérarchiquement comprenant un flux binaire de couche de base, qui comprend des informations d'exposant et des informations de mantisse d'un échantillon, codées avec un codec G.711 et un flux binaire de couche d'amélioration, qui comprend des informations de mantisse supplémentaires de l'échantillon, afin de réduire une erreur de quantification dans le codec G.711, le procédé comprenant :

le calcul du nombre de bits attribués à chaque échantillon pour les informations de mantisse supplémentaires, sur la base des informations d'exposant extraites du flux binaire de couche de base ; et

l'extraction des informations de mantisse supplémentaires du nombre calculé de bits attribués à chaque échantillon à partir du flux binaire de couche d'amélioration.

6. Procédé selon la revendication 5, dans lequel le calcul du nombre de bits est réalisé de façon adaptative selon la grandeur relative d'exposants d'échantillons existants au sein d'une trame.

7. Procédé selon la revendication 6, dans lequel le calcul du nombre de bits comprend l'attribution de bits selon les priorités, sur la base des exposants d'échantillons, dans lequel le nombre de bits attribués à un échantillon ne dépasse pas une valeur prédéterminée.

8. Procédé selon la revendication 6, dans lequel le calcul du nombre de bits comprend :

la génération d'une carte d'exposant en utilisant la plage des exposants, le nombre maximal de bits à attribuer par échantillon, et le nombre d'échantillons par trame ; et

le calcul du nombre de bits attribués à chaque échantillon en utilisant la carte d'exposant.

Drawing