How to deflate polynomials in LSP computation

1999 IEEE Workshop on Speech Coding Proceedings. Model, Coders, and Error Criteria (Cat. No.99EX351) Pub Date : 1999-06-20 DOI:10.1109/SCFT.1999.781481

B. Dumitrescu, I. Tabus

引用次数: 4

Abstract

In this paper we propose a new deflation algorithm for line spectral pair (LSP) computation in speech coding. This algorithm is much more reliable than other methods based on deflation.

查看原文本刊更多论文

如何消除LSP计算中的多项式

本文提出了一种新的用于语音编码中线谱对(LSP)计算的压缩算法。该算法比其他基于通货紧缩的方法可靠得多。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

1999 IEEE Workshop on Speech Coding Proceedings. Model, Coders, and Error Criteria (Cat. No.99EX351)

自引率

0.00%

发文量