Random Linear Streaming Codes in the Finite Memory Length and Decoding Deadline Regime—Part I: Exact Analysis

Pin-Wen Su; Yu-Chih Huang; Shih-Chun LinI-Hsiang WangChih-Chun Wang

首页> 外文期刊>IEEE Transactions on Information Theory >Random Linear Streaming Codes in the Finite Memory Length and Decoding Deadline Regime—Part I: Exact Analysis

【24h】

Random Linear Streaming Codes in the Finite Memory Length and Decoding Deadline Regime—Part I: Exact Analysis

机译：Random Linear Streaming Codes in the Finite Memory Length and Decoding Deadline Regime—Part I: Exact Analysis

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相关主题

摘要

Streaming codes take a string of source symbols as input and output a string of coded symbols in real time, which eliminate the queueing delay of traditional block codes and are thus especially appealing for delay sensitive applications. Existing works on streaming code performance either focused on the asymptotic error-exponent analyses, or on the optimal code construction under deterministic adversarial channel models . In contrast, this work analyzes the exact error probability of random linear streaming codes (RLSCs) in the large field size regime over the stochastic i.i.d. symbol erasure channel model. A closed-form expression of the error probability of large-field-size RLSCs is derived under, simultaneously, the finite memory length and decoding deadline constraints. The result is then used to examine the intricate tradeoff between memory length (complexity), decoding deadline (delay), code rate (throughput), and error probability (reliability). Numerical evaluation shows that under the same code rate and error probability requirements, the end-to-end delay of RLSCs is 40–48% of that of the optimal block codes (i.e., MDS codes). This implies that switching from block codes to streaming codes not only eliminates the queueing delay completely (which accounts for the initial 50% of the delay reduction) but also improves the reliability (which accounts for the additional 2–10% delay reduction).

著录项

来源
《IEEE Transactions on Information Theory》 |2022年第10期|6356-6387|共32页
作者
Pin-Wen Su; Yu-Chih Huang; Shih-Chun LinI-Hsiang WangChih-Chun Wang;
展开▼
作者单位

Elmore Family School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, USA;

Institute of Communications Engineering, National Yang Ming Chiao Tung University, Hsinchu, Taiwan;

Department of Electrical Engineering, Graduate Institute of Communication Engineering, National Taiwan University, Taipei, Taiwan;

展开▼
收录信息
原文格式 PDF
正文语种英语
中图分类通信;
关键词
Codes; Delays; Decoding; Error probability; Symbols; Block codes; Channel models;

Random Linear Streaming Codes in the Finite Memory Length and Decoding Deadline Regime—Part I: Exact Analysis

摘要

著录项

相关主题

期刊订阅