KFUPM ePrints

High speed multi-stage code search algorithm in CELP

Elshafei, M. and Al-Suwaiyel, M.I. (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]Microsoft Word


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
Date:December 1991
Date Type:Publication
Divisions:College Of Computer Sciences and Engineering > Information and Computer Science Dept
Creators:Elshafei, M. and Al-Suwaiyel, M.I.
ID Code:14449
Deposited By:KFUPM ePrints Admin
Deposited On:24 Jun 2008 16:36
Last Modified:12 Apr 2011 13:15

Repository Staff Only: item control page