Abstract:
A vector quantizer is disclosed which performs low bit rate coding of time sequential signals such as speech signals and image signals. A basis vector set is provided consisting of basis vectors greater in number than a predetermined number of bits and correspondingly, from the basis vector set, subsets corresponding in number to at most a predetermined number of bits are formed. The subsets thus formed include those consisting of at most a single basis vector and coefficient vector subsets formed from the coefficient vector set and determined according to the formed basis vector subsets.

Description:
BACKGROUND OF THE INVENTION 
     The present invention relates to vector quantizers for low bit rate coding of time sequential signals such as speech signals and image signals. 
     Vector quantization is a typical method of quantizing a speech signal or like time sequential signal by dividing the signal into frames of a predetermined interval (or blocks of a predetermined area). The vector quantization has an excellent quantization property of reducing quantization distortion for the allocated number of bits. However, it requires an extremely great number of operations to search the optimum quantization output vector best expressing the quantized signal. For example, where the frame length (or vector dimension number) is 10 and the number of bits per sample is 2, 10,485,760 times of product summing operation are required for the search. Considering a speech signal of 8 KHz sampling, this value corresponds to 830.86×10 6  times product operation per minute. This scale is far beyond the real time operation with a single chip of DSP (Digital Signal Processor) that is currently available. Accordingly, various methods have heretofore been investigated to reduce the operation scale for the vector quantization. These methods are largely grouped into a type which involves preliminary selection and/or simplification of operation, a type with specific vector quantizer structure contrivances, and a type in which the above two types are incorporated together. The type of method based on the simplification of operation has a merit that the amount of operations can be greatly reduced depending on the way of simplification. On the demerit side, however, deterioration of the properties is inevitable. It is another demerit that different evaluation standards are used at the time of the quantizer design and at the time of the search, and therefore expected quantizer properties can not be attained at the time of the design. The type of method with structural contrivance, on the other hand, has an advantage that expected quantization properties at the time of design can be attained at the time of the search. However, there is a problem that great amount of operational reduction can not be achieved unless the contrivance is well structured. The present invention pertains to the latter type method with structural contrivance. 
     As typical structural contrivance type method, there are multiple stage vector quantization (B. H. Juang and A. H. Gray, &#34;Multiple Stage Vector Quantization for Speech Coding&#34;, Proc. of Intl. Conf. on Acous., Speech and Signal Proc., 1982 (Literature 1)), conjugate structure vector quantization (Moriya and Y/da, &#34;Vector Quantization Method&#34;, Japanese Patent Laid-Open Publication No. Sho 63-285599 (Literature 2), Moriya, &#34;Method of and Apparatus for Multiple Vector Quantization&#34; (Lierature 3)), vector sum vector quantization (Ira A. Gerson, &#34;Digital Speech Coder with Improved Vector Exciting Source&#34;, Japanese Patent Laid-Open Publication No. Hei 02-502135 (Literature 4)), lattice vector quantization (J. H. Conway and N.J. A. Sloane, &#34;Fast Quantizing and Decoding Algorithms for Lattice Quantizers and Codes&#34;, IEEE Trans. Inf. Theory, Vol. IT-28, pp. 227-232, Mar. 1982 (Literature 5), R. M. Gray, &#34;Source Coding Theory&#34;, Ch. 5.5, Kluwer Academic Publishers, 1990 (Literature 6)), and tree structure delta quantization (Taniguchi, Ohta and Kurihara, &#34;Speech Coding System&#34;, Japanese Patent Laid-Open Publication No. Hei 4-352200 (Literature 7)). In these methods, output codevector is formed through linear operation on basis and coefficient vectors. More specifically, in the formation of output codevector for M bits from a basis vector set {e i   z  } and a coefficient vector set {g i   z  }, selecting a basis vector subset {e k   i  }and a coefficient vector subset {g k   i  }the i-th output codevector V i  is expressed as ##EQU1## Using this formula (1), the prior art method noted above is expressed as follows. In the M-bit two stage vector quantization, the following formula is given for all {i,k}, where K=2. 
     
         {g.sub.k.sup.i =1,2, i=0, . . . ,2.sup.M -1} 
    
     In this case, {e 1   i  } is selected from a basis vector subset B 1  consisting of C 1  vectors, and {e 2   i  } is selected from a basis vector subset B 2  consisting of C 2  vectors. Here C 1  ×C 2  =2 M . In the M-bit conjugate structure vector quantization, K=2, and 
     
         {g.sub.k.sup.i =±1, k=1, 2, i=0, . . . ,2.sup.M -1}. 
    
     In this case, e 1   i  is selected from the basis vector subset B 1  consisting of C 1  vectors, while {e 2   i  } is selected from the basis vector subset B 2  consisting of C 2  vectors. Here, C 1  ×C 2=2   M-2 . In the vector sum vector quantization, under K=M and {g k   i  =±1}, there are M type basis vector subsets each with single basis vector e k  and the output codevector is formed through arithmetic operations of M type basis vector. In the lattice vector quantization, it is featured that K is an appropriate number M o  and the coefficient vectors: {g k   i ,i=0, . . . , 2 M  } consist of integers. There are M o  type basis vector subsets each with single basis vector e k . Finally, in the M-bit tree structure delta quantization, there are M type basis vector subsets each with 2 K  vectors and coefficient vector subsets each with ±1 for each value of K which is {K=0,1,2, . . . , M-1}, and output codevectors of ##EQU2## are formed. 
     When the expression of the formula (1) is used, the vector quantization of the n-th input quantization vector x n  is defined as a search problem for obtaining i for minimizing the following formula (2). ##EQU3## 
     Considering the M-bit vector quantization, in the usual vector quantization without any structural contrivance, it is necessary to perform input vector distance calculation 2 M  times. In the case of the expression of the formula (1), it is just required to perform the K times distance calculation to the input vector, which is a smaller number of times than 2 M , and the subsequent operation is replaced with simple arithmetic operations. Thus, it is possible to reduce the amount of operations. Further, if there are equal numbers of v i  and -v i  in the basis vectors, the operations concerning the inner product (v i ) t  v i  are further reduced to one half. Generally, the properties and operation amount of the vector quantization depend on the number of basis vector sets. That is, the greater the number of basis vector sets, the better are the quantization properties, but the more is the operation amount. 
     Further, in a method in which the output codevectors are formed in the form of a linear sum of a plurality of basis vectors, such as the conjugate structure vector quantization, vector sum vector quantization, lattice structure vector quantization, etc., the characteristic deterioration due to transmission line errors is dispersed as characteristic deterioration of each basis vector. For this reason, the method is robust to errors compared with the single stage vector quantizer, in which deterioration due to transmission line error is loaded by the single vector. 
     Among the prior art quantization methods noted above, the multiple stage vector quantization and conjugate structure vector quantization require stage-by-stage search or preliminary selection for simply reducing the operation amount. However, this prevents the intrinsic characteristics from being attainable. The lattice vector quantization, on the other hand, permits equal characteristics to be attained at the time of the design and at the time of the search if all the basis vectors are designed collectively. However, since the number of basis vectors is at most equal to the number of bits, the quantization characteristics are inferior compared with the case without structural contrivance or the conjugate structure quantization. In the tree structure delta quantization, the number of basis vectors is less than the number of bits, and therefore the quantization characteristic is inferior compared with the cases of the conjugate vector quantization and lattice vector quantization. Besides, there has been no reported argorithm for designing an optimum quantizer for training sample sets. 
     SUMMARY OF THE INVENTION 
     An object of the present invention is therefore to provide a vector quantizing apparatus, which has a basis vector set consisting of basis vectors corresponding in number at least to a predetermined number of bits and permits a predetermined number of basis vector subsets to be obtained from the basis vector set such that some of the obtained basis vector subsets consist of a single basis vector and that output codevectors can be generated through arithmetic operations on the obtained basis vector subsets, so that it permits satisfactory quantization characteristics to be obtained with a comparatively small amount of operations and is robust to transmission line errors. 
     According to the present invention there is provided a vector quantizer for forming output codevectors corresponding in number to a predetermined number of bits with combinations of a set of a predetermined number of basis vectors and a set of a predetermined number of coefficient vectors, the vector quantizer comprising means for providing the basis vector sets such as to consist of basis vectors greater in number than the predetermined bit number and correspondingly forming, from the basis and coefficient vector sets, subsets corresponding in number to at most the predetermined bit number, the formed subsets including those consisting of at most a single basis vector and coefficient vector subsets formed from the coefficient vector set and determined according to the formed basis vector subsets. In the foregoing, the coefficient vector sets consist of ±1. It further comprises means for selecting combinations of a plurality of specific basis vector sets and a plurality of specific coefficient vector sets in a predetermined sequence from combinations of the formed basis vector subsets and coefficient vector subsets determined thereby, and means for forming output codevectors from combinations of the selected specific basis and coefficient vector subsets. 
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS 
     FIG. 1 is a block diagram showing a first embodiment of the vector quantizer according to the present invention; 
     FIG. 2 is a block diagram showing a second embodiment of the vector quantizer according to the present invention; 
     FIG. 3 is a block diagram showing a third embodiment of the vector quantizer according to the present invention; 
     FIG. 4 is a block diagram showing a fourth embodiment of the vector quantizer according to the present invention; and 
     FIG. 5 is a block diagram showing a fifth embodiment of the vector quantizer according to the present invention. 
    
    
     DESCRIPTION OF THE PREFERRED EMBODIMENTS 
     The present invention will now be described in conjunction with some preferred embodiments thereof. 
     FIG. 1 is a block diagram showing a first embodiment of the vector quantizer according to the present invention. Hereinafter, the number of bits of the quantizer is denoted by B, and the number of output codevectors by 2 B . (The output codevector number may be less than 2 B .) Referring to FIG. 1, a control signal input to an input terminal 101 assigns an output codevector index, and it is supplied to a code index controller 105. In a basis vector memory 120, a predetermined number of, i.e., K g  (B&lt;K g  &lt;2 B ) basis vectors are stored. In a coefficient vector memory 130, a predetermined number of, i.e., K c , coefficient vectors are stored. According to information assigned from a vector set assignment controller 110, the basis vectors stored in the basis vector memory 120 are divided into M types of subsets which are each supplied to each of sub basis vector memories 121, 122, . . . , 123. Meanwhile, according to information from the vector set assignment controller 110, the coefficient vectors stored in the coefficient vector memory 130 are divided into M types of (2&lt;M≦B) subsets which are each supplied to each of sub coefficient vector memories 131, 132, . . . , 133. The vector set assignment controller 110 divides the basis vectors in the basis vector memory 120 such that at most one basis vector is contained in at least one of the M type sub basis vector memories, 131, 132, . . . , 133. 
     It is assumed that the basis vectors in the m-th subsets are expressed as: 
     
         {e.sub.i.sup.m,i=1, . . . ,K.sub.g.sup.M } 
    
     the coefficient vectors in the m-th subset are defined as: 
     
         {c.sub.j.sup.m j=1, . . . , K.sub.c.sup.m } 
    
     The code index controller 105 generates, according to the output codevector index supplied from the input terminal 101, a control signal for selecting basis vectors and their multiplication coefficients from the sub basis and sub coefficient vector memories. The control signal is thus supplied to the sub basis vector memories 121, 122, . . . , 123 and also to the sub coefficient vector memories 131, 132, . . . , 133. According to the control signal from the code index controller 105, the M type sub basis and coefficient vector memories supply basis vectors e i   m  and coefficients c j   m  from their own subsets The basis vectors supplied from the sub basis vector memories and the coefficients output from the sub coefficient vector memories are multiplied by one another, and the products thus obtained are supplied to an adder 142. The adder 142 adds together the products of the basis vectors and the coefficients output, respectively, from the M type sub basis vector memories and the M type sub coefficient vector memories to form output codevector. The output codevector is expressed as: ##EQU4## Output codevector v t  is supplied from an output terminal 102. In this embodiment, there is a relation as shown in the following formula (4). ##EQU5## 
     FIG. 2 shows a second embodiment. This embodiment features that only ±1 are stored in sub coefficient vector memories 231, 232, . . . , 233. According to a control signal supplied from an input terminal 101, a code index controller 205 controls the individual sub coefficient vector memories 231 to 233 to selectively provide either +1 or -1. 
     A vector set assignment controller 210 controls only a basis vector memory 120. For the rest, the operation is the same as in the previous first embodiment. 
     FIG. 3 shows a third embodiment. Referring to the FIG. 3, an input terminal 101, a code index controller 105, a vector set assignment controller 110, a basis vector memory 120 and a coefficient vector memory 130 have the same functions as those described in connection with the first embodiment. According to information assigned from the vector set assignment controller 110, the basis vector memory 120 divides its stored basis vectors into M type subsets and supplies each thereof to each of sub basis vector memories 321, 322, . . . , 323. Also, according to information assigned from the vector set assignment controller 110, the coefficient vector memory 130 divides its stored coefficient vectors into M type (2&lt;M≦B) subsets and supplies each thereof to each of sub coefficient vector memories 331, 332, . . . , 333. The vector set assignment controller 110 divides the basis vectors in the basis vector memory 120 such that at most one basis vector is contained in at least one of the M type sub basis vector memories 321 to 323. Further, like the first embodiment, the basis vectors in the m-th subset are expressed as: {e i   m ,i=1, . . . , K g   m  } and the coefficient vectors in the m-th subset are expressed as: {c j   m ,j=1, . . . , K c   m  } 
     A precode selection controller 306 supplies information for selecting specific basis vectors to the sub basis vector memories 321 to 323 according to a control signal supplied from an input terminal 303. The sub basis vector memories 321 to 323 select specific basis vectors: {e i   m ,i=1, . . . , Z g   m  } determined by the information supplied from the precode selection controller 306 among the basis vectors supplied from the basis vector memory 120 and supplies the selected vectors each to each corresponding one of specific basis vector memories 351, 352, . . . , 353. Likewise, the sub coefficient vector memories 331 to 333 select specific coefficient vectors: 
     
         {c.sub.j.sup.m,j=1, . . . ,Z.sub.c.sup.m } 
    
     determined by the information from the precode selection controller 306 among the coefficient vectors supplied from the coefficient vector memory 130 and supplies each of the selected vectors to each corresponding one of specific coefficient vector memories 361, 362, . . . , 363. According to information supplied from an input terminal 301, a precode index controller 305 supplies a control signal for selecting basis vectors and coefficients from the specific basis vector memories 351 to 353 and specific coefficient vector memories 361 to 363. According to a control signal from the precode index controller 305, the M type specific basis and coefficient vector memories supply basis vectors e i   m  and coefficients c j   m  from their own subsets. The basis vectors and coefficients which are thus supplied are multiplied by one another in multipliers 141, and the products are supplied to an adder 142. The adder 142 adds together the products of the basis vectors and coefficients supplied from the M type specific basis vector memories and M type specific coefficient vector memories to form output codevector. The output codevector is expressed in the following formula (5). ##EQU6## Output codevector v t  is supplied from an output terminal 102. Again in this embodiment, there holds a relation as shown in the following formula (6). ##EQU7## 
     FIG. 4 shows a fourth embodiment. Referring to FIG. 4, a controller 400 drives a vector set assignment controller 410 to trigger a basis vector memory 420 and a coefficient vector memory 430 for distributing basis and coefficient vectors stored in these memories to sub basis and coefficient vector memories. In the basis vector memory 420, a predetermined number of, i.e., K g  (B&lt;K g&lt;  2 B ), basis vectors are stored. In the coefficient vector memory 430, a predetermined number of, i.e., K c  (B&lt;K c  &lt;2 B ), coefficient vectors are stored. According to information from a vector set assignment controller 410, the basis vector memory 420 divides the stored basis vectors into M type subsets and supplies each thereof to each of sub basis vector memories 421, 422, . . . , 423. Also, according to information supplied from the vector set assignment controller 410, the coefficient vector memory 430 divides the stored coefficient vectors into M type (2&lt;M≦B) subsets and supplies each thereof to each of sub coefficient vector memories 431, 432, . . . , 433. At this time, the vector set assignment controller 410 causes the division of the basis vectors in the basis vector memory 420 such that at most one basis vector is contained in at least one of the M type sub basis vector memories. The basis vectors in the subset stored in the m-th sub basis memory is defined as: {e i   m  i=1, . . . , K g   m  }, and the coefficient vectors in the subsets stored in the m-th sub coefficient vector memory is defined as: {c j   m ,j=1,. . . , K c   m  }. 
     Subsequently, the controller 400 supplies index information for assigning output codevectors corresponding to predetermined (=2 B ) bits and a control signal for switching switches 425, 435 and 445 to zero side. According to signal supplied from the controller 400, the code index controller 405 causes information for selecting basis vectors from the individual sub basis vector memories to be supplied to the sub basis vector memories 421 to 423 and also causes information for selecting coefficients from the individual sub coefficient vector memories to be supplied to the sub coefficient vector memories 431 to 433. The sub basis vector memories 421 to 423 select basis vectors e i   m  according to the information supplied from code index controller 405, the selected basis vectors being supplied through switches 425 to multipliers 141. The sub coefficient vector memories 431 to 433 select coefficients c j   m  according to the information from the code index controller 405, the selected coefficients being supplied through switches 435 to the multipliers 141. In the multipliers 141, the basis vectors and coefficients supplied from the M type sub basis and coefficient vector memories are multiplied by one another, and the products thus obtained are supplied to an adder 142. The adder 142 adds together M outputs of the multipliers 141 to form output codevector. The output codevector is expressed as: ##EQU8## 
     The output codevector thus formed is supplied through a switch 445 to a first output codevector evaluation unit 440. The first output codevector evaluation unit 440 calculates the inner products of an input vector x supplied from an input terminal 404 and 2 B  (or 2 B-1  if symmetrical positive and negative coefficients are present) output codevectors. The result is supplied to predetermined means for assigning a group of a predetermined number of vectors from the M type sub basis and coefficient vector sets. Information indicative of the sub vector memory of each assigned vector is supplied to a precode selection controller 406, and information indicative of the total number of assigned vectors in each sub vector memory is supplied to a precode index controller 407. As an example, an index group (F={t 1 , t 2 , . . . , t f  }) is assigned according to the magnitudes of cross-correlation of x and v t  such that 
     
         P.sub.t =X.sup.t V.sub.t, t=1, . . . ,2B 
    
     This can be realized, for instance, by feeding the index group: {(i fi   m ,j fj   m ),m=1, . . . ,M} of the sub basis and coefficient vector memories 421 to 423 and 431 to 433 generating the assigned indices to the precode selection controller 406 and outputting the number of elements: 
     
         {K.sub.gf.sup.m,K.sub.cf.sup.m,m=1, . . . ,M} 
    
     of the index group of the sub basis and coefficient vector memories 421 to 423 and 431 to 433 generating the assigned indices to a precode index controller 407. When information required for the precode selection and precode index controllers 406 and 407 are supplied from the first output codevector evaluation unit 440, the controller 400 supplies a control signal for switching the switches 425, 435 and 445 to the side of one. The precode selection controller 406 feed the index groups: 
     
         {(i.sub.fi.sup.m,j.sub.fj.sup.m),m=1, . . . ,M} 
    
     and ##STR1## from the first output codevector evaluation unit 440 to the sub basis vector memories 421 to 423 and the sub coefficient vector memories 431 to 433, respectively. Receiving information from the precode selection controller 406, the individual memories supply basis and coefficient vectors of corresponding indices to the specific basis and specific coefficient vector memories 451 to 453 and 451 to 453, respectively. The specific basis vector memories 451 to 453, receiving signal from the precode index controller 407, supplies basis vectors ##STR2## successively to multipliers 141. Also, the specific coefficient vector memories 461 to 463, receiving signal from precode index controller 407, supplies coefficients ##STR3## successively to the multipliers 141. The basis vectors and coefficients supplied to the multipliers 141 are multiplied by one another in the multipliers 141, and the products are supplied to an adder 142. 
     The adder 142 adds together the products of the basis vectors and coefficients from the M type specific basis vector memories and M type specific coefficient vector memories to form output codevector. The output codevector from the adder 142 is fed through the switch 455 to a second output codevector evaluation unit 470. The second codevector evaluation unit 470 calculates the distances, as shown in the following formula (8), of t f  output vectors {v t , t ={t 1 , t 2 , . . . , t f  }} with respect to an input vector supplied from the input terminal 404. ##EQU9## to obtain the value of t as an index corresponding to a minimum value of Q t , the value of t being output from an output terminal 402. 
     FIG. 5 shows a fifth or last embodiment. This embodiment is the same in structure as the preceding fourth embodiment except for a weighting coefficient extractor 580 and a first and a second output codevector evaluation unit 540 and 570, which have structure varying with the weighting coefficient extractor 580. The weighting coefficient extractor 580 extracts weighting coefficient that is used in the first and second output codevector evaluation units 540 and 570 according to the input vector x supplied from the input terminal 404. As the weighting coefficient may be used, for instance, the auto-correlation {r x  (0), . . . , r x  (K-1)} where K is the dimension number of the basis and input vectors. As an alternative, it is possible to use an impulse response with respect to a perceptual weighting filter which is used as standards in speech coding. This is detailed in, for instance, B. S. Atal, &#34;Predicative Coding of Speech at Low Bit Rates&#34;, IEEE Trans. Comm., pp. 600-614, 1982 (Literature 8), and J-H. Chen., &#34;High-Quality 16 kb/s Speech Coding with a One-Way Delay Less Than 2 ms&#34;, Proc. of Intl. Conf. on Acous., Speech and Signal Proc., pp. 453-456, 1990 (Literature 9). Denoting the impulse response of the perceptual weighting filter by h w  (n), the weighting coefficient matrix that is formed is expressed as: ##EQU10## 
     Elements {h w  0 . . . , h w  (K-1)} that determine the matrix are supplied from first and second output codevector evaluation units 540 and 570. The first output codevector evaluation unit 540 calculates weighting inner products of 2 B  (or 2 B-1  if symmetrical positive and negative coefficients are present) output codevectors: ##EQU11## and the input vector x supplied from the input terminal 404. The result is fed to predetermined means for assigning a group of a predetermined number of vectors from the M type sub basis and coefficient vector sets. Information indicative of the index of the sub vector memory containing each assigned vector is supplied to a precode selection controller 406, and information indicative of the total number of assigned vectors in each sub vector memory is supplied to a precode index controller 407. The inner products at this time are calculated as: 
     
         P.sub.t.sup.W =(H.sub.x x).sup.t H.sub.x v.sub.t,t=1, . . . ,2.sup.B(11) 
    
     Meanwhile, a second output codevector evaluation unit 570 weighting distances of t f  output vectors {v t , t={t 1 , t 2 , . . . , t f  }} supplied from an adder 142 with respect to input vector supplied from the input terminal 404. ##EQU12## to obtain the value of t as an index corresponding to the minimum value of Q t   W  the value of t being supplied to the output terminal 402. 
     In the description so far, the output codevector formation is done whenever the inner product and distance between the output codevector and input vector are calculated. However, as noted before in the description of the prior art, in the vector quantization method pertaining to the present invention it is possible to reduce the operation amount having the inner products of the input and basis vectors and the inner products of the basis vectors to be calculated previously. 
     As has been described in the foregoing, according to the present invention it is possible to provide a vector quantizing apparatus, which has a basis vector set consisting of basis vectors corresponding in number at least to a predetermined number of bits and permits a predetermined number of basis vector subsets to be obtained from the basis vector set such that some of the obtained basis vector subsets consist of a single basis vector and that output codevectors can be generated through arithmetic operation on the obtained basis vector subsets, so that it permits satisfactory quantization characteristics to be obtained with a comparatively small amount of operations and is robust to transmission line errors.