Multiple Description Vector Quantization with Lattice Codebooks: Design and Analysis

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

46 pages, 14 figures

Scientific paper

The problem of designing a multiple description vector quantizer with lattice codebook Lambda is considered. A general solution is given to a labeling problem which plays a crucial role in the design of such quantizers. Numerical performance results are obtained for quantizers based on the lattices A_2 and Z^i, i=1,2,4,8, that make use of this labeling algorithm. The high-rate squared-error distortions for this family of L-dimensional vector quantizers are then analyzed for a memoryless source with probability density function p and differential entropy h(p) < infty. For any a in (0,1) and rate pair (R,R), it is shown that the two-channel distortion d_0 and the channel 1 (or channel 2) distortions d_s satisfy lim_{R -> infty} d_0 2^(2R(1+a)) = (1/4) G(Lambda) 2^{2h(p)} and lim_{R -> infty} d_s 2^(2R(1-a)) = G(S_L) 2^2h(p), where G(Lambda) is the normalized second moment of a Voronoi cell of the lattice Lambda and G(S_L) is the normalized second moment of a sphere in L dimensions.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Multiple Description Vector Quantization with Lattice Codebooks: Design and Analysis does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Multiple Description Vector Quantization with Lattice Codebooks: Design and Analysis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multiple Description Vector Quantization with Lattice Codebooks: Design and Analysis will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-476753

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.