{"title":"语音编码中的卡尔曼滤波技术","authors":"S. Crisafulli, J. D. Mills, R. Bitmead","doi":"10.1109/ICASSP.1992.225968","DOIUrl":null,"url":null,"abstract":"The use of Kalman filtering (KF) techniques in speech coding is investigated. The authors show that the common linear predictor (LP) is a special case of the KF based on an all-pole signal model. They also show that the KF algorithm provides fixed-lag smoothing at no additional complexity. Simulation results reveal that KF based speech coding has significant advantage over the equivalent LP based systems, particularly when used with coarsely quantized measurements.<<ETX>>","PeriodicalId":163713,"journal":{"name":"[Proceedings] ICASSP-92: 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing","volume":"60 4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"31","resultStr":"{\"title\":\"Kalman filtering techniques in speech coding\",\"authors\":\"S. Crisafulli, J. D. Mills, R. Bitmead\",\"doi\":\"10.1109/ICASSP.1992.225968\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The use of Kalman filtering (KF) techniques in speech coding is investigated. The authors show that the common linear predictor (LP) is a special case of the KF based on an all-pole signal model. They also show that the KF algorithm provides fixed-lag smoothing at no additional complexity. Simulation results reveal that KF based speech coding has significant advantage over the equivalent LP based systems, particularly when used with coarsely quantized measurements.<<ETX>>\",\"PeriodicalId\":163713,\"journal\":{\"name\":\"[Proceedings] ICASSP-92: 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing\",\"volume\":\"60 4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-03-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"31\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[Proceedings] ICASSP-92: 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICASSP.1992.225968\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[Proceedings] ICASSP-92: 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICASSP.1992.225968","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The use of Kalman filtering (KF) techniques in speech coding is investigated. The authors show that the common linear predictor (LP) is a special case of the KF based on an all-pole signal model. They also show that the KF algorithm provides fixed-lag smoothing at no additional complexity. Simulation results reveal that KF based speech coding has significant advantage over the equivalent LP based systems, particularly when used with coarsely quantized measurements.<>