Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Linear (zero-one) programming approach to fixed-rate entropy-coded vector quantisation

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 $31
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

1 Author(s)
Khandani, A.K. ; Dept. of Electron. & Comput. Eng., Waterloo Univ., Ont., Canada

The problem of the decoding of a shaped set is formulated in terms of a zero-one linear program. Some special features of the problem are exploited to relax the zero-one constraint, and to substantially reduce the complexity of the underlying simplex search. The proposed decoding method has applications in fixed-rate entropy-coded vector quantisation of a memoryless source, in decoding of a shaped constellation, and in the bit allocation problem. The first application is considered and numerical results are presented for the quantisation of a memoryless Gaussian source demonstrating substantial (of the order of a few tens to a few hundred times) reduction in the complexity with respect to the conventional methods based on dynamic programming. It is generally observed that the complexity of the proposed method has a linear increase with respect to the quantiser dimension. The corresponding numerical results show that it is possible to get very close to the bounds determined by the rate-distortion theory, while keeping the complexity at a relatively low level

Published in:

Communications, IEE Proceedings-  (Volume:146 ,  Issue: 5 )