TY - JOUR
T1 - Rate-Distortion Performance of DPCM Schemes for Autoregressive Sources
AU - Farvardin, Nariman
PY - 1985/5
Y1 - 1985/5
N2 - An An analysis of the rate-distortion performance of differential pulse code modulation (DPCM) schemes operating on discrete-time autoregressive processes is presented. The approach uses an iterative algorithm for the design of the predictive quantizer subject to an entropy constraint on the output sequence. At each stage the iterative algorithm optimizes the quantizer structure, given the probability distribution of the prediction error, while simultaneously updating the distribution of the resulting prediction error. Different orthogonal expansions specifically matched to the source are used to express the prediction error density. A complete description of the algorithm, including convergence and uniqueness properties, is given. Results are presented for rate-distortion performance of the optimum DPCM scheme for first-order Gauss—Markov and Laplace—Markov sources, including comparisons with the corresponding rate-distortion bounds. Furthermore, asymptotic formulas indicating the high-rate performance of these schemes are developed for both first-order Gaussian and Laplacian autoregressive sources.
AB - An An analysis of the rate-distortion performance of differential pulse code modulation (DPCM) schemes operating on discrete-time autoregressive processes is presented. The approach uses an iterative algorithm for the design of the predictive quantizer subject to an entropy constraint on the output sequence. At each stage the iterative algorithm optimizes the quantizer structure, given the probability distribution of the prediction error, while simultaneously updating the distribution of the resulting prediction error. Different orthogonal expansions specifically matched to the source are used to express the prediction error density. A complete description of the algorithm, including convergence and uniqueness properties, is given. Results are presented for rate-distortion performance of the optimum DPCM scheme for first-order Gauss—Markov and Laplace—Markov sources, including comparisons with the corresponding rate-distortion bounds. Furthermore, asymptotic formulas indicating the high-rate performance of these schemes are developed for both first-order Gaussian and Laplacian autoregressive sources.
UR - http://www.scopus.com/inward/record.url?scp=0022056484&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0022056484&partnerID=8YFLogxK
U2 - 10.1109/TIT.1985.1057040
DO - 10.1109/TIT.1985.1057040
M3 - Article
AN - SCOPUS:0022056484
SN - 0018-9448
VL - 31
SP - 402
EP - 418
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 3
ER -