We describe in this paper a code-excited linear predictive coder in which the optimum innovation sequence is selected from a code book of stored sequences to optimize a given fidelity criterion. Each sample of the innovation sequence is filtered sequentially through two time-varying linear recursive filters, one with a long-delay (related to pitch period) predictor in the feedback loop and the other with a short-delay predictor (related to spectral envelope) in the feedback loop. We code speech, sampled at 8 kHz, in blocks of 5-msec duration. Each block consisting of 40 samples is produced from one of 1024 possible innovation sequences. The bit rate for the innovation sequence is thus 1/4 bit per sample. We compare in this paper several different random and deterministic code books for their effectiveness in providing the optimum innovation sequence in each block. Our results indicate that a random code book has a slight speech quality advantage at low bit rates. Examples of speech produced by the above method will be played at the conference.
[1]
Bishnu S. Atal,et al.
Stochastic coding of speech signals at very low bit rates: The importance of speech perception
,
1985,
Speech Commun..
[2]
Bishnu S. Atal,et al.
Predictive Coding of Speech at Low Bit Rates
,
1982,
IEEE Trans. Commun..
[3]
Bishnu S. Atal,et al.
Speech coding using efficient block codes
,
1982,
ICASSP.
[4]
P. Noll,et al.
Multipath Search Coding of Stationary Signals with Applications to Speech
,
1982,
IEEE Trans. Commun..
[5]
Bishnu S. Atal,et al.
Improving performance of multi-pulse LPC coders at low bit rates
,
1984,
ICASSP.