02.10.2019 Views

UploadFile_6417

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Adaptive PCM and DPCM (ADPCM) 615<br />

and performance of these encoders can be improved by having them adapt<br />

to the slowly time-variant power level of the speech signal.<br />

In both PCM and DPCM the quantization error q(n) resulting from a<br />

uniform quantizer operating on a slowly varying power level input signal<br />

will have a time-variant variance (quantization noise power). One improvement<br />

that reduces the dynamic range of the quantization noise is<br />

the use of an adaptive quantizer.<br />

Adaptive quantizers can be classified as feedforward or feedback. A<br />

feedforward adaptive quantizer adjusts its step size for each signal sample,<br />

based on a measurement of the input speech signal variance (power). For<br />

example, the estimated variance, based as a sliding window estimator, is<br />

ˆσ 2 n+1 = 1 M<br />

Then the step size for the quantizer is<br />

n+1<br />

∑<br />

k=n+1−M<br />

s 2 (k) (12.18)<br />

∆(n +1)=∆(n)ˆσ n+1 (12.19)<br />

In this case it is necessary to transmit ∆ (n +1)tothe decoder in order<br />

for it to reconstruct the signal.<br />

A feedback adaptive quantizer employs the output of the quantizer<br />

in the adjustment of the step size. In particular, we may set the step size<br />

as<br />

∆(n +1)=α(n)∆(n) (12.20)<br />

where the scale factor α(n) depends on the previous quantizer output.<br />

For example, if the previous quantizer output is small, we may select<br />

α(n) < 1inorder to provide for finer quantization. On the other hand,<br />

if the quantizer output is large, then the step size should be increased<br />

to reduce the possibility of signal clipping. Such an algorithm has been<br />

successfully used in the encoding of speech signals. Figure 12.5 illustrates<br />

such a (3-bit) quantizer in which the step size is adjusted recursively<br />

according to the relation<br />

∆(n +1)=∆(n) · M(n)<br />

where M(n) isamultiplication factor whose value depends on the quantizer<br />

level for the sample s(n), and ∆(n)isthe step size of the quantizer for<br />

processing s(n). Values of the multiplication factors optimized for speech<br />

encoding have been given by [14]. These values are displayed in Table 12.1<br />

for 2-, 3-, and 4-bit quantization for PCM and DPCM.<br />

In DPCM the predictor can also be made adaptive. Thus in ADPCM<br />

the coefficients of the predictor are changed periodically to reflect the<br />

changing signal statistics of the speech. The linear equations given by<br />

(12.11) still apply, but the short-term autocorrelation function of s(n),<br />

r ss (m) changes with time.<br />

Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).<br />

Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!