Using a fast RLS adaptive algorithm for efficient speech processing

✍ Scribed by C. Papaodysseus; G. Roussopoulos; A. Panagopoulos

• Publisher: Elsevier Science
• Year: 2005
• Tongue: English
• Weight: 83 KB
• Volume: 68
• Category: Article
• ISSN: 0378-4754
• DOI: 10.1016/j.matcom.2004.10.007

✦ Synopsis

In this paper, a new method is presented that offers efficient computation of Linear Prediction Coefficients (LPC) via a new Recursive Least Squares (RLS) adaptive filtering algorithm. This method can be successfully used in speech coding and processing. The introduced algorithm is numerically robust, fast, parallelizable and has particularly good tracking properties. By means of this scheme, Linear Prediction Coefficients are obtained that offer an improvement in the reconstruction of the speech signal before coding, as compared to the signal obtained by various classical algorithm. An analogous improvement is observed in speech coding experiments too, while a subjective test confirms the improvement of the quality of synthesized speech. The overall processing time of the proposed method of speech coding is a bit greater, but comparable to the time the classical methods need.