A fast LSF search algorithm based on interframe correlation in G.723.1

Authors:
Sameer A. Kibey;Jaydeep P. Kulkarni;Piyush D. Sarode
Affiliations:
Digital Signal Processing and Multimedia Group, Tata Elxsi Ltd., Hoody, Bangalore, India;Centre for Electronics Design and Technology, Indian Institute of Science, Bangalore, India;Honeywell Technology Solutions Labs Pvt. Ltd., Bangalore, India
Venue:
EURASIP Journal on Applied Signal Processing
Year:
2004

Citing 3
Cited 0

A new efficient algorithm to compute the LSP parameters for speech coding

Signal Processing
Digital Speech; Coding for Low Bit Rate Communication Systems

Digital Speech; Coding for Low Bit Rate Communication Systems
Efficient Algorithm to Compute LSP Parameters from 10th-order LPC Coefficients

ICASSP '97 Proceedings of the 1997 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '97)-Volume 3 - Volume 3

Quantified Score

Hi-index	0.00

Visualization

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