SUCHEN MIT ALGEBRAISCHEM KODEBUCH BEI SCHNELLKODIERUNG VON SPRACHE

摘要

A codebook is searched in view of encoding a sound signal. This codebook consists of a set of codevectors each of 40 positions and comprising N non-zero-amplitude pulses assignable to predetermined valid positions. To reduce the search complexity, a depth-first search is used which involves a tree structure with levels ordered from 1 through M. A path-building operation takes place at each level whereby a candidate path from the previous level is extended by choosing a predetermined number of new pulses and selecting valid positions for said new pulses in accordance with a given pulse-order rule and a given selection criterion. A path originated at the first level and extended by the path-building operations of subsequent levels determines the respective positions of the N non-zero-amplitude pulse of a candidate codevector. Use of a signal-based pulse-position likelihood estimate during the first few levels enable initial pulse-screening to start the search on favorable conditions. A selection criterion based on maximizing a ratio is used to assess the progress and to choose the best one among competing candidate codevectors.