Name
Title | ||
|---|---|---|
On reducing computational complexity of codebook search in CELP coder through the use of algebraic codes |
Abstract | ||
|---|---|---|
A general framework is introduced which allows both fast search and freedom in designing codebooks with good statistical properties. Several previously proposed schemes are compared from this viewpoint. A backward filtering formulation is given to show that sparse algebraic codes (SACs) (i.e., with few nonzero components) offer distinct advantages. It is shown that they reduce the optimal-search computation per codeword. They also allow control of the statistical properties of the codebook in the time and frequency domains. This control can be dynamic in the sense that it can be made to evolve as a function of the linear predictive coding model A(z). The algebraic-code excited linear prediction (ACELP) technology which allows full duplex operation on a single TMS320C25 at rates between 4.8 and 16 kb/s and which is based on SAC-driven dynamic codebooks is described |
Year | DOI | Venue |
|---|---|---|
1990 | 10.1109/ICASSP.1990.115567 | Albuquerque, NM |
Keywords | DocType | ISSN |
computational complexity,decoding,encoding,filtering and prediction theory,speech analysis and processing,vocoders,4.8 to 16 kbit/s,acelp,celp coder,sac-driven dynamic codebooks,tms320c25,algebraic-code excited linear prediction,backward filtering,codebook search,full duplex operation,linear predictive coding model,sparse algebraic codes,statistical properties,code excited linear prediction,predictive models,lattices,filtering,error correction,linear predictive coding,sparse matrices,frequency domain,speech,algebraic code excited linear prediction,frequency domain analysis,stochastic processes | Conference | 1520-6149 |
Citations | PageRank | References |
20 | 4.12 | 3 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Laflamme, C. | 1 | 20 | 4.12 |
| J. Adoul | 2 | 290 | 63.42 |
| Su, H.Y. | 3 | 20 | 4.12 |
| Morissette, S. | 4 | 110 | 25.66 |