Error-correcting codes for automatic control

Rafail Ostrovsky; Yuval Rabani; Leonard J. Schulman

doi:10.1109/TIT.2009.2021303

Error-correcting codes for automatic control

Rafail Ostrovsky^*, Yuval Rabani, Leonard J. Schulman

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

34 Scopus citations

Abstract

Systems with automatic feedback control may consist of several remote devices, connected only by unreliable communication channels. It is necessary in these conditions to have a method for accurate, real-time state estimation in the presence of channel noise. This problem is addressed, for the case of polynomial-growth-rate state spaces, through a new type of error-correcting code that is online and computationally efficient. This solution establishes a constructive analog, for some applications in estimation and control, of the Shannon coding theorem.

Original language	English
Pages (from-to)	2931-2941
Number of pages	11
Journal	IEEE Transactions on Information Theory
Volume	55
Issue number	7
DOIs	https://doi.org/10.1109/TIT.2009.2021303
State	Published - 2009
Externally published	Yes

Bibliographical note

Funding Information:
Manuscript received August 30, 2006; revised June 16, 2008. Current version published June 24, 2009. The work of R. Ostrovsky was supported in part by the Institute for Pure and Applied Mathematics (IPAM); in part by a gift from Teradata, Intel equipment Grant, IBM Faculty Award, Xerox Innovation Group Award, National Science Foundation under Grants 0430254, 0716835, 0716389, 0830803, a U.C. MICRO Grant, and Okawa Foundation. The work of Y. Ra-bani was supported by the Israel Science Foundation under Grant 52/03 and by United States–Israel Binational Science Foundation under Grant 2002282. This work was also supported in part while Y. Rabani was visiting the Institute for Pure and Applied Mathematics in the University of California at Los Angeles. The work of L. J. Schulman was supported by the National Science Foundatio (NSF) under Grants CCF-0515342, NSA H98230-06-1-0074, NSF under Grant ITR CCR-0326554, and the Okawa Foundation. The material in this paper was presented in part at the 46th Annual Symposium on Foundations of Computer Science (FOCS), Pittsburgh, PA, October 2005.

Keywords

Control theory
Lovász local lemma
State estimation
Tree codes

Access to Document

10.1109/TIT.2009.2021303

Cite this

@article{f427449bd3c5455cbd9c5abe0eb0f355,

title = "Error-correcting codes for automatic control",

abstract = "Systems with automatic feedback control may consist of several remote devices, connected only by unreliable communication channels. It is necessary in these conditions to have a method for accurate, real-time state estimation in the presence of channel noise. This problem is addressed, for the case of polynomial-growth-rate state spaces, through a new type of error-correcting code that is online and computationally efficient. This solution establishes a constructive analog, for some applications in estimation and control, of the Shannon coding theorem.",

keywords = "Control theory, Lov{\'a}sz local lemma, State estimation, Tree codes",

author = "Rafail Ostrovsky and Yuval Rabani and Schulman, {Leonard J.}",

note = "Funding Information: Manuscript received August 30, 2006; revised June 16, 2008. Current version published June 24, 2009. The work of R. Ostrovsky was supported in part by the Institute for Pure and Applied Mathematics (IPAM); in part by a gift from Teradata, Intel equipment Grant, IBM Faculty Award, Xerox Innovation Group Award, National Science Foundation under Grants 0430254, 0716835, 0716389, 0830803, a U.C. MICRO Grant, and Okawa Foundation. The work of Y. Ra-bani was supported by the Israel Science Foundation under Grant 52/03 and by United States–Israel Binational Science Foundation under Grant 2002282. This work was also supported in part while Y. Rabani was visiting the Institute for Pure and Applied Mathematics in the University of California at Los Angeles. The work of L. J. Schulman was supported by the National Science Foundatio (NSF) under Grants CCF-0515342, NSA H98230-06-1-0074, NSF under Grant ITR CCR-0326554, and the Okawa Foundation. The material in this paper was presented in part at the 46th Annual Symposium on Foundations of Computer Science (FOCS), Pittsburgh, PA, October 2005.",

year = "2009",

doi = "10.1109/TIT.2009.2021303",

language = "אנגלית",

volume = "55",

pages = "2931--2941",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "7",

}

TY - JOUR

T1 - Error-correcting codes for automatic control

AU - Ostrovsky, Rafail

AU - Rabani, Yuval

AU - Schulman, Leonard J.

N1 - Funding Information: Manuscript received August 30, 2006; revised June 16, 2008. Current version published June 24, 2009. The work of R. Ostrovsky was supported in part by the Institute for Pure and Applied Mathematics (IPAM); in part by a gift from Teradata, Intel equipment Grant, IBM Faculty Award, Xerox Innovation Group Award, National Science Foundation under Grants 0430254, 0716835, 0716389, 0830803, a U.C. MICRO Grant, and Okawa Foundation. The work of Y. Ra-bani was supported by the Israel Science Foundation under Grant 52/03 and by United States–Israel Binational Science Foundation under Grant 2002282. This work was also supported in part while Y. Rabani was visiting the Institute for Pure and Applied Mathematics in the University of California at Los Angeles. The work of L. J. Schulman was supported by the National Science Foundatio (NSF) under Grants CCF-0515342, NSA H98230-06-1-0074, NSF under Grant ITR CCR-0326554, and the Okawa Foundation. The material in this paper was presented in part at the 46th Annual Symposium on Foundations of Computer Science (FOCS), Pittsburgh, PA, October 2005.

PY - 2009

Y1 - 2009

N2 - Systems with automatic feedback control may consist of several remote devices, connected only by unreliable communication channels. It is necessary in these conditions to have a method for accurate, real-time state estimation in the presence of channel noise. This problem is addressed, for the case of polynomial-growth-rate state spaces, through a new type of error-correcting code that is online and computationally efficient. This solution establishes a constructive analog, for some applications in estimation and control, of the Shannon coding theorem.

AB - Systems with automatic feedback control may consist of several remote devices, connected only by unreliable communication channels. It is necessary in these conditions to have a method for accurate, real-time state estimation in the presence of channel noise. This problem is addressed, for the case of polynomial-growth-rate state spaces, through a new type of error-correcting code that is online and computationally efficient. This solution establishes a constructive analog, for some applications in estimation and control, of the Shannon coding theorem.

KW - Control theory

KW - Lovász local lemma

KW - State estimation

KW - Tree codes

UR - http://www.scopus.com/inward/record.url?scp=67650142489&partnerID=8YFLogxK

U2 - 10.1109/TIT.2009.2021303

DO - 10.1109/TIT.2009.2021303

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:67650142489

SN - 0018-9448

VL - 55

SP - 2931

EP - 2941

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 7

ER -

Error-correcting codes for automatic control

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this