| 摘要 |
A code excited linear prediction speech communication system includes a ternary codebook of innovation sequences. The ternary codebook is formed as the sum of first and second binary codebooks containing binary codevectors. Code sequences Ck, in the ternary codebook are constructed from the set of values, {-1,0,1}. To form the ternary codebook, one binary codebook has the binary codevector values {0,1}, and the other binary codebook has the binary codevector values {-1,0}. The sum of one binary codevector from each binary codebook forms a ternary codevector. The present codebook structure permits several efficient search procedures for an optimum innovation sequence. In particular, the binary codevectors may be searched using a given fidelity criterion function in order to find an optimum ternary codevector representing the optimum innovation sequence.
|
