{"title":"Fast spherical code decoding algorithms for the residual codebook in CELP coders","authors":"K. Koppinen, T. Mikkonen","doi":"10.1109/SCFT.1999.781501","DOIUrl":null,"url":null,"abstract":"A new method for fast decoding when using algebraic codes for the fixed codebook in CELP speech coders is presented. This method is based on the trellis structure of a block code, and allows fast optimal search of the residual codebook even with a combined scalar gain, unlike previous search methods. The method is flexible, allowing for long block lengths and the use of any code including nonlinear ones. Currently the performance is not as high as with standard algebraic coding methods, but further refinements may make this a viable method.","PeriodicalId":372569,"journal":{"name":"1999 IEEE Workshop on Speech Coding Proceedings. Model, Coders, and Error Criteria (Cat. No.99EX351)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","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.781501","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
A new method for fast decoding when using algebraic codes for the fixed codebook in CELP speech coders is presented. This method is based on the trellis structure of a block code, and allows fast optimal search of the residual codebook even with a combined scalar gain, unlike previous search methods. The method is flexible, allowing for long block lengths and the use of any code including nonlinear ones. Currently the performance is not as high as with standard algebraic coding methods, but further refinements may make this a viable method.