基于奇偶校验和伴随式的二进制数据压缩的统一观点
A Unified Perspective on Parity- and Syndrome-Based Binary Data Compression Using Off-the-Shelf Turbo Codecs
摘要:
我们考虑的问题,压缩无记忆的二进制数据或没有边信息在解码器。我们回顾奇偶校验和综合征为基础的方法,并讨论其理论上的限制,假设存在一个虚拟的二进制对称通道之间的源和边信息,并且源不一定是均匀分布的。我们采取一个因子图为基础的方法,以设计如何充分利用现成的迭代解码程序时,采用涡轮码,在奇偶校验或综合征为基础的方式。我们最终获得了一个统一的解码器配方,同时适用于无差错和易出错的编码器到解码器的通用通道传输。为了支持理论结果,本文中分析的不同压缩系统也进行了实验测试。他们对文献中提出的几种不同的方法进行了比较,并在各种情况下具有竞争力。
英文摘要:
We consider the problem of compressing memoryless binary data with or without side information at the decoder. We review the parity- and the syndrome-based approaches and discuss their theoretical limits, assuming that there exists a virtual binary symmetric channel between the source and the side information, and that the source is not necessarily uniformly distributed. We take a factor-graph-based approach in order to devise how to take full advantage of the ready-available iterative decoding procedures when turbo codes are employed, in both a parity- or a syndrome-based fashion. We end up obtaining a unified decoder formulation that holds both for error-free and for error-prone encoder-to-decoder transmission over generic channels. To support the theoretical results, the different compression systems analyzed in the paper are also experimentally tested. They are compared against several different approaches proposed in literature and shown to be competitive in a variety of cases.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。