https://scholars.lib.ntu.edu.tw/handle/123456789/558999
標題: | Error Rate Analysis for Random Linear Streaming Codes in the Finite Memory Length Regime | 作者: | Su, P.-W. Huang, Y.-C. SHIH-CHUN LIN Wang, C.-C. I-HSIANG WANG |
公開日期: | 2020 | 卷: | 2020-June | 起(迄)頁: | 491-496 | 來源出版物: | IEEE International Symposium on Information Theory - Proceedings | 摘要: | Streaming codes encode a string of source packets and output a string of coded packets in real time, which eliminate the queueing delay of block coding and are thus especially suitable for delay-sensitive applications. This work studies random linear streaming codes (RLSCs) and i.i.d. packet erasure channels. While existing works focused on the asymptotic error-exponent analyses, this work characterizes the error rate in the finite memory length regime and the contributions include: (i) A new information-debt-based description of the error event; (ii) A matrix-based characterization of the error rate; (iii) A closed-form approximation of the error rate that is provably tight for large memory lengths; and (iv) A new Markov-chainbased analysis framework, which can be of independent research interest. Numerical results show that the approximation, i.e. (iii), closely matches the exact error rate even for small memory length (≈ 20). The results can be viewed as a sequential- coding counterpart of the finite length analysis of block coding [Polyanskiy et al. 10] under the specialized setting of RLSCs. © 2020 IEEE. |
URI: | https://www.scopus.com/inward/record.url?eid=2-s2.0-85090404240&partnerID=40&md5=ef1585779dac927d5ead5b79caa03eb2 https://scholars.lib.ntu.edu.tw/handle/123456789/558999 |
DOI: | 10.1109/ISIT44484.2020.9174038 | SDG/關鍵字: | Codes (symbols); Network coding; Analysis frameworks; Asymptotic error exponents; Closed form approximations; Delay-sensitive applications; Error rate analysis; Finite length analysis; Independent research; Packet erasure channels; Errors |
顯示於: | 電機工程學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。