Block-constrained TCQ method, and method and apparatus for quantizing LSF parameters employing the same in a speech coding system

BACKGROUND OF THE INVENTION

0001The present invention relates to a speech coding system, and more particularly, to a method and apparatus for quantizing line spectral frequency (LSF) using block-constrained Trellis coded quantization (BC-TCQ).

0002For high quality speech coding in a speech coding system, it is very important to efficiently quantize linear predictive coding (LPC) coefficients indicating the short interval correlation of a voice signal. In an LPC filter, an optimal LPC coefficient value is obtained such that after an input voice signal is divided into frame units, the energy of the prediction error for each frame is minimized. In the third generation partnership project (3GPP), the LPC filter of an adaptive multi-rate wideband (AMR_WB) speech coder standardized for International Mobile Telecommunications-2000 (IMT-2000) is a 16-dimensional all-pole filter and at this time, for quantization of 16 LPC coefficients being used, many bits are allocated. For example, the IS-96A Qualcomm code excited linear prediction (QCELP) coder, which is the speech coding method used in the CDMA mobile communications system, uses 25% of the total bits for LPC quantization, and Nokia's AMR_WB speech coder uses a maximum of 27.3% to a minimum of 9.6% of the total bits in 9 different modes for LPC quantization.

0003So far, many methods for efficiently quantizing LPC coefficients have been developed and are being used in voice compression apparatuses. Among these methods, direct quantization of LPC filter coefficients has the problems that the characteristic of a filter is too sensitive to quantization errors, and stability of the LPC filter after quantization is not guaranteed. Accordingly, LPC coefficients should be converted into other parameters having a good compression characteristic and then quantized. and Typically, reflection coefficients or LSFs are used. Particularly, since an LSF value has a characteristic very closely related to the frequency characteristic of voice, most of the recently developed voice compression apparatuses employ a LSF quantization method.

0004In addition, if inter-frame correlation of LSF coefficients is used, efficient quantization can be implemented. That is, without directly quantizing the LSF of a current frame, the LSF of the current frame is predicted from the LSF information of past frames and then the error between the LSF and its prediction frames is quantized. Since this LSF value has a close relation with the frequency characteristic of a voice signal, this can be predicted temporally and in addition, can obtain a considerable prediction gain.

0005LSF prediction methods include using an auto-regressive (AR) filter and using a moving average (MA) filter. The AR filter method has good prediction performance, but has a drawback that at the decoder side, the impact of a coefficient transmission error can spread into subsequent frames. Although the MA filter method has prediction performance that is typically lower than that of the AR filter method, the MA filter has an advantage that the impact of a transmission error is constrained temporally. Accordingly, speech compression apparatuses such as AMR, AMR_WB, and selectable mode vocoder (SMV) apparatuses that are used in an environment where transmission errors frequently occur, such as wireless communications, use the MA filter method of predicting LSF. Also, prediction methods using correlation between neighbor LSF element values in a frame, in addition to LSF value prediction between frames, have been developed. Since the LSF values must always be sequentially ordered for a stable filter, if this method is employed additional quantization efficiency can be obtained.

0006Quantization methods for LSF prediction error can be broken down into scalar quantization and vector quantization (VQ). At present, the vector quantization method is more widely used than the scalar quantization method because VQ requires fewer bits to achieve the same encoding performance. In the vector quantization method, quantization of entire vectors at one time is not feasible because the size of the VQ codebook table is too large and codebook searching takes too much time. To reduce the complexity, a method by which the entire vector is divided into several sub-vectors and each sub-vector is independently vector quantized has been developed and is referred to as a split vector quantization (SVQ) method. For example, if in 10-dimensional vector quantization using 20 bits, quantization is performed for the entire vector, the size of the vector codebook table becomes 10 x2²⁰. However, if a split vector quantization method is used, by which the vector is divided into two 5-dimensional sub-vectors and 10 bits are allocated for each sub-vector, the size of the vector table becomes just 5 x 2¹⁰ x 2.

0007FIG. 1a shows an LSF quantizer used in an AMR wideband speech coder having a multi-stage split vector quantization (S-MSVQ) structure, and FIG. 1 b shows an LSF quantizer used in an AMR narrowband speech coder having an SVQ structure. In LSF coefficient quantization with 46 bits allocated, compared to a full search vector quantizer, the LSF quantizer having an S-MSVQ structure as shown in FIG. 1a has a smaller memory and a smaller amount of codebook search computation, but due to complexity of memory and codebook search, requires a larger amount of computation. Also, in the SVQ method, if the vector is divided into more sub-vectors, the size of the vector table decreases and the memory can be saved and search time can decrease, but the performance is degraded because the correlation between vector values is not fully utilized. In an extreme case, if 10-dimensional vector quantization is divided into 10 1-dimensional vectors, it becomes scalar quantization. If the SVQ method is used and without LSF prediction between 20 msec frames, LSF is directly quantized, acceptable quantization performance can be obtained using 24 bits per vector. However, since in the SVQ method each sub-vector is independently quantized, correlation between sub-vectors cannot be fully utilized and the entire vector cannot be optimized.

0008Many VQ methods have been developed including a method by which vector quantization is performed in a plurality of steps, a selective vector quantization method by which two tables are used for selective quantization, and a link split vector quantization method by which a table is selected by checking a boundary value of each sub-vector. These methods of LSF quantization can provide transparent sound quality, provided the encoding rate is large enough.

SUMMARY OF THE INVENTION

0009According to an aspect of the present invention, there is provided a block-constrained (BC)-Trellis coded quantization (TCQ) method comprising: in a Trellis structure having total N (N=2^v, here v denotes the number of binary memory elements in the finite-state machine defining the convolutional encoder) states, constraining the number of initial states of Trellis paths that are available for selection, within 2^k (0 ≤ k ≤ v) in total N states, and constraining the number of the states of a last stage within 2^v-k among total N states according to the initial states of Trellis paths; after referring to initial states of N survivor paths determined under the initial state constraint by the constraining from a first stage to stage L-log₂N (here, L denotes the number of the entire stages and N denotes the number of entire Trellis states), considering Trellis paths in which the state of a last stage is selected among 2^v-k states determined by each initial state under the constraint that the state of a last stage is constrained by the remaining v stages; and obtaining an optimum Trellis path among the considered Trellis paths and transmitting the optimum Trellis path.

0010According to another aspect of the present invention, there is provided a line spectral frequency (LSF) coefficient quantization method in a speech coding system comprising: removing the direct current (DC) component in an input LSF coefficient vector; generating a first prediction error vector by performing inter-frame and intra-frame prediction of the LSF coefficient vector, in which the DC component is removed, quantizing the first prediction error vector by using BC-TCQ algorithm, and then, by performing intra-frame and inter-frame prediction compensation, generating a quantized first LSF coefficient vector; generating a second prediction error vector by performing intra-frame prediction of the LSF coefficient vector, in which the DC component is removed, quantizing the second prediction error vector by using the BC-TCQ algorithm, and then, by performing intra-frame prediction compensation, generating a quantized second LSF coefficient vector; and selectively outputting a vector having a shorter Euclidian distance to the input LSF coefficient vector between the generated quantized first and second LSF coefficient vectors.

0011According to still another aspect of the present invention, there is provided an LSF coefficient quantization apparatus in a speech coding system comprising: a first subtracter which removes the DC component in an input LSF coefficient vector and provides the LSF coefficient vector, in which the DC component is removed; a memory-based Trellis coded quantization unit which generates a first prediction error vector by performing inter-frame and intra-frame prediction for the LSF coefficient vector provided by the first subtracter, in which the DC component is removed, quantizes the first prediction error vector by using the BC-TCQ algorithm, and then, by performing intra-frame and inter-frame prediction compensation, generates a quantized first LSF coefficient vector; a non-memory Trellis coded quantization unit which generates a second prediction error vector by performing intra-frame prediction for the LSF coefficient vector, in which the DC component is removed, quantizes the second prediction error vector by using BC-TCQ algorithm, and then, by performing intra-frame prediction compensation, generates a quantized second LSF coefficient vector; and a switching unit which selectively outputs a vector having a shorter Euclidian distance to the input LSF coefficient vector between the quantized first and second LSF coefficient vectors provided by the memory-based Trellis coded quantization unit and the non-memory-based Trellis coded quantization unit, respectively.

