Comparison between the Performance of Algorithmic Optical Codes and Orthogonal Optical Codes in OCDMA Systems

Abstract

A novel method to be used in OCDMA systems is exhaustively described in this paper. It uses Algorithmic Optical Codes (AOCs). They are based on the signature sequence idea. However patterns are constantly changing. A common seed for pseudo-random sequence is the signature element. In this paper a derivation of the probability of error due to the multiple-access interference is provided. An other contribution of this work is also the comparison between the AOCs and the Orthogonal Optical Codes (OOCs) with (auto- and cross-) correlation equal to one. Attending to the cardinality limitation problem observed in OOCs, the comparison is focused on the number of users allowed by the two different systems aforementioned. As result we state that a system using AOCs allows more users than one using OOCs when the codes are long enough.