An Algorithm for Constructing All Families of Codes of Arbitrary Requirement in an OCDMA System

TL;DR

This paper introduces a flexible algorithm for constructing all possible code families for reconfiguration in OCDMA systems, based on graph search techniques, enabling practical and arbitrary code requirement fulfillment.

Contribution

It presents a novel graph-based algorithm that efficiently finds all code families for optical code reconfiguration, adaptable to arbitrary requirements.

Findings

The algorithm effectively constructs all code families for given requirements.

Choosing appropriate code length is crucial for balancing code family quantity and cost.

Simulation confirms the algorithm's practicality and flexibility.

Abstract

A novel code construction algorithm is presented to find all the possible code families for code reconfiguration in an OCDMA system. The algorithm is developed through searching all the complete subgraphs of a constructed graph. The proposed algorithm is flexible and practical for constructing optical orthogonal codes (OOCs) of arbitrary requirement. Simulation results show that one should choose an appropriate code length in order to obtain sufficient number of code families for code reconfiguration with reasonable cost.