Handle URI:
http://hdl.handle.net/10754/623501
Title:
(Almost) practical tree codes
Authors:
Khina, Anatoly; Halbawi, Wael; Hassibi, Babak
Abstract:
We consider the problem of stabilizing an unstable plant driven by bounded noise over a digital noisy communication link, a scenario at the heart of networked control. To stabilize such a plant, one needs real-time encoding and decoding with an error probability profile that decays exponentially with the decoding delay. The works of Schulman and Sahai over the past two decades have developed the notions of tree codes and anytime capacity, and provided the theoretical framework for studying such problems. Nonetheless, there has been little practical progress in this area due to the absence of explicit constructions of tree codes with efficient encoding and decoding algorithms. Recently, linear time-invariant tree codes were proposed to achieve the desired result under maximum-likelihood decoding. In this work, we take one more step towards practicality, by showing that these codes can be efficiently decoded using sequential decoding algorithms, up to some loss in performance (and with some practical complexity caveats). We supplement our theoretical results with numerical simulations that demonstrate the effectiveness of the decoder in a control system setting.
Citation:
Khina A, Halbawi W, Hassibi B (2016) (Almost) practical tree codes. 2016 IEEE International Symposium on Information Theory (ISIT). Available: http://dx.doi.org/10.1109/isit.2016.7541730.
Publisher:
Institute of Electrical and Electronics Engineers (IEEE)
Journal:
2016 IEEE International Symposium on Information Theory (ISIT)
Conference/Event name:
2016 IEEE International Symposium on Information Theory, ISIT 2016
Issue Date:
15-Aug-2016
DOI:
10.1109/isit.2016.7541730
Type:
Conference Paper
Sponsors:
This work was supported in part by the National Science Foundation under grants CNS-0932428, CCF-1018927, CCF-1423663 and CCF-1409204, by a grant from Qualcomm Inc., by NASA’s Jet Propulsion Laboratory through the President and Directors Fund, and by King Abdullah University of Science and Technology.
Appears in Collections:
Publications Acknowledging KAUST Support

Full metadata record

DC FieldValue Language
dc.contributor.authorKhina, Anatolyen
dc.contributor.authorHalbawi, Waelen
dc.contributor.authorHassibi, Babaken
dc.date.accessioned2017-05-15T10:35:04Z-
dc.date.available2017-05-15T10:35:04Z-
dc.date.issued2016-08-15en
dc.identifier.citationKhina A, Halbawi W, Hassibi B (2016) (Almost) practical tree codes. 2016 IEEE International Symposium on Information Theory (ISIT). Available: http://dx.doi.org/10.1109/isit.2016.7541730.en
dc.identifier.doi10.1109/isit.2016.7541730en
dc.identifier.urihttp://hdl.handle.net/10754/623501-
dc.description.abstractWe consider the problem of stabilizing an unstable plant driven by bounded noise over a digital noisy communication link, a scenario at the heart of networked control. To stabilize such a plant, one needs real-time encoding and decoding with an error probability profile that decays exponentially with the decoding delay. The works of Schulman and Sahai over the past two decades have developed the notions of tree codes and anytime capacity, and provided the theoretical framework for studying such problems. Nonetheless, there has been little practical progress in this area due to the absence of explicit constructions of tree codes with efficient encoding and decoding algorithms. Recently, linear time-invariant tree codes were proposed to achieve the desired result under maximum-likelihood decoding. In this work, we take one more step towards practicality, by showing that these codes can be efficiently decoded using sequential decoding algorithms, up to some loss in performance (and with some practical complexity caveats). We supplement our theoretical results with numerical simulations that demonstrate the effectiveness of the decoder in a control system setting.en
dc.description.sponsorshipThis work was supported in part by the National Science Foundation under grants CNS-0932428, CCF-1018927, CCF-1423663 and CCF-1409204, by a grant from Qualcomm Inc., by NASA’s Jet Propulsion Laboratory through the President and Directors Fund, and by King Abdullah University of Science and Technology.en
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en
dc.title(Almost) practical tree codesen
dc.typeConference Paperen
dc.identifier.journal2016 IEEE International Symposium on Information Theory (ISIT)en
dc.conference.date2016-07-10 to 2016-07-15en
dc.conference.name2016 IEEE International Symposium on Information Theory, ISIT 2016en
dc.conference.locationBarcelona, ESPen
dc.contributor.institutionDept. of Electrical Engineering, Caltech, Pasadena, CA 91125, USAen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.