02.10.2019 Views

UploadFile_6417

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Differential PCM (DPCM) 611<br />

the signal-to-quantization noise ratio (SQNR) in dB as<br />

( ∑ )<br />

N<br />

n=1<br />

SQNR = 10 log s2 (n)<br />

10 ∑ N<br />

n=1 (s(n) − s q(n)) 2 .<br />

For different b-bit quantizers, systematically determine the value of µ<br />

that maximizes the SQNR. Also plot the input and output waveforms<br />

and comment on the results.<br />

12.2 DIFFERENTIAL PCM (DPCM)<br />

In PCM each sample of the waveform is encoded independently of all the<br />

other samples. However, most signals, including speech, sampled at the<br />

Nyquist rate or faster exhibit significant correlation between successive<br />

samples. In other words, the average change in amplitude between successive<br />

samples is relatively small. Consequently, an encoding scheme that<br />

exploits the redundancy in the samples will result in a lower bit rate for<br />

the speech signal.<br />

A relatively simple solution is to encode the differences between successive<br />

samples rather than the samples themselves. Since differences between<br />

samples are expected to be smaller than the actual sampled amplitudes,<br />

fewer bits are required to represent the differences. A refinement<br />

of this general approach is to predict the current sample based on the<br />

previous p samples. To be specific, let s(n) denote the current sample of<br />

speech and let ŝ(n) denote the predicted value of s(n), defined as<br />

ŝ(n) =<br />

p∑<br />

a (i) s (n − i) (12.8)<br />

i=1<br />

Thus ŝ(n) isaweighted linear combination of the past p samples, and<br />

the a (i) are the predictor (filter) coefficients. The a (i) are selected to<br />

minimize some function of the error between s(n) and ŝ(n).<br />

A mathematically and practically convenient error function is the sum<br />

of squared errors. With this as the performance index for the predictor,<br />

we select the a (i) tominimize<br />

[<br />

△ N 2<br />

∑ N∑<br />

p∑<br />

E p = e 2 (n)= s(n) − a (i) s (n − i)]<br />

(12.9)<br />

n=1<br />

n=1<br />

=r ss (0) − 2<br />

i=1<br />

p∑<br />

a (i) r ss (i)+<br />

i=1<br />

p∑<br />

i=1 j=1<br />

p∑<br />

a (i) a (j) r ss (i − j)<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!