Capacity-Approaching Variable-Length Pearson Codes

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.