3.8 Proceedings Paper

Block Codes with Embedded Quantization Step Size Information

Journal

2023 DATA COMPRESSION CONFERENCE, DCC
Volume -, Issue -, Pages 358-358

Publisher

IEEE COMPUTER SOC
DOI: 10.1109/DCC55655.2023.00083

Keywords

-

Ask authors/readers for more resources

This paper investigates the quantization of a block of n samples by transmitting quantization step size information in the same bitstream. It is proven that such codes can be as efficient as block codes without embedded step-size information, which contradicts our initial expectation. The proof relies on results from the Diophantine approximations theory.
If we quantize a block of n samples and then transmit information about quantization step size in the same bitstream, we may naturally expect such a code to be at least O(1/n) redundant. However, as we will show in this paper, this may not necessarily be true. Moreover, we prove that asymptotically, such codes can be as efficient as block codes without embedded step-size information. The proof relies on results from the Diophantine approximations theory. We discuss the significance of this finding for practical applications, such as the design of audio and video coding algorithms.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

3.8
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available