期刊
2023 DATA COMPRESSION CONFERENCE, DCC
卷 -, 期 -, 页码 358-358出版社
IEEE COMPUTER SOC
DOI: 10.1109/DCC55655.2023.00083
关键词
-
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据