By Topic

On optimal transforms and quantization schemes in gaussian distributed source coding

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)
Bursalioglu, O. ; California Univ., Riverside, CA ; Tuncel, E.

Two different aspects of distributed source coding is discussed. First, a previously developed distributed uniform scalar quantization method is improved by adopting non-uniform quantization. It is observed that compared to uniform quantization, the non-uniform scheme further approaches to the distortion-rate bound by 0.5 bit. Turning then to sources with memory, the tradeoff between exploitation of time and space correlation is exposed. It is shown by example that optimal transforms deviate from their traditional counterparts. Specifically, optimal transforms in the distributed framework do not necessarily fully decorrelate each sequence in time

Published in:

Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on

Date of Conference:

4-9 Sept. 2005