Abstract
This paper deals with a key component involved in the short time spectrum coding in a speech coding system, namely the computation of line spectral frequencies (LSF). The method consists in: (1) the use of some predictions of the LSF as starting points for the search of the current LSF, (2) the fast bracketing of the LSF restricted on a grid of points and (3) the refinement of LSF by a variable number of bisections. The experimental results show an improvement of the average performance with more than 30% with respect to one frequently used method of LSF computation—the Kabal–Ramachandran method.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
