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

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

{"title":"如何消除LSP计算中的多项式","authors":"B. Dumitrescu, I. Tabus","doi":"10.1109/SCFT.1999.781481","DOIUrl":null,"url":null,"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.","PeriodicalId":372569,"journal":{"name":"1999 IEEE Workshop on Speech Coding Proceedings. Model, Coders, and Error Criteria (Cat. No.99EX351)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"How to deflate polynomials in LSP computation\",\"authors\":\"B. Dumitrescu, I. Tabus\",\"doi\":\"10.1109/SCFT.1999.781481\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":372569,\"journal\":{\"name\":\"1999 IEEE Workshop on Speech Coding Proceedings. Model, Coders, and Error Criteria (Cat. No.99EX351)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-06-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1999 IEEE Workshop on Speech Coding Proceedings. Model, Coders, and Error Criteria (Cat. No.99EX351)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCFT.1999.781481\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1999 IEEE Workshop on Speech Coding Proceedings. Model, Coders, and Error Criteria (Cat. No.99EX351)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCFT.1999.781481","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

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

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

查看原文本刊更多论文

How to deflate polynomials in LSP computation

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

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

自引率

0.00%

发文量