Citation
Abstract
We investigate methods of coding for a channel subject to a large dead-time constraint, i.e., a constraint on the minimum spacing between transmitted pulses, with the deep-space optical channel as the motivating example. Several constrained codes designed to satisfy the dead-time constraint are considered and compared on the basis of throughput, complexity, and decoded error rate. The performance of an iteratively decoded serial concatenation of a constrained code with an outer code is evaluated and shown to provide significant gains over a Reed–Solomon code concatenated with pulse-position modulation.
Keywords
pulse-position modulation
deep space optical communications
iterative decoding
constrained codes
Details
- Volume
- 42-149
- Published
- May 15, 2002
- Pages
- 1–29
- File Size
- 550.2 KB