0012The invention thus provides a block-constrained Trellis coded quantization method by which when an input signal and coefficients are quantized in a speech coding system, the required memory size and the amount of computation and complexity in a codebook search process are greatly decreased, and good signal to noise ratio (SNR) performance is provided. By applying the block-constrained Trellis coded quantization method of the invention, line spectral frequency coefficients are quantized.

BRIEF DESCRIPTION OF THE DRAWINGS

0013Examples of the invention will now be described in detail with reference to the attached drawings in which: <ul id="ul0001" list-style="none" compact="compact"><li>FIGS. 1a and 1b are block diagrams of quantizers applied to adaptive multi rate (AMR) wideband and narrowband speech coders proposed by 3rd generation partnership project (3GPP);</li><li>FIG. 2 is a diagram showing the Trellis coded quantization (TCQ) structure and output level;</li><li>FIG. 3 is a diagram showing the structure of Trellis path information in TCQ;</li><li>FIG. 4 is a diagram showing the structure of Trellis path information in TB-TCQ;</li><li>FIG. 5 is a diagram showing a Trellis path that should be considered in a single Viterbi encoding process according to an initial state when a TB-TCQ algorithm is used in a 4-state Trellis structure;</li><li>FIG. 6 is a block diagram showing the structure of a line spectral frequency (LSF) coefficient quantization apparatus according to a preferred embodiment of the present invention in a speech coding system;</li><li>FIG. 7 is a diagram showing Trellis paths that should be considered in a single Viterbi encoding process according to a constrained initial state when a BC-TCQ algorithm is used in a 4-state Trellis structure;</li><li>FIG. 8 is a schematic diagram of a Viterbi encoding process in a non-memory Trellis coded quantization unit in FIG. 6;</li><li>FIG. 9 is a schematic diagram of a Viterbi encoding process in a memory-based Trellis coded quantization unit in FIG. 6;</li><li>FIGS. 10a through 10c are flowcharts explaining the BC-TCQ encoding process of the non-memory Trellis coded quantization unit in FIG. 6;</li><li>FIGS. 11a through 11c are flowcharts explaining the BC-TCQ encoding process of the memory-based Trellis coded quantization unit in FIG. 6; and</li><li>FIG. 12 is a flowchart explaining an LSF coefficient quantization method according to the present invention in a speech coding system.</li></ul>

DESCRIPTION OF THE PREFERRED EMBODIMENTS

0014Prior to detailed explanation of the present invention, the Trellis coded quantization (TCQ) method will now be explained.

0015While ordinary vector quantizers require a large memory space and a large amount of computation, the TCQ method is characterized in that it requires a smaller memory size and a smaller amount of computation. The most important characteristic of the TCQ method is quantization of an object signal by using a structured codebook which is constructed based on a signal set expansion concept. By using Ungerboeck's set partition concept, a Trellis coding quantizer uses an extended set of quantization levels, and codes an object signal at a desired transmission bit rate. The Viterbi algorithm is used to encode an object signal. At a transmission rate of R bits per sample, an output level is selected among 2^R+1 levels when encoding each sample.

0016FIG. 2 is a diagram showing an output signal and Trellis structure for an input signal having a uniform distribution when 2 bits are allocated for a sample. Eight output signals are distributed, in an interleaved manner, in the sub-codebooks of D0, D1, D2, and D3, as shown in FIG. 2. When quantization object vector x is given, output signal (<i>x̂</i>) minimizing distortion (<i>d</i>(<i>x,x̂</i>)) is determined by using the Viterbi algorithm, and the output signal (<i>x̂</i>) determined by the Viterbi algorithm is expressed using 1-bit/sample information to indicate a corresponding Trellis path and (R-1)-bits/sample information to indicate a codeword determined in the sub-codebook allocated to the corresponding Trellis path. These information bits are transmitted through a channel to a decoder, and the decoding process from the transmitted bit information items will now be explained. The bit indicating Trellis path information is used as an input to a rate-1/2 convolutional encoder, and the corresponding output bits of the convolutional encoder specify the sub-codebook. Trellis path information requires one bit of path information in each stage and initial state information. The number of additional bits required to express initial state information is log₂N when the Trellis has N states.

0017FIG. 3 is a diagram showing the overhead information of TCQ for a 4-state Trellis structure. In order to transmit Trellis path (thick dotted lines) information determined by the TCQ method, initial state information '01' should be additionally transmitted in addition to L bits of path information to specify L stages. Accordingly, when data is being quantized in units of blocks by the TCQ method, the object signal should be coded by using the remaining available bits excluding log₂N bits among entire transmission bits in each block, which is the cause of its performance degradation. In order to solve this problem, Nikneshan and Kandani suggested a tail-biting (TB)-TCQ algorithm. Their algorithm puts constraints on the selection of an initial trellis state and a last state in a Trellis path.

0018FIG. 4 is a diagram showing a Trellis path (thick dotted lines) quantized and selected by TB-TCQ method suggested by Nikneshan and Kandani. Since transmission of path change information in the last log₂N stage is not needed, Trellis path information can be transmitted by using a total of L bits, and additional bits are not needed like the traditional TCQ. That is, the TB-TCQ algorithm suggested by Nikneshan and Kandani solves the overhead problem of the conventional TCQ. However, from a quantization complexity point of view, the single Viterbi encoding process needed by the TCQ should be performed as many times as the number of allowed initial Trellis states. The maximal complexity TB-TCQ method allows all initial states, each pair with a single (nominally the same) final state, and therefore the complexity is obtained by multiplying that of TCQ by the number of trellis states. For example, FIG. 5 is a diagram showing Trellis paths (thick solid lines) that can be selected in each of a total of four Viterbi encoding processes in order to find an optimal Trellis path by using TB-algorithm suggested by Nikneshan and Kandani.

0019FIG. 6 is a block diagram showing the structure of a line spectral frequency (LSF) coefficient quantization apparatus according to a preferred embodiment of the present invention in a speech coding system. The LSF coefficient quantization apparatus comprises a first subtracter 610, a memory-based Trellis coded quantization unit 620, a non-memory Trellis coded quantization unit 630 connected in parallel with the memory-based coded quantization unit 620, and a switching unit 640. Here, the memory-based Trellis coded quantization unit 620 comprises a first predictor 621, a second predictor 624, a second subtracter 622, a third subtracter 625, first through fourth adders 623, 627, 628, and 629, and a first block-constrained Trellis coded quantization unit (BC-TCQ) 626. The non-memory coded quantization unit 630 comprises fifth through seventh adders 631, 635, and 636, a fourth subtracter 633, a third predictor 633, and a second BC-TCQ 634.

0020Referring to FIG. 6, the first subtracter 610 subtracts the DC component (<i><u>f</u></i>_<i>DC</i>(<i>n</i>)) of an input LSF coefficient vector (<i><u>f</u></i>(<i>n</i>)) from the LSF coefficient vector and the LSF coefficient vector (<i><u>x</u></i>(<i>n</i>)), in which the DC component is removed, is applied as input to the memory-based Trellis coded quantization unit 620 and the non-memory Trellis coded quantization unit 630 at the same time.

0021The memory-based Trellis coded quantization unit 620 receives the LSF coefficient vector (<i><u>x</u></i>(<i>n</i>)), in which the DC component is removed, generates prediction error vector (<i>t</i>_<i>i</i>(<i>n</i>)) by performing inter-frame prediction and intra-frame prediction, quantizes the prediction error vector (<i>t</i>_<i>i</i>(<i>n</i>)) by using the BC-TCQ algorithm to be explained later, and then, by performing intra-frame and inter-frame prediction compensation, generates the quantized and prediction-compensated LSF coefficient vector (<u><i>x̂</i></u>(<i>n</i>)), and provides the final quantized LSF coefficient vector (<i><u>f̂</u></i>₁(<i>n</i>)), which is obtained by adding the quantized and prediction-compensated LSF coefficient vector (<i><u>x̂</u></i>(<i>n</i>)) and the DC component (<i><u>f</u></i>_<i>DC</i>(<i>n</i>)) of the LSF coefficient vector, and is applied as input to the switching unit 640.

0022For this, MA prediction, for example, a fourth-order MA prediction algorithm is applied to the first predictor 621 and the first predictor 621 generates a prediction value obtained from prediction error vectors of previous frames (n-i, here i = 1,...,4) which are quantized and intra-frame prediction-compensated. The second subtracter 622 obtains prediction error vector (<i><u>e</u></i>(<i>n</i>)) of the current frame (n) by subtracting the prediction value provided by the first predictor 621 from the LSF coefficient vector (<i><u>x</u></i>(<i>n</i>)), in which the DC component is removed.

