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

分布式控制中的纠错码

Error Correcting Codes for Distributed Control

Ravi Teja Sukhavasi, Babak Hassibi

摘要:

在网络控制系统的应用中,如何在有噪声的通信链路上稳定不稳定对象是一个越来越重要的问题。虽然Schulman和Sahai在过去二十年的工作,以及他们对"树码" \phantom{}和"随时容量"概念的发展,为研究这些问题提供了理论框架,但由于不存在具有有效编码和解码的树码的显式构造,因此在这一领域很少有实际进展。为了稳定由有界噪声驱动的不稳定设备,需要实时编码和实时解码以及随着解码延迟呈指数增长的可靠性,这就是树码所保证的。我们证明了线性树码发生的概率很高,擦除信道,给出了一个明确的建设与预期的解码复杂度是恒定的每一个时刻。我们给出了新的充分条件的速度和可靠性所需的树代码稳定向量植物,并认为他们是渐近紧。这项工作采取了重要的一步,控制植物在嘈杂的渠道,我们通过几个例子证明了该方法的有效性。

英文摘要:

The problem of stabilizing an unstable plant over a noisy communication link is an increasingly important one that arises in applications of networked control systems. Although the work of Schulman and Sahai over the past two decades, and their development of the notions of "tree codes"\phantom{} and "anytime capacity", provides the theoretical framework for studying such problems, there has been scant practical progress in this area because explicit constructions of tree codes with efficient encoding and decoding did not exist. To stabilize an unstable plant driven by bounded noise over a noisy channel one needs real-time encoding and real-time decoding and a reliability which increases exponentially with decoding delay, which is what tree codes guarantee. We prove that linear tree codes occur with high probability and, for erasure channels, give an explicit construction with an expected decoding complexity that is constant per time instant. We give novel sufficient conditions on the rate and reliability required of the tree codes to stabilize vector plants and argue that they are asymptotically tight. This work takes an important step towards controlling plants over noisy channels, and we demonstrate the efficacy of the method through several examples.

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

↑