arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2311.02797cs.ITmath.IT
收藏

N比特延迟近似即时定长到变长码的最优构造

Optimal Construction of N-bit-delay Almost Instantaneous Fixed-to-Variable-Length Codes

Ryosuke Sugiura, Masaaki Nishino, Norihito Yasuda, Yutaka Kamamoto, Takehiro Moriya

AI总结:

本文研究允许有限解码延迟的二进制无损编码,提出N比特延迟AIFV码的最优构造算法,理论分析最优性条件,并在N≥3时取得优于传统AIFV-m码、扩展霍夫曼码及32位区间码的压缩性能。

摘要:

本文提出了N比特延迟近似即时定长到变长(AIFV)码的最优构造方法,这是当允许有限比特解码延迟时可以构造的二进制码的一般形式。与传统的定长到变长(FV)码和AIFV码相比,所提出的方法使我们能够在更广泛的码类中优化无损编码。本文首先讨论了编码构造问题,其中包含一些关键的子问题,并定义了三类最优性,以阐明我们能在多大程度上解决这些问题。从理论上分析了最优码的性质,给出了达到最优的充分条件。然后,我们提出了一种针对给定平稳无记忆信源构造N比特延迟AIFV码的算法。从理论和实验两方面讨论了所构造码的最优性。当N≥3时,它们显示出比传统AIFV-m码和扩展霍夫曼码更短的期望码长。此外,在随机数仿真中,它们在合理条件下表现出比32位精度区间码更高的压缩效率。

英文摘要:

This paper presents an optimal construction of $N$-bit-delay almost instantaneous fixed-to-variable-length (AIFV) codes, the general form of binary codes we can make when finite bits of decoding delay are allowed. The presented method enables us to optimize lossless codes among a broader class of codes compared to the conventional FV and AIFV codes. The paper first discusses the problem of code construction, which contains some essential partial problems, and defines three classes of optimality to clarify how far we can solve the problems. The properties of the optimal codes are analyzed theoretically, showing the sufficient conditions for achieving the optimum. Then, we propose an algorithm for constructing $N$-bit-delay AIFV codes for given stationary memory-less sources. The optimality of the constructed codes is discussed both theoretically and empirically. They showed shorter expected code lengths when $N\ge 3$ than the conventional AIFV-$m$ and extended Huffman codes. Moreover, in the random numbers simulation, they performed higher compression efficiency than the 32-bit-precision range codes under reasonable conditions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