.png){kind=icon}
返回
Capacity-Approaching Variable-Length Pearson Codes
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2018.2829706.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Sequences encoded with Pearson codes are immune to channel gain and offset mismatch that cause performance loss in communication systems. In this letter, we introduce an efficient method of constructing capacity-approaching variable-length Pearson codes. We introduce a finite state machine (FSM) description of Pearson codes and present a variable-length code construction process based on this FSM. We then analyze the code rate, redundancy, and the convergence property of our codes. We show that our proposed codes have less redundancy than codes recently described in the literature and that they can be implemented in a straightforward fashion.
Keyword:
Capacity-approaching
constrained sequence codes
data storage
implementation
Pearson-distance
variable-length
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
引用论文
.png){kind=icon}
分享收藏 没有更多内容
没有更多内容