Cart (Loading....) | Create Account
Close category search window
 

Complexity-constrained trellis quantizers

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)
Larsen, M.F. ; Dept. of Electr. & Comput. Eng., Brigham Young Univ., Provo, UT, USA ; Frost, R.L.

A reasonable measure of quantizer complexity is the expected number of quanta per input sample for which distortion is computed. Given this measure, a rate-distortion-complexity theory is obtained by extending earlier work in alphabet-constrained rate-distortion theory. Numerical results show that operation on the alphabet-constrained rate-distortion bound can be obtained with a complexity of two. Furthermore, Lloyd-Max conditions are shown to describe the minimum of a slightly constrained version of the rate-distortion-complexity problem. Complexity-constrained design methods are applied first to trellis-coded quantizers, where they are shown to reduce arithmetic operations by at least 25%. They are then used to develop model-based trellis quantizers, the trellises of which are derived from a Markov model of the source. Simulation results confirm that excellent performance can be obtained with modest complexity

Published in:

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

Date of Publication:

Jul 1997

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.