发明名称 |
Algebraisk djupet-först-kodbokssökning för snabb kodning av tal |
摘要 |
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. |
申请公布号 |
SE520554(C2) |
申请公布日期 |
2003.07.22 |
申请号 |
SE19960000918 |
申请日期 |
1996.03.08 |
申请人 |
UNIVERSITE DE SHERBROOKE |
发明人 |
JEAN-PIERRE ADOUL;CLAUDE LAFLAMME |
分类号 |
G10L19/08;G10L19/00;G10L19/10;G10L19/12;(IPC1-7):G10L9/14 |
主分类号 |
G10L19/08 |
代理机构 |
|
代理人 |
|
主权项 |
|
地址 |
|