Math @ Duke

Publications [#235821] of Robert Calderbank
Papers Published
 Calderbank, AR; Georghiades, CN, Synchronizable codes for the optical OPPM channel,
IEEE Transactions on Information Theory, vol. 40 no. 4
(1994),
pp. 10971107 [doi]
(last updated on 2018/10/16)
Abstract: Random overlapping pulseposition modulation (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 symbol synchronize by observing M or more symbol intervals. In this paper we design finitestate machines and codes over a Jary alphabet, which produce sequences with the property that every subsequence of length L is synchronizable. Some of the codes, in addition to being synchronizable, produce a coding gain. For an optical Poisson channel we introduce joint synchronization and detection algorithms that utilize the memory in the encoded sequences to produce joint estimates of timing and sequences. Their performance is analyzed through simulations and analytical results.


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

