Abstract

Optical orthogonal codes (OOCs) are commonly used as signature codes for optical code-division multiple-access (OCDMA) communication systems. Many OOCs have been proposed and investigated. Asynchronous OCDMA systems using conventional OOCs have very limited number of subscribers and a few simultaneous users. Recently, we reported a new code family with large code size by relaxing the crosscorrelation constraint to2. In this paper by further loosening the crosscorrelation constraint, we adopt the random greedy algorithm to construct a code family which has larger code size and more simultaneous users. We also derive an upper bound of number of simultaneous users for given code length, code weight, and bit error rate. The study shows that it is possible to have codes approaching to this bound.

[IEEE ]

PDF Article

References

You do not have subscription access to this journal. Citation lists with outbound citation links are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access OSA Member Subscription

Cited By

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access OSA Member Subscription