Math @ Duke

Publications [#235810] of Robert Calderbank
Papers Published
 Calderbank, AR; Georghiades, CN, Coding for the unsynchronized optical OPPM channel,
Proceedings of the 1993 IEEE International Conference on Communications
(1993),
pp. 557561
(last updated on 2018/10/23)
Abstract: Random OPPM sequences result in an unrecoverable error floor on both the probability of erroneous synchronization and the probability of symbol error when only chip synchronization is present. It is known, however, that for a given sequence length M, a subset of the set of all possible sequences is synchronizable in the sense that in the absence of noise, the receiver can correctly symbolsynchronize by observing M or more symbol intervals. In this paper we design finite state machines and codes over a Jary alphabet which produce sequences with the property that every subsequence of length L is synchronizable and introduce algorithms that utilize the memory in the encoded sequences to produce joint estimates of timing and sequences.


dept@math.duke.edu
ph: 919.660.2800
fax: 919.660.2821
 
Mathematics Department
Duke University, Box 90320
Durham, NC 277080320

