Truncated tree codes for streaming data: Infinite-memory reliability using finite memory
Truncated tree codes for streaming data: Infinite-memory reliability using finite memory
复制标题
用于流数据的截断树代码：使用有限内存的无限内存可靠性
DOI：
10.1109/iswcs.2011.6125325
复制
发表时间：
2011
期刊：
影响因子：
--
通讯作者：
A. Khisti
中科院分区：
文献类型：
--
作者：
S. Draper;A. Khisti
我们提出了一个有限内存的流数据系统的代码结构。在我们的模型中，一系列独立和相同分布的消息到达发送器根据一个确定性的到达过程。每个消息必须在固定延迟之后由解码器估计。以前的工作，这个模型依赖于使用半无限树码与不断增长的编码器和解码器的内存。我们表明，在这些结构中，这是基于错误指数分析，也可以通过有限的内存建设获得相同的可靠性。在我们的构造中，编码器和解码器都具有有限的内存，尽管代码（和解码过程）的瞬时约束长度是以周期性方式随时间变化的。越接近于想要操作的容量，我们的构造需要的内存就越大，以匹配无限内存的结果。对于给定的速率和延迟，可以直接求解获得与早期策略相同的可靠性所需的内存。
We present a finite-memory code construction for streaming data systems. In our model a sequence of independent and identically distributed messages arrives at the transmitter according to a deterministic arrival process. Each message must be estimated by the decoder after a fixed delay. Prior work on this model relied on the use of semi-infinite tree-codes with growing encoder and decoder memory. We show that the same reliability that was attained in those constructions, which was based on an error-exponent analysis, can also be obtained by a finite-memory construction. In our construction both encoder and decoder have finite memory, although the instantaneous constraint length of the code (and of the decoding process) is time-varying in a periodic manner. The closer to capacity one wants to operate, the greater the memory our construction requires to match the infinite-memory results. For a given rate and delay it is straightforward to solve for the memory required to attain the same reliability as the earlier strategies.