High speed multi-stage code search algorithm in CELP

(1991) High speed multi-stage code search algorithm in CELP. Global Telecommunications Conference, 1991. GLOBECOM '91. 'Countdown to the New Millennium. Featuring a Mini-Theme on: Personal Communications Services, 1.

[img]
Preview
PDF
14449_1.pdf

Download (18kB) | Preview
[img] Microsoft Word
14449_2.doc

Download (26kB)

Abstract

An efficient multistage algorithm for code search in the code excited linear prediction (CELP) methods of speech coding is described. The algorithm requires binary clustering of the codebook into a fixed number of cells and inverse filtering of the incoming speech by the format and pitch filters to produce a residual error sequence (RES). It is demonstrated that the method could achieve a reduction in the number of operations from 40 to 50 times. It is shown that codebooks constructed from random walk stochastic sequences improve the average signal to noise ratio by 5-6 dB over codebooks constructed from Gaussian white noise sequences

Item Type: Article
Subjects: Computer
Department: College Of Computer Sciences and Engineering > Information and Computer Science Dept
Depositing User: Mr. Admin Admin
Date Deposited: 24 Jun 2008 13:36
Last Modified: 01 Nov 2019 14:05
URI: https://eprints.kfupm.edu.sa/id/eprint/14449