0023To the second predictor 624, AR prediction, for example a first-order AR prediction algorithm is applied and the second predictor 624 generates a prediction value obtained by multiplying prediction factor (<i>ρ</i>_<i>i</i>) for the i-th element by the (i-1)-th element value (<i><u>ê</u></i>_<i>i</i>_-1(<i>n</i>)) which is quantized by the first BC-TCQ 626 and intra-frame prediction-compensated by the first adder 623. The third subtracter 625 obtains the prediction error vector of i-th element value (<i>t</i>_<i>i</i>(<i>n</i>)) by subtracting the prediction value provided by the second predictor 624 from the i-th element value (<i>e</i>_<i>i</i>(<i>n</i>)) in prediction error vector (<i><u>e</u></i>(<i>n</i>)) of the current frame (n) provided by the second subtracter 622.

0024The first BC-TCQ 626 generates the quantized prediction error vector with i-th element value (<i>t̂</i>_<i>i</i>(<i>n</i>)), by performing quantization of the prediction error vector with i-th element value (<i>t</i>_<i>i</i>(<i>n</i>)), which is provided by the second subtracter 625, by using the BC-TCQ algorithm. The second adder 627 adds the prediction value of the second predictor 624 to the quantized prediction error vector with i-th element value (<i>t̂</i>_<i>i</i>(<i>n</i>)) provided by the first BC-TCQ 626, and by doing so, performs intra-frame prediction compensation for the quantized prediction error vector with i-th element value (<i>t̂</i>_<i>i</i>(<i>n</i>)) and generates the i-th element value (<i>ê</i>_<i>i</i>(<i>n</i>)) of the quantized inter-frame prediction error vector. The element value of each order forms the quantized prediction error vector (<i><u>ê</u></i>(<i>n</i>)) of the current frame.

0025The third adder 628 generates the quantized LSF coefficient vector (<i><u>x̂</u></i>(<i>n</i>)), by adding the prediction value of the first predictor 612 to the quantized inter-frame prediction error vector (<i><u>ê</u></i>(<i>n</i>)) of the current frame provided by the second adder 627, that is, by performing inter-frame prediction compensation for the quantized prediction error vector (<i><u>ê</u></i>(<i>n</i>)) of the current frame. The fourth adder 629 generates the quantized LSF coefficient vector (<i><u>f̂</u></i>₁(<i>n</i>)), by adding DC component (<i><u>f</u></i>_<i>DC</i>(<i>n</i>)) of the LSF coefficient vector to the quantized LSF coefficient vector (<i><u>x̂</u></i>(<i>n</i>)) provided by the third adder 628. The finally quantized LSF coefficient vector (<i><u>f̂</u></i>₁(<i>n</i>)) is provided to one end of the switching unit 640.

0026The non-memory Trellis coded quantization unit 630 receives the LSF coefficient vector (<i><u>x</u></i>(<i>n</i>)), in which the DC component is removed, performs intra-frame prediction, generates prediction error vector (<i>t</i>_<i>i</i>(<i>n</i>)), quantizes the prediction error vector (<i>t</i>_<i>i</i>(<i>n</i>)) by using the BC-TCQ algorithm, which will be explained later, then performs intra-frame prediction compensation, and generates the quantized and prediction-compensated LSF coefficient vector (<i><u>x̂</u></i>(<i>n</i>)). The non-memory Trellis coded quantization unit 630 provides the switching unit 640 with the finally quantized LSF coefficient vector (<i><u>f̂</u></i>₂(<i>n</i>)), which is obtained by adding quantized and prediction-compensated LSF coefficient vector (<i><u>x̂</u></i>(<i>n</i>)) and DC component (<i><u>f</u></i>_<i>DC</i>(<i>n</i>)) of the LSF coefficient vector.

0027For this, AR prediction, for example, a first-order AR prediction algorithm is used in the third predictor 632 and the third predictor 632 generates a prediction value obtained by multiplying prediction element (<i>ρ</i>_<i>i</i>) for the i-th element by the intra-frame prediction error vector with (i-1)-th element (<i><u>x̂</u></i>_<i>i</i>_-1(<i>n</i>)) which is quantized by the second BC-TCQ 634 and then intra-frame prediction-compensated by the fifth adder 631. The fourth subtracter 633 generates the prediction error vector with i-th element (<i>t</i>_<i>i</i>(<i>n</i>)) by subtracting the prediction value provided by the third predictor 632 from the i-th element (<i>x</i>_<i>i</i>(<i>n</i>)) of the LSF coefficient vector (<i><u>x</u></i>(<i>n</i>)), in which the DC component is removed, provided by the first subtracter 610.

0028The second BC-TCQ 634 generates the quantized prediction error vector of i-th element value (<i>t̂</i>_<i>i</i>(<i>n</i>)), by performing quantization of the prediction error vector of i-th element (<i>t</i>_<i>i</i>(<i>n</i>)), which is provided by the fourth subtracter 633, by using the BC-TCQ algorithm. The sixth adder 635 adds the prediction value of the third predictor 632 to the quantized prediction error vector of i-th element value (<i>t̂</i>_<i>i</i>(<i>n</i>)) provided by the second BC-TCQ 634, and by doing so, performs intra-frame prediction compensation for the quantized prediction error vector of i-th element value (<i>t̂</i>_<i>i</i>(<i>n</i>)) and generates the quantized and prediction-compensated LSF coefficient vector of i-th element value (<i>x̂</i>_<i>i</i>(<i>n</i>)). The LSF coefficient vector of the element values of each order forms the quantized prediction error vector (<i><u>ê</u></i>(<i>n</i>)) of the current frame. The seventh adder 636 generates the quantized LSF coefficient vector (<i><u>f̂</u></i>_<i>2</i>(<i>n</i>)), by adding the quantized LSF coefficient vector (<i><u>x̂</u></i>(<i>n</i>)) provided by the sixth adder 635 to the DC component (<i><u>f</u></i>_<i>DC</i>(<i>n</i>)) of the LSF coefficient vector. The finally quantized LSF coefficient vector (<i><u>f̂</u></i>₂(<i>n</i>)) is provided to one end of the switching unit 640.

0029Between LSF coefficient vectors (<i><u>f̂</u></i>₁(<i>n</i>), <i><u>f̂</u></i>₂(<i>n</i>)) quantized in the memory-based Trellis coded quantization unit 620 and the non-memory Trellis coded quantization unit 630, respectively, the switching unit 640 selects one that has a shorter Euclidian distance from the input LSF coefficient vector (<i><u>f</u></i>(<i>n</i>)), and outputs the selected LSF coefficient vector.

0030In the present embodiment, the fourth adder 629 and the seventh adder 636 are disposed in the memory-based Trellis coded quantization unit 620 and the non-memory Trellis coded quantization unit 630, respectively. In another embodiment, the fourth adder 629 and the seventh adder 636 may be removed and instead, one adder is disposed at the output end of the switching unit 640 so that the DC component (<i><u>f</u></i>_<i>DC</i>(<i>n</i>)) of the LSF coefficient vector can be added to the quantized LSF coefficient vector (<i><u>x̂</u></i>(<i>n</i>)) which is selectively output from the switching unit 640.

0031The BC-TCQ algorithm used in the present invention will now be explained.

0032The BC-TCQ algorithm uses a rate-1/2 convolutional encoder and N-state Trellis structure (N=2^v, here, v denotes the number of binary state variables in the encoder finite state machine) based on an encoder structure without feedback. As prerequisites for the BC-TCQ algorithm, the initial states of Trellis paths that can be selected are limited to 2^k (0 ≤ k ≤ v) among the total of N states, and the number of states of the last stage are limited to 2^v-k (0 ≤ k ≤ v) among a total of N states, and dependent on the initial states of the Trellis path.

0033In the process for performing single Viterbi encoding by applying this BC-TCQ algorithm, the N survivor paths determined under the initial state constraint are found from the first stage to stage L-log₂N (here, L denotes the number of entire stages, and N denotes the number of entire Trellis states), and then, in the encoding over the remaining v stages, only Trellis paths are considered in which terminate in a state of the last stage selected among 2^v-k (0 ≤ k ≤ v) states determined according to each initial state. Among the considered Trellis paths, an optimum Trellis path is selected and transmitted.

