Modulo-Based Coding for Distributed Sources

本项目提案涉及用于分布式信源编码的方法。最近，整数强制信源编码的理论概念被提出，这是一种基于模数的信源编码。然而，到目前为止，它只被视为一个信息论概念，并对其渐近行为进行了分析。在文献中，对于与实践相关的低维情况，很少有关于该方法的有效性、相应的实现方面以及与已建立的信源编码策略相比的优点和缺点的结果。因此，应从工程角度对该方法进行分析和评估。在此基础上，设计了具体的基于模编码的有损数据压缩方案。为此，将利用信源编码和信道编码/均衡之间的对偶性。基于格子的均衡领域中已知的各种概念和方法可以有益地转移到手头的情况。

The present project proposal addresses methods for distributed source coding. Recently, the theoretical concept of integer-forcing source coding, a modulo-based source coding, has been presented. However, up to now, it has been treated only as an information-theoretic concept and its asymptotic behavior has been analyzed. In the literature, there are very few results concerning the effectiveness of the method, corresponding implementation aspects, as well as advantages and disadvantages in comparison to established source coding strategies for the practice-relevant, low-dimensional case. Hence, the approach shall be analyzed and evaluated from an engineering perspective. On this basis, specific modulo-based coding schemes for lossy data compression will be designed. For this purpose, the duality between source coding and channel coding/equalization will be exploited. The diverse concepts and methods known in the field of lattice-based equalization can be beneficially transferred to the to the situation at hand.