Name
Abstract | ||
|---|---|---|
In this article, a low bit-rate low-complexity block-based trellis quantization (BTQ) scheme is proposed for quantization of line spectral frequencies for speech coding applications. The branches in the trellis diagram correspond to the LSF difference code-words and the states correspond to quantized LSF parameters. An efficient algorithm for the index generation (finding the index of a path in the trellis) is introduced. The proposed BTQ achieves the transparent coding quality at 23 bits/frame (1150 b/sec.) and offers a gain of 3 b/frame (150 b/s) and significant reduction in complexity, compared to the IS-641 split-VQ. An interframe BTQ scheme is also presented to exploit the redundancies between the adjacent frames. The interframe scheme is found to achieve an additional 50 b/sec reduction of the bit-rate and is based on adaptive block-based trellis quantization of the prediction residues |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1109/ICASSP.2000.861080 | ICASSP |
Keywords | Field | DocType |
linear predictive coding,quantization,signal analysis,speech coding,computational complexity,frequency response,information technology,indexation,gain | Speech coding,Diagram,Artificial intelligence,Pattern recognition,Algorithm,Speech recognition,Quantization (physics),Inter frame,Trellis quantization,Space–time trellis code,Quantization (signal processing),Mathematics,Computational complexity theory | Conference |
Volume | ISSN | ISBN |
5 | 1520-6149 | 0-7803-6293-4 |
Citations | PageRank | References |
1 | 0.37 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lahouti, F. | 1 | 133 | 11.22 |
| A. K. Khandani | 2 | 297 | 19.65 |