Skip to main content

A Fast LSF Search Algorithm Based on Interframe Correlation in G.723.1

Abstract

We explain a time complexity reduction algorithm that improves the line spectral frequencies (LSF) search procedure on the unit circle for low bit rate speech codecs. The algorithm is based on strong interframe correlation exhibited by LSFs. The fixed point C code of ITU-T Recommendation G.723.1, which uses the "real root algorithm" was modified and the results were verified on ARM-7TDMI general purpose RISC processor. The algorithm works for all test vectors provided by International Telecommunications Union-Telecommunication (ITU-T) as well as real speech. The average time reduction in the search computation was found to be approximately 20%.

Author information

Affiliations

Authors

Corresponding author

Correspondence to Sameer A Kibey.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Kibey, S.A., Kulkarni, J.P. & Sarode, P.D. A Fast LSF Search Algorithm Based on Interframe Correlation in G.723.1. EURASIP J. Adv. Signal Process. 2004, 760931 (2004). https://doi.org/10.1155/S1110865704312011

Download citation

Keywords and phrases

  • line spectral frequencies
  • linear predictive coding
  • unit circle
  • interframe correlation
  • G.723.1