首页> 外文会议> >On reducing computational complexity of codebook search in CELP coder through the use of algebraic codes
【24h】

On reducing computational complexity of codebook search in CELP coder through the use of algebraic codes

机译:关于通过使用代数码来降低CELP编码器中码本搜索的计算复杂度

获取原文

摘要

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.
机译:引入了一个通用框架,该框架允许快速搜索和自由地设计具有良好统计属性的代码本。从这个角度比较了几种先前提出的方案。给出了向后过滤的公式,以表明稀疏代数代码(SAC)(即,具有很少的非零分量)具有明显的优势。结果表明,它们减少了每个码字的最佳搜索计算量。它们还允许在时域和频域中控制码本的统计属性。在可以根据线性预测编码模型A(z)进行演变的意义上说,该控制可以是动态的。描述了基于SAC驱动的动态码本的代数编码激励线性预测(ACELP)技术,该技术允许在单个TMS320C25上以4.8到16 kb / s的速率进行全双工操作。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号