| 摘要 |
PURPOSE:To perform inner product calculation by a number of times of <=n by making n-notation tree retrieval executable in such a way that an inner product value output is provided in a block which performs the 1st stage of 1-notation tree retrieval and comparing inner products of plural blocks by using the plural blocks in parallel. CONSTITUTION:When the 1st stage of n-notation tree retrieval is performed by using two stages of vector quantity quantizers, half output vectors of the whole retrieval are stored in the 1st- and 2nd-stage code books and, for example, the largest inner product value 5 in the 1st half is outputted from the 1st-stage vector quantizer and the largest inner product value in the 2nd half is outputted from the 1st-stage vector quantizer. An address producer inputs the comparing output of a comparator and output vector index of the quantizer and produces the output vector index of the 1st stage of the tree retrieval. Either the output of the 2nd-stage vector quantizer or the output of the address producer is selected as the output vector index sent in the 3rd stage. |
