Title :
Trellis codes for the optical direct-detection channel
Author :
Pottie, Gregory J.
Author_Institution :
Codex Corp., Mansfield, MA, USA
fDate :
8/1/1991 12:00:00 AM
Abstract :
It is observed that the reduced complexity minimum distance search method of Zehavi and Wolf (1987) can be extended from codes designed using the squared Euclidean distance measure to any measure which is additive over the code branches. C.N. Georghiades (1989) has derived such a metric for codes for the direct-detection optical channel. The search method is applied to find codes for four- and eight-point overlapping pulse position modulation (OPPM), with large minimum distance and a small number of codewords at that distance
Keywords :
error correction codes; optical links; code branches; codewords; metric; optical direct-detection channel; overlapping pulse position modulation; reduced complexity minimum distance search; squared Euclidean distance measure; trellis codes; Convolutional codes; Costs; Error probability; Euclidean distance; Modulation coding; Optical modulation; Optical pulses; Pulse modulation; Search methods; Upper bound;
Journal_Title :
Communications, IEEE Transactions on
