By Topic

Deterministic and stochastic stability of adaptive differential pulse code modulation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

The problem of stability of an adaptive differential pulse code modulation (ADPCM) system is considered from two viewpoints. First, it is demonstrated that the step-size adaptation algorithm of a certain class of ADPCM's can be characterized by the system's response to step: function inputs. The degree of "hunting" or "oscillation" provides an indication of the deterministic stability of the algorithm, and algorithms are presented that minimize these effects. Secondly, stationary random processes with rational spectral densities are used to study stochastic stability of ADPCM. It is shown that for certain ADPCM's the time-averaged mean-absolute quantizing noise is bounded, that the joint distribution of the input and decoded output processes possesses a stationary distribution, that this joint distribution converges to the stationary distribution from an arbitrary starting point, and that the mean-absolute quantizing noise is finite under the stationary distribution.

Published in:

Information Theory, IEEE Transactions on  (Volume:23 ,  Issue: 4 )