IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v68y2005i2p105-113.html
   My bibliography  Save this article

Using a fast RLS adaptive algorithm for efficient speech processing

Author

Listed:
  • Papaodysseus, C.
  • Roussopoulos, G.
  • Panagopoulos, A.

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.

Suggested Citation

  • Papaodysseus, C. & Roussopoulos, G. & Panagopoulos, A., 2005. "Using a fast RLS adaptive algorithm for efficient speech processing," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 68(2), pages 105-113.
    • Handle: RePEc:eee:matcom:v:68:y:2005:i:2:p:105-113
    DOI: 10.1016/j.matcom.2004.10.007
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475404002885
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.matcom.2004.10.007?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:matcom:v:68:y:2005:i:2:p:105-113. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.