{"title":"基于树结构矢量量化的语音压缩技术","authors":"P. Kanawade, S. Gundal","doi":"10.1109/ICDMAI.2017.8073524","DOIUrl":null,"url":null,"abstract":"In this paper, the Tree-Structured Vector Quantization (TSVQ) method for proficient speech compression is presented. Efficient utilization of memory is always needed when analog-encoded or digitized data such as image, audio, videos, portable files are need to store and/or convey to digital channels. Compression offers betterments with storage requirements while transmitting the encoded signals with lossy and lossless techniques. Lossy compression is always intended for compression of high volume data with Scalar Quantization (SQ) and Vector Quantization (VQ). The Tree based VQ method is used with hieratically organized binary sequences of codeword of data (speech) for compression with reduced and minimized arithmetic calculation requirements. Speech compression has been gained by compressed-codebook coefficients and structured in binary fashion. The quantization noise ratio with signal power is obtained efficiently around less than 1.082 dB. Shared codebook method described in this TSVQ algorithm achieves 3.6 reduced storage requirements of factor 5 to 3.","PeriodicalId":368507,"journal":{"name":"2017 International Conference on Data Management, Analytics and Innovation (ICDMAI)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Tree structured vector quantization based technique for speech compression\",\"authors\":\"P. Kanawade, S. Gundal\",\"doi\":\"10.1109/ICDMAI.2017.8073524\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, the Tree-Structured Vector Quantization (TSVQ) method for proficient speech compression is presented. Efficient utilization of memory is always needed when analog-encoded or digitized data such as image, audio, videos, portable files are need to store and/or convey to digital channels. Compression offers betterments with storage requirements while transmitting the encoded signals with lossy and lossless techniques. Lossy compression is always intended for compression of high volume data with Scalar Quantization (SQ) and Vector Quantization (VQ). The Tree based VQ method is used with hieratically organized binary sequences of codeword of data (speech) for compression with reduced and minimized arithmetic calculation requirements. Speech compression has been gained by compressed-codebook coefficients and structured in binary fashion. The quantization noise ratio with signal power is obtained efficiently around less than 1.082 dB. Shared codebook method described in this TSVQ algorithm achieves 3.6 reduced storage requirements of factor 5 to 3.\",\"PeriodicalId\":368507,\"journal\":{\"name\":\"2017 International Conference on Data Management, Analytics and Innovation (ICDMAI)\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 International Conference on Data Management, Analytics and Innovation (ICDMAI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDMAI.2017.8073524\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Data Management, Analytics and Innovation (ICDMAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDMAI.2017.8073524","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Tree structured vector quantization based technique for speech compression
In this paper, the Tree-Structured Vector Quantization (TSVQ) method for proficient speech compression is presented. Efficient utilization of memory is always needed when analog-encoded or digitized data such as image, audio, videos, portable files are need to store and/or convey to digital channels. Compression offers betterments with storage requirements while transmitting the encoded signals with lossy and lossless techniques. Lossy compression is always intended for compression of high volume data with Scalar Quantization (SQ) and Vector Quantization (VQ). The Tree based VQ method is used with hieratically organized binary sequences of codeword of data (speech) for compression with reduced and minimized arithmetic calculation requirements. Speech compression has been gained by compressed-codebook coefficients and structured in binary fashion. The quantization noise ratio with signal power is obtained efficiently around less than 1.082 dB. Shared codebook method described in this TSVQ algorithm achieves 3.6 reduced storage requirements of factor 5 to 3.