.png){kind=icon}
.png){kind=icon}
Return
Capacity-Approaching Variable-Length Pearson Codes
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2018.2829706.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Capacity-approaching
constrained sequence codes
data storage
implementation
Pearson-distance
variable-length
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W