{"title":"修改CELP编码器使用根倒谱","authors":"V. Abolghasemi, H. Marvi","doi":"10.5281/ZENODO.40485","DOIUrl":null,"url":null,"abstract":"Due to increasing demand for speech communications, efficient techniques in low-rate speech coding are of interest. In this paper a new compression technique using root cepstral analysis has been proposed. Implementing the proposed method causes the coder to deal with root cepstrum coefficients instead of speech samples. The main idea in using root cepstrum analysis is that some of the trivial coefficients can be ignored to send toward the decoder. Although it leaves a little degradation in the quality of decoded speech signal, considerable reduction in the total bit-rate is achieved. Moreover it has the advantage of adjustability which can be used to optimize the coding procedure. The experimental results confirm the ability of the proposed method in speech coding problems.","PeriodicalId":176384,"journal":{"name":"2007 15th European Signal Processing Conference","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Modified CELP coder using root cepstrum\",\"authors\":\"V. Abolghasemi, H. Marvi\",\"doi\":\"10.5281/ZENODO.40485\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Due to increasing demand for speech communications, efficient techniques in low-rate speech coding are of interest. In this paper a new compression technique using root cepstral analysis has been proposed. Implementing the proposed method causes the coder to deal with root cepstrum coefficients instead of speech samples. The main idea in using root cepstrum analysis is that some of the trivial coefficients can be ignored to send toward the decoder. Although it leaves a little degradation in the quality of decoded speech signal, considerable reduction in the total bit-rate is achieved. Moreover it has the advantage of adjustability which can be used to optimize the coding procedure. The experimental results confirm the ability of the proposed method in speech coding problems.\",\"PeriodicalId\":176384,\"journal\":{\"name\":\"2007 15th European Signal Processing Conference\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-09-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 15th European Signal Processing Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5281/ZENODO.40485\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 15th European Signal Processing Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5281/ZENODO.40485","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Due to increasing demand for speech communications, efficient techniques in low-rate speech coding are of interest. In this paper a new compression technique using root cepstral analysis has been proposed. Implementing the proposed method causes the coder to deal with root cepstrum coefficients instead of speech samples. The main idea in using root cepstrum analysis is that some of the trivial coefficients can be ignored to send toward the decoder. Although it leaves a little degradation in the quality of decoded speech signal, considerable reduction in the total bit-rate is achieved. Moreover it has the advantage of adjustability which can be used to optimize the coding procedure. The experimental results confirm the ability of the proposed method in speech coding problems.