A fast LSF search algorithm based on interframe correlation in G.723.1 (Q1773778)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A fast LSF search algorithm based on interframe correlation in G.723.1 |
scientific article; zbMATH DE number 2163850
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast LSF search algorithm based on interframe correlation in G.723.1 |
scientific article; zbMATH DE number 2163850 |
Statements
A fast LSF search algorithm based on interframe correlation in G.723.1 (English)
0 references
3 May 2005
0 references
Summary: 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 an 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\%.
0 references
linear predictive coding
0 references
line spectral frequency
0 references
0.7475773692131042
0 references
0.722704291343689
0 references