Abstract
An efficient search procedure for CELP coders is described. Based on the phase spectra of the codevectors and the ideal excitation vector, a subset of the codebook is preselected. This subset is then exhaustively searched to find the best, perhaps optimum, codevector. Computational savings of the order of 30-40 are achieved while still maintaining good output speech quality.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
