Using a fast RLS adaptive algorithm for efficient speech processing

C. Papaodysseus, G. Roussopoulos and A. Panagopoulos

Mathematics and Computers in Simulation (MATCOM), 2005, vol. 68, issue 2, 105-113

Abstract: 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.

Keywords: Speech coding; Speech processing; Adaptive RLS filtering; Forward linear prediction (search for similar items in EconPapers)
Date: 2005
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475404002885
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:68:y:2005:i:2:p:105-113

DOI: 10.1016/j.matcom.2004.10.007

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().