0034FIG. 7 is a diagram showing Trellis paths that are considered when using the BC-TCQ algorithm with k being 1 and a Trellis structure with a total of 4 states. In this example, constraints are given such that the initial states of Trellis paths that can be selected are '00' and '10' among 4 states, and the state of the last stage is '00' or '01' when the initial state is '00' and '10' or '11' when the initial state is '10'. Referring to FIG. 7, since the initial state of survivor path (thick dotted lines) determined to state '00' in stage L-log₂4 is '00', Trellis paths that can be selected in the remaining stages are marked by thick dotted lines with the states of the last stage being '00' and '01'.

0035Next, the BC-TCQ encoding process performed in Trellis paths selected as shown in FIG. 7 in the memory-based Trellis coded quantization unit 620 will now be explained referring to FIG. 8 and FIGS. 10a through 10c.

0036The Viterbi encoding process in the j-th stage in FIG. 8 or FIG. 10a will first be explained. Unlike x^j in BC-TCQ encoding process in the non-memory Trellis coded quantization unit 630, the quantization object signals related to state p of the j-th stage are <i>e'= x</i>^<i>j</i> - <i>µ</i>^<i>j</i><i> · x̂</i><maths id="math0001" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">j</mtext><mtext>-1</mtext></mrow><mrow><mtext mathvariant="italic">i</mtext><mtext>'</mtext></mrow></mfrac></mrow></math><img file="EP1450352A2_D0001.tif" /></maths> and <i>e"= x</i>^<i>j</i> - µ^<i>j</i><i> · x̂</i><maths id="math0002" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">j</mtext><mtext>-1</mtext></mrow><mrow><mtext mathvariant="italic">i</mtext><mtext>''</mtext></mrow></mfrac></mrow></math><img file="EP1450352A2_D0002.tif" /></maths>, and vary depending on the state of the previous stage. This is shown in FIGS. 10a through 10c. In step 101, initialization of the entire distance (ρ<maths id="math0003" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext>0</mtext></mrow><mrow><mtext mathvariant="italic">p</mtext></mrow></mfrac></mrow></math><img file="EP1450352A2_D0003.tif" /></maths>) at state p in stage 0 is performed, and in steps 102 and 103, N survivor paths are determined from the first stage to stage L-log₂N (here, L denotes the number of entire stages and N denotes the number of entire Trellis states). That is, in step 102a, for N states from the first stage to stage L-log₂N, quantization distortion (<i>d</i>_<i>i',p</i><i>, d</i>_<i>i",p</i>) for a quantization object signal obtained by step 102a-1 is obtained as the following equations 1 and 2 by using a corresponding sub-codebook, and stored in distance metric (<i>d</i>_<i>i',p</i><i>,d</i>_<i>i",p</i>) in step 102a-2:<maths id="math0004" num="(1)"><math display="block"><mrow><msub><mrow><mtext mathvariant="italic">d</mtext></mrow><mrow><mtext mathvariant="italic">i',p</mtext></mrow></msub><mtext> = min(</mtext><mtext mathvariant="italic">d</mtext><mtext>(</mtext><msub><mrow><mtext mathvariant="italic">e',y</mtext></mrow><mrow><mtext mathvariant="italic">i',p</mtext></mrow></msub><mtext>)|</mtext><msub><mrow><mtext mathvariant="italic">y</mtext></mrow><mrow><mtext mathvariant="italic">i',p</mtext></mrow></msub><mtext> ∈ </mtext><msubsup><mrow><mtext mathvariant="italic">D</mtext></mrow><mrow><mtext mathvariant="italic">i</mtext><mtext>',</mtext><mtext mathvariant="italic">p</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></msubsup><mtext> )</mtext></mrow></math><img file="EP1450352A2_D0004.tif" /></maths><maths id="math0005" num="(2)"><math display="block"><mrow><msub><mrow><mtext mathvariant="italic">d</mtext></mrow><mrow><mtext mathvariant="italic">i",p</mtext></mrow></msub><mtext> = min(</mtext><mtext mathvariant="italic">d</mtext><mtext>(</mtext><mtext mathvariant="italic">e</mtext><mtext>",</mtext><msub><mrow><mtext mathvariant="italic">y</mtext></mrow><mrow><mtext>i",</mtext></mrow></msub><msub><mrow><mtext>​</mtext></mrow><mrow><mtext mathvariant="italic">p</mtext></mrow></msub><mtext>)|</mtext><msub><mrow><mtext mathvariant="italic">y</mtext></mrow><mrow><mtext mathvariant="italic">i</mtext></mrow></msub><msub><mrow><mtext>​</mtext></mrow><mrow><mtext>",</mtext></mrow></msub><msub><mrow><mtext>​</mtext></mrow><mrow><mtext mathvariant="italic">p</mtext></mrow></msub><mtext> ∈ </mtext><msubsup><mrow><mtext mathvariant="italic">D</mtext></mrow><mrow><mtext mathvariant="italic">i</mtext><mtext>'',</mtext><mtext mathvariant="italic">p</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></msubsup><mtext> )</mtext></mrow></math><img file="EP1450352A2_D0005.tif" /></maths>

0037In the equations 1 and 2, <i>D</i><maths id="math0006" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">j</mtext></mrow><mrow><mtext mathvariant="italic">i',p</mtext></mrow></mfrac></mrow></math><img file="EP1450352A2_D0006.tif" /></maths> denotes a sub-codebook allocated to a branch between state p in the j-th stage and state i' in the (j-1)-th stage, and <i>D</i><maths id="math0007" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">j</mtext></mrow><mrow><mtext mathvariant="italic">i',p</mtext></mrow></mfrac></mrow></math><img file="EP1450352A2_D0007.tif" /></maths> denotes a sub-codebook allocated to a branch between state p in the j-th stage and state i" in the (j-1)-th stage. Here, y_i',p and y_i",p denote code vectors in <i>D</i><maths id="math0008" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">j</mtext></mrow><mrow><mtext mathvariant="italic">i',p</mtext></mrow></mfrac></mrow></math><img file="EP1450352A2_D0008.tif" /></maths> and <i>D</i><maths id="math0009" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">j</mtext></mrow><mrow><mtext mathvariant="italic">i'',p</mtext></mrow></mfrac></mrow></math><img file="EP1450352A2_D0009.tif" /></maths>, respectively.

0038Then, a process for selecting one between two Trellis paths connected to state p in the j-th stage and an accumulated distortion update process are performed as the following equation 3 (step 102b-1 in step 102b):<maths id="math0010" num="(3)"><math display="block"><mrow><msubsup><mrow><mtext>ρ</mtext></mrow><mrow><mtext mathvariant="italic">p</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></msubsup><msubsup><mrow><mtext> = min(ρ</mtext></mrow><mrow><mtext mathvariant="italic">i'</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext><mtext>-1</mtext></mrow></msubsup><mtext> + </mtext><msub><mrow><mtext mathvariant="italic">d</mtext></mrow><mrow><mtext mathvariant="italic">i'</mtext></mrow></msub><msub><mrow><mtext mathvariant="italic">,</mtext></mrow><mrow><mtext mathvariant="italic">p</mtext></mrow></msub><msubsup><mrow><mtext>,ρ</mtext></mrow><mrow><mtext mathvariant="italic">i''</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext><mtext>-1</mtext></mrow></msubsup><mtext> + </mtext><msub><mrow><mtext mathvariant="italic">d</mtext></mrow><mrow><mtext mathvariant="italic">i", p</mtext></mrow></msub><mtext>)</mtext></mrow></math><img file="EP1450352A2_D0010.tif" /></maths>

0039Then, when state i' of the previous stage between the two paths is determined, the quantization value for x^j at state p in j-th stage is obtained as the following equation 4 (step 102b-2 in step 102b):<maths id="math0011" num=""><img file="EP1450352A2_D0011.tif" /></maths>

0040Next, in step 104, in the remaining v stages, the only Trellis paths considered are those for which the state of the last stage is selected among 2^v-k (0 ≤ k ≤ v) states determined according to each initial state are considered. For this, in step 104a, the initial state each of N survivor paths determined as in the step 103 and 2^v-k (0 ≤ k ≤ v) Trellis paths in the last v stages are determined in step 104a.

0041In steps 104b through 104e, for each of 2^v-k (0 ≤ k ≤ v) states defined according to each initial state value in the entire N survivor paths, information on a Trellis path that has the shortest distance between an input sequence and a quantized sequence in a path determined to the last state, and the codeword information are obtained. In the steps 104b through 104e, ρ<maths id="math0012" num=""><math display="inline"><mrow><mfrac linethickness="0" numalign="left" denomalign="left"><mrow><mtext mathvariant="italic">L</mtext></mrow><mrow><mtext mathvariant="italic">i,n</mtext></mrow></mfrac></mrow></math><img file="EP1450352A2_D0012.tif" /></maths> denotes the entire distance between an input sequence and a quantized sequence in a path determined to the last state (n=1, ..., 2^v-k) in survivor path i, and <i>d</i><maths id="math0013" num=""><math display="inline"><mrow><mfrac linethickness="0" numalign="left" denomalign="left"><mrow><mtext mathvariant="italic">j</mtext></mrow><mrow><mtext mathvariant="italic">i,n</mtext></mrow></mfrac></mrow></math><img file="EP1450352A2_D0013.tif" /></maths> denotes the distance between the quantization value of input sample x_j and the input sample in a path determined to the last state (n=1, ..., 2^v-k) in survivor path i.

0042Next, the BC-TCQ encoding process performed in Trellis paths selected as shown in FIG. 7 in the non-memory Trellis coded quantization unit 630 will now be explained referring to FIG. 9 and FIGS. 11a through 11c.

0043Constraints on the initial state and last state are the same as in the BC-TCQ encoding process in the memory-based Trellis coded quantization unit 620, but inter-frame prediction of input samples is not used.

0044First, the Viterbi encoding process in the j-th stage of FIG. 9 will now be explained, referring to FIGS. 11a through 11c.

0045In step 11, initialization of the entire distance (ρ<maths id="math0014" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext>0</mtext></mrow><mrow><mtext mathvariant="italic">p</mtext></mrow></mfrac></mrow></math><img file="EP1450352A2_D0014.tif" /></maths>) at state p in stage 0 is performed, and in steps 112 and 113, N survivor paths are determined from the first stage to stage L-log₂N (here, L denotes the number of entire stages and N denotes the number of entire Trellis states). That is, in step 112a, for N states from the first stage to stage L-log₂N, quantization distortion (<i>d</i>_<i>i',p</i><i>,d</i>_<i>i",p</i>) is obtained as the following equations 5 and 6 by using sub-codebooks allocated to two branches connected to state p in j-th stage, and stored in distance metric (<i>d</i>_<i>i',p</i><i>,d</i>_<i>i",p</i>):<maths id="math0015" num=""><img file="EP1450352A2_D0015.tif" /></maths><maths id="math0016" num=""><img file="EP1450352A2_D0016.tif" /></maths>

0046In the equations 5 and 6, <i>D</i><maths id="math0017" num=""><math display="inline"><mrow><mfrac linethickness="0" numalign="left" denomalign="left"><mrow><mtext mathvariant="italic">j</mtext></mrow><mrow><mtext mathvariant="italic">i',p</mtext></mrow></mfrac></mrow></math><img file="EP1450352A2_D0017.tif" /></maths> denotes a sub-codebook allocated to a branch between state p in j-th stage and state i' in (j-1)-th stage, and <i>D</i><maths id="math0018" num=""><math display="inline"><mrow><mfrac linethickness="0" numalign="left" denomalign="left"><mrow><mtext mathvariant="italic">j</mtext></mrow><mrow><mtext mathvariant="italic">i'',p</mtext></mrow></mfrac></mrow></math><img file="EP1450352A2_D0018.tif" /></maths> denotes a sub-codebook allocated to a branch between state p in j-th stage and state i" in (j-1)-th stage. Here, y_i',p and y_i",p denote code vectors in <i>D</i><maths id="math0019" num=""><math display="inline"><mrow><mfrac linethickness="0" numalign="left" denomalign="left"><mrow><mtext mathvariant="italic">j</mtext></mrow><mrow><mtext mathvariant="italic">i',p</mtext></mrow></mfrac></mrow></math><img file="EP1450352A2_D0019.tif" /></maths> and <i>D</i><maths id="math0020" num=""><math display="inline"><mrow><mfrac linethickness="0" numalign="left" denomalign="left"><mrow><mtext mathvariant="italic">j</mtext></mrow><mrow><mtext mathvariant="italic">i'',p</mtext></mrow></mfrac></mrow></math><img file="EP1450352A2_D0020.tif" /></maths>, respectively.

0047Then, a process for selecting one between two Trellis paths connected to state p in j-th stage and an accumulated distortion update process are performed as the following equation 7 and according to the result, a path is selected and <i>x̂</i><maths id="math0021" num=""><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">j</mtext></mrow><mrow><mtext mathvariant="italic">p</mtext></mrow></mfrac></mrow></math><img file="EP1450352A2_D0021.tif" /></maths>, is updated (step 112b-1 and 112b-2 in step 112b):<maths id="math0022" num="(7)"><math display="block"><mrow><msubsup><mrow><mtext>ρ</mtext></mrow><mrow><mtext mathvariant="italic">p</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext></mrow></msubsup><msubsup><mrow><mtext> = min(ρ</mtext></mrow><mrow><mtext mathvariant="italic">i'</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext><mtext>-1</mtext></mrow></msubsup><mtext> + </mtext><msub><mrow><mtext mathvariant="italic">d</mtext></mrow><mrow><mtext mathvariant="italic">i',p</mtext></mrow></msub><msubsup><mrow><mtext>, + ρ</mtext></mrow><mrow><mtext mathvariant="italic">i''</mtext></mrow><mrow><mtext mathvariant="italic">j</mtext><mtext>-1</mtext></mrow></msubsup><mtext> + </mtext><msub><mrow><mtext mathvariant="italic">d</mtext></mrow><mrow><mtext mathvariant="italic">i",p</mtext></mrow></msub><mtext>)</mtext></mrow></math><img file="EP1450352A2_D0022.tif" /></maths>

0048The operation sequence and functions of the next step, step 114, are the same as that of the step 104 shown in FIG. 10c.

0049Thus, unlike the TB-TCQ algorithm, the BC-TCQ algorithm according to the present invention enables quantization by a single Viterbi encoding process such that the additional complexity in the TB-TCQ algorithm can be avoided.

0050FIG. 12 is a flowchart explaining an LSF coefficient quantization method according to the present invention in a speech coding system. The method comprises DC component removing step 121, memory-based Trellis coded quantization step 122, non-memory Trellis coded quantization step 123, switching step 124 and DC component restoration step 125. Here, DC component restoration step 125 can be implemented by including the step into the memory-based Trellis coded quantization step 122 and the non-memory Trellis coded quantization step 123.

0051Referring to FIG. 12, in step 121, the DC component (<i><u>f</u></i>_<i>DC</i>(<i>n</i>)) of an input LSF coefficient vector (<i><u>f</u></i>(<i>n</i>)) is subtracted from the LSF coefficient vector and the LSF coefficient vector (<i><u>x</u></i>(<i>n</i>)) in which the DC component is removed is generated.

0052In step 122, the LSF coefficient vector (<i><u>x</u></i>(<i>n</i>)), in which the DC component is removed in the step 121, is received, and by performing inter-frame and intra-frame predictions, prediction error vector (<i>t</i>_<i>i</i>(<i>n</i>)) is generated. The prediction error vector (<i>t</i>_<i>i</i>(<i>n</i>)) is quantized by using the BC-TCQ algorithm, and then, by performing intra-frame and inter-frame prediction compensation, quantized LSF coefficient vector (<i><u>x̂</u></i>(<i>n</i>)) is generated, and Euclidian distance (<i>d</i>_{<i>memory</i>}) between quantized LSF coefficient vector (<i><u>x̂</u></i>(<i>n</i>)) and the LSF coefficient vector (<i><u>x</u></i>(<i>n</i>)), in which the DC component is removed, is obtained.

0053The step 122 will now be explained in more detail. In step 122a, MA prediction, for example, 4-dimensional MA inter-frame prediction, is applied to the LSF coefficient vector (<i><u>x</u></i>(<i>n</i>)), in which the DC component is removed in the step 121, and prediction error vector (<i><u>e</u></i>(<i>n</i>)) of the current frame (n) is obtained. The step 122a can be expressed as the following equation 8:<maths id="math0023" num=""><img file="EP1450352A2_D0023.tif" /></maths>

0054Here, <i><u>ê</u></i>(<i>n</i>-<i>i</i>) denotes prediction error vector of the previous frame (n-i, here i=1,...,4) which is quantized using the BC-TCQ algorithm and then intra-frame prediction-compensated.

0055In step 122b, AR prediction, for example, 1-dimensional AR intra-frame prediction, is applied to the i-th element value (<i>e</i>_<i>i</i>(<i>n</i>)) in the prediction error vector (<i><u>e</u></i>(<i>n</i>)) of the current frame (n) obtained in the step 122a, and prediction error vector (<i>t</i>_<i>i</i>(<i>n</i>)) of the i-th element value is obtained. The AR prediction can be expressed as the following equation 9:<maths id="math0024" num="(9)"><math display="block"><mrow><msub><mrow><mtext mathvariant="italic">t</mtext></mrow><mrow><mtext mathvariant="italic">i</mtext></mrow></msub><mtext>(</mtext><mtext mathvariant="italic">n</mtext><mtext>) = </mtext><msub><mrow><mtext mathvariant="italic">e</mtext></mrow><mrow><mtext mathvariant="italic">i</mtext></mrow></msub><mtext>(</mtext><mtext mathvariant="italic">n</mtext><mtext>) - </mtext><msub><mrow><mtext mathvariant="italic">ρ</mtext></mrow><mrow><mtext mathvariant="italic">i</mtext></mrow></msub><mtext>·</mtext><msub><mrow><mtext mathvariant="italic">ê</mtext></mrow><mrow><mtext mathvariant="italic">i</mtext></mrow></msub><msub><mrow><mtext>​</mtext></mrow><mrow><mtext>-1</mtext></mrow></msub><mtext>(</mtext><mtext mathvariant="italic">n</mtext><mtext>)</mtext></mrow></math><img file="EP1450352A2_D0024.tif" /></maths>

0056Here, <i>ρ</i>_<i>i</i> denotes the prediction factor of i-th element, and <i>ê</i>_<i>i</i>-1(<i>n</i>) denotes the (i-1 )-th element value which is quantized using the BC-TCQ algorithm and then, intra-frame prediction-compensated.

0057Next, the prediction error vector with i-th element value (<i>t</i>_<i>i</i>(<i>n</i>)) obtained by the equation 9 is quantized using the BC-TCQ algorithm and the quantized prediction error vector of i-th element value (<i>t̂</i>_<i>i</i>(<i>n</i>)) is obtained. Intra-frame prediction compensation is performed for the quantized prediction error vector with i-th element value (<i>t̂</i>_<i>i</i>(<i>n</i>)) and the LSF coefficient vector with i-th element value (<i>ê</i>_<i>i</i>(<i>n</i>)) is obtained. LSF coefficient vector of the element value of each order forms quantized inter-frame prediction error vector (<i><u>ê</u></i>(<i>n</i>)) of the current frame. The intra-frame prediction compensation can be expressed as the following equation 10:<maths id="math0025" num="(10)"><math display="block"><mrow><msub><mrow><mtext mathvariant="italic">ê</mtext></mrow><mrow><mtext mathvariant="italic">i</mtext></mrow></msub><mtext>(</mtext><mtext mathvariant="italic">n</mtext><mtext>) = </mtext><msub><mrow><mover accent="true"><mrow><mtext mathvariant="italic">t</mtext></mrow><mo>ˆ</mo></mover></mrow><mrow><mtext mathvariant="italic">i</mtext></mrow></msub><mtext>(</mtext><mtext mathvariant="italic">n</mtext><msub><mrow><mtext>) + ρ</mtext></mrow><mrow><mtext mathvariant="italic">i</mtext></mrow></msub><msub><mrow><mtext mathvariant="italic">·ê</mtext></mrow><mrow><mtext mathvariant="italic">i</mtext></mrow></msub><msub><mrow><mtext>​</mtext></mrow><mrow><mtext>-1</mtext></mrow></msub><mtext>(</mtext><mtext mathvariant="italic">n</mtext><mtext>)</mtext></mrow></math><img file="EP1450352A2_D0025.tif" /></maths>

0058In step 122c, inter-frame prediction compensation is performed for quantized inter-frame prediction error vector (<i><u>ê</u></i>(<i>n</i>)) of the current frame obtained in the step 122b and quantized LSF coefficient vector (<i><u>x̂</u></i>(<i>n</i>)) is obtained. The step 122c can be expressed as the following equation 11:<maths id="math0026" num=""><img file="EP1450352A2_D0026.tif" /></maths>

0059In step 122d, Euclidian distance (<i>d</i>_{<i>memory</i>}<i> = d</i>(<i><u>x</u>,<u>x̂</u></i>)) between quantized LSF coefficient vector (<u><i>x̂</i></u>(<i>n</i>)) obtained in the step 122c and the LSF coefficient vector (<i><u>x</u></i>(<i>n</i>)) input in the step 122a, in which the DC component is removed, is obtained.

0060In step 123, the LSF coefficient vector (<i><u>x</u></i>(<i>n</i>)), in which the DC component is removed in the step 121, is received, and by performing intra-frame prediction, prediction error vector (<i>t</i>_<i>i</i>(<i>n</i>)) is generated. The prediction error vector (<i>t</i>_<i>i</i>(<i>n</i>)) is quantized by using the BC-TCQ algorithm and intra-frame prediction compensated, and by doing so, quantized LSF coefficient vector (<i><u>x̂</u></i>(<i>n</i>)) is generated. Euclidian distance (<i>d</i>_{<i>memoryless</i>}) between quantized LSF coefficient vector (<i><u>x̂</u></i>(<i>n</i>)) and the LSF coefficient vector (<i><u>x</u></i>(<i>n</i>)), in which the DC component is removed, is obtained.

0061The step 123 will now be explained in more detail. In step 123a, AR prediction, for example, 1-dimensional AR intra-frame prediction, is applied to the LSF coefficient vector (<i><u>x</u></i>(<i>n</i>)), with i-th element (<i>x</i>_<i>i</i>(<i>n</i>)), in which the DC component is removed in the step 121, and intra-frame prediction error vector with i-th element (<i>t</i>_<i>i</i>(<i>n</i>)) is obtained. The AR prediction can be expressed as the following equation 12:<maths id="math0027" num="(12)"><math display="block"><mrow><msub><mrow><mtext mathvariant="italic">t</mtext></mrow><mrow><mtext mathvariant="italic">i</mtext></mrow></msub><mtext>(</mtext><mtext mathvariant="italic">n</mtext><mtext>) = </mtext><msub><mrow><mtext mathvariant="italic">x</mtext></mrow><mrow><mtext mathvariant="italic">i</mtext></mrow></msub><mtext>(</mtext><mtext mathvariant="italic">n</mtext><msub><mrow><mtext>) - ρ</mtext></mrow><mrow><mtext mathvariant="italic">i</mtext></mrow></msub><mtext mathvariant="italic">·</mtext><msub><mrow><mover accent="true"><mrow><mtext mathvariant="italic">x</mtext></mrow><mo>ˆ</mo></mover></mrow><mrow><mtext mathvariant="italic">i</mtext></mrow></msub><msub><mrow><mtext>​</mtext></mrow><mrow><mtext>-1</mtext></mrow></msub><mtext>(</mtext><mtext mathvariant="italic">n</mtext><mtext>)</mtext></mrow></math><img file="EP1450352A2_D0027.tif" /></maths>

0062Here, ρ_<i>i</i> denotes the prediction factor of the i-th element, and <i>x̂</i>_<i>i</i>_-1(<i>n</i>) denotes intra-frame prediction error vector of the (i-1)-th element which is quantized by BC-TCQ algorithm and then, intra-frame prediction-compensated.

0063Next, the intra-frame prediction error vector with i-th element (<i>t</i>_<i>i</i>(<i>n</i>)) obtained by the equation 12 is quantized using the BC-TCQ algorithm and the quantized intra-frame prediction error vector with i-th element (<i>t̂</i>_i(<i>n</i>)) is obtained. Intra-frame prediction compensation is performed for the quantized intra-frame prediction error vector with i-th element (<i>t̂</i>_<i>i</i>(<i>n</i>)) and the quantized LSF coefficient vector with i-th element value (<i>x̂</i>_<i>i</i>(<i>n</i>)) is obtained. The quantized LSF coefficient vector of the element value of each order forms the quantized LSF coefficient vector (<i><u>x̂</u></i>(<i>n</i>)) of the current frame. The intra-frame prediction compensation can be expressed as the following equation 13:<maths id="math0028" num="(13)"><math display="block"><mrow><msub><mrow><mover accent="true"><mrow><mtext mathvariant="italic">x</mtext></mrow><mo>ˆ</mo></mover></mrow><mrow><mtext mathvariant="italic">i</mtext></mrow></msub><mtext>(</mtext><mtext mathvariant="italic">n</mtext><mtext>) = </mtext><msub><mrow><mover accent="true"><mrow><mtext mathvariant="italic">t</mtext></mrow><mo>ˆ</mo></mover></mrow><mrow><mtext mathvariant="italic">i</mtext></mrow></msub><mtext>(</mtext><mtext mathvariant="italic">n</mtext><msub><mrow><mtext>) + ρ</mtext></mrow><mrow><mtext mathvariant="italic">i</mtext></mrow></msub><mtext>·</mtext><msub><mrow><mover accent="true"><mrow><mtext mathvariant="italic">x</mtext></mrow><mo>ˆ</mo></mover></mrow><mrow><mtext mathvariant="italic">i</mtext></mrow></msub><msub><mrow><mtext>​</mtext></mrow><mrow><mtext>-1</mtext></mrow></msub><mtext>(</mtext><mtext mathvariant="italic">n</mtext><mtext>)</mtext></mrow></math><img file="EP1450352A2_D0028.tif" /></maths>

0064In step 123b, Euclidian distance (<i>d</i>_{<i>memory</i>} = <i>d</i>(<i><u>x</u></i>,<i><u>x̂</u></i>)) between the quantized LSF coefficient vector (<i><u>x̂</u></i>(<i>n</i>)) obtained in the step 123a and LSF coefficient vector (<i><u>x</u></i>(<i>n</i>)) input in the step 123a, in which the DC component is removed, is obtained.

0065In step 124, Euclidian distances (<i>d</i>_{<i>memory</i>}<i>, d</i>_{<i>memoryless</i>}), obtained in steps 122d and 123b, respectively, are compared and the quantized LSF coefficient vector (<i><u>x</u></i>(<i>n</i>)) with the smaller Euclidian distance is selected.

0066In step 125, the DC component (<i><u>f</u></i>_<i>DC</i>(<i>n</i>)) of the LSF coefficient vector is added to the quantized LSF coefficient vector (<i><u>x̂</u></i>(<i>n</i>)) selected in the step 124 and finally the quantized LSF coefficient vector (<i><u>f̂</u></i>(<i>n</i>)) is obtained.

0067Meanwhile, the present invention may be embodied in a code, which can be read by a computer, on a computer readable recording medium. The computer readable recording medium includes all kinds of recording apparatuses on which computer readable data are stored.

0068The computer readable recording media includes storage media such as magnetic storage media (e.g., ROM's, floppy disks, hard disks, etc.), optically readable media (e.g., CD-ROMs, DVDs, etc.) and carrier waves (e.g., transmissions over the Internet). Also, the computer readable recording media can be scattered on computer systems connected through a network and can store and execute a computer readable code in a distributed mode. Also, function programs, codes and code segments for implementing the present invention can be easily inferred by programmers in the art of the present invention.

<Experiment Examples>

0069In order to compare performances of BC-TCQ algorithm proposed in the present invention and the TB-TCQ algorithm, quantization signal-to-noise ratio (SNR) performance for the memoryless Gaussian source (mean 0, dispersion 1) was evaluated. The following table 1 shows SNR performance value comparison with respect to block length. Trellis structure with 16 states and a double output level was used in the performance comparison experiment and 2 bits were allocated for each sample. The reference TB-TCQ system allowed 16 initial trellis states, with a single (identical to the initial state) final state allowed for each initial state. <tables id="tabl0001" num="0001"><table frame="all"><title>Table 1</title><tgroup cols="3" colsep="1" rowsep="1"><colspec colnum="1" colname="col1" colwidth="52.50mm" /><colspec colnum="2" colname="col2" colwidth="52.50mm" /><colspec colnum="3" colname="col3" colwidth="52.50mm" /><thead valign="top"><row><entry namest="col1" nameend="col1" align="center">Block length</entry><entry namest="col2" nameend="col2" align="center">TB-TCQ(dB)</entry><entry namest="col3" nameend="col3" align="center">BC-TCQ(dB)</entry></row></thead><tbody valign="top"><row><entry namest="col1" nameend="col1" align="center">16</entry><entry namest="col2" nameend="col2" align="center">10.53</entry><entry namest="col3" nameend="col3" align="center">10.47</entry></row><row><entry namest="col1" nameend="col1" align="center">32</entry><entry namest="col2" nameend="col2" align="center">10.70</entry><entry namest="col3" nameend="col3" align="center">10.68</entry></row><row><entry namest="col1" nameend="col1" align="center">64</entry><entry namest="col2" nameend="col2" align="center">10.74</entry><entry namest="col3" nameend="col3" align="center">10.76</entry></row><row rowsep="1"><entry namest="col1" nameend="col1" align="center">128</entry><entry namest="col2" nameend="col2" align="center">10.74</entry><entry namest="col3" nameend="col3" align="center">10.82</entry></row></tbody></tgroup></table></tables>

0070Referring to table 1, when block lengths of the source are 16 and 32, the TB-TCQ algorithm showed the better SNR performance, while when block lengths of the source are 64 and 128, BC-TCQ algorithm showed the better performance.

0071The following table 2 shows complexity comparison between BC-TCQ algorithm proposed in the present invention and TB-TCQ algorithm, when the block length of the source is 16 in the table 1. <tables id="tabl0002" num="0002"><table frame="all"><title>Table 2</title><tgroup cols="4" colsep="1" rowsep="1"><colspec colnum="1" colname="col1" colwidth="39.37mm" /><colspec colnum="2" colname="col2" colwidth="39.37mm" /><colspec colnum="3" colname="col3" colwidth="39.37mm" /><colspec colnum="4" colname="col4" colwidth="39.37mm" /><thead valign="top"><row><entry namest="col1" nameend="col1" align="center">Operation</entry><entry namest="col2" nameend="col2" align="center">TB-TCQ</entry><entry namest="col3" nameend="col3" align="center">BC-TCQ</entry><entry namest="col4" nameend="col4" align="center">Remarks</entry></row></thead><tbody valign="top"><row><entry namest="col1" nameend="col1" align="center">Addition</entry><entry namest="col2" nameend="col2" align="center">5184</entry><entry namest="col3" nameend="col3" align="center">696</entry><entry namest="col4" nameend="col4" align="center">86.57% decrease</entry></row><row><entry namest="col1" nameend="col1" align="center">Multiplication</entry><entry namest="col2" nameend="col2" align="center">64</entry><entry namest="col3" nameend="col3" align="center">64</entry><entry namest="col4" nameend="col4" align="center">-</entry></row><row rowsep="1"><entry namest="col1" nameend="col1" align="center">Comparison</entry><entry namest="col2" nameend="col2" align="center">2302</entry><entry namest="col3" nameend="col3" align="center">223</entry><entry namest="col4" nameend="col4" align="center">90.32% decrease</entry></row></tbody></tgroup></table></tables>

0072Referring to table 2, in addition and comparison operations, the complexity of the BC-TCQ algorithm according to the present invention greatly decreased compared to that of the TB-TCQ algorithm.

0073Meanwhile, the number of initial states that can be held in a 16-state Trellis structure is 2^k (0 ≤ k ≤ v) and the following table 3 shows comparison of quantization performance for a memoryless Laplacian signal using BC-TCQ when k=0, 1, ..., 4. The codebook used in the performance comparison experiment has 32 output levels and the encoding rate is 3 bits per sample. <tables id="tabl0003" num="0003"><table frame="all"><title>Table 3</title><tgroup cols="5" colsep="1" rowsep="1"><colspec colnum="1" colname="col1" colwidth="31.50mm" /><colspec colnum="2" colname="col2" colwidth="31.50mm" /><colspec colnum="3" colname="col3" colwidth="31.50mm" /><colspec colnum="4" colname="col4" colwidth="31.50mm" /><colspec colnum="5" colname="col5" colwidth="31.50mm" /><thead valign="top"><row><entry namest="col1" nameend="col1" rowsep="0" align="center">Order, k</entry><entry namest="col2" nameend="col5" align="center">Block length, L</entry></row><row><entry namest="col1" nameend="col1" /><entry namest="col2" nameend="col2" align="center">L=8</entry><entry namest="col3" nameend="col3" align="center">L=16</entry><entry namest="col4" nameend="col4" align="center">L=32</entry><entry namest="col5" nameend="col5" align="center">K=64</entry></row></thead><tbody valign="top"><row><entry namest="col1" nameend="col1" align="center">k=0</entry><entry namest="col2" nameend="col2" align="center">13.6287</entry><entry namest="col3" nameend="col3" align="center">14.4819</entry><entry namest="col4" nameend="col4" align="center">15.1030</entry><entry namest="col5" nameend="col5" align="center">15.5636</entry></row><row><entry namest="col1" nameend="col1" align="center">k=1</entry><entry namest="col2" nameend="col2" align="center">14.7567</entry><entry namest="col3" nameend="col3" align="center">15.2100</entry><entry namest="col4" nameend="col4" align="center">15.5808</entry><entry namest="col5" nameend="col5" align="center">15.8499</entry></row><row><entry namest="col1" nameend="col1" align="center">k=2</entry><entry namest="col2" nameend="col2" align="center">14.9591</entry><entry namest="col3" nameend="col3" align="center">15.4942</entry><entry namest="col4" nameend="col4" align="center">15.7731</entry><entry namest="col5" nameend="col5" align="center">15.9887</entry></row><row><entry namest="col1" nameend="col1" align="center">k=3</entry><entry namest="col2" nameend="col2" align="center">13.4285</entry><entry namest="col3" nameend="col3" align="center">14.5864</entry><entry namest="col4" nameend="col4" align="center">15.3346</entry><entry namest="col5" nameend="col5" align="center">15.7704</entry></row><row rowsep="1"><entry namest="col1" nameend="col1" align="center">k=4</entry><entry namest="col2" nameend="col2" align="center">11.6558</entry><entry namest="col3" nameend="col3" align="center">13.2499</entry><entry namest="col4" nameend="col4" align="center">14.4951</entry><entry namest="col5" nameend="col5" align="center">15.2912</entry></row></tbody></tgroup></table></tables>

0074Referring to table 3, it is shown that when k=2, the BC-TCQ algorithm has the best performance. When k=2, 4 states of a total 16 states were allowed as initial states in the BC-TCQ algorithm. The following table 4 shows initial state and last state information of BC-TCQ algorithm when k=2. <tables id="tabl0004" num="0004"><table frame="all"><title>Table 4</title><tgroup cols="2" colsep="1" rowsep="1"><colspec colnum="1" colname="col1" colwidth="78.75mm" /><colspec colnum="2" colname="col2" colwidth="78.75mm" /><thead valign="top"><row><entry namest="col1" nameend="col1" align="center">Initial states</entry><entry namest="col2" nameend="col2" align="center">Last states</entry></row></thead><tbody valign="top"><row><entry namest="col1" nameend="col1" align="center">0</entry><entry namest="col2" nameend="col2" align="center">0,1,2,3</entry></row><row><entry namest="col1" nameend="col1" align="center">4</entry><entry namest="col2" nameend="col2" align="center">4, 5, 6, 7</entry></row><row><entry namest="col1" nameend="col1" align="center">8</entry><entry namest="col2" nameend="col2" align="center">8, 9, 10, 11</entry></row><row rowsep="1"><entry namest="col1" nameend="col1" align="center">12</entry><entry namest="col2" nameend="col2" align="center">12, 13, 14, 15</entry></row></tbody></tgroup></table></tables>

0075Next, in order to evaluate the performance of the present invention, voice samples for wideband speech provided by NTT were used. The total length of the voice samples is 13 minutes, and the samples include male Korean, female Korean, male English and female English. in order to compare with the performance of the LSF quantizer S-MSVQ used in 3GPP AMR_WB speech coder, the same process as the AMR_WB speech coder was applied to the preprocessing process before an LSF quantizer, and comparison of spectral distortion (SD) performances, the amounts of computation, and the required memory sizes are shown in tables 5 and 6. <tables id="tabl0005" num="0005"><table frame="all"><title>Table 5</title><tgroup cols="4" colsep="1" rowsep="1"><colspec colnum="1" colname="col1" colwidth="39.37mm" /><colspec colnum="2" colname="col2" colwidth="39.37mm" /><colspec colnum="3" colname="col3" colwidth="39.37mm" /><colspec colnum="4" colname="col4" colwidth="39.37mm" /><thead valign="top"><row><entry namest="col1" nameend="col2" /><entry namest="col3" nameend="col3" align="center">AMR_WB S-MSVQ</entry><entry namest="col4" nameend="col4" align="center">Present invention</entry></row></thead><tbody valign="top"><row><entry namest="col1" nameend="col1" morerows="2" align="center">SD</entry><entry namest="col2" nameend="col2" align="center">Average SD(dB)</entry><entry namest="col3" nameend="col3" align="center">0.7933</entry><entry namest="col4" nameend="col4" align="center">0.6979</entry></row><row><entry namest="col2" nameend="col2" align="center">2~4 dB(%)</entry><entry namest="col3" nameend="col3" align="center">0.4099</entry><entry namest="col4" nameend="col4" align="center">0.1660</entry></row><row rowsep="1"><entry namest="col2" nameend="col2" align="center">> 4dB(%)</entry><entry namest="col3" nameend="col3" align="center">0.0026</entry><entry namest="col4" nameend="col4" align="center">0</entry></row></tbody></tgroup></table></tables><tables id="tabl0006" num="0006"><table frame="all"><title>Table 6</title><tgroup cols="5" colsep="1" rowsep="1"><colspec colnum="1" colname="col1" colwidth="31.50mm" /><colspec colnum="2" colname="col2" colwidth="31.50mm" /><colspec colnum="3" colname="col3" colwidth="31.50mm" /><colspec colnum="4" colname="col4" colwidth="31.50mm" /><colspec colnum="5" colname="col5" colwidth="31.50mm" /><thead valign="top"><row><entry namest="col1" nameend="col2" /><entry namest="col3" nameend="col3" align="center">AMR_WB</entry><entry namest="col4" nameend="col4" align="center">Present invention</entry><entry namest="col5" nameend="col5" align="center">Remarks</entry></row></thead><tbody valign="top"><row><entry namest="col1" nameend="col1" morerows="2" align="center">Computation amount</entry><entry namest="col2" nameend="col2" align="center">Addition</entry><entry namest="col3" nameend="col3" align="center">15624</entry><entry namest="col4" nameend="col4" align="center">3784</entry><entry namest="col5" nameend="col5" align="center">76% decrease</entry></row><row><entry namest="col2" nameend="col2" align="center">Multiplication</entry><entry namest="col3" nameend="col3" align="center">8832</entry><entry namest="col4" nameend="col4" align="center">2968</entry><entry namest="col5" nameend="col5" align="center">66% decrease</entry></row><row><entry namest="col2" nameend="col2" align="center">Comparison</entry><entry namest="col3" nameend="col3" align="center">3570</entry><entry namest="col4" nameend="col4" align="center">2335</entry><entry namest="col5" nameend="col5" align="center">35% decrease</entry></row><row rowsep="1"><entry namest="col1" nameend="col2" align="center">Memory requirement</entry><entry namest="col3" nameend="col3" align="center">5280</entry><entry namest="col4" nameend="col4" align="center">1056</entry><entry namest="col5" nameend="col5" align="center">80% decrease</entry></row></tbody></tgroup></table></tables>

0076Referring to tables 5 and 6, in SD performance, the present invention showed a decrease of 0.0954 in average SD, and a decrease of 0.2439 in the number of outlier quantization areas between 2dB-4dB, compared to AMR_WB S-MSVQ. Also, the present invention showed a great decrease in the amount of computation needed in addition, multiplication, and comparison that are required for codebook search, and accordingly, the memory requirement also decreased correspondingly.

0077According to the present invention as described above, by quantizing the first prediction error vector obtained by inter-frame and intra-frame prediction using the input LSF coefficient vector, and the second prediction error vector obtained in intra-frame prediction, using the BC-TCQ algorithm, the memory size required for quantization and the amount of computation in the codebook search process can be greatly reduced.

0078In addition, when data analyzed in units of frames is transmitted by using Trellis coded quantization algorithm, additional transmission bits for initial states are not needed and the complexity can be greatly reduced.

0079Further, by introducing a safety net, error propagation that may take place by using predictors is prevented such that outlier quantization areas are reduced, the entire amount of computation and memory requirement decrease and at the same time the SD performance improves.

0080Optimum embodiments have been explained above and are shown. However, the present invention is not limited to the preferred embodiment described above, and it is apparent that variations and modifications by those skilled in the art can be effected within the scope of the present invention defined in the appended claims. Therefore, the scope of the present invention is not determined by the above description but by the accompanying claims.