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.

Differential PCM (DPCM) 613<br />

digits and transmitted over the channel to the receiver. The quantized<br />

error ẽ(n) isalso added to the predicted value ̂˜s(n) toyield ˜s(n).<br />

At the receiver the same predictor that was used at the transmitting<br />

end is synthesized, and its output ̂˜s(n) isadded to ẽ(n) toyield ˜s(n). The<br />

signal ˜s(n) isthe desired excitation for the predictor and also the desired<br />

output sequence from which the reconstructed signal ˜s (t) isobtained by<br />

filtering, as shown in Figure 12.3b.<br />

The use of feedback around the quantizer, as described, ensures that<br />

the error in ˜s(n) issimply the quantization error q(n) = ẽ(n) − e(n)<br />

and that there is no accumulation of previous quantization errors in the<br />

implementation of the decoder. That is,<br />

q(n) =ẽ(n) − e(n) =ẽ(n) − s(n)+̂˜s(n) =˜s(n) − s(n) (12.15)<br />

Hence ˜s(n) =s(n) +q(n). This means that the quantized sample ˜s(n)<br />

differs from the input s(n) by the quantization error q(n) independent<br />

of the predictor used. Therefore the quantization errors do not<br />

accumulate.<br />

In the DPCM system illustrated in Figure 12.3, the estimate or predicted<br />

value ˜s(n) ofthe signal sample s(n) isobtained by taking a linear<br />

combination of past values ˜s (n − k) , k =1, 2,...,p,asindicated by<br />

(12.13). An improvement in the quality of the estimate is obtained by<br />

including linearly filtered past values of the quantized error. Specifically,<br />

the estimate of s(n) may be expressed as<br />

p∑<br />

m∑<br />

̂˜s(n) = a (i)˜s (n − i)+ b (i)ẽ (n − i) (12.16)<br />

i=1<br />

where b (i) are the coefficients of the filter for the quantized error sequence<br />

ẽ(n). The block diagram of the encoder at the transmitter and the decoder<br />

at the receiver are shown in Figure 12.4. The two sets of coefficients<br />

a (i) and b (i) are selected to minimize some function of the error e(n) =<br />

˜s(n) − s(n), such as the sum of squared errors.<br />

By using a logarithmic compressor and a 4-bit quantizer for the error<br />

sequence e(n), DPCM results in high-quality speech at a rate of 32,000<br />

bps, which is a factor of two lower than logarithmic PCM.<br />

i=1<br />

12.2.1 PROJECT 12.2: DPCM<br />

The objective of this project is to gain understanding of the DPCM encoding<br />

and decoding operations. For simulation purposes, generate correlated<br />

random sequences using a pole-zero signal model of the form<br />

s(n) =a (1) s (n − 1) + b 0 x(n)+b 1 x (n − 1) (12.17)<br />

where x(n) isazero-mean unit variance Gaussian sequence. This can be<br />

done using the filter function. The sequences developed in Project 12.1<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!