CaltechAUTHORS
  A Caltech Library Service

(Almost) practical tree codes

Khina, Anatoly and Halbawi, Wael and Hassibi, Babak (2016) (Almost) practical tree codes. In: 2016 IEEE International Symposium on Information Theory (ISIT). IEEE , Piscataway, NJ, pp. 2404-2408. ISBN 978-1-5090-1807-9. http://resolver.caltech.edu/CaltechAUTHORS:20160824-092753974

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:20160824-092753974

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.


Item Type:Book Section
Related URLs:
URLURL TypeDescription
http://dx.doi.org/10.1109/ISIT.2016.7541730 DOIArticle
http://ieeexplore.ieee.org/document/7541730/?arnumber=7541730PublisherArticle
ORCID:
AuthorORCID
Khina, Anatoly0000-0003-2359-1678
Additional Information:© 2016 IEEE. We thank R. T. Sukhavasi for many helpful discussions. 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.
Funders:
Funding AgencyGrant Number
NSFCNS-0932428
NSFCCF-1018927
NSFCCF-1423663
NSFCCF-1409204
Qualcomm Inc.UNSPECIFIED
JPL Director's Discretionary FundUNSPECIFIED
Caltech President’s FundUNSPECIFIED
King Abdullah University of Science and Technology (KAUST)UNSPECIFIED
Record Number:CaltechAUTHORS:20160824-092753974
Persistent URL:http://resolver.caltech.edu/CaltechAUTHORS:20160824-092753974
Official Citation:A. Khina, W. Halbawi and B. Hassibi, "(Almost) practical tree codes," 2016 IEEE International Symposium on Information Theory (ISIT), Barcelona, Spain, 2016, pp. 2404-2408. doi: 10.1109/ISIT.2016.7541730 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7541730&isnumber=7541040
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:69888
Collection:CaltechAUTHORS
Deposited By: Tony Diaz
Deposited On:24 Aug 2016 22:20
Last Modified:03 May 2018 20:27

Repository Staff Only: item control page