Open Access

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

  • Sameer A Kibey1Email author,
  • Jaydeep P Kulkarni2 and
  • Piyush D Sarode3
EURASIP Journal on Advances in Signal Processing20042004:760931

Received: 16 December 2002

Published: 8 July 2004


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%.

Keywords and phrases

line spectral frequencieslinear predictive codingunit circleinterframe correlationG.723.1

Authors’ Affiliations

Digital Signal Processing and Multimedia Group, Tata Elxsi Ltd.,
Centre for Electronics Design and Technology, Indian Institute of Science
Honeywell Technology Solutions Labs Pvt. Ltd.


© Kibey et al. 2004