Back to Search
Start Over
Efficient complexity reduction in codebook search for ACELP.
- Source :
-
Application Research of Computers / Jisuanji Yingyong Yanjiu . Dec2013, Vol. 30 Issue 12, p3699-3701. 4p. - Publication Year :
- 2013
-
Abstract
- In order to reduce the complexity of ACELP ( algebraic code excited linear prediction), and achieve a better operation in real-time system, this paper proposed an effective algorithm. First, it proposed the discontinuous open-loop pitch estimation in adaptive codebook search, used the time decimation factor in different delays, and then proposed the unified pulse-replacement search algorithm in stochastic codebook search, used the prediction technique and judging mechanism to control the number of codebook search. Finally, it simulated the improved algorithm in G. 729A. The result shows that the proposed algorithm not only acquires complexity reduction but also get a high speech quality. [ABSTRACT FROM AUTHOR]
Details
- Language :
- Chinese
- ISSN :
- 10013695
- Volume :
- 30
- Issue :
- 12
- Database :
- Academic Search Index
- Journal :
- Application Research of Computers / Jisuanji Yingyong Yanjiu
- Publication Type :
- Academic Journal
- Accession number :
- 95444061
- Full Text :
- https://doi.org/10.3969/j.issn.1001-3695.2013.12.046