Skip to main content

Coding for the unsynchronized optical OPPM channel

Publication ,  Journal Article
Calderbank, AR; Georghiades, CN
Published in: Proceedings of the 1993 IEEE International Conference on Communications
January 1, 1993

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 symbol-synchronize by observing M or more symbol intervals. In this paper we design finite state machines and codes over a J-ary 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.

Duke Scholars

Published In

Proceedings of the 1993 IEEE International Conference on Communications

Publication Date

January 1, 1993

Start / End Page

557 / 561
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Calderbank, A. R., & Georghiades, C. N. (1993). Coding for the unsynchronized optical OPPM channel. Proceedings of the 1993 IEEE International Conference on Communications, 557–561.
Calderbank, A. R., and C. N. Georghiades. “Coding for the unsynchronized optical OPPM channel.” Proceedings of the 1993 IEEE International Conference on Communications, January 1, 1993, 557–61.
Calderbank AR, Georghiades CN. Coding for the unsynchronized optical OPPM channel. Proceedings of the 1993 IEEE International Conference on Communications. 1993 Jan 1;557–61.
Calderbank, A. R., and C. N. Georghiades. “Coding for the unsynchronized optical OPPM channel.” Proceedings of the 1993 IEEE International Conference on Communications, Jan. 1993, pp. 557–61.
Calderbank AR, Georghiades CN. Coding for the unsynchronized optical OPPM channel. Proceedings of the 1993 IEEE International Conference on Communications. 1993 Jan 1;557–561.

Published In

Proceedings of the 1993 IEEE International Conference on Communications

Publication Date

January 1, 1993

Start / End Page

557 / 561