Abstract
In this paper we propose a simple fast-search VQ of the LSF's to be used on top of the split VQ, that is, in each of the sub-vector domains. The main trait of the proposed method is that no suboptimal codebooks are used and there is no further reduction in performance. In each sub-vector domain, a full-size optimally trained codebook, typically of size 1024, is searched using a fast-search algorithm. The result of this search is identical to that of a full-search, yet, only about 25% of a full-search complexity is needed.
| Original language | English (US) |
|---|---|
| Title of host publication | International Conference on Spoken Language Processing, ICSLP, Proceedings |
| Editors | Anon |
| Publisher | IEEE |
| Pages | 945-948 |
| Number of pages | 4 |
| Volume | 2 |
| State | Published - Dec 1 1996 |
| Externally published | Yes |
| Event | Proceedings of the 1996 International Conference on Spoken Language Processing, ICSLP. Part 1 (of 4) - Philadelphia, PA, USA Duration: Oct 3 1996 → Oct 6 1996 |
Other
| Other | Proceedings of the 1996 International Conference on Spoken Language Processing, ICSLP. Part 1 (of 4) |
|---|---|
| City | Philadelphia, PA, USA |
| Period | 10/3/96 → 10/6/96 |
All Science Journal Classification (ASJC) codes
- Computer Science(all)