Combinatorial Construction of Simple 2-Dimensional Optical Orthogonal Codes for Scalable OCDMA Networks

Optical code division multiple access (OCDMA) offers several attractive features like asynchronous access, privacy and security in transmission, ability to support variable bit rate and bursty traffic, and scalability of the network. An optical orthogonal code (OOC) is a collection of binary sequences with good correlation properties which are important factors of determining the capacity of OCDMA systems. In this paper, a combinatorial construction of simple 2- dimensional (2-D) OOCs with autocorrelation 0 and crosscorrelation 1 is proposed. These codes are called single or no pulse per row (SNPR) codes and they can simplify the correlator structure without over- compromising the cardinality of the codes. Also, they can give the scalability to the OCDMA network consisting of various smaller networks. The upper bound on the size of SNPR codes is derived for various cases and the BER performance and blocking probability of these codes are evaluated.